{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"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":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D25","name":"ADR Conformance","shortDescription":{"text":"ADR Conformance"},"helpUri":"https://codehealth.canine.dev/dimensions/D25"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"D40","name":"Network Egress Confinement","shortDescription":{"text":"Network Egress Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D40"},{"id":"D41","name":"Kernel \u0026 Syscall Confinement","shortDescription":{"text":"Kernel \u0026 Syscall Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D41"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"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":"C1","name":"Data Protection","shortDescription":{"text":"Data Protection"},"helpUri":"https://codehealth.canine.dev/dimensions/C1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"C3","name":"Audit Trail","shortDescription":{"text":"Audit Trail"},"helpUri":"https://codehealth.canine.dev/dimensions/C3"},{"id":"C4","name":"Data Retention","shortDescription":{"text":"Data Retention"},"helpUri":"https://codehealth.canine.dev/dimensions/C4"},{"id":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM2","name":"Strongly-typed ids","shortDescription":{"text":"Strongly-typed ids"},"helpUri":"https://codehealth.canine.dev/dimensions/DM2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"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":"ruvector_hailo_cluster::bin::embed::main (cyclomatic 90): ruvector_hailo_cluster::bin::embed::main has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c90da2bbcfe4164bb80f4c7866547743e15fa3562344eb4274c8e4eec039b79"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor::backward (cyclomatic 88): Tensor::backward has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/backprop.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"338b54a425a291a752b5bddc7cb4bc63e4af3dd3b2e10f4ad6874d9620ad2cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor::backward (cyclomatic 86): Tensor::backward has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ed93034f50e99974e40ef9c4b5ea391b63935123f65149e5bf0d316b9193d0"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::bench::main (cyclomatic 80): ruvector_hailo_cluster::bin::bench::main has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f755afb86e7bcd8804739b4aa99bb48d908d5489fd3e0fa0a2e4d68ab5501c3"}},{"ruleId":"D1","level":"warning","message":{"text":"MetalStorage::reduce_op (cyclomatic 72): MetalStorage::reduce_op has cyclomatic complexity 72 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: MetalStorage::unary_impl (cyclomatic 170) 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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6cdac359041cf4648a3c3408236c48735d86ee177c27ee167861cb233a010a"}},{"ruleId":"D1","level":"warning","message":{"text":"MetalStorage::reduce_op (cyclomatic 72): MetalStorage::reduce_op has cyclomatic complexity 72 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: MetalStorage::unary_impl (cyclomatic 111) 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":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b7a41a12ccd8d2cd360f3dc226d80f08bee7c2f2cd1d9bbecaaefa2f63cff1"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::handle_mcp_tool_call (cyclomatic 71): mcp_brain_server::routes::handle_mcp_tool_call has cyclomatic complexity 71 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6115}}}],"partialFingerprints":{"codehealthFindingId/v1":"856ae41c53ba94fef7690750d48b7877897cd9b5c61dc8ea24e223a9712cadb5"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::run_enhanced_training_cycle (cyclomatic 70): mcp_brain_server::routes::run_enhanced_training_cycle has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9292c7b0bb316f56d2b3a053d01d33c82dbb5b782469f9ffa302b487d7be7267"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::stats::main (cyclomatic 70): ruvector_hailo_cluster::bin::stats::main has cyclomatic complexity 70 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/stats.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c198be74ed76908c0edea8adec2547549419b5af322bf1f9e40a838ee668f81d"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::search_memories (cyclomatic 57): mcp_brain_server::routes::search_memories has cyclomatic complexity 57 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"3decd5be0659176cca8e1c9609cccd129577cf4a0fa7786f8d0290fcf088672d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_temporal_tensor::quantizer::dequantize_f32 (cyclomatic 55): ruvector_temporal_tensor::quantizer::dequantize_f32 has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5246e0058f7f7bbe0e9931146c3297429255bb5720578603932459544313ac57"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cli::main (cyclomatic 52): ruvector_cli::main has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/main.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b014ced1fa5f8f51282978d67ffbf8c8a657a21c17bb9606f968009dd6312"}},{"ruleId":"D1","level":"warning","message":{"text":"ArenaCactus::build_from_compact_graph (cyclomatic 47): ArenaCactus::build_from_compact_graph has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/canonical_witness.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6215684a81002b15664935dd90e675b40acfca0fec36d0c6ea96dd572f069b55"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::ruview-csi-bridge::main (cyclomatic 47): ruvector_hailo_cluster::bin::ruview-csi-bridge::main has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1632dc66aa9bfc400e7361f15e5e8a5178cd95c9379f16a7213a5c8cbe16f161"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer::next_token (cyclomatic 47): Tokenizer::next_token has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/parser.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4fc2d764624099d327e073ed66f783427986cd0595e0f53e6e25fdd4fb5442"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::mmwave-bridge::main (cyclomatic 44): ruvector_hailo_cluster::bin::mmwave-bridge::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":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e920c2d066a2691e366644513090e828c10dcb819b5daf71643d4f5285ef0e0c"}},{"ruleId":"D1","level":"warning","message":{"text":"Stack::read (cyclomatic 44): Stack::read has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/pickle.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8293ff9fe0e00cb8f3cced44b708449627a4694496367d4a6c9021dc9a9a61"}},{"ruleId":"D1","level":"warning","message":{"text":"SubquadraticSparseAttention::forward_flash_inner (cyclomatic 42): SubquadraticSparseAttention::forward_flash_inner has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"0309e0af4028d4638e634ac2c4c1e97495b87470942c3f150940af64c2d58365"}},{"ruleId":"D1","level":"warning","message":{"text":"Stack::read (cyclomatic 42): Stack::read has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b27dae6616321a5a18f91ebc67643644f7390bbbd6ed3ea38451fb129eb5d04"}},{"ruleId":"D1","level":"warning","message":{"text":"ruos_thermal::main (cyclomatic 39): ruos_thermal::main has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruos-thermal/src/main.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"376aa1e1538638d8d1d61ca309551312625b999dc32de2edf4fc5ce50ab5f286"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::compute_aggregate (cyclomatic 39): ruvector_postgres::graph::sparql::executor::compute_aggregate has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb2244bef52471be56c6a9c8ed292e3287de34861501fed0fa932a7c1c6b553"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvllm::backends::lattice_backend::adapter::validate_tensors (cyclomatic 38): ruvllm::backends::lattice_backend::adapter::validate_tensors has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/lattice_backend/adapter.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d60713954d4629707f4cafd34d9aac4cd4bfab19841630fbbd8cefec6ce9dd"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmark (cyclomatic 38): benchmark has cyclomatic complexity 38 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"99803b62dc0eee2018fa48f01103f4bf42b7ba67dfe8e1920f32fc0cef8f24d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_py::graph::cypher_eval::eval_binary (cyclomatic 37): ruvector_py::graph::cypher_eval::eval_binary has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph/cypher_eval.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8c086dd3255dbb4e4cabd06d0fb17ead55a21e536385e375da6ed3af1a991b"}},{"ruleId":"D1","level":"warning","message":{"text":"splitMegaStatement (cyclomatic 37): splitMegaStatement 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":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a772c96676e80f35f535f63ea5f7b034752fa0e6d317c4829ab3d95e2b5caed"}},{"ruleId":"D1","level":"warning","message":{"text":"DevelopmentalProgram::grow_step (cyclomatic 36): DevelopmentalProgram::grow_step has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/self_organizing.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3db7d86c85490d0ac96a3e480adb57fde180eba7e0b8412c5082e89daeba48"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::ruvllm-bridge::main (cyclomatic 36): ruvector_hailo_cluster::bin::ruvllm-bridge::main has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27f1749d63b20c1b5e6b40e2c2d853e09eb81a7ae9be51f88b2f95a966c456e"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::graph::cypher::executor::match_pattern (cyclomatic 36): ruvector_postgres::graph::cypher::executor::match_pattern has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/executor.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d972f1de82527ec7c775ccb13c40f8b5865dde6591a1704141a457b1b7a4240c"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorNameMapper::categorize (cyclomatic 36): TensorNameMapper::categorize has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/loader.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b8be9995fa3328c45ffb496915355dc047ac2d356dbe192d3a40c880c4499b"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::quantized::utils::make_qx_quants (cyclomatic 36): candle_core::quantized::utils::make_qx_quants has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/utils.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfc36cfb8610bf38c56b80b721517ef3da1bb19fa71e6b328632be2e96f9bcc"}},{"ruleId":"D1","level":"warning","message":{"text":"SubquadraticSparseAttention::forward (cyclomatic 35): SubquadraticSparseAttention::forward has cyclomatic complexity 35 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SubquadraticSparseAttention::forward_gqa) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cd3ab8740d439192c11e983c0e25ffc33946afa46b74c245a67634e4c8f6b5"}},{"ruleId":"D1","level":"warning","message":{"text":"SubquadraticSparseAttention::forward_gqa (cyclomatic 35): SubquadraticSparseAttention::forward_gqa has cyclomatic complexity 35 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SubquadraticSparseAttention::forward) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cc59a51ceff84561fe0123dbe10f12a9c9a7340b4f18f753f5339d9194f1e1"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamIngest::query_with (cyclomatic 34): StreamIngest::query_with has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/ingest/query.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"963197484f14e0cc183cdf2e92cb0a505d88befd5993284cd80623b466be23a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next_token (cyclomatic 34): Lexer::next_token has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Lexer::scan_identifier (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/lexer.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6f665195b21e9c4b63b2fd473abaab3baef10d98f75ca617d38b421951f3d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::ingest::run (cyclomatic 34): ruvector_edge_gateway::ingest::run 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":"edge/gateway/src/ingest.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"de660a8b2acf77c8b2c2b5f889a29a93f8b0d1a8a9c73d2674221aeb453c4022"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticAnalyzer::analyze_expression (cyclomatic 33): SemanticAnalyzer::analyze_expression has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/semantic.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41ea643b6b8f7b307d3f85b66e87616c844fd6a369526db5f9fc5cfb9632d6e"}},{"ruleId":"D1","level":"warning","message":{"text":"GeoMipPhiEngine::compute_phi (cyclomatic 32): GeoMipPhiEngine::compute_phi has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/geomip.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc95bafd0f59a991ea041b1ec9c07c218d85d003018c01a5d12567084039942"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_node::cypher_exec::exec_pattern (cyclomatic 32): ruvector_graph_node::cypher_exec::exec_pattern has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7a5a186f1d9d747c92f66ac59166921e4213dbf68452d55fc7299f74a34d9a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_expression (cyclomatic 32): ruvector_postgres::graph::sparql::executor::evaluate_expression has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87893bc772a6cae1932b77c582c9ed6e22cbcc8082123734271a32f9e5f96d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_py::graph::cypher_exec::exec_pattern (cyclomatic 32): ruvector_py::graph::cypher_exec::exec_pattern has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph/cypher_exec.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd59bb09d0d043c3d97734a97bfcc57cbc14b4f976139cee6f960163e1b30a59"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_cli::cmd::verify_witness::run (cyclomatic 32): rvf_cli::cmd::verify_witness::run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_witness.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9357cd7bd20cdf525bfab3194a53c4f4ab8972113d6bb29641ca30ca2c5f272"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::restore_cow_state (cyclomatic 32): RvfStore::restore_cow_state has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":3753}}}],"partialFingerprints":{"codehealthFindingId/v1":"47056422dfc382ec46128a7a2c761a6b5f6a8c8125c9ac5109d16dc62ea76cae"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::quantized::utils::make_qx_quants (cyclomatic 32): candle_core::quantized::utils::make_qx_quants 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":"patches/candle-core-0.8.4/src/quantized/utils.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e943640d5a50b9a4d9a3781572c7fca78abb052e4fa6332fee7d6196ddec893"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::binary (cyclomatic 31): ruvector_graph_wasm::cypher_exec::binary has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62b24e10c839310035997d3c0628babb6eae69cf4058558be1cd54e535c9f22"}},{"ruleId":"D1","level":"warning","message":{"text":"Header::parse (cyclomatic 31): Header::parse has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/npy.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"be06448c33c3d32b2fb0489b3994e3caba126785e6f0148f80930a8677bbdc43"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_release.validate (cyclomatic 31): validate_release.validate 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":"python/portfolio/validate_release.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"706fee8e1e6187d407538193194211b3366a2d139834fc38392e4324bc6c3811"}},{"ruleId":"D1","level":"warning","message":{"text":"ProblemDetector::detect_problems (cyclomatic 30): ProblemDetector::detect_problems 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":"crates/ruvector-postgres/src/healing/detector.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdb1688bc1fd371e267e55d753e28381d18d8106f6a2d586a1bf98473b21d4d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_temporal_tensor::quantizer::quantize_and_pack_f32 (cyclomatic 30): ruvector_temporal_tensor::quantizer::quantize_and_pack_f32 has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2a3e6bbe90f1d4dcbafb00d6ed4ada2e7acf9a7a8007085f59e8d99a6e1ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"HybridPipeline::route_operation (cyclomatic 30): HybridPipeline::route_operation 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":"crates/ruvllm/src/backends/hybrid_pipeline.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1489dde3bb54af02d3c1dcd6b0bbeb10648e0b6400cc978a9d9bd7f7bb0affe4"}},{"ruleId":"D1","level":"warning","message":{"text":"FirestoreClient::firestore_list_checked (cyclomatic 29): FirestoreClient::firestore_list_checked has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0730b766407034289aa6ee9d782507aece947d887bef830fe3c04caa34ba87"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvllm::backends::lattice_backend::adapter::configuration (cyclomatic 29): ruvllm::backends::lattice_backend::adapter::configuration has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/lattice_backend/adapter.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eac333f3041a0c66345b3e783aa2190759c2ce159505ccda5cf7c1459f70cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvllm_cli::commands::chat::handle_command (cyclomatic 29): ruvllm_cli::commands::chat::handle_command has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/chat.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e5496c6194de7499f3e450359581747a3f09ca5493c540d7786fc10161b241"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::ingest_batch_internal (cyclomatic 29): RvfStore::ingest_batch_internal has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a57a5772af60122d063e390345809a71f558670900034a01c45fadc6a55eb99"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamVerifier::on_chunk (cyclomatic 29): StreamVerifier::on_chunk has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/verifier.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c547113f1a16ad79dd4f85bd1aa9fab0cfd41b5e10645185315cd31e381fdb2"}},{"ruleId":"D1","level":"warning","message":{"text":"Header::parse (cyclomatic 29): Header::parse has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bf7b4e0a7196e8fd18d01c825749faaedb22b9fe0482f8c0638942c33f6774"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::google_chat_handler (cyclomatic 28): mcp_brain_server::routes::google_chat_handler has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7446}}}],"partialFingerprints":{"codehealthFindingId/v1":"078ff61dc97001168d27362819de8c52e57fac781b26a42601860e1ff5b314a6"}},{"ruleId":"D1","level":"warning","message":{"text":"DagSonaEngine::compute_dag_embedding (cyclomatic 28): DagSonaEngine::compute_dag_embedding has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/sona/engine.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7412a35741daecafa6a581931ec3e8a44827f20d60cb6c993b4311e6e1e594a8"}},{"ruleId":"D1","level":"warning","message":{"text":"CpuStorage::concat (cyclomatic 28): CpuStorage::concat has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: CpuStorage::to_dtype (cyclomatic 102) 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d31733fc760c0ab0de4614637871739d65793915eb1d3b53c47f6f16a1c9322"}},{"ruleId":"D1","level":"warning","message":{"text":"parseTopLevelStatements (cyclomatic 28): parseTopLevelStatements has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"623c35ce61453a32ab15eaa0ec3299ccb824199bd309705dd5867e2e0010cc9c"}},{"ruleId":"D1","level":"warning","message":{"text":"MobileNetV3Large::process_inverted_residual (cyclomatic 27): MobileNetV3Large::process_inverted_residual has cyclomatic complexity 27 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/mobilenet.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9fe11f89eaf8eae25e2c20e6cdf275e1de23bf98b89725bb88a08d3e40e79d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::simd::avx2::depthwise_conv_3x3_avx2 (cyclomatic 27): ruvector_cnn::simd::avx2::depthwise_conv_3x3_avx2 has cyclomatic complexity 27 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa729e51214ad7d21f16701f57194c8ce6c5465d079386301f0e279b1495eed9"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_graph_pattern (cyclomatic 27): ruvector_postgres::graph::sparql::executor::evaluate_graph_pattern has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0adb9c02c8fdc3b946d64c9fe30479e526dd0b0a19a0c28700dddfe73b14b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::queue::build (cyclomatic 27): ruvector_weaver::queue::build has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/queue.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8543dfda57f040770e9f810965f3442a105ae065f6bf75ecb59ff271264fe34"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvix_cli::commands::monitor::run_monitor_loop (cyclomatic 27): ruvix_cli::commands::monitor::run_monitor_loop has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/monitor.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"258f85b98b8ec50974d4681acab3ca42a97c56139b4ae669167075b3ab431d64"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::cuda_backend::gemm_config (cyclomatic 27): candle_core::cuda_backend::gemm_config has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e0fa4cf8099af82f33af2f06ee5106401b1e2b2fbdcb2dc8f0f0a313fc48ab"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::cuda_backend::gemm_config (cyclomatic 27): candle_core::cuda_backend::gemm_config has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c933d2ee4b4ef59813a114c56e1f80d34eb3f3ae515e33e25ad3739ea05339"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::pipeline_optimize (cyclomatic 26): mcp_brain_server::routes::pipeline_optimize 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":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":4045}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a51dea95a6ff1685ec806cb7c0293be88457f00d8153b2264d864a9756a255"}},{"ruleId":"D1","level":"warning","message":{"text":"MinCutGatedAttention::compute_min_cut (cyclomatic 26): MinCutGatedAttention::compute_min_cut 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":"crates/ruvector-dag/src/attention/mincut_gated.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ebae8c2a908714c0d4a33b0bddc6b681eb3ca0721595af3dd841b25e242e37"}},{"ruleId":"D1","level":"warning","message":{"text":"DiskAnnIndex::load_impl (cyclomatic 26): DiskAnnIndex::load_impl has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/index.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"93961634516d45f5e7c402bf62c8720c03c90d29847f62405d037cca2792f527"}},{"ruleId":"D1","level":"warning","message":{"text":"MemSqlStore::run (cyclomatic 26): MemSqlStore::run 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":"crates/ruvector-edge-store/src/mem_store/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc50adda0c596a14dea43af9ec139f2ba45ba0a6e87d1dad96f2528dcd7c8ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_node::cypher_exec::eval_binary (cyclomatic 26): ruvector_graph_node::cypher_exec::eval_binary has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ee3c1ff058d93638293d1ba43e04c73050c6335e945bfd60c20febb3afdf36"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_literal (cyclomatic 26): SparqlParser::parse_literal has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"13100ae4bca905d48104a84c8264426828e3a7f666ddfe1eed29f6d5088eaf65"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvllm_retrieval_diffusion::sample_logits (cyclomatic 26): ruvllm_retrieval_diffusion::sample_logits has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_retrieval_diffusion/src/lib.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1371cc53582a06f778bf4da08c8f5205ffba6dfce2b86e8ce6ad5791ff7304b8"}},{"ruleId":"D1","level":"warning","message":{"text":"HnswGraph::search_filtered (cyclomatic 26): HnswGraph::search_filtered has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b719440908280a1073ff2ed843f5d01434fa0b3684fe914e35b07629fee4a1"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::compact (cyclomatic 26): RvfStore::compact has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefd6a31284049c9f13259c4e7d74bcd24ae4ab21f58e885bc47b78492dc956d"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::restore_metadata (cyclomatic 26): RvfStore::restore_metadata has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":4371}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a5f718162e882391531e4e2c02c463fef1150fe848bc0e5d21874f75602b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_literal (cyclomatic 26): SparqlParser::parse_literal has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e67e0684ebbcc9f586de97eec67f4710ad11d5b26a2aafc8ee80ae1c02d96a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_avx2::conv2d_int8_avx2 (cyclomatic 25): ruvector_cnn::kernels::int8_avx2::conv2d_int8_avx2 has cyclomatic complexity 25 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"679f819309b1e2399fb6cece815a35a249554f4c22e7ca716746076f7be07666"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_neon::conv2d_int8_neon (cyclomatic 25): ruvector_cnn::kernels::int8_neon::conv2d_int8_neon has cyclomatic complexity 25 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_neon.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2aec3912c829c755fd82468755406070356cb8154c5e767ccb819986616128"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_wasm::conv2d_int8_wasm (cyclomatic 25): ruvector_cnn::kernels::int8_wasm::conv2d_int8_wasm has cyclomatic complexity 25 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_wasm.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12fdd45f1bb043a690e26209ec0c427c2cd82a17e3595b2b889f86fa1119967"}},{"ruleId":"D1","level":"warning","message":{"text":"DagSonaEngine::hash_dag (cyclomatic 25): DagSonaEngine::hash_dag has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/sona/engine.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5218a805d964376d174fbbe48b8510732e99ffc9c1736976bf532c6695d10b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_decompiler::partitioner::louvain_partition (cyclomatic 25): ruvector_decompiler::partitioner::louvain_partition has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/partitioner.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e410f41f02bb454921ef1278fb7b03bd73e210341e1f360d82de4f456674ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_primary (cyclomatic 25): Parser::parse_primary has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a95d9347bd7b2632df6854794a443e57123fb7a51cdc70d94b72365c6ec0df"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_primary_expression (cyclomatic 25): SparqlParser::parse_primary_expression has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e516ae3ac93fd4466e84c4cdfb218ac572f3dc137d580e3aa0b1cf55207715"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvllm::backends::lattice_backend::spawn_worker (cyclomatic 25): ruvllm::backends::lattice_backend::spawn_worker has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/lattice_backend.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbfee7e958da5c68536bea15181ca6a3a7af03aedbc85d9082d0240426f1f48"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_primary_expression (cyclomatic 25): SparqlParser::parse_primary_expression has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"093d723385d2e6828fad015d1dee344be46e6a121860e4626b033e2ca2439fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::graph_store::handle_call (cyclomatic 25): ruvector_edge_gateway::graph_store::handle_call has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/graph_store.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87eeb852a85fbf02f0f71a8fbd81dce16c4ef379ed04fe6385cda75fa31cc4a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::m3_ledger::handle (cyclomatic 25): ruvector_edge_gateway::m3_ledger::handle has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/m3_ledger.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"db68d6d63d005a5dbf9e06399271d135b16a8b964ef88373abc3a83092c9f544"}},{"ruleId":"D1","level":"warning","message":{"text":"decompileGguf::readValue (cyclomatic 25): decompileGguf::readValue 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":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a0d69d11e203c2de8d4dbad04e44fd72d29e81ec636e7d174a0f64db779bf5"}},{"ruleId":"D1","level":"warning","message":{"text":"BrainTrainer::discover_space (cyclomatic 24): BrainTrainer::discover_space has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"939f9739f9b3fa5a2afd8e757167561751a8b24dda96300ed9193f0a6587461c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_decompiler::transformer::mha (cyclomatic 24): ruvector_decompiler::transformer::mha 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":"crates/ruvector-decompiler/src/transformer.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb169e26b66e590b9240779fa6bbfcadbdd58840dffc0f471e42493c74f9e11"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::project (cyclomatic 24): ruvector_graph_wasm::cypher_exec::project has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fda6818a1f1d87186f12f98403232a9dc637b3580c9998751ac80049c41976"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_graph_pattern_inner (cyclomatic 24): SparqlParser::parse_graph_pattern_inner has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"357e3b6949901ef07b0a310252478caa635c3a41dced8d7076f273c7596e2a25"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_sota_bench::bin::sota_all::main (cyclomatic 24): ruvector_sota_bench::bin::sota_all::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":"crates/ruvector-sota-bench/src/bin/sota_all.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"391af4729858926475cdd982a7b8212f37126faeaabb0d4e2410c132af37efd0"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentGraph::run (cyclomatic 24): AgentGraph::run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/graph.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9992891c2fef9e6fda2dbafa8b5ca70bd26fd8160a0f30a02df902477c221272"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::query_via_filtered_index_cow (cyclomatic 24): RvfStore::query_via_filtered_index_cow has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/filtered_query.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e12f4d517ec393967a70dda19cbd66adc87a46dfcda54292e221e4b8f5ef8d"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_graph_pattern_inner (cyclomatic 24): SparqlParser::parse_graph_pattern_inner has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"82de82c9e3a430e6a8f173a88f5ea4107c0074da24e38f6b907ddb423bf64d76"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::graph_cypher_dx::render (cyclomatic 24): ruvector_edge_gateway::graph_cypher_dx::render 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":"edge/gateway/src/graph_cypher_dx.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd9c6b1b1a224c3714c687f8435ee254aae4befb58b2da23e8aaae058419675"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::rvf_finalize::finalize (cyclomatic 24): ruvector_edge_gateway::rvf_finalize::finalize has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/rvf_finalize.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e502037e8eadc4f5a4b1137ad66c3c1b401870534d2c413630344814884f02"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::rvf_finalize_step::step (cyclomatic 24): ruvector_edge_gateway::rvf_finalize_step::step has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/rvf_finalize_step.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcf5d59e0102a67e771ce54e51d3b895f4dcc92ffc720ed360fcdb618469ff3"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorFormatter::fmt_tensor (cyclomatic 24): TensorFormatter::fmt_tensor 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":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8884034d11ea58529dbd6f5b2e53023bf3bbb3ebe76816239567c4d35ca31115"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorFormatter::fmt_tensor (cyclomatic 24): TensorFormatter::fmt_tensor 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":"patches/candle-core-0.9.2/src/display.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79587e64415a08f5404e26034af400a87ed2755ce3b237ed3fc26fdb4585735"}},{"ruleId":"D1","level":"warning","message":{"text":"isPrivateAddress (cyclomatic 24): isPrivateAddress has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"582b7ce623690c72eee68fba9746cef9f6d4b8902f632163c3bdeb9f53cf7932"}},{"ruleId":"D1","level":"warning","message":{"text":"inferPurpose (cyclomatic 24): inferPurpose 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":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ff6689aca866039efec5f7b9215388c22ceb62df923f631a8c60b9e197bd4d"}},{"ruleId":"D1","level":"warning","message":{"text":"NeuralSymbolicBridge::run_inference (cyclomatic 23): NeuralSymbolicBridge::run_inference has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ce731fc6a5ce2091d400444ac35d8c47321f2431ba914eb964a73eea8ce938"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::share_memory (cyclomatic 23): mcp_brain_server::routes::share_memory has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"726c6d149e4c53895344d64c996aa243f1ce41d3a84b7f1410b37dd691b075bd"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_decompiler::parser::scan_body_single_pass (cyclomatic 23): ruvector_decompiler::parser::scan_body_single_pass has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/parser.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c9f773b109ebed213e6babddb594eec0e7195c0e944e87c14ea0a3967af9c0"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_decompiler::tree::agglomerative_cluster (cyclomatic 23): ruvector_decompiler::tree::agglomerative_cluster has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/tree.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e223ff2d2a07fd65305446422a1fa64e25cffde47e91276774f27ffe8a1b5f69"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_store::mem_store::parse::tokenize (cyclomatic 23): ruvector_edge_store::mem_store::parse::tokenize has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/mem_store/parse.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f607d6382bc2af9caedd99878fa910a8d36a1044951e05eef2d28f6d171405"}},{"ruleId":"D1","level":"warning","message":{"text":"RoadRouter::route (cyclomatic 23): RoadRouter::route has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/routing/mod.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"531a7d74397c97aa652bbc27b3fb674ace23af1ef72d491aeb9e1539ea88453d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_binary_op (cyclomatic 23): ruvector_postgres::graph::sparql::executor::evaluate_binary_op has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec215bd3fee49c21d3665ec01f58943c927e2b1d5d70146d0be3fbdb26918ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::execute_update (cyclomatic 23): ruvector_postgres::graph::sparql::executor::execute_update has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6162462c988c56f33c7f4d17888d05aa3070ebe2e1e21692ce8c12c03b738c8"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::semver::bounds (cyclomatic 23): ruvector_weaver::semver::bounds has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/semver.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9168bd87a584ad1614e46508bd8056a71baffd2a669b3ad52ca32e1ab9e60dec"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::seo::audit::audit_package (cyclomatic 23): ruvector_weaver::seo::audit::audit_package has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/audit.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d7a5576552504aba78e4e43a8382b0e71776eab5ce25acbafb5c746310eab1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvix_qemu_swarm::monitor::run_simple (cyclomatic 23): ruvix_qemu_swarm::monitor::run_simple has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/monitor.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab85045ae50af834b252a80209a1692fad1b09383db1f8a6bbd964214a27df5"}},{"ruleId":"D1","level":"warning","message":{"text":"SubquadraticSparseAttention::forward_gated (cyclomatic 23): SubquadraticSparseAttention::forward_gated has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ff1bad04e34cb63f4a44bb3e3dff7674f22632f02ac45688980ef8d25277d9"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::build_ingest_metadata (cyclomatic 23): RvfStore::build_ingest_metadata has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e7db1c21ae92662fb40b5c049cd0bda1c1b3c657cfc8c25e2ef5e7cc594cb2"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_runtime::qr_encode::evaluate_penalty (cyclomatic 23): rvf_runtime::qr_encode::evaluate_penalty has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_encode.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db0435f4ec7f90ddce12b253fdbc9143f6ab76947731c010c591ab8eb90a277"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_runtime::safety_net::selective_safety_net_scan (cyclomatic 23): rvf_runtime::safety_net::selective_safety_net_scan has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/safety_net.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0015e76eaa89a8f5c144ba3d77e006780c0ab7d930c04b5d575920e0873bd9"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::cpu::erf::erf_impl (cyclomatic 23): candle_core::cpu::erf::erf_impl has cyclomatic complexity 23 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/erf.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"6646b11501dab82024e72a91a919718d9324eed395601626456e58b3945904f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor.run (cyclomatic 23): Supervisor.run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/portfolio/release_supervisor.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac90d955b3052331aa46fbd843d4ba43156e2689bdd99b8e4db19ba70b226f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"resume_release.validate_archive (cyclomatic 23): resume_release.validate_archive 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":"python/portfolio/resume_release.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ea094dabf9c95b673de8b01567a8aaf846126c5f0d82172e5ed93877a9259b"}},{"ruleId":"D1","level":"warning","message":{"text":"inferParamType (cyclomatic 23): inferParamType has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbbb47c96bcb831843c2cd52a2c8fe283ffd6f999d50d94e03f93bd2002378d"}},{"ruleId":"D1","level":"warning","message":{"text":"micro_hnsw_wasm::search (cyclomatic 22): micro_hnsw_wasm::search has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be3cd869f74eed02f2cd0e62b340251df7c8b88f1607ac6ad6bab443f7d3a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"FlashAttention3::forward (cyclomatic 22): FlashAttention3::forward has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/flash.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dca0d214f71b5879d63125f0bdae7d95fcfabd0f0384a3dff854a8ead5df38c"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaAwareTraversal::neighbors (cyclomatic 22): DeltaAwareTraversal::neighbors has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-graph/src/traversal.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a0d5be33dddf640e32be2b97c5d1856de0221262d93b1d1bdfa465410c8879"}},{"ruleId":"D1","level":"warning","message":{"text":"PayloadIndex::remove (cyclomatic 22): PayloadIndex::remove has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-filter/src/index.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4519d46d04419fc3211725e5feb6974eeee133f45935d5231888a57e1cac0d66"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::eval (cyclomatic 22): ruvector_graph_wasm::cypher_exec::eval has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b387a78e092c9bcb591fcabffe1db45f7a542322d78f943cc930e6377eef2639"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_mincut_gated_transformer::spectral::lanczos_sparse (cyclomatic 22): ruvector_mincut_gated_transformer::spectral::lanczos_sparse has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/spectral.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2daeca6ce647128743185159c8e9bf9c0e5576d6c9b7d0aca889b3cf4dd14e"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::scan::scan_dir (cyclomatic 22): ruvector_weaver::scan::scan_dir has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/scan/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"10890cacbbb4cce35d13c500dbe86edfb711ecaa4f011541eef1580c6be25458"}},{"ruleId":"D1","level":"warning","message":{"text":"RuvltraQuantizer::quantize_tensor (cyclomatic 22): RuvltraQuantizer::quantize_tensor has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/ruvltra_quant.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"4906358dbd34a2fce6d134fab483c7ce6cdb298f523b5e91d2137b2a1e48e677"}},{"ruleId":"D1","level":"warning","message":{"text":"sonic_ct::organ::detect_organs (cyclomatic 22): sonic_ct::organ::detect_organs has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/organ.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"232c128a8447cf72db3390249c9bbb7524b11127e74a6806d4473262225d1a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"CudaStorage::copy_strided_src (cyclomatic 22): CudaStorage::copy_strided_src 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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"03beafd4de30874f563fca51c40b1c1672746121715fa17e2dbbc8c1030b52ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Hnsw::select_neighbours (cyclomatic 22): Hnsw::select_neighbours 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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa92cc508a51afd63e241e8847dd931ec5273a3eb6b2e3d12c67884e06fb3241"}},{"ruleId":"D1","level":"warning","message":{"text":"Hnsw::select_neighbours (cyclomatic 22): Hnsw::select_neighbours 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":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d729d18e97d6e4128d501a9c15e21af9d565ba8515b6fdcf8eed545a8969486"}},{"ruleId":"D1","level":"warning","message":{"text":"NeuralSymbolicBridge::extract_from_clusters (cyclomatic 21): NeuralSymbolicBridge::extract_from_clusters has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"16378c57e0b688d9a2e598b69f83a6557d014249aa5af34569f9fa8d5baab613"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_consciousness::rsvd_emergence::randomized_svd (cyclomatic 21): ruvector_consciousness::rsvd_emergence::randomized_svd has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/rsvd_emergence.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"27489f4f1b46f7c78286ad1521c4809892c36b0775491e9f0bb9c180df6fb1d8"}},{"ruleId":"D1","level":"warning","message":{"text":"CrvSessionManager::find_convergence (cyclomatic 21): CrvSessionManager::find_convergence has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/session.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ce697a4b21367f28cf898c5c0783cfe4341c516b740320bf5e6949d0c2c16f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductQuantizer::train (cyclomatic 21): ProductQuantizer::train has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/pq.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e124be8c27a77b469116527668658fb31d03b06c4c19f8b77a73e08dcb3a25c"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolOrchestrationDomain::score_orchestration (cyclomatic 21): ToolOrchestrationDomain::score_orchestration has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/tool_orchestration.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd4424d80e6a62f0dfc7c24d27e78e69cea238deda827babe88bf46ee8bf706"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_e_means::trainer::fit (cyclomatic 21): ruvector_e_means::trainer::fit has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-e-means/src/trainer.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d80172c31ab0552db8bcd3268651642a0d9c4f2f35797dc30f7778d666d6d2d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_condense::cutloss::cut_and_ortho (cyclomatic 21): ruvector_graph_condense::cutloss::cut_and_ortho has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/cutloss.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f854285ee54bc8f5f1dc3deb6b66e4fa0ea6093e4aff11eb086e852b124176cb"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuousTimeODE::integrate (cyclomatic 21): ContinuousTimeODE::integrate has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2876d87a4ddac1aa86d8379d79b32e6df15c7ffff6534cdbb9e99e31c775c5ae"}},{"ruleId":"D1","level":"warning","message":{"text":"CactusGraph::stoer_wagner_all_cuts (cyclomatic 21): CactusGraph::stoer_wagner_all_cuts has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ff4a08de54aa12bef20d7fccec39200a8f13d50b706defdf3197c06994d81"}},{"ruleId":"D1","level":"warning","message":{"text":"CactusGraph::build_cactus_from_cuts (cyclomatic 21): CactusGraph::build_cactus_from_cuts has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"339c532b4e11cbdf62601864358c9680404546982b5cbbc427d06d8c00063cce"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_numeric_literal (cyclomatic 21): SparqlParser::parse_numeric_literal has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72e16831403f1ed261a6bc6c99d0c92c776649b58360b76909cdc4a36c76b12"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::index::hnsw_am::hnsw_rescan (cyclomatic 21): ruvector_postgres::index::hnsw_am::hnsw_rescan has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4a4408411c87dba6eeb5fedca61d478036827db1b34f81b2ebca67ea59ffc6"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_py::graph::cypher_eval::eval (cyclomatic 21): ruvector_py::graph::cypher_eval::eval has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph/cypher_eval.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d0904bbc93c339d564ede6b98b80866d2e5e27b49684b4b861c0aceeedf30d"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorInfo::tensor_type (cyclomatic 21): TensorInfo::tensor_type 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":"crates/ruvllm/src/gguf/tensors.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8ae90fc0b93140ff30d5d802263608dc1e1753493f0864974571de3dde51f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorCategory::classify (cyclomatic 21): ErrorCategory::classify 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":"crates/ruvllm/src/reflection/error_recovery.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22055c505e000f4248b6e11edd0b66d2e2f7fb70767416b8b0d911cfcde35b2"}},{"ruleId":"D1","level":"warning","message":{"text":"rvagent_backends::gemini::sanitize_schema (cyclomatic 21): rvagent_backends::gemini::sanitize_schema has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/gemini.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49f2b297b883b0ae4df5c8b2c5afc86d01583ecfadb7921ab695ec9a4fb777c"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_cli::cmd::verify_attestation::run (cyclomatic 21): rvf_cli::cmd::verify_attestation::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_attestation.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0902a5ab54ad41e47b0a08e74dcad22ae948a669976af5a8c7f3df3482d23bf8"}},{"ruleId":"D1","level":"warning","message":{"text":"ParsedSeed::parse_manifest (cyclomatic 21): ParsedSeed::parse_manifest has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_seed.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"746b92d27ed6dd5379c83b79e90570321fc3d588a35cab380466bd4f7f8ffd4f"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::encode_metadata_generation (cyclomatic 21): RvfStore::encode_metadata_generation has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":4152}}}],"partialFingerprints":{"codehealthFindingId/v1":"368b0014557a6300425561a607265dc1db471817465507b5de813da5b348c855"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_wire::stream::descriptor::decode_descriptor (cyclomatic 21): rvf_wire::stream::descriptor::decode_descriptor has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/descriptor.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c9d8ff9d44e6a811a630700b3300baa5c92429e6e3e3acbe24871c7272b8e4"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_wire::stream::descriptor::parse_table (cyclomatic 21): rvf_wire::stream::descriptor::parse_table has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/descriptor.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafef2b9e2464808c587fd1eb847a8eb625b2cfb25b4d480895e88034fde22a8"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_numeric_literal (cyclomatic 21): SparqlParser::parse_numeric_literal has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb8ad1890c40384c995c2d0ed0149e54d1a9fe72d9fece42dd2b7830bba4f8"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::quantized::utils::make_qkx3_quants (cyclomatic 21): candle_core::quantized::utils::make_qkx3_quants 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":"patches/candle-core-0.9.2/src/quantized/utils.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"73af3fd68f624c74a100a1b99ae4a82fba57722ce8b8adecb00e686b76810f84"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::main (cyclomatic 20): mcp_brain_server::main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"578c38c606100b69c75157d72b889d58bc404e83b7dcfa40962f4adbd3a7e53c"}},{"ruleId":"D1","level":"warning","message":{"text":"EscalationLadder::run (cyclomatic 20): EscalationLadder::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":"crates/mcp-gate/src/monitor/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"143464d7d675e5daa6738339bd2a3211e14a20a58e388c66997c529114684445"}},{"ruleId":"D1","level":"warning","message":{"text":"photonlayer_bench::privacy::ridge_least_squares (cyclomatic 20): photonlayer_bench::privacy::ridge_least_squares 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":"crates/photonlayer-bench/src/privacy.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8972c583b13e79e874084c5aeb25479474c6f47a053f951fc727bcc9171fa5"}},{"ruleId":"D1","level":"warning","message":{"text":"MinCutRetriever::retrieve (cyclomatic 20): MinCutRetriever::retrieve has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bounded-rag/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"15403a74be09241ebaf45e9835a4f556609095ee4daf4e9792bd678fe0aaf427"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_avx2::depthwise_conv2d_int8_avx2 (cyclomatic 20): ruvector_cnn::kernels::int8_avx2::depthwise_conv2d_int8_avx2 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":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbae3ea7ea9ba95877f10d08846096677db9dfe5b78484a1687123a5ada7a36"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterExpression::evaluate (cyclomatic 20): FilterExpression::evaluate has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/filtered_search.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8b48afef5c5e0c8b81872fa3148960e9211169eb4a802ffb1697557f644684"}},{"ruleId":"D1","level":"warning","message":{"text":"Header::decode (cyclomatic 20): Header::decode has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-quant/src/persist/format.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dd8c1a681c2d0116d2f584ba0df1dff8ba9ea0926cff486bf9961e6da24566"}},{"ruleId":"D1","level":"warning","message":{"text":"EntropyScaledEf::search (cyclomatic 20): EntropyScaledEf::search has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"282e9a70656bd81b9ad11c8d0360b625e44c3459fcf15450d69374fc9b669406"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_gpu_runner::runner::launch (cyclomatic 20): ruvector_gpu_runner::runner::launch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gpu-runner/src/runner.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"672d7aeaa611601809ce58cd0e415183b176bf7ea741fb140d30e52883951ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"AdaptiveRadixTree::insert_recursive (cyclomatic 20): AdaptiveRadixTree::insert_recursive has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/adaptive_radix.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c17b395aa05fdb68f50e25b5f8144ee8a7445aaf4352cecf9ff8673af4725b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_node::cypher_exec::eval (cyclomatic 20): ruvector_graph_node::cypher_exec::eval has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"80439ed98c0012e195020afbaf806dbeac3e31ae47bae364e1d66f697fed1ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::aggregate (cyclomatic 20): ruvector_graph_wasm::cypher_exec::aggregate 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: ruvector_graph_wasm::cypher_exec::binary_symbol (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d851860767a6d7f771c0f89c6ca353df5937d37ded02252d9eba73756a47df"}},{"ruleId":"D1","level":"warning","message":{"text":"AdjSnapshot::global_mincut_value (cyclomatic 20): AdjSnapshot::global_mincut_value has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b44761f981dfbbf26b193acb75545d70015bbf1bdefc59eb89d378a7c1048b5"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreeLevelHierarchy::certify_mirror_cuts (cyclomatic 20): ThreeLevelHierarchy::certify_mirror_cuts has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed010783166c7622c7b72d63b0aa0cdf9bf69552e6fd4259a4c43e97b50a3bf2"}},{"ruleId":"D1","level":"warning","message":{"text":"DeterministicLocalKCut::deterministic_bfs (cyclomatic 20): DeterministicLocalKCut::deterministic_bfs has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/localkcut/paper_impl.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1a99d2f4f2c202162b935361e11be9915e6b72287622edb2871d8d2a16f2c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::index::ivfflat_am::ivfflat_amrescan (cyclomatic 20): ruvector_postgres::index::ivfflat_am::ivfflat_amrescan has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffa1d767dd9641cda09375c1512f924cb61de8d261f8a292ee0b764442cf955"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_retrieval_receipt::bin::benchmark::main (cyclomatic 20): ruvector_retrieval_receipt::bin::benchmark::main has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0287925670dc936c6c3e7ff4273e0cc43de222afed69fd8a76c166041425794d"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_solver::bmssp::build_aggregates (cyclomatic 20): ruvector_solver::bmssp::build_aggregates has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04251e26a353613d932bee983c770ec9e4c90fd0de102fd69ece5411b825541"}},{"ruleId":"D1","level":"warning","message":{"text":"ConsoleFilter::matches (cyclomatic 20): ConsoleFilter::matches has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/console.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3e7706c37e016b3469947689a535550479a761303a6458fbfe393edd1e9944"}},{"ruleId":"D1","level":"warning","message":{"text":"BitNetBackend::forward_mla_cached (cyclomatic 20): BitNetBackend::forward_mla_cached 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":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"c907940baf3999221157169f6ea04ae4f0b5866ce68defca992091a8aefd1bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Sampler::sample (cyclomatic 20): Sampler::sample has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/sampling.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be795dc4af6d58371ed733811768bbbbf11ff9ff59f3e4d7bdebd4110c213de"}},{"ruleId":"D1","level":"warning","message":{"text":"HnswGraph::relink (cyclomatic 20): HnswGraph::relink has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd3a60cf545b1b52936df3ea4bd032075a1a7683d8ad76ce7f850d7ef8ab4fa"}},{"ruleId":"D1","level":"warning","message":{"text":"VecParse::feed (cyclomatic 20): VecParse::feed has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/vectors.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1e42d1a01dbd20148a326f3c30d53a7799a70c12ccb89b29135b51080a4341"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::boot_with_ancestry (cyclomatic 20): RvfStore::boot_with_ancestry has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":3531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9208e02c0383077780099011c7935fef35be6ab9e18569dbb427195a42c781"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_primary (cyclomatic 20): Parser::parse_primary has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a0187dcdf24e0a9d1bc1f63068dd09e365ef996019f8f5bf1d13b5e3a92a4c"}},{"ruleId":"D1","level":"warning","message":{"text":"rvlite::sparql::executor::evaluate_binary_op (cyclomatic 20): rvlite::sparql::executor::evaluate_binary_op has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8981d4173e416614b3e89295916594ce5cac1e275f7f17a6a50fe474475104a"}},{"ruleId":"D1","level":"warning","message":{"text":"Phantom::build_slice (cyclomatic 20): Phantom::build_slice has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/phantom.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f8eee1b2a2ccac934b647df8173263a0f38936712a3212f97951960149b985"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor::write_bytes (cyclomatic 20): Tensor::write_bytes 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":"patches/candle-core-0.9.2/src/convert.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe3491ef1181b07d902d045fbfe655a81315ebd131f93cee7e2439b99c74094"}},{"ruleId":"D1","level":"warning","message":{"text":"Tensor::fmt (cyclomatic 20): Tensor::fmt has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/display.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8341056d8882498fadf640830920bba643238cd03e77c62caf68bc32a80aa791"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::cpu_backend::conv2d::conv2d_tiled (cyclomatic 20): candle_core::cpu_backend::conv2d::conv2d_tiled 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":"patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7f6832fe3164c085b15f779d6207b1c2d6c6685da1ec353d32761dd9e3dc7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Collection._load_validated (cyclomatic 20): Collection._load_validated has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1a02233d840090f6fe8fe3fbf2df0a6a9d213ddb70ae4b4a28e8f725d531b7"}},{"ruleId":"D1","level":"warning","message":{"text":"decompileSource (cyclomatic 20): decompileSource 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":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbe5f896804fb37e9cfdfeea492018856519da0cb50c81d50b9162651ac2c28"}},{"ruleId":"D1","level":"warning","message":{"text":"splitModules (cyclomatic 20): splitModules 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":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10d6de97121dd4d34d926a320482a436ed69b1e0cb48f5c21ed1848c384c3c7"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::status (cyclomatic 19): mcp_brain_server::routes::status 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":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"71900b4ff09deeafd04dfecff8fe0c7407010c31c0040129e4db1b9d06ef77a5"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorDB::open (cyclomatic 19): VectorDB::open has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98775a1c910c6b198cec3e7c968344fa54b86ffc05429fc0d08f5ebf55ee22a"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_authz::confidential::authenticate (cyclomatic 19): ruvector_edge_authz::confidential::authenticate 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":"crates/ruvector-edge-authz/src/confidential.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd6fece133db79303fb06fc3933996cb36a6a4157d8fe616700e52abe73a190"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorShard::plan_upsert (cyclomatic 19): VectorShard::plan_upsert 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":"crates/ruvector-edge-store/src/shard/write.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e402e25bf9cbdab3e2bf77f80d091144275b2e9552fac4315676f37d887a4cfb"}},{"ruleId":"D1","level":"warning","message":{"text":"GameTheoreticAttention::compute (cyclomatic 19): GameTheoreticAttention::compute has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/economic.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f74e496908b0298ce17aaf3489185461817dd14a5c6ba657b7a1cf81564205"}},{"ruleId":"D1","level":"warning","message":{"text":"ContinuousTimeODE::dormand_prince_step (cyclomatic 19): ContinuousTimeODE::dormand_prince_step has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc958462823661b7e9e487e03f164a0c6a71f93ee8f83b886f1be275c9c6addb"}},{"ruleId":"D1","level":"warning","message":{"text":"KgeModel::eval_json (cyclomatic 19): KgeModel::eval_json has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/pipeline.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb242937994e061e7e7392979506174a49c4cc658397664a9876eda27e39a7de"}},{"ruleId":"D1","level":"warning","message":{"text":"KgeModel::eval_json (cyclomatic 19): KgeModel::eval_json has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-wasm/src/pipeline.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4b9fb3979678c29526dba49f40a03bbd354bd627fea3f318c1a91fb7cb4dbf"}},{"ruleId":"D1","level":"warning","message":{"text":"SpectralClustering::kmeans (cyclomatic 19): SpectralClustering::kmeans has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/clustering.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a461f657cd2c69d8989dc752cadee1e5f1a5adebe997d74e354dd27672b86d8"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreeLevelHierarchy::propagate_updates (cyclomatic 19): ThreeLevelHierarchy::propagate_updates has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"e714afdfd3a42b1ffa9cf0a4b4f46836a0d9283c08136f2ad67b1d5817ac4d42"}},{"ruleId":"D1","level":"warning","message":{"text":"AttractorDynamics::karger_contract_fast (cyclomatic 19): AttractorDynamics::karger_contract_fast has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/attractor.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d03f56cb00bdd31ddbf3fa01c1fc54f82fc8e84f06ab83e02107d5b5c1ab71e"}},{"ruleId":"D1","level":"warning","message":{"text":"SubpolynomialMinCut::build_level (cyclomatic 19): SubpolynomialMinCut::build_level has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a7ae17ff5cb80779ee6b00a375cc4b83ffee895f40ddf7b9b404e31ec6d493"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::index::hnsw_am::hnsw_search (cyclomatic 19): ruvector_postgres::index::hnsw_am::hnsw_search has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12df1a8c1c3140d71315ad79795b8f4c4c64931fac9e4bd6a0e879c16822542"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_solver_wasm::analyze_sparsity (cyclomatic 19): ruvector_solver_wasm::analyze_sparsity has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-wasm/src/lib.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf8867ebeccf86424e9aa9cf0471e99310522602e8b21c89f2ba0e2191660d9"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_typesafe_train::export::transplant::map_initializers (cyclomatic 19): ruvector_typesafe_train::export::transplant::map_initializers has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/export/transplant.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cbdaf70830f4e6d5ffc6eb94a0555b2387caa1df371bd14f416ae3f10a9f89"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::cli::seo_apply::apply (cyclomatic 19): ruvector_weaver::cli::seo_apply::apply has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo_apply.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"42790fee25dade5b0a452c7e19e749b2ec0beee0cfd1fe0b62ec925f991d6dfa"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::gate::new_package_source_gates (cyclomatic 19): ruvector_weaver::gate::new_package_source_gates has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/gate.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3a06cf79af35a78f0163485867f1e67ae805ec5e8eb9f9ab124b28396c152f"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvix_cli::commands::security::execute_audit (cyclomatic 19): ruvix_cli::commands::security::execute_audit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/security.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"465e34e9a4d47930a2832b89b367bd999ca49ccfec6fe5354aae64a90ce7e52c"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRouter::classify_task (cyclomatic 19): AgentRouter::classify_task 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":"crates/ruvllm/src/claude_flow/agent_router.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea50246065736bc80880cf0e7ace37f86e3b8dadb65656e934e4b61b1cc67e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelSelector::apply_criteria (cyclomatic 19): ModelSelector::apply_criteria has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/model_router.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"781d426785993e1b748d012354899afd37441ca36372c412c0dc809a96427e46"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvllm::kernels::matmul::gemm_tile_12x4 (cyclomatic 19): ruvllm::kernels::matmul::gemm_tile_12x4 has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd0a6606b900c53f97141c6988cb109f9cc99c2b747f6fc8fb82217f808b8f0"}},{"ruleId":"D1","level":"warning","message":{"text":"SubquadraticSparseAttention::decode_step (cyclomatic 19): SubquadraticSparseAttention::decode_step has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef352ee2322f63b52bdf7982fa744890db87b2b9340c0547841dd6d7f0bb5a4c"}},{"ruleId":"D1","level":"warning","message":{"text":"KvCacheF16::decode_step_f16 (cyclomatic 19): KvCacheF16::decode_step_f16 has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d55452945f0d7f77c816cd92faccbe8c8ec4ab6ec15298358c28d69b3bad8aa"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvllm_sparse_attention::attention::build_landmark_candidates (cyclomatic 19): ruvllm_sparse_attention::attention::build_landmark_candidates has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a9bf04829076116cb52a23902369468501cdf7da2d2034f01843ed5d2d2e01"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamClient::run (cyclomatic 19): StreamClient::run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/client.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff978b1c2d13ffe6aff4006e02d3bfa2ea936ac24ec8ab4af5f1748ae0ccd5a"}},{"ruleId":"D1","level":"warning","message":{"text":"rvlite::sparql::executor::evaluate_expression (cyclomatic 19): rvlite::sparql::executor::evaluate_expression has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5acb83c1e49a7d09fbc70248cba8ed2314c54afb8c3b191679e712a71d1083"}},{"ruleId":"D1","level":"warning","message":{"text":"MinCutBridge::find_min_cut (cyclomatic 19): MinCutBridge::find_min_cut has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/mincut.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b30f95d4abdaaf8a1d05ffa9eadfc13404a4e237e1b6e42519456fd5a5fdc43"}},{"ruleId":"D1","level":"warning","message":{"text":"MatMul::f (cyclomatic 19): MatMul::f has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: CpuStorage::to_dtype (cyclomatic 49) 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a366b1fe774c1be563b033c1c43592fb37166f1fb0ed63fd0c1cca20251528"}},{"ruleId":"D1","level":"warning","message":{"text":"MatMul::f (cyclomatic 19): MatMul::f has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: CpuStorage::to_dtype (cyclomatic 102) 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"73153ccec626989a7da967b9f7f5c25737ddabaa3b7faea7780d30ce8ed4f07e"}},{"ruleId":"D1","level":"warning","message":{"text":"llamaindex._match_filter_value (cyclomatic 19): llamaindex._match_filter_value 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":"crates/ruvector-py/python/ruvector/integrations/llamaindex.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e07fb2e2cfe28a62dadd9fe65bcdcd4f38a845d7ccb27d0ca0375ba7715159"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_weights.main (cyclomatic 19): convert_weights.main 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":"crates/timesfm/scripts/convert_weights.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"315b74da606a5fdd92a59b37f050ed43bda450d69141a971727ea81fe483df8a"}},{"ruleId":"D1","level":"warning","message":{"text":"hasBraceBalance (cyclomatic 19): hasBraceBalance 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":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef3da34f30cf5a7b9e7c5e04c6f3c10c84cad1d8e4d09797add8d9a4ef24967"}},{"ruleId":"D1","level":"warning","message":{"text":"createRuField (cyclomatic 19): createRuField has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/client.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f554b13caa14da5f1e9d6ad0488ee63b1f4c47806c2fd0ab02105e6686aba2b"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_agent_memory::arbitration::arbitrate (cyclomatic 18): ruvector_agent_memory::arbitration::arbitrate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/arbitration.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e814a6f31dd2271021fff889a9532d4fdf3847b761e141661409c5df09c55c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_agent_memory::witness_signing::verify_signed_chain (cyclomatic 18): ruvector_agent_memory::witness_signing::verify_signed_chain has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/witness_signing.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a0a2f0f50384b7010506898093d2640c387dd6db4c77e8944f7b308f2bc691"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_neon::depthwise_conv2d_int8_neon (cyclomatic 18): ruvector_cnn::kernels::int8_neon::depthwise_conv2d_int8_neon 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":"crates/ruvector-cnn/src/kernels/int8_neon.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2dc8569bcfff53c62b300444c31114ddf23cd6ed89a8b7f84444e5cdc069b1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::simd::avx2::conv_3x3_avx2_fma (cyclomatic 18): ruvector_cnn::simd::avx2::conv_3x3_avx2_fma 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. This shape REPEATS in the file: one other method here (ruvector_cnn::simd::avx2::conv_3x3_avx2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2e068d6e984fd79cb504d70dfb45bf0a4c7924bea5e14d17402b4ab3ae6047"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::simd::avx2::conv_3x3_avx2 (cyclomatic 18): ruvector_cnn::simd::avx2::conv_3x3_avx2 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. This shape REPEATS in the file: one other method here (ruvector_cnn::simd::avx2::conv_3x3_avx2_fma) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"29455339c7cfc784eb1b9ed5fdc20e233fb67f322ad109dc522f3ebd9d5cff55"}},{"ruleId":"D1","level":"warning","message":{"text":"HierarchicalPhiEngine::compute_phi (cyclomatic 18): HierarchicalPhiEngine::compute_phi has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ee778d9575b7542a68d5aca8164d259c6c3f0815416a1d86a30147beb92531"}},{"ruleId":"D1","level":"warning","message":{"text":"FlatGraph::search_filtered (cyclomatic 18): FlatGraph::search_filtered has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/flat_graph/filtered.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0a0b00ab8188371d843077e1261bc43c818ea3dc560ab64598451dafa20a19"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_decompiler::parser::find_declaration_end (cyclomatic 18): ruvector_decompiler::parser::find_declaration_end has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/parser.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a32d40647adf7631132e4b92ceb24ef18cd4b87db0e0fbd97ed93c79f3fcd84"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_gpu_runner::runner::supervise (cyclomatic 18): ruvector_gpu_runner::runner::supervise has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gpu-runner/src/runner.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35cdb5d7965e5ec1a043c5173f79cebd82b8fbda2d42c9ce9a1d791efc7f5b6"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphCoarsener::aggregate_features (cyclomatic 18): GraphCoarsener::aggregate_features 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":"crates/ruvector-graph-transformer/src/self_organizing.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"6346b2face597590526262d7bef54cdba2b06e4b140a617223b4da5fd85b0739"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplacementEdgeIndex::find_components_after_cut (cyclomatic 18): ReplacementEdgeIndex::find_components_after_cut has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/replacement.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f1b4c12d7ba44e152118cb9a296bc036c23e1d6e79f8b365fb2f219271bfe8"}},{"ruleId":"D1","level":"warning","message":{"text":"CactusGraph::detect_cycles (cyclomatic 18): CactusGraph::detect_cycles has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d58228f0a4dda0ac51276485f1720b326264e3148b71a0ef59aaa949f63b4f6"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_mincut::canonical::source_anchored::canonical_mincut (cyclomatic 18): ruvector_mincut::canonical::source_anchored::canonical_mincut has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"0268db25944722e27389cbce11ffaad8350091bdd4b80ce16d72f686cde262e9"}},{"ruleId":"D1","level":"warning","message":{"text":"MincutComputer::compute_algebraic_connectivity (cyclomatic 18): MincutComputer::compute_algebraic_connectivity 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":"crates/ruvector-postgres/src/integrity/mincut.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7229d0060806cd7c1f562d4379e462869eac59411c0d896565b3be20d6f91c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_property_path (cyclomatic 18): ruvector_postgres::graph::sparql::executor::evaluate_property_path has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64f37c82d667117ca160cdefd27f5dc9d93f7a7910d1021fc8b2b3ca1a1b79d"}},{"ruleId":"D1","level":"warning","message":{"text":"FactorSet::from_data (cyclomatic 18): FactorSet::from_data 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":"crates/ruvector-temporal-tensor/src/delta.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"970bb8919515071c8057692c047e87dc5a855c5d0080e979e9a9031e35a2e875"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_typesafe_train::train::run (cyclomatic 18): ruvector_typesafe_train::train::run has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/train/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"448f9545a65f6f06f5cb8b93a2d6d17adbe715a3d72a051b17c6256a83ccb37c"}},{"ruleId":"D1","level":"warning","message":{"text":"Taxonomy::parse (cyclomatic 18): Taxonomy::parse has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/taxonomy.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e9f209a71a27d511df42ff921d866ab9ebdf4b010d9144fc54f63feb65a6a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::seo::diff::myers (cyclomatic 18): ruvector_weaver::seo::diff::myers has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/diff.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c319e96e1c63d9bc478c231206b85ae6475b899bf308979b439dd8ea25c4d9f"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvix_cli::commands::security::execute_scan (cyclomatic 18): ruvix_cli::commands::security::execute_scan has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/security.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6cf866af79d6cc67430ba0ceebcfbdff90ec354513410f4d56966dbbe8329c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvix_qemu_swarm::monitor::tui_loop (cyclomatic 18): ruvix_qemu_swarm::monitor::tui_loop has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/monitor.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c458593b8abdb88a6720b273cf37d081e7fd7976e41928fc81fd0c4979193eea"}},{"ruleId":"D1","level":"warning","message":{"text":"BitNetBackend::discover_tensors (cyclomatic 18): BitNetBackend::discover_tensors has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"76944915a21cf5b41be73c6322dc7ddd1e86f07ba7594092bd5cda0ba8eede13"}},{"ruleId":"D1","level":"warning","message":{"text":"IntelligentContextManager::prepare_context (cyclomatic 18): IntelligentContextManager::prepare_context has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/context_manager.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7ccbe8968ecfa2b6d7b7b1e1532c1fa82766eb9b950d8f3c9274a96b124d12"}},{"ruleId":"D1","level":"warning","message":{"text":"Sampler::sample_topk (cyclomatic 18): Sampler::sample_topk has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/sampling.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2ba7eeced9561da69b026a9fcd3ac63ec9e6d82813ae2fc99c7b9fee2807bf"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonSchemaValidator::validate_against_schema (cyclomatic 18): JsonSchemaValidator::validate_against_schema has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/validators.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6d391dcfa614d7fd51b2dd9ba04a9011699522c2c311350d7167529492daa2"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::apply_open_policy (cyclomatic 18): RvfStore::apply_open_policy has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/policy_api.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"132f73cba22e7f10ac23845259fd1dda768b9d611322ba42c1aec6d3713b0bf2"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_server::stream::body (cyclomatic 18): rvf_server::stream::body has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/stream.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f093e5d7d19ed7b14fe951a7b3c3795d7c3cae6c4022368b9ea4cc0183a4c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::mcp::tools_call (cyclomatic 18): ruvector_edge_gateway::mcp::tools_call 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":"edge/gateway/src/mcp.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e547d8e7a35a43f0bbf67581d4abea6d6ad573c08937d10f974595825992b477"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::tenant_admin::deny_entry (cyclomatic 18): ruvector_edge_gateway::tenant_admin::deny_entry 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":"edge/gateway/src/tenant_admin.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bc84b573837387eaa8b3d6969829def82b17e651c34d4a554542068357eace"}},{"ruleId":"D1","level":"warning","message":{"text":"CpuStorage::unary_impl (cyclomatic 18): CpuStorage::unary_impl has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: CpuStorage::to_dtype (cyclomatic 102) 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c31ee16372996e8785aa80c4ed529c1df4f1bfe55d11eea97a49f07ef91cc58"}},{"ruleId":"D1","level":"warning","message":{"text":"CpuStorage::binary_impl (cyclomatic 18): CpuStorage::binary_impl has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: CpuStorage::to_dtype (cyclomatic 102) 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e764539d4cafdc1e859d3a5dca87499c017a081ee66434420a0b33672b609e2c"}},{"ruleId":"D1","level":"warning","message":{"text":"MatMul::f (cyclomatic 18): MatMul::f has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: CpuStorage::to_dtype (cyclomatic 49) 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"08843d41d386f406bf18d59dfefbc7bd29da9f9202e3396177593ac2cd68777b"}},{"ruleId":"D1","level":"warning","message":{"text":"MatMul::f (cyclomatic 18): MatMul::f has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: CpuStorage::to_dtype (cyclomatic 102) 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bc4171633cf6d5e28dcf6294baa2a219536c5dfa7dffe338c87edfeec593a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Collection.from_vectors (cyclomatic 18): Collection.from_vectors has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b6eb7cfab462cd4d2d5d87909322a34188b064bd0242122445470226f681d0"}},{"ruleId":"D1","level":"warning","message":{"text":"tuneClustering (cyclomatic 18): tuneClustering has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/metaharness.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3bcba61e24c6d52b7b265a3d56966236da29e719ad1e061e0c1f0932f477bf"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshotOptions (cyclomatic 18): snapshotOptions has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/quantization.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9aee33fd8c6d098fb8be12b76aaac339091606a9591e760040a4bab6d10b47"}},{"ruleId":"D1","level":"warning","message":{"text":"isStatementBoundaryAfterBrace (cyclomatic 18): isStatementBoundaryAfterBrace 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":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3f4c25a2528c4da932eb3e0cef0d0439d418bd54647ce367575dd033e23021"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::create_router (cyclomatic 17): mcp_brain_server::routes::create_router has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44adbb6e2037d05bf5c625858dd58d5f11c47124bc83e73e30daffb697614f1"}},{"ruleId":"D1","level":"warning","message":{"text":"RiskGate::evaluate (cyclomatic 17): RiskGate::evaluate has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/neural-trader-strategies/src/risk.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8176840507cdc2779d831869d8b10e8930cf903677b80ebae579ab15ca89c282"}},{"ruleId":"D1","level":"warning","message":{"text":"IncoherenceIsolator::find_isolated_regions (cyclomatic 17): IncoherenceIsolator::find_isolated_regions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05cd27839045888b522d00cada2a176f3c0e9758beaa7eb0711afe12be94522"}},{"ruleId":"D1","level":"warning","message":{"text":"SheafSubgraph::from_graph (cyclomatic 17): SheafSubgraph::from_graph has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac52e5da2f02b82b95325fcd5649d4b23b44a5522fe77bfbfeeceaac6d15ee5"}},{"ruleId":"D1","level":"warning","message":{"text":"RingAttention::ring_forward (cyclomatic 17): RingAttention::ring_forward has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/flash.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"15109e44a90ef2cf26e31648ec56baaa9e22436a97df467cf80717f2fe0a7fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"InfoNCELoss::forward_detailed (cyclomatic 17): InfoNCELoss::forward_detailed has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/infonce.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"014713f96630225c1ab808d4a16537f9149e47cf941af25024a0e9584711f251"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::simd::wasm::conv_3x3_wasm (cyclomatic 17): ruvector_cnn::simd::wasm::conv_3x3_wasm has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/wasm.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"477b4fd2cdb5cae8d4d9a38c1b9db76759c9e790b0f536ebf6b3d52ef72ee13e"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::simd::winograd::conv_3x3_winograd (cyclomatic 17): ruvector_cnn::simd::winograd::conv_3x3_winograd has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/winograd.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f4c675759fd3816360dca801987103c11c7c9cafeaf1e070c455a364f5aaf8"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_core::advanced_features::product_quantization::kmeans_clustering (cyclomatic 17): ruvector_core::advanced_features::product_quantization::kmeans_clustering has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/product_quantization.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c901fbcaab698b523aeac7404445039656ddd4cb0873eefe6b6043e950beca35"}},{"ruleId":"D1","level":"warning","message":{"text":"StageIIIEncoder::encode_element (cyclomatic 17): StageIIIEncoder::encode_element has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/stage_iii.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5535d561f866bc1fcbd2b2c71f1bec6dbe571cb99b26e13ad1b43ab72ddf7411"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_decompiler::inferrer::infer_declaration_name (cyclomatic 17): ruvector_decompiler::inferrer::infer_declaration_name has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/inferrer.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9378ebe311104d4e58edc0dd3452ac4fc54e047ed7176af0e2f3b7e1baf9896"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphState::apply_delta (cyclomatic 17): GraphState::apply_delta has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-graph/src/lib.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ca66a7cb4279fa7e486f05295b02dca3312b41875dc0ddce0fe380865deb87"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_analytics::cost::certificate (cyclomatic 17): ruvector_edge_analytics::cost::certificate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-analytics/src/cost.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c5127b07cf91f0197984c0d2b2fc9cc13f39bb958c22ba1be723f5284ef20b"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceUrl::parse (cyclomatic 17): ResourceUrl::parse has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-auth/src/resource.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6a4247a13d546b4515235f61b3168c8b4276ae26578f3f1782a3ee0020138b"}},{"ruleId":"D1","level":"warning","message":{"text":"HnswIndex::compact (cyclomatic 17): HnswIndex::compact has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/hnsw/compact.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c46a960fde841153e5ea6889b93ce2b148ae9cc62f6225177083daa990b74c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_relationship_pattern (cyclomatic 17): Parser::parse_relationship_pattern has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2a0c1ebb2341362480b00f052ccbae401f39268f08e123d70e3762f42e59d3"}},{"ruleId":"D1","level":"warning","message":{"text":"InhibitionStrategy::apply (cyclomatic 17): InhibitionStrategy::apply has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/biological.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a150a25ab99b095c868a36700ffbee60011cf75dc30aea4f5761296021bde3"}},{"ruleId":"D1","level":"warning","message":{"text":"GaugeEquivariantMP::forward (cyclomatic 17): GaugeEquivariantMP::forward has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/physics.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb119b589ea211421f4edbc311706c87538741625038bf38fed25974d67d1dae"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::call_function (cyclomatic 17): ruvector_graph_wasm::cypher_exec::call_function has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ruvector_graph_wasm::cypher_exec::binary_symbol (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"662d62cc64533c1b1110c49eac14f2035e235e863c7c4be4de5f9dbca989c345"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_hnsw_repair::strategy::repair_one (cyclomatic 17): ruvector_hnsw_repair::strategy::repair_one has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/strategy.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"67eaa2904cca3865b240d1c3f88c46832fee5d4d1b538c02450d8d2abe13ad9e"}},{"ruleId":"D1","level":"warning","message":{"text":"KFACLayer::update (cyclomatic 17): KFACLayer::update has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/kfac.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e66fe1beb5faea1b85ec1dcbbe594ac48e961d756aec4d1cc54eb224306b5a"}},{"ruleId":"D1","level":"warning","message":{"text":"SpikeTrain::cross_correlation (cyclomatic 17): SpikeTrain::cross_correlation has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/neuron.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40535d77e3bdb97922651dcffbefce87b619b537cf16c76fbaaea2b7b60a0fa"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_solution_modifiers (cyclomatic 17): SparqlParser::parse_solution_modifiers has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"726dee56ef07f3e78ac78710f7ad591600b9dce3635fcd50d7553b33e56219a0"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_postgres::graph::cypher::parser::parse_relationship_pattern (cyclomatic 17): ruvector_postgres::graph::cypher::parser::parse_relationship_pattern has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/parser.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f2ba9120cd66699620c2595177c6947d5d66f975825d9cc442a942f398d4ae"}},{"ruleId":"D1","level":"warning","message":{"text":"NapiSolver::pagerank (cyclomatic 17): NapiSolver::pagerank has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fda3d18b92fb76568ba39d535b05a19556bbf17af039511d633e648007bc77"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_typesafe_core::limits::validate (cyclomatic 17): ruvector_typesafe_core::limits::validate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/limits.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9ad2bd6facb0d5954ec1dacd79cf3cc7eaa01d6aa8e4c28beb459b3a5ef4cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvix_cli::commands::keys::execute_list (cyclomatic 17): ruvix_cli::commands::keys::execute_list has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/keys.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"23643baf75414cbe42ccb3d41c157a21212c3cd6fa6e01c8bc6a030169290fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"HooksIntegration::fallback_routing (cyclomatic 17): HooksIntegration::fallback_routing has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/hooks_integration.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ac4f3c92c7f366e479e8344b59403c55dd4fddbb9c9670594398ec6050bba3"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolDatasetGenerator::generate_param_value (cyclomatic 17): ToolDatasetGenerator::generate_param_value has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ToolCategory::name (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/tool_dataset.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc4641f60fcbde594cafd2cc5256e2bb9870bb21dc821ea87ee59dd9e71ba02"}},{"ruleId":"D1","level":"warning","message":{"text":"Tui::handle_key (cyclomatic 17): Tui::handle_key has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/tui.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f6ed0bd58adafc01e06c259a52264d37fecbe176c69706b752dc863f097cb6"}},{"ruleId":"D1","level":"warning","message":{"text":"UnicodeSecurityMiddleware::before_agent (cyclomatic 17): UnicodeSecurityMiddleware::before_agent has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/unicode_security_middleware.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f5c76e9fd4208adc23a281992cad91e744ec4cfd388b8f9a96a7e5de1532b9"}},{"ruleId":"D1","level":"warning","message":{"text":"AgiContainerBuilder::build_sections (cyclomatic 17): AgiContainerBuilder::build_sections has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ParsedAgiManifest::parse (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/agi_container.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"762dcee8ab9eab47484b81179c67abe33f39da8fb826f71fe2d2365d079e3446"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::query_via_index_cow (cyclomatic 17): RvfStore::query_via_index_cow has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7806c1e9071b3744da99006a73dfcba8c7c92b1335c6b14c361b9687427f62"}},{"ruleId":"D1","level":"warning","message":{"text":"RvfStore::cow_exact_parent_scan (cyclomatic 17): RvfStore::cow_exact_parent_scan has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"45378a3ceb5745c50b0ea574e1aed2640fd6cac2a345274fc0043ee4ed9a271e"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_runtime::index_path::decode_graph (cyclomatic 17): rvf_runtime::index_path::decode_graph has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/index_path.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce18d935cb7e9e434b2c00d5639cc099c10943fb7966b30647011c52a9ef3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_runtime::read_path::scan_blocks (cyclomatic 17): rvf_runtime::read_path::scan_blocks has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"39529b5ef1d1be256c486e46c75f9f6e07e86206b5696754298cae9773aaf1f5"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_solver_wasm::engine::inject_noise (cyclomatic 17): rvf_solver_wasm::engine::inject_noise has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/engine.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d095787c74d40b6b2829713c9bfafe66e3617154491b0de1a5321cb5b93820"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::match_relationship_pattern (cyclomatic 17): Executor::match_relationship_pattern has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/executor.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"467f3bd588bd1f8947791677913ba852ba77fa01bc873c4d5e6b8009b1953133"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_relationship_pattern (cyclomatic 17): Parser::parse_relationship_pattern has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0246d77f0cf0890bd29434059de3f409a196cdb165963a5dc29621c8aa413a"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_solution_modifiers (cyclomatic 17): SparqlParser::parse_solution_modifiers has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd4dd4ea593d9d4948292d4711d397c097a1bac4f42893003939163e1488084"}},{"ruleId":"D1","level":"warning","message":{"text":"rvm_wasm::validate_module (cyclomatic 17): rvm_wasm::validate_module has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/lib.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d59ce9c7772a6bf4fc52e94812cc84e3c873e5aab9334ecf90f58549562850"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::rest::exec_route (cyclomatic 17): ruvector_edge_gateway::rest::exec_route has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ruvector_edge_gateway::rest::parse (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/rest.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6cb6aeac61db8a508e4e25a88c3ac8862f28d202e5fa938dfab626af75244d"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockQ3K::from_float (cyclomatic 17): BlockQ3K::from_float 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b96b9eb05bb14af4e941be8f8b4bcafb2af0e1148d22667d32ba45bde2b07f3"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockQ3K::from_float (cyclomatic 17): BlockQ3K::from_float 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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3c7e08d7963b08f7277848d0aae017b86e8099d2783c91307b1432d4c27e23"}},{"ruleId":"D1","level":"warning","message":{"text":"UpsampleBilinear2D::f (cyclomatic 17): UpsampleBilinear2D::f has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: CpuStorage::to_dtype (cyclomatic 102) 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c5a34245697b4a098e8b65aa638790c6dc4f4e77904c27de4aac59fabf14e8"}},{"ruleId":"D1","level":"warning","message":{"text":"Hnsw::search_layer (cyclomatic 17): Hnsw::search_layer 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":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"79233b20aa99634f4b05e6907f7ebd88f106372b79f10ca1e5df2de5a987071d"}},{"ruleId":"D1","level":"warning","message":{"text":"HnswIo::load_point_indexation (cyclomatic 17): HnswIo::load_point_indexation 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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f40cd2c69c9c98481ece0b363cce47450c505141939846a6237af418c053f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"HnswIo::load_point_indexation (cyclomatic 17): HnswIo::load_point_indexation 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":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b41cc13400aaa7cbab1c2a3dfb6d6dae9221a1f0138b5efcad9c6462e19aecf"}},{"ruleId":"D1","level":"warning","message":{"text":"RealMatrix::symmetric_eigen (cyclomatic 16): RealMatrix::symmetric_eigen has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/real_matrix.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"71be6ef3e2fd7a88ad0cd9b111917aea53d547bf887fc5731fc6c4df6b49d251"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_brain_server::routes::pipeline_crawl_discover (cyclomatic 16): mcp_brain_server::routes::pipeline_crawl_discover has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec606a1755137f6e3af25bcab2b0b6cd6fbc054b8ae2044b76441ede01f3133"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_cnn::simd::neon::conv_3x3_neon (cyclomatic 16): ruvector_cnn::simd::neon::conv_3x3_neon has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b2e464d486b98bfab47ae8d4367ef1333674eec213e48de3665b5c5aa4ddd4"}},{"ruleId":"D1","level":"warning","message":{"text":"MinCutPhiEngine::compute_phi (cyclomatic 16): MinCutPhiEngine::compute_phi has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/mincut_phi.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"986dd9d73e8534c4ed43db05b88d77549ea861144f2afc6d32a2e48f6b6fd44d"}},{"ruleId":"D1","level":"warning","message":{"text":"CommunityDetection::detect_communities (cyclomatic 16): CommunityDetection::detect_communities has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/graph_rag.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c32c0c1240e3bec83973182f609ab44997bb7463e2e0c8173fe9e110c90e53"}},{"ruleId":"D1","level":"warning","message":{"text":"RustSynthesisDomain::score_solution (cyclomatic 16): RustSynthesisDomain::score_solution has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/rust_synthesis.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"2313f6fe2a353ec01413550987937270dffd845a5600ff075f6475907a24b9ee"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamValidator::on_header (cyclomatic 16): StreamValidator::on_header has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-registry/src/validate/stream.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"93abb9d6eae49220b002414e59d1b2eca076ca5a9e6d23f04e553a8731d16f28"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreSession::begin (cyclomatic 16): RestoreSession::begin has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/src/restore.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66d9246a86e1d44754dbfa1b62ca8b448c577ab47631d735f50be899e90c6b4"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_store::shard::read::validate_query (cyclomatic 16): ruvector_edge_store::shard::read::validate_query has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/read.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3b62e12e307acf97372d76182f3affe074a6e7e72df81b9a5a538b119752ac"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeSimBackend::run_layer (cyclomatic 16): NativeSimBackend::run_layer has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9eb04994ffb9d506120dea1a00ae43f5e85ed74fdc76bae0fe4eb063e04c20f"}},{"ruleId":"D1","level":"warning","message":{"text":"IncentiveAlignedMPNN::step (cyclomatic 16): IncentiveAlignedMPNN::step has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/economic.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a66b310718d003a6234617619acc3a50ed606c14c6cd7c6676c9febf3083dc2"}},{"ruleId":"D1","level":"warning","message":{"text":"KgeModel::predict_json (cyclomatic 16): KgeModel::predict_json has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abfdc289804b3e49eb1006dcbd87e5ecf3ce46ae841086114698d730cf8495d"}},{"ruleId":"D1","level":"warning","message":{"text":"KgeModel::predict_json (cyclomatic 16): KgeModel::predict_json has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-wasm/src/ops.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea18d336d61939f2ff4abed1b255ef79fd6b96a9031a663272c197a7f9c5615a"}},{"ruleId":"D1","level":"warning","message":{"text":"VietorisRips::build (cyclomatic 16): VietorisRips::build has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/filtration.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3fc227f874344c2f684ba1e5f30adb109bf71b0a661b49a8920e47a3bae74c"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_math::tensor_networks::contraction::contract_tensors (cyclomatic 16): ruvector_math::tensor_networks::contraction::contract_tensors has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/contraction.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e272d7b2ffa65ce9b0d0b81ba0e96d7dabb061ed566c4ecbded53a77d0df3028"}},{"ruleId":"D1","level":"warning","message":{"text":"RuFieldRouter::ingest_json (cyclomatic 16): RuFieldRouter::ingest_json has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/routing/rufield.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ecb9d17a652c8c4d0e15ca07aac76c871c98f848fab823ab1376302cceceba"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_relational_expression (cyclomatic 16): SparqlParser::parse_relational_expression has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"b948fe3cce8c78d4d3d144882bed933387db14da0ada7d713b2224ff7aabbd0e"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::try_parse_aggregate (cyclomatic 16): SparqlParser::try_parse_aggregate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0693551b32a118b65eb1a0ba302744bb0493a396d409cda18716d970077dd6"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_robotics::cognitive::behavior_tree::eval (cyclomatic 16): ruvector_robotics::cognitive::behavior_tree::eval has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/cognitive/behavior_tree.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2042220daf875bff0f347a7b87a9a79b9391dc87b2acdea7ae89ff5765d1727"}},{"ruleId":"D1","level":"warning","message":{"text":"SolverOrchestrator::analyze_sparsity (cyclomatic 16): SolverOrchestrator::analyze_sparsity has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cc2b9f672324df1805c008dde5b8b12f43681276d0eee782bb723d025795c8"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_solver::validation::validate_csr_matrix (cyclomatic 16): ruvector_solver::validation::validate_csr_matrix has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/validation.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6a225257472637fab69db08c3dc3005578d2c5193b0bcdd8d560ddbb662da6"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::cli::seo_apply::package_pr (cyclomatic 16): ruvector_weaver::cli::seo_apply::package_pr has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo_apply.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d40e628f37640073b490edb0d3c3d717f7a26fa0425712ab4c7d30eb1de0e4"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_weaver::seo::baseline::classify (cyclomatic 16): ruvector_weaver::seo::baseline::classify has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/baseline.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec18882a70319efd45cf4196ae5fa75ed55b34ae5dc79b54772f9de5f572188c"}},{"ruleId":"D1","level":"warning","message":{"text":"Shell::dispatch_command (cyclomatic 16): Shell::dispatch_command has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/shell/src/lib.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38a20bce0fc02f93f35f1bcaa4417a742e093e43f9d472af63cff43a4394c85"}},{"ruleId":"D1","level":"warning","message":{"text":"AneInfo::detect_ane_tops (cyclomatic 16): AneInfo::detect_ane_tops has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a01b26ab266d60a606f6d5e68f66baacba5a0fcdf55d50dd1be4c751d35e90"}},{"ruleId":"D1","level":"warning","message":{"text":"MythosConfig::validate (cyclomatic 16): MythosConfig::validate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/config.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"94347ea83fee1cee22e6802a6fc1712fa002d652a94bff98bded4a63cc3396ed"}},{"ruleId":"D1","level":"warning","message":{"text":"FormatValidator::simple_match (cyclomatic 16): FormatValidator::simple_match has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/validators.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e96a88c8cdc8c5057c7cfaacc65d1927968c6ad322d7ccd5a05b23d24361e0f"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfidenceChecker::identify_weak_points (cyclomatic 16): ConfidenceChecker::identify_weak_points has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/confidence.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbc531c5233efb65a7f749c35290a0dc4b4904df6609b2518e0612a5f53a8f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvllm::kv_migration::mapper::solve_linear_system (cyclomatic 16): ruvllm::kv_migration::mapper::solve_linear_system has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_migration/mapper.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0543bf69e431bf8c5b151f809ade8881aa655c2cbc674f9f4a1d71d7731f2260"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmMcpServer::execute_tool (cyclomatic 16): WasmMcpServer::execute_tool has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/mcp.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3deb224e8e815bfbf87abd34eac35629b01727b2d358fadf786fafd9205534"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamIngest::feed (cyclomatic 16): StreamIngest::feed has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/ingest.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7016367ba9b08ca21bd100c8da8461d64c32c2e5cfa48bf7a6f44591b596ae4"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_solver_wasm::engine::run_acceptance_mode (cyclomatic 16): rvf_solver_wasm::engine::run_acceptance_mode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/engine.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc95fecddd6bdb6ebd8656c07ccebbec37b40714510dbe0af92334f351cedaa"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataSegment::decode (cyclomatic 16): MetadataSegment::decode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/metadata.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32d188b96cc1afc36dc5653f844743bba000c52ee970616762952eb342e9fda"}},{"ruleId":"D1","level":"warning","message":{"text":"rvf_types::metadata::validate_segment (cyclomatic 16): rvf_types::metadata::validate_segment has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/metadata.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"58668ee2da7f338602332500a38e6e66baf977ca4cb6b46f52ef7d5d035d99b3"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::parse_relational_expression (cyclomatic 16): SparqlParser::parse_relational_expression has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0c9af3174c46c391e724075adf73508396cef8ba71a8237043897d3b490c39"}},{"ruleId":"D1","level":"warning","message":{"text":"SparqlParser::try_parse_aggregate (cyclomatic 16): SparqlParser::try_parse_aggregate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb63e65b10f62f20813ff45bebe5266fcb4a9bd78dae69e05f3c6ef75215b7f"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::graph_cypher::precheck (cyclomatic 16): ruvector_edge_gateway::graph_cypher::precheck 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":"edge/gateway/src/graph_cypher.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c540616c7fd23cc818abe314eaa9e87558360337db6dad041f84d6930b6a5a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ruvector_edge_gateway::registry_routes::route_inner (cyclomatic 16): ruvector_edge_gateway::registry_routes::route_inner has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ruvector_edge_gateway::registry_routes::parse (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/registry_routes.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"08305234e4bc40778afd99bd2210334c335953f21ca4ff02bb6793c3299dfb11"}},{"ruleId":"D1","level":"warning","message":{"text":"CudaStorage::copy_strided_src (cyclomatic 16): CudaStorage::copy_strided_src 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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"888cb66adf378446db0b1f351ea584493fdecfae406b98ceae37b59c7edf3594"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::write (cyclomatic 16): Value::write has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Value::read (cyclomatic 17) 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":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c76461c94856793da6b33a4bdbcad650b850e00ec2c8824757870e3ec19219"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::write (cyclomatic 16): Value::write has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Value::read (cyclomatic 17) 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":"patches/candle-core-0.9.2/src/quantized/gguf_file.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1599d660ac4f937ea506d3323cfede676d3ea908c85ffdae3b32e52f6c35eff"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::cpu_backend::utils::binary_map_vec (cyclomatic 16): candle_core::cpu_backend::utils::binary_map_vec has cyclomatic complexity 16 (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":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db8c8049413fbb814a6df5f072e30b96dc25f99d26b93ac7dc801196e582b8c"}},{"ruleId":"D1","level":"warning","message":{"text":"candle_core::cpu_backend::utils::binary_map_vec (cyclomatic 16): candle_core::cpu_backend::utils::binary_map_vec has cyclomatic complexity 16 (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":"patches/candle-core-0.9.2/src/cpu_backend/utils.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"789c42b5625c3c1800222e2702d42b7addce56c9a8958842b800c913822a106f"}},{"ruleId":"D1","level":"warning","message":{"text":"Hnsw::search_layer (cyclomatic 16): Hnsw::search_layer 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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"326923fb9935fafbdd9c44a4d6b65912348e310418a02ee25803b33d9d500949"}},{"ruleId":"D1","level":"warning","message":{"text":"heuristicName (cyclomatic 16): heuristicName has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/name-predictor.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb17b3266ebf8446c9cd1c107e172998ebc308edeedcd94731a23e44f74849b"}},{"ruleId":"D1","level":"warning","message":{"text":"domain (cyclomatic 16): domain 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":"npm/packages/e-means/integrations/clustering-validation.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53fb1f6e712a9b1e01ac09e47bd5d48a74a76cd6940a7cfba458bd8a9a89863"}},{"ruleId":"D1","level":"warning","message":{"text":"checkedCodebook (cyclomatic 16): checkedCodebook has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/cloudflare/validation.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9eb493348950b388865177bb4c6dc24e2f46f72e4ee0253c549216bf9f9c19"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_temporal_tensor::quantizer::dequantize_f32 (cognitive 166): ruvector_temporal_tensor::quantizer::dequantize_f32 has cognitive complexity 166 (threshold 15). Drivers by points: if/else 27 (80 pts), loops 22 (76 pts), boolean chains 8, match/switch 2 (nesting depth added 107). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00b1b5b844cd42d7bae6b4b62f7d6300d852a0aadd335fbfc111fdf3e7552a0"}},{"ruleId":"D2","level":"warning","message":{"text":"SubquadraticSparseAttention::forward_flash_inner (cognitive 146): SubquadraticSparseAttention::forward_flash_inner has cognitive complexity 146 (threshold 15). Drivers by points: if/else 26 (72 pts), loops 20 (67 pts), match/switch 1 (5 pts), boolean chains 2 (nesting depth added 97). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0449c7f1c318a46dcd4d006e81e2216a47f365551360e44a48f0d879abfb94"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::embed::main (cognitive 137): ruvector_hailo_cluster::bin::embed::main has cognitive complexity 137 (threshold 15). Drivers by points: if/else 44 (88 pts), loops 10 (29 pts), match/switch 9 (17 pts), boolean chains 3 (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"471c1c9e6e910ff7994c8310f1b25c4a182294281a22d2c4b649fc7e0488078b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::compute_aggregate (cognitive 129): ruvector_postgres::graph::sparql::executor::compute_aggregate has cognitive complexity 129 (threshold 15). Drivers by points: if/else 31 (106 pts), loops 7 (14 pts), match/switch 3 (9 pts) (nesting depth added 88). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"f128645d5662cf2f81e144100d1a8e83eccefa3b1b9cd029aca43f296358363c"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::run_enhanced_training_cycle (cognitive 128): mcp_brain_server::routes::run_enhanced_training_cycle has cognitive complexity 128 (threshold 15). Drivers by points: if/else 56 (80 pts), loops 14 (29 pts), boolean chains 13, match/switch 2 (6 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c80c59af1731cf3ab858bc68b9bb280cabdf509544b44dc6ed0f69c00019b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::search_memories (cognitive 114): mcp_brain_server::routes::search_memories has cognitive complexity 114 (threshold 15). Drivers by points: if/else 47 (81 pts), loops 12 (26 pts), boolean chains 7 (nesting depth added 48). Of this number, 104 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc05febceb529e0b171b60b116bb4ae0550b20f7a941609e5a949074ae65ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::backward (cognitive 108): Tensor::backward has cognitive complexity 108 (threshold 15). Drivers by points: if/else 26 (81 pts), loops 5 (17 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41ea9e488db3996bf97a78921c9311fe53e522503e359cb7c5b5d96a8f87837"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::backward (cognitive 108): Tensor::backward has cognitive complexity 108 (threshold 15). Drivers by points: if/else 26 (81 pts), loops 5 (17 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/backprop.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f288a51abb51568c07ffb1db61ff906e635a7cc52285f72efe2e0d3aa69788"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::cypher::executor::match_pattern (cognitive 106): ruvector_postgres::graph::cypher::executor::match_pattern has cognitive complexity 106 (threshold 15). Drivers by points: if/else 27 (91 pts), loops 4 (7 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/executor.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fff46e3f4897f8351f12d2fa6d67cba7f42a3d8fb6219e469229ea9c1859eb6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_avx2::conv2d_int8_avx2 (cognitive 105): ruvector_cnn::kernels::int8_avx2::conv2d_int8_avx2 has cognitive complexity 105 (threshold 15). Drivers by points: loops 20 (91 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 81). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbf5ee52ef8f70e6b753a2800701738264db8a290f22241384fbeeb9d387bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_neon::conv2d_int8_neon (cognitive 105): ruvector_cnn::kernels::int8_neon::conv2d_int8_neon has cognitive complexity 105 (threshold 15). Drivers by points: loops 20 (91 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 81). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_neon.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d510eedb97a84f166fc4d57e7c7c3de4411c24f218f130c84b0146e95d5e82"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_wasm::conv2d_int8_wasm (cognitive 105): ruvector_cnn::kernels::int8_wasm::conv2d_int8_wasm has cognitive complexity 105 (threshold 15). Drivers by points: loops 20 (91 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 81). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_wasm.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d337fae28bf9226130c479ca4899f0ce6e54094e765d3a8d91d6fd7d73739e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"SubquadraticSparseAttention::forward (cognitive 102): SubquadraticSparseAttention::forward has cognitive complexity 102 (threshold 15). Drivers by points: loops 19 (60 pts), if/else 18 (42 pts) (nesting depth added 65). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SubquadraticSparseAttention::forward_gqa) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e52416c45dd06ad96851c96e91b37b20e3091d21490b8efa200b4cc9f1d9e59"}},{"ruleId":"D2","level":"warning","message":{"text":"SubquadraticSparseAttention::forward_gqa (cognitive 102): SubquadraticSparseAttention::forward_gqa has cognitive complexity 102 (threshold 15). Drivers by points: loops 19 (60 pts), if/else 18 (42 pts) (nesting depth added 65). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (SubquadraticSparseAttention::forward) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a91a1abad7ec9957a59b5a6fb755751f21196eaa7a037d7c99273cbb3ba5f6"}},{"ruleId":"D2","level":"warning","message":{"text":"DevelopmentalProgram::grow_step (cognitive 98): DevelopmentalProgram::grow_step has cognitive complexity 98 (threshold 15). Drivers by points: if/else 16 (68 pts), loops 5 (15 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/self_organizing.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e743b0ce011b656620b9fd35a846484f5790e80efc116fb0537a6cbc3311ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::bench::main (cognitive 98): ruvector_hailo_cluster::bin::bench::main has cognitive complexity 98 (threshold 15). Drivers by points: if/else 36 (60 pts), match/switch 10 (23 pts), loops 6 (13 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6166adeb56fdfbd737b0fa9ddefe0e2171f2c7415a0fa7dbbb651e8ff98ff416"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_node::cypher_exec::exec_pattern (cognitive 96): ruvector_graph_node::cypher_exec::exec_pattern has cognitive complexity 96 (threshold 15). Drivers by points: if/else 21 (81 pts), match/switch 4 (8 pts), loops 3 (7 pts) (nesting depth added 68). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaa77b0dc9d9cc7a4e8e2b1697446154e77d7ff759e6c33e54a83e99f15c6bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_py::graph::cypher_exec::exec_pattern (cognitive 96): ruvector_py::graph::cypher_exec::exec_pattern has cognitive complexity 96 (threshold 15). Drivers by points: if/else 21 (81 pts), match/switch 4 (8 pts), loops 3 (7 pts) (nesting depth added 68). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph/cypher_exec.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d4279728f6e92d4e1b608c445f5d295f888471ca9a2bb064dc43d499bffd58"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::avx2::depthwise_conv_3x3_avx2 (cognitive 91): ruvector_cnn::simd::avx2::depthwise_conv_3x3_avx2 has cognitive complexity 91 (threshold 15). Drivers by points: loops 12 (48 pts), if/else 7 (36 pts), boolean chains 7 (nesting depth added 65). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"53179da45c87c3051da9003d59ac4d0005967ca09d87538901170848dffe48b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_temporal_tensor::quantizer::quantize_and_pack_f32 (cognitive 84): ruvector_temporal_tensor::quantizer::quantize_and_pack_f32 has cognitive complexity 84 (threshold 15). Drivers by points: if/else 29 (60 pts), loops 9 (23 pts), boolean chains 1 (nesting depth added 45). Of this number, 80 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb0d6d01ba823327de5a7208e5ee37ab6b439c8cbd9873d6e89c4adf47e4f66"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaCactus::build_from_compact_graph (cognitive 79): ArenaCactus::build_from_compact_graph has cognitive complexity 79 (threshold 15). Drivers by points: if/else 26 (54 pts), loops 10 (13 pts), boolean chains 12 (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":"crates/cognitum-gate-kernel/src/canonical_witness.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f387fbaddadb2694bdf11871d8259bfa1d63e929804a2717b9cac59d5d3c4cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::avx2::conv_3x3_avx2_fma (cognitive 78): ruvector_cnn::simd::avx2::conv_3x3_avx2_fma has cognitive complexity 78 (threshold 15). Drivers by points: loops 13 (64 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 61). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ruvector_cnn::simd::avx2::conv_3x3_avx2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a30251436cf5071e5d97cfc4c878a9c6d24e8c5e0ea0684ba4360afd81b8263"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::avx2::conv_3x3_avx2 (cognitive 78): ruvector_cnn::simd::avx2::conv_3x3_avx2 has cognitive complexity 78 (threshold 15). Drivers by points: loops 13 (64 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 61). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ruvector_cnn::simd::avx2::conv_3x3_avx2_fma) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd4bdc6343031330641046459f7620e6e099ece44e87fa79d6588a096e7d5f6"}},{"ruleId":"D2","level":"warning","message":{"text":"BrainTrainer::discover_space (cognitive 74): BrainTrainer::discover_space has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (50 pts), loops 5 (18 pts), match/switch 4, boolean chains 2 (nesting depth added 49). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d40fed5ed32af55553a704a360c20a09d6883699db037a407e373c76c55264"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_avx2::depthwise_conv2d_int8_avx2 (cognitive 73): ruvector_cnn::kernels::int8_avx2::depthwise_conv2d_int8_avx2 has cognitive complexity 73 (threshold 15). Drivers by points: loops 15 (59 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 54). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad3928237aef3f6c78b044766a94f1ca40d1b04197869bdf447141cf5773b66"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::stats::main (cognitive 73): ruvector_hailo_cluster::bin::stats::main has cognitive complexity 73 (threshold 15). Drivers by points: if/else 24 (38 pts), loops 7 (13 pts), match/switch 8 (13 pts), boolean chains 9 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/stats.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d1eec2a86511765d937af2516b0547866c123cb31c0bf81011ff75e5edad4a"}},{"ruleId":"D2","level":"warning","message":{"text":"NeuralSymbolicBridge::run_inference (cognitive 72): NeuralSymbolicBridge::run_inference has cognitive complexity 72 (threshold 15). Drivers by points: if/else 11 (40 pts), match/switch 6 (22 pts), loops 5 (8 pts), boolean chains 2 (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":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"57abfc6e1e81b55defd25d31c41ab06842ea5e7ae16ec2937e10efd8b9e5953c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::wasm::conv_3x3_wasm (cognitive 72): ruvector_cnn::simd::wasm::conv_3x3_wasm has cognitive complexity 72 (threshold 15). Drivers by points: loops 11 (49 pts), if/else 3 (21 pts), boolean chains 2 (nesting depth added 56). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/wasm.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"602a231d0a31941149cc48d2635c542b6c080ce2a433f5ba461b7fd828e31e22"}},{"ruleId":"D2","level":"warning","message":{"text":"CrvSessionManager::find_convergence (cognitive 71): CrvSessionManager::find_convergence has cognitive complexity 71 (threshold 15). Drivers by points: if/else 11 (41 pts), loops 9 (28 pts), boolean chains 2 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/session.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d11633296abba7e9835b26285bf31702056ec43b0a85107e5a7553013080b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::monitor::run_monitor_loop (cognitive 71): ruvix_cli::commands::monitor::run_monitor_loop has cognitive complexity 71 (threshold 15). Drivers by points: if/else 20 (59 pts), match/switch 2 (7 pts), loops 2 (5 pts) (nesting depth added 47). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/monitor.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6402617a8e434b0cd77946d55c7f29924a64d08957cddf7664b14594190a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::utils::make_qx_quants (cognitive 70): candle_core::quantized::utils::make_qx_quants has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (47 pts), loops 12 (20 pts), boolean chains 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/utils.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6883bcbd53109b07ba48f67a70a8e2a6a3093706c31a43b0e577d2a72426280"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::search_filtered (cognitive 69): HnswGraph::search_filtered has cognitive complexity 69 (threshold 15). Drivers by points: if/else 21 (54 pts), loops 6 (11 pts), match/switch 2 (4 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":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3507a3f48b75e9b24ade699422f2c747a94c2dc531d853575b892dd138a1ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::ruview-csi-bridge::main (cognitive 68): ruvector_hailo_cluster::bin::ruview-csi-bridge::main has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (46 pts), match/switch 5 (14 pts), boolean chains 6, loops 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a27279ad2cbfcf3ba88f86644a810e97d6198f0b053e807fec7d61e88e8aa89"}},{"ruleId":"D2","level":"warning","message":{"text":"FirestoreClient::firestore_list_checked (cognitive 67): FirestoreClient::firestore_list_checked has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (52 pts), match/switch 4 (10 pts), loops 2 (4 pts), boolean chains 1 (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":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac0198ee576c4d75fe5b3af823d1066b9ea7de907726a66bec048716b91f7c0"}},{"ruleId":"D2","level":"warning","message":{"text":"micro_hnsw_wasm::search (cognitive 66): micro_hnsw_wasm::search has cognitive complexity 66 (threshold 15). Drivers by points: if/else 10 (44 pts), loops 6 (17 pts), boolean chains 5 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1babb33afdde78eefb7c0fcdd7a350892e15b1bb298b893243634a58550875b5"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::utils::make_qx_quants (cognitive 66): candle_core::quantized::utils::make_qx_quants has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (43 pts), loops 12 (20 pts), boolean chains 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/utils.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f01c4d7b0e71afef79db7788d092da2b8e344d4144eec88a72170ccd005e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentGraph::run (cognitive 65): AgentGraph::run has cognitive complexity 65 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 5 (20 pts), loops 6 (18 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":"crates/rvAgent/rvagent-core/src/graph.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f199857ed9e45e93120a4009d0eeec29ce2f4c92f09cf14d5fb3d6cad0a0e550"}},{"ruleId":"D2","level":"warning","message":{"text":"MobileNetV3Large::process_inverted_residual (cognitive 64): MobileNetV3Large::process_inverted_residual has cognitive complexity 64 (threshold 15). Drivers by points: loops 20 (52 pts), if/else 5 (10 pts), boolean chains 2 (nesting depth added 37). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/mobilenet.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8090072be016fe85fd43505110e0217d979414c5fd7064eae8e1fe14d7a36b61"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::transformer::mha (cognitive 64): ruvector_decompiler::transformer::mha has cognitive complexity 64 (threshold 15). Drivers by points: loops 16 (40 pts), if/else 8 (24 pts) (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/transformer.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"68260782962d6427aa54df6588d6eab9bca4613cfab723a80f3b8667bd799961"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::backends::lattice_backend::adapter::validate_tensors (cognitive 64): ruvllm::backends::lattice_backend::adapter::validate_tensors has cognitive complexity 64 (threshold 15). Drivers by points: if/else 28 (50 pts), boolean chains 5, loops 4 (5 pts), 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":"crates/ruvllm/src/backends/lattice_backend/adapter.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce626f239ab8777ee8976ed47a14c77aa6dd3368696f7f70225609197f9eeae9"}},{"ruleId":"D2","level":"warning","message":{"text":"SubquadraticSparseAttention::forward_gated (cognitive 64): SubquadraticSparseAttention::forward_gated has cognitive complexity 64 (threshold 15). Drivers by points: loops 9 (33 pts), if/else 14 (29 pts), boolean chains 2 (nesting depth added 39). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"25989f918ac3bd66a11262b46eb0055f70c00ccb81ef0c6305f1a6abade8cad0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::neon::conv_3x3_neon (cognitive 63): ruvector_cnn::simd::neon::conv_3x3_neon has cognitive complexity 63 (threshold 15). Drivers by points: loops 11 (49 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 48). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8364291bb042ba6050c09eee04faa6e976522a6165e6312de02ca68fe64eefd1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::winograd::conv_3x3_winograd (cognitive 62): ruvector_cnn::simd::winograd::conv_3x3_winograd has cognitive complexity 62 (threshold 15). Drivers by points: loops 11 (42 pts), if/else 3 (18 pts), boolean chains 2 (nesting depth added 46). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/winograd.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"428c48cb005762cc9a400659ffa4de04f6647e7d780e684982d64491243d61af"}},{"ruleId":"D2","level":"warning","message":{"text":"FlashAttention3::forward (cognitive 61): FlashAttention3::forward has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 8 (27 pts), boolean chains 3 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/flash.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b297eb12c9bc9075681fcb95ac5aff480f9db8d70dbe0a5b104dffc34e053642"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_neon::depthwise_conv2d_int8_neon (cognitive 59): ruvector_cnn::kernels::int8_neon::depthwise_conv2d_int8_neon has cognitive complexity 59 (threshold 15). Drivers by points: loops 13 (45 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 42). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_neon.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e0e35bd54f5b203d020019a82cca71160c77c993a154a32fb367ddbba6903a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::parser::scan_body_single_pass (cognitive 59): ruvector_decompiler::parser::scan_body_single_pass has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 6 (18 pts), boolean chains 5 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/parser.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2692da8813547f3b1192c44a269203944a9559efd18ede62af7880a4ed535a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::backends::lattice_backend::spawn_worker (cognitive 59): ruvllm::backends::lattice_backend::spawn_worker has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (40 pts), match/switch 6 (14 pts), loops 2 (4 pts), boolean chains 1 (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":"crates/ruvllm/src/backends/lattice_backend.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea989344f2bd281498c0c0c7008c67d694e8ee278b1a38952c75d76e486392d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductQuantizer::train (cognitive 58): ProductQuantizer::train has cognitive complexity 58 (threshold 15). Drivers by points: loops 12 (36 pts), if/else 7 (21 pts), boolean chains 1 (nesting depth added 38). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/pq.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"972507f4805b4a83e32546e50d607fa034e5b73171ad0d1e475cfc368be332f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ruos_thermal::main (cognitive 57): ruos_thermal::main has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 9 (17 pts), match/switch 6 (14 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruos-thermal/src/main.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef0ba905166d6a5b043185f5f35943d556e99976ff642f196188da3492bc8c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_e_means::trainer::fit (cognitive 57): ruvector_e_means::trainer::fit has cognitive complexity 57 (threshold 15). Drivers by points: loops 12 (36 pts), if/else 10 (20 pts), boolean chains 1 (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":"crates/ruvector-e-means/src/trainer.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5d38b9dd7513bcd805bc62a2631d4225b07448c51d425b5cf48348e2ecc9fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_cli::cmd::verify_witness::run (cognitive 57): rvf_cli::cmd::verify_witness::run has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (31 pts), loops 5 (13 pts), match/switch 4 (8 pts), boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_witness.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"22218a6c0eb87704c6254fda5a5e77a8f5febfdbe832237321b19074e9f886f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::tree::agglomerative_cluster (cognitive 56): ruvector_decompiler::tree::agglomerative_cluster has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 7 (15 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/tree.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad4ac50e586a682335723a00c1d82b069f510789d1f4f90e26322561de70ced"}},{"ruleId":"D2","level":"warning","message":{"text":"EntropyScaledEf::search (cognitive 56): EntropyScaledEf::search has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 4 (7 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c241a195af74372bd106e543fd335ac279149d126b80e590b2b700c84ff3ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"CactusGraph::detect_cycles (cognitive 56): CactusGraph::detect_cycles has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (40 pts), loops 5 (15 pts), boolean chains 1 (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":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfff521fb10a53e96ffd7f8706b014cc3af258ea9711a274ffe2e453ee9d38f2"}},{"ruleId":"D2","level":"warning","message":{"text":"RoadRouter::route (cognitive 56): RoadRouter::route has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (46 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/routing/mod.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd111b9fa5b4526c90f7aec2fe97b08a6455467b4e90aa24face9b6d14928e7f"}},{"ruleId":"D2","level":"warning","message":{"text":"sonic_ct::organ::detect_organs (cognitive 56): sonic_ct::organ::detect_organs has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (44 pts), loops 4 (10 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":"crates/sonic-ct/src/organ.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"14df853473b22ba4ec263206337b0b785bc55d6baaf4cc20c45acc626135b4c2"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorFormatter::fmt_tensor (cognitive 56): TensorFormatter::fmt_tensor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 6 (18 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b789cc779d1c6d292910d4c2731e06624699e930e71d6ed18481e3867d9637f"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorFormatter::fmt_tensor (cognitive 56): TensorFormatter::fmt_tensor has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 6 (18 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/display.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66afc42cfcbf9ebbd12c7214b3c244fa565910ee7ff985246a01d5c50da0679"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphCoarsener::aggregate_features (cognitive 55): GraphCoarsener::aggregate_features has cognitive complexity 55 (threshold 15). Drivers by points: loops 9 (31 pts), if/else 8 (22 pts), match/switch 1 (2 pts) (nesting depth added 37). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/self_organizing.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"621484ef326800ba9bb2a6f09ff5b6ff67a30d50e96147b5e9a5bdbb737b6304"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::build_ingest_metadata (cognitive 55): RvfStore::build_ingest_metadata has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 5 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"8998a023ac53a5ce2b76421bec0871aa9d83580d1944ab508e2a50689b2cdc5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::search_layer (cognitive 55): Hnsw::search_layer has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (51 pts), loops 2 (3 pts), boolean chains 1 (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":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d7f33061265e573e793da533d47dfe5e462f02160a24f510a5b804cbca3b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"CactusGraph::build_cactus_from_cuts (cognitive 54): CactusGraph::build_cactus_from_cuts has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 12 (24 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb48ea4aad6f94163d806c5f18d022d3c079709dbe56063d320523df2355901"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::search_layer (cognitive 54): Hnsw::search_layer has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (50 pts), loops 2 (3 pts), boolean chains 1 (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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c56bdd64de457c5c015b086e401da9e7df3a597afd40f2678467dbbd8be8df"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_transitive_path (cognitive 53): ruvector_postgres::graph::sparql::executor::evaluate_transitive_path has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (46 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdd96bc67f6a4cf07a95a5d5c01b5e4c329361aeb1a929d9d2f6555e65b3342"}},{"ruleId":"D2","level":"warning","message":{"text":"BitNetBackend::forward_mla_cached (cognitive 53): BitNetBackend::forward_mla_cached has cognitive complexity 53 (threshold 15). Drivers by points: loops 14 (40 pts), if/else 6 (13 pts) (nesting depth added 33). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ce98efbeb3f57d21dfca2e1ee728b1d37832449db90f7429edcac93db27fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSchemaValidator::validate_against_schema (cognitive 53): JsonSchemaValidator::validate_against_schema has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 4 (13 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/validators.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7845b13256c74766db17776bba5cb7a97a0698192c5aca32e3c04c22909603"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::handle_mcp_tool_call (cognitive 52): mcp_brain_server::routes::handle_mcp_tool_call has cognitive complexity 52 (threshold 15). Drivers by points: if/else 24 (43 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6115}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba9495e0d5591db56ef7b576faa2bf06478564cf00b16c7a4a6f04ad13b6be3"}},{"ruleId":"D2","level":"warning","message":{"text":"GeoMipPhiEngine::compute_phi (cognitive 52): GeoMipPhiEngine::compute_phi has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/geomip.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecf8bd18b440019cd17b803457ac46dfb928f7d56502ef19b0d1c50f6c1ba61"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::project (cognitive 52): ruvector_graph_wasm::cypher_exec::project has cognitive complexity 52 (threshold 15). Drivers by points: loops 9 (20 pts), match/switch 6 (17 pts), if/else 8 (15 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1883577814f9d98f3b8a3f01520d06da60a28845e648f4e128272f106aaf264f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm_retrieval_diffusion::sample_logits (cognitive 52): ruvllm_retrieval_diffusion::sample_logits has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 8 (16 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_retrieval_diffusion/src/lib.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"de94489b410e5f8956ec6a1711a23906f155d49bc71ab6c98751758b059fb88c"}},{"ruleId":"D2","level":"warning","message":{"text":"UnicodeSecurityMiddleware::before_agent (cognitive 52): UnicodeSecurityMiddleware::before_agent has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 3 (9 pts), match/switch 1 (2 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/unicode_security_middleware.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"71980382d7c3be1076dc09b74e4ea33c739c7f49edf95b2ff3783fe368efd474"}},{"ruleId":"D2","level":"warning","message":{"text":"rvlite::sparql::executor::match_triple_pattern (cognitive 52): rvlite::sparql::executor::match_triple_pattern has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (50 pts), loops 1 (2 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8640cc1afa2b16f3307ffedf87a541c1c374b42bda388b8b2332329e4214807"}},{"ruleId":"D2","level":"warning","message":{"text":"resume_release.validate_archive (cognitive 52): resume_release.validate_archive has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (43 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/portfolio/resume_release.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"745b67155491ba4c5a87acea4655ba4497a1c5193ab83c517018caebe30a1a43"}},{"ruleId":"D2","level":"warning","message":{"text":"SheafSubgraph::from_graph (cognitive 51): SheafSubgraph::from_graph has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (39 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1c2b013a999023440af66ee42eb3cd39bd4e8ad0d762793ee3843216f6d80f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::partitioner::louvain_partition (cognitive 51): ruvector_decompiler::partitioner::louvain_partition has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 9 (13 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/partitioner.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c0b8ead3a7729e64d8c5581ef6799de83b1f8a4bc84cc30772ee5eb6a6cf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"PayloadIndex::remove (cognitive 51): PayloadIndex::remove has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-filter/src/index.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a1bcbca56a43eb5a61f234ad72dfb520c89dd699fb9bd9152341855f992f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProblemDetector::detect_problems (cognitive 51): ProblemDetector::detect_problems has cognitive complexity 51 (threshold 15). Drivers by points: if/else 34 (48 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/detector.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fadd1173b7a072f09182e8c901cbc06a0df0d2fc0c28bf92673409a915cbe67"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::match_relationship_pattern (cognitive 51): Executor::match_relationship_pattern has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (42 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/executor.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b059b27ff9e0641e3be1acd2c3a2615972b20dffd9e8229c8917b449d0f89cc"}},{"ruleId":"D2","level":"warning","message":{"text":"HierarchicalPhiEngine::compute_phi (cognitive 50): HierarchicalPhiEngine::compute_phi has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (36 pts), loops 4 (12 pts), boolean chains 2 (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":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadfb047a490ab179a8c15041468cb3f79ddf9ded979d06e502cde512065f78e"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_cli::cmd::verify_attestation::run (cognitive 50): rvf_cli::cmd::verify_attestation::run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 2 (7 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_attestation.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae72db1bf2497d3d4a7e474c599e54375f43cd6176c57d77c15d9f24fbe7784"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cpu_backend::conv2d::conv2d_tiled (cognitive 50): candle_core::cpu_backend::conv2d::conv2d_tiled has cognitive complexity 50 (threshold 15). Drivers by points: loops 14 (37 pts), if/else 4 (11 pts), boolean chains 2 (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":"patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b025b35bf8628caf588e27b0fcb0d62603b898441d1b26d79c3c2291967a3c99"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaptiveRadixTree::insert_recursive (cognitive 49): AdaptiveRadixTree::insert_recursive has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 3 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/adaptive_radix.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"62182bd7d1da3ad2596cddd6ff0d8e66259058eb7d02edb5c2ebaf2f10054914"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::hnsw_am::hnsw_search (cognitive 49): ruvector_postgres::index::hnsw_am::hnsw_search has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 6 (15 pts), boolean chains 1 (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":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"d888a64787bd0688ef0936964ebb361451abe10c9dfbaabd556834c2f092d2e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::queue::build (cognitive 49): ruvector_weaver::queue::build has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 9 (10 pts), match/switch 4 (9 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":"crates/ruvector-weaver/src/queue.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce369d887bc0fa763add761da6d0c26d41c53f14345cf31e75720667ddded4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_qemu_swarm::monitor::run_simple (cognitive 49): ruvix_qemu_swarm::monitor::run_simple has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 4 (7 pts), match/switch 1 (5 pts), boolean chains 3 (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":"crates/ruvix/qemu-swarm/src/monitor.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5424996a7239097d0128b26e8936fbe6b0174e5593e65dcb1ef0c3c7ad81206"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_release.validate (cognitive 49): validate_release.validate has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 12, loops 4 (6 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":"python/portfolio/validate_release.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aab080e815e8a98019cfe7ed6cba3b1ab6794408efb7291e2906a68bd33b5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"splitMegaStatement (cognitive 49): splitMegaStatement has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 9, ternaries 3 (7 pts), 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":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e78e7293bd82084fa7b8ec083fef83acc3bc6d20fee43064bf9f6c87313fca8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::neon::depthwise_conv_3x3_neon (cognitive 48): ruvector_cnn::simd::neon::depthwise_conv_3x3_neon has cognitive complexity 48 (threshold 15). Drivers by points: loops 9 (34 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 35). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa11b3117f6f5990c90c0a6111a4bd97e4d27b523febd83991de2f20c2b7efb4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::wasm::depthwise_conv_3x3_wasm (cognitive 48): ruvector_cnn::simd::wasm::depthwise_conv_3x3_wasm has cognitive complexity 48 (threshold 15). Drivers by points: loops 9 (34 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 35). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/wasm.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daa1eb3f3bfb0263926db48b4d1fc3738086d44333abc948e4d89b1c84a7a0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_condense::cutloss::cut_and_ortho (cognitive 48): ruvector_graph_condense::cutloss::cut_and_ortho has cognitive complexity 48 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 13 (22 pts), boolean chains 1 (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/cutloss.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"803f0813991664b866487ab28ce3445737903453903244394e033e15904145de"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorTrain::add (cognitive 48): TensorTrain::add has cognitive complexity 48 (threshold 15). Drivers by points: loops 10 (37 pts), if/else 7 (11 pts) (nesting depth added 31). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/tensor_train.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e1c38b7cde1fb7a61b17270688e185d1fce89d93d96461e26d512fc1308e16"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreeLevelHierarchy::certify_mirror_cuts (cognitive 48): ThreeLevelHierarchy::certify_mirror_cuts has cognitive complexity 48 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 7 (18 pts), match/switch 2 (6 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7faef59e75da4073027a152cbee15ca864df7a8df1cc614f336ffd12e4bd87"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_sota_bench::bin::sota_all::main (cognitive 48): ruvector_sota_bench::bin::sota_all::main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 6 (14 pts), match/switch 3 (10 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sota_all.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f373173760a6c237b37ced95184ae364de3bd691e10a347dbaa98dbe4311ea"}},{"ruleId":"D2","level":"warning","message":{"text":"FactorSet::from_data (cognitive 48): FactorSet::from_data has cognitive complexity 48 (threshold 15). Drivers by points: loops 13 (36 pts), if/else 5 (12 pts) (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":"crates/ruvector-temporal-tensor/src/delta.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"079b8db3943488eda9e7a0dfd3250812908fa1c06eca8857ce466c133ed2af45"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsoleIO::register_node (cognitive 48): ConsoleIO::register_node has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (37 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/console.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d97ba55a1251d73294c8fccf6f7f4eebf262b1b774c9dba4dbd7b8f1618c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"parseTopLevelStatements (cognitive 48): parseTopLevelStatements has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 8, ternaries 3 (8 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":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bff130e7592352fb496d241685a7a11831931e5227f1313b0f7aa456b58dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::pipeline_optimize (cognitive 47): mcp_brain_server::routes::pipeline_optimize has cognitive complexity 47 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 6 (15 pts), match/switch 4 (10 pts) (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":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":4045}}}],"partialFingerprints":{"codehealthFindingId/v1":"556693c7ff6724350cf825f77c192359d50fee2bc244890383d4ed6c7910fb98"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::mmwave-bridge::main (cognitive 47): ruvector_hailo_cluster::bin::mmwave-bridge::main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6fcd40780ea96ab89cca864e7d00d77324c3b8d9349cc1f31dd551012f82e9"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamIngest::query_with (cognitive 47): StreamIngest::query_with has cognitive complexity 47 (threshold 15). Drivers by points: if/else 32 (37 pts), boolean chains 8, match/switch 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/ingest/query.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c5fd8b1c7bc86a5c34e9e299febc8dd1da3d73866e028835aff90ecb65d2b8"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::qr_encode::evaluate_penalty (cognitive 47): rvf_runtime::qr_encode::evaluate_penalty has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 10 (15 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_encode.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a4409f2df329ced2011ad66fda4ce1fc784ce5f352ed647a12da9c37857d79"}},{"ruleId":"D2","level":"warning","message":{"text":"MinCutBridge::find_min_cut (cognitive 47): MinCutBridge::find_min_cut has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 4 (9 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":"crates/rvm/crates/rvm-coherence/src/mincut.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5fbd6ca4d91dd61626e004dd71682c8ec576f8b2c47a051711cd41b674d091"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmark (cognitive 47): benchmark has cognitive complexity 47 (threshold 15). Drivers by points: loops 35 (43 pts), if/else 4 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e79434800a09832b1057135f732fec1a2d8996880e13046d09de8f807d5d744"}},{"ruleId":"D2","level":"warning","message":{"text":"MinCutRetriever::retrieve (cognitive 46): MinCutRetriever::retrieve has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 11 (18 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bounded-rag/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dc4ee39ebaf8aae8b115bc63ae9cfb558c69eff98381fb1dd3a78d36d401af"}},{"ruleId":"D2","level":"warning","message":{"text":"MinCutGatedAttention::compute_min_cut (cognitive 46): MinCutGatedAttention::compute_min_cut has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 11 (19 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/attention/mincut_gated.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58522675ce279e0c80084809f06614ed92037cb140c60d9c3acb0b91f343a49"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hnsw_repair::strategy::repair_one (cognitive 46): ruvector_hnsw_repair::strategy::repair_one has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 3 (7 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":"crates/ruvector-hnsw-repair/src/strategy.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba7863a53d6cf85b4d225924dbe657eb6b124f7c6abba336a401219c487062c"}},{"ruleId":"D2","level":"warning","message":{"text":"DeterministicLocalKCut::color_coded_dfs (cognitive 46): DeterministicLocalKCut::color_coded_dfs has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (42 pts), loops 2 (4 pts) (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":"crates/ruvector-mincut/src/localkcut/deterministic.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddafe6b797b117fa6c5c3b575916744f659c6044317251c872b2e9755efef234"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_graph_pattern_inner (cognitive 46): SparqlParser::parse_graph_pattern_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 2, boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7f6506e02f41227ffdc91f36e3173183b05c6844e2ce79958912957b2b6f83"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_graph_pattern_inner (cognitive 46): SparqlParser::parse_graph_pattern_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 2, boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"246696b6cb2eb18015e87854703df4eb36224f091e673cd7f86c249447f918b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_relationship_pattern (cognitive 45): Parser::parse_relationship_pattern has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (41 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"212c5c3a5562c764165accc86396ad199926d4bdbfb5928c2e43fee3f9378ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswRouter::consolidate_patterns (cognitive 45): HnswRouter::consolidate_patterns has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (40 pts), loops 2 (4 pts), boolean chains 1 (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":"crates/ruvllm/src/claude_flow/hnsw_router.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"5799570d53cdb6d7a1266bb7f32516c6c1b28b2f76dd3bfde4ab29e81d94e2e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_relationship_pattern (cognitive 45): Parser::parse_relationship_pattern has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (41 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1616caf2b4757530a7f5d2e253845670728f8d9f0ab51de12c751502a71480df"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ3K::from_float (cognitive 45): BlockQ3K::from_float has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 9 (21 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"4516878c7d72130e363d98f80c41d358362fd591a764959c1f66151b516621c2"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ3K::from_float (cognitive 45): BlockQ3K::from_float has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 9 (21 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea3db4fd4d3c7940c91c943ef4f3b4763680fcae351ce40c09061d5752ddecc"}},{"ruleId":"D2","level":"warning","message":{"text":"RingAttention::ring_forward (cognitive 44): RingAttention::ring_forward has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 5 (13 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/flash.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8548748920f63498fbbc8eccacb6a7b304b37304484de4d7e16103664fa57f39"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaAwareTraversal::neighbors (cognitive 44): DeltaAwareTraversal::neighbors has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (34 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-graph/src/traversal.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3907d45f6845ea9238ecae04c2bea8cecdf3bcb48cd47a2ff610d35af7df161e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_graph_pattern (cognitive 44): ruvector_postgres::graph::sparql::executor::evaluate_graph_pattern has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 5 (15 pts), match/switch 2 (3 pts) (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf78d45c8f3d7be64c8fd366cf9570904bb6fd0ff8b2e5a4efca66b38e4331c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::match_simple_triple_with_var_pred (cognitive 44): ruvector_postgres::graph::sparql::executor::match_simple_triple_with_var_pred has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (43 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":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"50155d2d242c75c979a6b3e887c3065482d3ecc9128462269ed3c906ae7a22de"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::kernels::matmul::gemm_tile_12x4 (cognitive 44): ruvllm::kernels::matmul::gemm_tile_12x4 has cognitive complexity 44 (threshold 15). Drivers by points: loops 18 (44 pts) (nesting depth added 26). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6fe726e30f9092a0693a95f35ebca53dd8292c45a2ad9622a9cbed48d6e164"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::ingest::run (cognitive 44): ruvector_edge_gateway::ingest::run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 9 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/ingest.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"968cba56c62f5e870bee5aea8cd455b9c119ef513fe171895d9570b39d0d3e79"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cpu_backend::conv2d::conv2d_direct (cognitive 44): candle_core::cpu_backend::conv2d::conv2d_direct has cognitive complexity 44 (threshold 15). Drivers by points: loops 9 (29 pts), if/else 4 (13 pts), boolean chains 2 (nesting depth added 29). 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":"patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fde763f72f353fa7ea36c8648339321c9408e6e1186be171a202ba3aa67f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::select_neighbours (cognitive 44): Hnsw::select_neighbours has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 8 (17 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"475fdf3618f43416b0281e2222a05a1ffe3b7d96f899c51a831f03cd4d7e32bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::select_neighbours (cognitive 44): Hnsw::select_neighbours has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 8 (17 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d80f0d0ac61ca7e01b0f9a5f3226a4653e9a851d15d15bdd24ac6a7e8fc88f8"}},{"ruleId":"D2","level":"warning","message":{"text":"InhibitionStrategy::apply (cognitive 43): InhibitionStrategy::apply has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 4 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/biological.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6b892ad150f0dabaffdead20a072415da15beb47681ee396e6d2dbf0c37a94"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuousTimeODE::integrate (cognitive 43): ContinuousTimeODE::integrate has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (8 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc93845d4fe468d5a59605278b2458b3a32606b65bb689fb0fe8fcf6be912b7"}},{"ruleId":"D2","level":"warning","message":{"text":"VietorisRips::build (cognitive 43): VietorisRips::build has cognitive complexity 43 (threshold 15). Drivers by points: loops 10 (27 pts), if/else 5 (16 pts) (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/filtration.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b78cdd1fd948f2f929373f7d2c28a98ee3e2e9fa3a99c99b723dcbaafa5f8f3"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectralClustering::kmeans (cognitive 43): SpectralClustering::kmeans has cognitive complexity 43 (threshold 15). Drivers by points: loops 11 (26 pts), if/else 7 (16 pts), boolean chains 1 (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/clustering.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad78ee339c93553d35fc5f155a88cc01624b753b0f5677a632a76acdf0c5d8e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_qemu_swarm::monitor::tui_loop (cognitive 43): ruvix_qemu_swarm::monitor::tui_loop has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 5 (12 pts), match/switch 1 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/monitor.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16ab5424cca69822efedd68807f32704c808dc16df96419461f7c5318fd18a2"}},{"ruleId":"D2","level":"warning","message":{"text":"BitNetBackend::forward_ffn (cognitive 43): BitNetBackend::forward_ffn has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (13 pts), match/switch 1 (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"5654eeac319bb62a9079434fa7d07d1aa169a942ce68fbf9c6307cde328436ff"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::restore_metadata (cognitive 43): RvfStore::restore_metadata has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 6 (8 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":4371}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c7bb5c83b4ce9cb214259881559e6e48bdfb7abca39a537ecfd16c802fa503"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_server::stream::body (cognitive 43): rvf_server::stream::body has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (38 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/stream.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f39a1aa4af4ea228172678cc823053983f28950b84062df3f97a6518b32273"}},{"ruleId":"D2","level":"warning","message":{"text":"Phantom::build_slice (cognitive 43): Phantom::build_slice has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 8 (18 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/phantom.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5171cf6579768ccfc246db098b1289314a56a8da5fe8958b6e851722a4bd278"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ3K::vec_dot_unopt (cognitive 43): BlockQ3K::vec_dot_unopt has cognitive complexity 43 (threshold 15). Drivers by points: loops 9 (26 pts), if/else 9 (17 pts) (nesting depth added 25). 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d941e0dfdbdad73da25ee572935276e5cd15a020caaa6ff345746bc9996d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskAnnIndex::load_impl (cognitive 42): DiskAnnIndex::load_impl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/index.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"620ac4ee0ee141d7ae08685fc3b70c1135436ac06116d7217861245889b6a343"}},{"ruleId":"D2","level":"warning","message":{"text":"CactusGraph::stoer_wagner_all_cuts (cognitive 42): CactusGraph::stoer_wagner_all_cuts has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 10 (19 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6fb6b744b79c562329962208453a81f1648cfc36651661d72647d38c11eeda"}},{"ruleId":"D2","level":"warning","message":{"text":"MincutSparseAttention::build_sparse_positions (cognitive 42): MincutSparseAttention::build_sparse_positions has cognitive complexity 42 (threshold 15). Drivers by points: loops 7 (22 pts), if/else 7 (20 pts) (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8103aad8a625f25d7088a828dfc07b35e4030233567c0d613a310f7d3db633ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_numeric_literal (cognitive 42): SparqlParser::parse_numeric_literal has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 4 (8 pts), boolean chains 6 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a718f8c2aaefbd3ac1fbcca13bdbbb08266950c7ad9026d64d759110e067b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::hnsw_am::hnsw_rescan (cognitive 42): ruvector_postgres::index::hnsw_am::hnsw_rescan has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 6 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64e93789284b90ad18b05065827de4b2406a62c36e70343bb2ca31666383a89"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::ivfflat_am::ivfflat_amrescan (cognitive 42): ruvector_postgres::index::ivfflat_am::ivfflat_amrescan has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (37 pts), boolean chains 5 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cfa1aac2c792351c1a3ec71bee885a882e43eaa0b33e60c43a4d3f361531e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::backends::lattice_backend::adapter::configuration (cognitive 42): ruvllm::backends::lattice_backend::adapter::configuration has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 6, loops 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/lattice_backend/adapter.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"00237efd43ca1a579edccdec98ce0ee88f9af4c8d5f1f5e8e9f653b3222ad0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm_cli::commands::chat::handle_command (cognitive 42): ruvllm_cli::commands::chat::handle_command has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 4 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/chat.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1761c668755a657659dbfb80793a745bbb55ab1060819732df52e5cd8f8dd56"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_numeric_literal (cognitive 42): SparqlParser::parse_numeric_literal has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 4 (8 pts), boolean chains 6 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff955ae85c0c65de9fad18d2a7f0108df3716e876365be27ff619ee92703ed40"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ3K::vec_dot_unopt (cognitive 42): BlockQ3K::vec_dot_unopt has cognitive complexity 42 (threshold 15). Drivers by points: loops 9 (26 pts), if/else 8 (16 pts) (nesting depth added 25). 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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"4423c71cb306c91c8a0f7ab502d0ee7e301837ce3fc4a07c79003df999975a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"NeuralSymbolicBridge::extract_from_clusters (cognitive 41): NeuralSymbolicBridge::extract_from_clusters has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 5, loops 3 (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":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"867813e8cbecfaeb029a85823ac6a29e32beaf17b2a993c5dc28a090fd510e49"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::rsvd_emergence::randomized_svd (cognitive 41): ruvector_consciousness::rsvd_emergence::randomized_svd has cognitive complexity 41 (threshold 15). Drivers by points: loops 19 (39 pts), if/else 1 (2 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/rsvd_emergence.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d0511c1d47df6207e2c96abb51317cc9c11872c78ae5a5f143aa760a3190ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_chained_pattern (cognitive 41): Parser::parse_chained_pattern has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cb7a1f1ea92ece9f3296b7111d9747bd1297b96862411a11bc617ac788a2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_math::tensor_networks::contraction::contract_tensors (cognitive 41): ruvector_math::tensor_networks::contraction::contract_tensors has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 7 (14 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/contraction.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0accd801bdcb28b437c9eb27298c57a7e27fe8b510e560e7d42f26d7837f4b29"}},{"ruleId":"D2","level":"warning","message":{"text":"AdjSnapshot::global_mincut_value (cognitive 41): AdjSnapshot::global_mincut_value has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 9 (18 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2459a3773e023373c6620bff2689c1014f50fbad7be41d8bf9f88fcf98098a9d"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedInstance::search_for_cuts (cognitive 41): BoundedInstance::search_for_cuts has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 6 (14 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/instance/bounded.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bb4c29540adaf8c448b28ac1902348a57c8b617076040ea7dc8ee81d9d6641"}},{"ruleId":"D2","level":"warning","message":{"text":"DeterministicLocalKCut::deterministic_bfs (cognitive 41): DeterministicLocalKCut::deterministic_bfs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 4 (7 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/localkcut/paper_impl.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4110dc5a5dd686c10856c2a4b73c45898418a623f5e071aba5dc11f70a6eac3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::execute_update (cognitive 41): ruvector_postgres::graph::sparql::executor::execute_update has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 6 (18 pts), match/switch 3 (4 pts) (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc40d3ae7edeb80c137656d337a4d295593b83b87874bf86291f8977b44705c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_solver::bmssp::build_aggregates (cognitive 41): ruvector_solver::bmssp::build_aggregates has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfea53f5257337fdd29392adc9f8bf8d81ed2f70cbbd5f59e904d95b24da40a"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::query_via_index_cow (cognitive 41): RvfStore::query_via_index_cow has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 3 (7 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76e8b21fc7351a3155a3042cc7e27998dfcad4283e89923bc785c181a90898a"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::read_path::scan_blocks (cognitive 41): rvf_runtime::read_path::scan_blocks has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (35 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"209d98ed06bda1ce6faf5e0da1967254d915ca099d6b0d86f27c82c0b6f700d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_chained_pattern_unguarded (cognitive 41): Parser::parse_chained_pattern_unguarded has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64e9ede03f8318872be05e09b5a3aba4d593a3778a60302cf6d9145f8fd80b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::aggregate (cognitive 40): ruvector_graph_wasm::cypher_exec::aggregate has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 5 (12 pts), match/switch 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":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1bff56b9d4c768bbcc00fb2de11b59ac9665e6d7b24e6f42f3f6cbc424c34d"}},{"ruleId":"D2","level":"warning","message":{"text":"HybridPipeline::route_operation (cognitive 40): HybridPipeline::route_operation has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 6, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/hybrid_pipeline.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e36660d10cb2222fd95679eafc33ae60d8e022a5311cb80e36543926043ec66"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedSeed::parse_manifest (cognitive 40): ParsedSeed::parse_manifest has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_seed.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"12710b22226f09ff7955d0d30467619afa20d83fe641e14936292f71fbf00a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"RealMatrix::symmetric_eigen (cognitive 39): RealMatrix::symmetric_eigen has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 8 (15 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/real_matrix.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"637812b7646d8e9852d777e5b30c3bfdad79b760aaa9e90e7b54e8c408f92737"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedConv2d::conv_3x3_int8_scalar (cognitive 39): QuantizedConv2d::conv_3x3_int8_scalar has cognitive complexity 39 (threshold 15). Drivers by points: loops 10 (32 pts), if/else 1 (6 pts), boolean chains 1 (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":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de297cdd419b0e31e0db5a60128387decac68bbb6573c542e2d6fd97954cd22"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreeLevelHierarchy::propagate_updates (cognitive 39): ThreeLevelHierarchy::propagate_updates has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 7 (11 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":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9d530d676c0b334dd85ad535c7aba393461c47d4b8127ef54bef66d7253c58"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut_gated_transformer::spectral::lanczos_sparse (cognitive 39): ruvector_mincut_gated_transformer::spectral::lanczos_sparse has cognitive complexity 39 (threshold 15). Drivers by points: loops 10 (22 pts), if/else 9 (15 pts), boolean chains 2 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/spectral.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf8988e2d42c2dc4325ee18435352cf7be452bf146611a0c6a4d3928497ff8f"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorNameMapper::categorize (cognitive 39): TensorNameMapper::categorize has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 18 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/loader.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"63715a34cf8835fca8f582030a651e7c445ebf963b78d561e7cf855fd0e1a527"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantCompressor::compress_batch (cognitive 39): TurboQuantCompressor::compress_batch has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5d10b8e1f93e9788b7ab8e92cf681892286708eabb6ca553aa20de34cd302c"}},{"ruleId":"D2","level":"warning","message":{"text":"KvCacheF16::decode_step_f16 (cognitive 39): KvCacheF16::decode_step_f16 has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 9 (14 pts), boolean chains 1 (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a75b7a8bd138bddc104ce8cd2a1dd1a18915ff597a33c363abdaacacf9ce3cd"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::ingest_batch_internal (cognitive 39): RvfStore::ingest_batch_internal has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (28 pts), loops 4 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2126d8a58a0b1b0b1278bb3850dc0db868adb7d8e9558042f2ffd747376b4499"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::encode_metadata_generation (cognitive 39): RvfStore::encode_metadata_generation has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 6 (11 pts), boolean chains 2, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":4152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca448895915f33a1d8bc93f7675419a784bb42e297670bb50a9ef97da083386"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvTranspose2D::f (cognitive 39): ConvTranspose2D::f has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (25 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 26). 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8523aa6738c4770414d093dc1e932c3b404d415d37befc6d558195dce2445e58"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvTranspose2D::f (cognitive 39): ConvTranspose2D::f has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (25 pts), if/else 2 (12 pts), boolean chains 2 (nesting depth added 26). 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"02112fbffbdd5ff6db66aeeecde62812cfdaeb9637086cd8c2caec436a1ca78c"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::share_memory (cognitive 38): mcp_brain_server::routes::share_memory has cognitive complexity 38 (threshold 15). Drivers by points: if/else 26 (34 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a634b102eb53dfcfa1ea329cec51ecbb4050d78cc77aa5497ffd9fc48cb2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"photonlayer_bench::privacy::ridge_least_squares (cognitive 38): photonlayer_bench::privacy::ridge_least_squares has cognitive complexity 38 (threshold 15). Drivers by points: loops 16 (30 pts), if/else 3 (8 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/privacy.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d636e5af8a001f93893155c8680fc396365a7d9932eb34221283ab15663b4e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"CommunityDetection::detect_communities (cognitive 38): CommunityDetection::detect_communities has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 6 (10 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/graph_rag.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa2c1271a7204469374fdf86cf2a702be5694cbf3774308e6df80348c014285"}},{"ruleId":"D2","level":"warning","message":{"text":"Im2Col::f (cognitive 38): Im2Col::f has cognitive complexity 38 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 2 (13 pts), boolean chains 4 (nesting depth added 26). 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa62f0fb7c7e1c8964415725d9885f752bd2410e0706267a7c51233138d8f55e"}},{"ruleId":"D2","level":"warning","message":{"text":"Im2Col::f (cognitive 38): Im2Col::f has cognitive complexity 38 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 2 (13 pts), boolean chains 4 (nesting depth added 26). 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9db28bc76f2029e13dec91ef8feba51b5dba27e2e5e37c1bbf95a0c25db43ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Conv2D::f (cognitive 38): Conv2D::f has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (25 pts), if/else 2 (11 pts), boolean chains 2 (nesting depth added 25). 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb56e36679d2ad9d79977913682a290ce4f146d734cc472530824c4324d3a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ3K::from_float_imatrix (cognitive 38): BlockQ3K::from_float_imatrix has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 7 (17 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"00287173b2ffb3921cbd1952cd7ff8dc293d298550e4c7e4397cf8460ac97e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"classifyStatement (cognitive 38): classifyStatement has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (7 pts), error handling 1 (5 pts), ternaries 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":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad93d0a0c8e1b026bc73af11034aecc1cf0d4b3718af5007292eb73c0012e7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"IncoherenceIsolator::find_isolated_regions (cognitive 37): IncoherenceIsolator::find_isolated_regions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"93473f8c97d46aaabfc8997cea30caaf95ce2fa7ace052ffa7dfe27cdb3b62c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Conv2d::conv_generic (cognitive 37): Conv2d::conv_generic has cognitive complexity 37 (threshold 15). Drivers by points: loops 7 (29 pts), if/else 1 (7 pts), boolean chains 1 (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a8bed60d91fbcfd48e34a15ff5ad275fb16f58a1c63ae515c408eee342994c"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticAnalyzer::analyze_expression (cognitive 37): SemanticAnalyzer::analyze_expression has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (9 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/semantic.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"8313b578484923555ac70405573d91f8feafcdc98d106479e35d1fb67662be3f"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuousTimeODE::dormand_prince_step (cognitive 37): ContinuousTimeODE::dormand_prince_step has cognitive complexity 37 (threshold 15). Drivers by points: loops 12 (24 pts), if/else 7 (13 pts) (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"b674ce352f1a06f4c927ee1fad7131af390477bf556cbdaacb0c273fdc19eee9"}},{"ruleId":"D2","level":"warning","message":{"text":"MorphogeneticSNN::apply_growth_rules (cognitive 37): MorphogeneticSNN::apply_growth_rules has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 5 (9 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/morphogenetic.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cb1ff7f30ebe46ccba7e011695c81373a3a5a73a19cdf6d156186e9d45a4cd"}},{"ruleId":"D2","level":"warning","message":{"text":"SubpolynomialMinCut::build_level (cognitive 37): SubpolynomialMinCut::build_level has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 9 (14 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d78d13ff5b99c89c81ad9b51387129f932a537e455d1be5e375b1c4b39bd2d"}},{"ruleId":"D2","level":"warning","message":{"text":"ServingEngine::run_iteration (cognitive 37): ServingEngine::run_iteration has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"745f071f6ad22ca4b93ff33379cc99ee94e3410162b54a9e61d40565ca65db98"}},{"ruleId":"D2","level":"warning","message":{"text":"SubquadraticSparseAttention::decode_step (cognitive 37): SubquadraticSparseAttention::decode_step has cognitive complexity 37 (threshold 15). Drivers by points: loops 8 (21 pts), if/else 10 (15 pts), boolean chains 1 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f303cd88b53f06f5c7a17ef271d36ef511fd59fc1913b850a6eec3daa3e3f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::insert (cognitive 37): HnswIndex::insert has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 4 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fabe2604afc7c7e480fb407ddd8d1fb6130d039a3ef6d11152f939a64dc4f02"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgressiveIndex::search_a_plus_b (cognitive 37): ProgressiveIndex::search_a_plus_b has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/progressive.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2062e42f9783c217d4c0e386fa2bff6eab7473b54befe946df922b9c80ac937"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::query_via_filtered_index_cow (cognitive 37): RvfStore::query_via_filtered_index_cow has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 5 (6 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/filtered_query.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d5bf674296bfbe31e02ff11932f497205e6e40a00be00b85f1f391300de329"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::compact (cognitive 37): RvfStore::compact has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (25 pts), match/switch 4 (6 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43f34ca1aa42a2b5b856d5bad592b03070d7566974f855c01a4e29a738915f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::safety_net::selective_safety_net_scan (cognitive 37): rvf_runtime::safety_net::selective_safety_net_scan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 3 (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":"crates/rvf/rvf-runtime/src/safety_net.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c113674f42b61dc07470d7d341709fb8ad970ed93a3e4932d3d7f88d4b825902"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaptiveSolver::search_with_mode (cognitive 37): AdaptiveSolver::search_with_mode has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (33 pts), match/switch 1 (2 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":"crates/rvf/rvf-solver-wasm/src/engine.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"da607bd67bb2b52f06a63efa152627fc76c2f76b6c0186eeb06639ff2a355fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"ReduceIndex::fold_impl (cognitive 37): ReduceIndex::fold_impl has cognitive complexity 37 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 5 (17 pts), match/switch 1 (nesting depth added 25). 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0b45e9fc879dc1a51ab4c334ff706d29fb71cda94ae5ff2b1c0d984a0cd947"}},{"ruleId":"D2","level":"warning","message":{"text":"ReduceIndex::fold_impl (cognitive 37): ReduceIndex::fold_impl has cognitive complexity 37 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 5 (17 pts), match/switch 1 (nesting depth added 25). 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4276bed5fbcf25deb74ec3956299e6f88f84658d03c6af37426639a5928552dc"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ5K::vec_dot_unopt (cognitive 37): BlockQ5K::vec_dot_unopt has cognitive complexity 37 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 5 (11 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca006fedd01aa6f583d881cab2feeac8cfb2e70e71ffc147affb893568c806e"}},{"ruleId":"D2","level":"warning","message":{"text":"splitModules (cognitive 37): splitModules has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 7 (10 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":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcfcc1931bc7bbaa7f09aaaafc97df5263373000cfd6c8144d112d79a857b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::google_chat_handler (cognitive 36): mcp_brain_server::routes::google_chat_handler has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 5 (9 pts), loops 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aecccb345a4e04303e8376bf9f0d6372a2f1808974683e66947229a7c5f6bb"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedAvgPool2d::forward_int8 (cognitive 36): QuantizedAvgPool2d::forward_int8 has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 4 (14 pts), boolean chains 1 (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_pooling.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"25388e099440c529dfb75cdabdac680c9d0b9ce211a40bc255fe74f80de6c85d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_scalar::conv2d_int8_scalar (cognitive 36): ruvector_cnn::kernels::int8_scalar::conv2d_int8_scalar has cognitive complexity 36 (threshold 15). Drivers by points: loops 7 (28 pts), if/else 1 (7 pts), boolean chains 1 (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":"crates/ruvector-cnn/src/kernels/int8_scalar.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c72161ea8f009e8701717b7dcf1ed620dc5f48b530041602de97501addee1fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_primary (cognitive 36): Parser::parse_primary has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (8 pts), match/switch 2 (5 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"96361998f791c4d6b05c16ab331ff7159e800634799685bcae435f7555a9742e"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplacementEdgeIndex::find_components_after_cut (cognitive 36): ReplacementEdgeIndex::find_components_after_cut has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (8 pts), boolean chains 6 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/replacement.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"149816508cf3255e9ec5c19de4ba2f05bf0c3f98e0c4248a2ce172b648f2dd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::scan::scan_dir (cognitive 36): ruvector_weaver::scan::scan_dir has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 8, loops 5 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/scan/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c242b538673afbedca37f8472e3fa645efdc5c657c3624ede19fd19b8c7228d"}},{"ruleId":"D2","level":"warning","message":{"text":"AdapterMerger::merge_dare (cognitive 36): AdapterMerger::merge_dare has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 3 (15 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":"crates/ruvllm/src/lora/adapters/merge.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5458c36b2a8c4a317ed423b68678e155bbcae982f117df687c75a0f6e631545"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectiveAgent::execute_with_reflection (cognitive 36): ReflectiveAgent::execute_with_reflection has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/reflective_agent.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8af4d2e2af0ded08f223ba0767c1c3d8dd0d60415ece5e14acbbdaf75e95373"}},{"ruleId":"D2","level":"warning","message":{"text":"RealContrastiveTrainer::train (cognitive 36): RealContrastiveTrainer::train has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/real_trainer.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5136297f5182e0e22e0a2373878995f41797b2827022b840b3bb630af3e1596a"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::search_layer (cognitive 36): HnswGraph::search_layer has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"146631c725b9cf49d2971fd507e95ab392c0368f1a2082d7a8dbb0c180a18c02"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamVerifier::on_chunk (cognitive 36): StreamVerifier::on_chunk has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/verifier.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f423bd53bf0c5776c7f11824b6d2582ca6e6acabbb09abbaa8356dced49819"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ5K::from_float (cognitive 36): BlockQ5K::from_float has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 7 (15 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1d232b4e262b03a41259830f9875d9191e69ad2acfc423220d31cd9e54fd1b"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ5K::vec_dot_unopt (cognitive 36): BlockQ5K::vec_dot_unopt has cognitive complexity 36 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 4 (10 pts) (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d964724c37f04b73fbd073504b06e1ebf32f7cbc679b3ed413838fd9a66f68"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ5K::from_float (cognitive 36): BlockQ5K::from_float has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 7 (15 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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3418e0ae9d90c2abc97880ef43207f7c3bce753a457c03f1743e6df6174b05"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::utils::make_qkx3_quants (cognitive 36): candle_core::quantized::utils::make_qkx3_quants has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 5 (8 pts), match/switch 5 (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":"patches/candle-core-0.9.2/src/quantized/utils.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4080730735523a628ea3bc29513f7b64f131bf45ce1cd195f00e95422ca87f24"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIo::load_point_indexation (cognitive 36): HnswIo::load_point_indexation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (9 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61b0167accef51d8943007d55182e1702a0df8c96a59e1710e5c26c7e9f2e1e"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIo::load_point_indexation (cognitive 36): HnswIo::load_point_indexation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (9 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9eaa2703fd78392e671b6705efa4110aa5142b2022cb6a5f08a816eb0476f3"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::main (cognitive 35): mcp_brain_server::main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"680462724ffdf35940b37069e22a39c9ee120f51d32ee661222939b34e4b08f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut::canonical::source_anchored::canonical_mincut (cognitive 35): ruvector_mincut::canonical::source_anchored::canonical_mincut has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (8 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"039b9c6a79eea48809cb10ef732dec8e54f997499218488855094f20a93f2991"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_typesafe_train::train::run (cognitive 35): ruvector_typesafe_train::train::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 7 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/train/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cd498b922e61a12e2f7c1c10c377c9fa593ade4bab006fb013e969778524e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Taxonomy::parse (cognitive 35): Taxonomy::parse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 6 (9 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/taxonomy.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"99aec60d0d8eaa64c994f2459d10008d9212ca6de069c8319cbabf6339db5761"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::dtb::search_compatible_string (cognitive 35): ruvix_cli::commands::dtb::search_compatible_string has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (28 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (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":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5001c53c3151bed79966a7716947bbc795f622de4a498772e9ace7c7f583106"}},{"ruleId":"D2","level":"warning","message":{"text":"RuvltraQuantizer::quantize_tensor (cognitive 35): RuvltraQuantizer::quantize_tensor has cognitive complexity 35 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 7 (13 pts), boolean chains 5, match/switch 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/ruvltra_quant.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a46ce91bcd116fd7a7adcc6a2f5087eb18aab1c4393d6b00ea9f878ce482d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_index::progressive::beam_search_layer (cognitive 35): rvf_index::progressive::beam_search_layer has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/progressive.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacca6a506397a5398d9ce3075c6ea84f2cdbbe23ce2df49339a750052193f48"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::execute_delete (cognitive 35): Executor::execute_delete has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (27 pts), match/switch 1 (5 pts), loops 2 (3 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/executor.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"da991560daf894c9dadf08b2ab62ddb5313b52a4b7ab10a9514891f7479e1463"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cpu_backend::utils::binary_map_vec (cognitive 35): candle_core::cpu_backend::utils::binary_map_vec has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (30 pts), match/switch 3 (5 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"302cf3fbeaf99d9d0e0bf7a1223e5110ef29f57accbe67dfd3f0de858336c0ad"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cpu_backend::utils::binary_map_vec (cognitive 35): candle_core::cpu_backend::utils::binary_map_vec has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (30 pts), match/switch 3 (5 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/utils.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"739f3d9f8af8a5246f11ea330175bb1f322fc5c7e8d65b334dfc81d0ab8e2064"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::gist::research_and_write_with_gemini (cognitive 34): mcp_brain_server::gist::research_and_write_with_gemini has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"411fc4e9bd362b298c6b399d14234af1d56a07676d49748f336d505c9f9a1301"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_core::advanced_features::product_quantization::kmeans_clustering (cognitive 34): ruvector_core::advanced_features::product_quantization::kmeans_clustering has cognitive complexity 34 (threshold 15). Drivers by points: loops 8 (21 pts), if/else 7 (12 pts), boolean chains 1 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/product_quantization.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ed34c696ddd134fe32095d5ac26532f3c206ff900c442b5d5923e887469f39"}},{"ruleId":"D2","level":"warning","message":{"text":"MemSqlStore::run (cognitive 34): MemSqlStore::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (9 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/mem_store/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46f708a8ec7301db36da68400376752346212e4b6311fab2d155058fd7c454d"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeSimBackend::run_layer (cognitive 34): NativeSimBackend::run_layer has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (31 pts), if/else 2, boolean chains 1 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5843feb353a4cddf1b5da25bfd6301a468197ebcbab954d78a1146f13953437f"}},{"ruleId":"D2","level":"warning","message":{"text":"GameTheoreticAttention::compute (cognitive 34): GameTheoreticAttention::compute has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 7 (12 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/economic.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1bd2a1f0a7ab29b40ec271e6b7ace950d9db52168d0e43fd17356191d8eebb"}},{"ruleId":"D2","level":"warning","message":{"text":"Trainer::fit_with_multiplicity (cognitive 34): Trainer::fit_with_multiplicity has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/train/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b141ce71e6638cd871eb5c89283fb1d4e8800700902aecd5a29269c70cc7b9"}},{"ruleId":"D2","level":"warning","message":{"text":"SpikingNetwork::step (cognitive 34): SpikingNetwork::step has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 6 (16 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/network.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c4935f62bc24e48d2c67aa802917da0e38d5c07727fbd7771da5e8bb2df7fb"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::try_parse_aggregate (cognitive 34): SparqlParser::try_parse_aggregate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"894c19ea7b1836c328701bb9e1ac46608caf18d231a3ee66ecd8547d1466d804"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::search_knn_internal (cognitive 34): HnswIndex::search_knn_internal has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/src/index.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"355c88892084d8c9c29ddebb8c1366e733f7162e7be9cf2264c3497083c45433"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_solver_wasm::analyze_sparsity (cognitive 34): ruvector_solver_wasm::analyze_sparsity has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-wasm/src/lib.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3485fffe69aee6865f3e694efee0e05a70eb993050efc8d9b322327443595f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::keys::execute_list (cognitive 34): ruvix_cli::commands::keys::execute_list has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (7 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/keys.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6d89ae745caa702847e9c39de9caab3122cd9aa233ba3d092f613da85905e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpertCache::compute_base_eviction_scores (cognitive 34): ExpertCache::compute_base_eviction_scores has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/expert_cache.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"512ed7ed72b0e41859377ee2d59e13984db339737b9acc74599e98582817a4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"AdapterMerger::merge_ties (cognitive 34): AdapterMerger::merge_ties has cognitive complexity 34 (threshold 15). Drivers by points: loops 10 (31 pts), if/else 1 (3 pts) (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/adapters/merge.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b198224d3916acc7640a5e8512c72bde1a3a5fe63c08824b8b6cb5b29b84eb9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::kv_migration::mapper::solve_linear_system (cognitive 34): ruvllm::kv_migration::mapper::solve_linear_system has cognitive complexity 34 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 4 (10 pts), boolean chains 1 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_migration/mapper.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf8726f2bd8cda703634905fa2bac921a4c2753e0d7b75391db4874741478c7"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::search_layer (cognitive 34): HnswGraph::search_layer has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (28 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":"crates/ruvllm-wasm/src/hnsw_router.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f835ac62574a00d4cdaa8efa2b2609bdfb8c1bea3dfda8a97e52527f590fb69"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm_sparse_attention::attention::build_landmark_candidates (cognitive 34): ruvllm_sparse_attention::attention::build_landmark_candidates has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acaf36379d877e1d5613c6d27773c46b3b3c37efa02946724b6ee617ec94ed5"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::relink (cognitive 34): HnswGraph::relink has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 5 (8 pts), boolean chains 1, 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":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62a67b9717d674e217b2ed1e120ce0d245384468a7afdd7acf2bfb35cb68e27"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamClient::run (cognitive 34): StreamClient::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/client.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7ea352d4aeae91655e6b50d70d8ac1bf04dd3ae9ada520ce28e7d63aa6b217"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::try_parse_aggregate (cognitive 34): SparqlParser::try_parse_aggregate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"990310cb88013561334ca4a45ca0081b9807f0cdda2130f460e9470d31a61255"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ5K::from_float_imatrix (cognitive 34): BlockQ5K::from_float_imatrix has cognitive complexity 34 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 5 (15 pts) (nesting depth added 21). 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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7ffa11416abae7b204db336d720c31892dd5ce407e783b58a9922b77552ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"UpsampleBilinear2D::f (cognitive 34): UpsampleBilinear2D::f has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 6 (12 pts), boolean chains 1 (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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4ecb94512e7afbc4b2e4db3f79843938e27a08dee6c223d4c3f35e056b9b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::utils::make_q3_quants (cognitive 34): candle_core::quantized::utils::make_q3_quants has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 6 (11 pts), boolean chains 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":"patches/candle-core-0.8.4/src/quantized/utils.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"193302f14287f51be8ab5e6f23764e1b60aa12d467e953cb3bd3ac11a50b1ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::utils::make_q3_quants (cognitive 34): candle_core::quantized::utils::make_q3_quants has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 6 (11 pts), boolean chains 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":"patches/candle-core-0.9.2/src/quantized/utils.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0517050b9a0ea851e21301e69f79e2b4ff25d6c9c821c2414a016cfc2e0471f6"}},{"ruleId":"D2","level":"warning","message":{"text":"decompileSource (cognitive 34): decompileSource has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 2 (7 pts), loops 2 (5 pts), ternaries 3 (4 pts), boolean chains 3 (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":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fec01c65aa8fd5a46feb1fb30ad7a21ba4abd266f12f83f35f30a949cbcfa4"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskAnnIndex::save (cognitive 33): DiskAnnIndex::save has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (14 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/index.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b4a497939e6bde85521aeedd59fae49a3d06c0634f831d1aff0c5f05194a31"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_analytics::cost::certificate (cognitive 33): ruvector_edge_analytics::cost::certificate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 4, boolean chains 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-analytics/src/cost.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b85a34f3c850708821ac9b2828478df531fccefb69676cb3c09ff7697834cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut::algorithm::exact::minimum_cut (cognitive 33): ruvector_mincut::algorithm::exact::minimum_cut has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 5 (11 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":"crates/ruvector-mincut/src/algorithm/exact.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"247552611e3a04362af109840f579724ba6ce09d8fec0cd4b7c10ff2db8dc553"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_primary_expression (cognitive 33): SparqlParser::parse_primary_expression has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"55709cfe350a2dcd99a80fdfb10c63e9a67f36f733c79b11a54455bd20585f08"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_literal (cognitive 33): SparqlParser::parse_literal has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c88becfb6504c7832cecaadaec7d57e196d51c84b1c953f94a10436a53e3e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Router::route (cognitive 33): Router::route has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 3 (9 pts), boolean chains 2, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/router.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe710277b60d8c64053c0633f07cb6755d0771282b7eef59d70d54bf7adc01a"}},{"ruleId":"D2","level":"warning","message":{"text":"BitNetBackend::tl1_gemv_dispatch (cognitive 33): BitNetBackend::tl1_gemv_dispatch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (13 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4439d5e043b38377ed3221c94d486d7cb56747cd015e58a3b2a6cc0a530b8d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningBankIntegration::distill_patterns (cognitive 33): ReasoningBankIntegration::distill_patterns has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 7 (16 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"1163e0dc0875916ca7ede69e836f3e5ffd607665ce4d849d1f13c774c5be5965"}},{"ruleId":"D2","level":"warning","message":{"text":"IntelligentContextManager::prepare_context (cognitive 33): IntelligentContextManager::prepare_context has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 4 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/context_manager.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaa3ac0e3013e8528bba47af1bf18175754eb4497186f203f6c985ce02db64d"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::boot_with_ancestry (cognitive 33): RvfStore::boot_with_ancestry has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2 (5 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":3531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff585f607ed7376564b11727f9725e81920c8e176b388ae5e9d514267df95e13"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::restore_cow_state (cognitive 33): RvfStore::restore_cow_state has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 8, match/switch 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":3753}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a1f13c016fe2e2f965a37fee4b0224f7a86dc3dda95a0ba9cfbc1b9ff548a2"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_primary_expression (cognitive 33): SparqlParser::parse_primary_expression has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"7740013182e92932f2e3b3310477811fcc9c0b56ea8f3abaf2da914c542dacd0"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_literal (cognitive 33): SparqlParser::parse_literal has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42a498f8f9df2cb5a462a2d76672bb195f542f7efa76671289aa122d4b92057"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlEngine::select (cognitive 33): SqlEngine::select has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 2 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/executor.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbebe13a0e087f76a0036db46545cdc899083302a563d37a5d46ba1575599f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::create_router (cognitive 32): mcp_brain_server::routes::create_router has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 5 (9 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d101382df4932ba14a804d2d1d5d0a17bbf1aefc0edb4e042d73b8bae77ada8"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::status (cognitive 32): mcp_brain_server::routes::status has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26 (32 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d6e886fd81789bf3896c74c559ba84523e324ccbe53b8f17d8420e1b642124"}},{"ruleId":"D2","level":"warning","message":{"text":"SheafConvolution::forward (cognitive 32): SheafConvolution::forward has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 2 (5 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/neural.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb0bfc3839abba8e1d6ab5b81f0ecd3810f066b7f1b9ffad25da3d86a52c33a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cli::cli::hooks::post_command_hook (cognitive 32): ruvector_cli::cli::hooks::post_command_hook has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (28 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":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fc0515713b27460197be727b7c0ad5aa8aa4dd1cf841020311aeabeae6fbc1"}},{"ruleId":"D2","level":"warning","message":{"text":"MinCutPhiEngine::compute_phi (cognitive 32): MinCutPhiEngine::compute_phi has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/mincut_phi.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e08a6a7231895c1293af0d3576632a2354dc0a0b7cb0034dd9b1379a6240296"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorDB::open (cognitive 32): VectorDB::open has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5204542a9408889b76a172d2ebdfc1cf17d16d2e130d01b42782658688475d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParallelBranchAttention::detect_branches (cognitive 32): ParallelBranchAttention::detect_branches has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/attention/parallel_branch.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"df66604a96b7ac7a4dfb2a1dce3887d307b9ff2d35f0f85ad28e14bbcd3f1639"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::parser::find_declaration_end (cognitive 32): ruvector_decompiler::parser::find_declaration_end has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (9 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/parser.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea0114425bf6daddd67798b7709306ddd02946e58e185d085f32ef35e288aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::search_layer (cognitive 32): HnswIndex::search_layer has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/hnsw/search.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5991ba34ab02c74288322675de18bf31a256cf16afc87615b87e6fbd85d7aa15"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDatabase::delete_node (cognitive 32): GraphDatabase::delete_node has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (11 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b2ff6f9d57d7ab9266fbadf993f77f62c05193ea5a7f4173a23cfc4f579c05"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpanderDecomposition::insert_edge (cognitive 32): ExpanderDecomposition::insert_edge has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bb4f2b3186848bddf467b41f9328af4f0137e624de075047ad23249dc13856"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::cypher::parser::parse_relationship_pattern (cognitive 32): ruvector_postgres::graph::cypher::parser::parse_relationship_pattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 1 (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":"crates/ruvector-postgres/src/graph/cypher/parser.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"63607e21865cbd6b32599a077603849813b53a16388c07deb0941c0d1aaa0624"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::seo::diff::myers (cognitive 32): ruvector_weaver::seo::diff::myers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (9 pts), boolean chains 7 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/diff.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e86e685512178e4ff9dac6fe20f590c3a303bf16cd27a4be6335afb676f4196"}},{"ruleId":"D2","level":"warning","message":{"text":"WebGpuInference::attention_cpu (cognitive 32): WebGpuInference::attention_cpu has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (23 pts), if/else 2 (8 pts), boolean chains 1 (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/webgpu/compute.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac7e95c6230fe47746d0dd06823a5c532d47a4099914d674116b1384799e6da"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::apply_open_policy (cognitive 32): RvfStore::apply_open_policy has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/policy_api.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1044913f9a02c87210052143ba82f69b2372ad53b3913e2a266e9fe32fd6bff7"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamVerifier::finish_identity (cognitive 32): StreamVerifier::finish_identity has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/verifier.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"267f8a0f71b2595cb1bdc88aa7adcb63cf03e31a21183994f183b5d2351f0e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"CudaStorage::copy_strided_src (cognitive 32): CudaStorage::copy_strided_src has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21 (31 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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6df77e9d88dbcd00b4bb70b715a2fc5a377591d2533409d73949be0cb0effe"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::pickle::read_pth_tensor_info (cognitive 32): candle_core::pickle::read_pth_tensor_info has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c1f65bd83bf2bec58098ba3debab0081bc3edb2f5b081897663d52b2e8987a"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::pickle::read_pth_tensor_info (cognitive 32): candle_core::pickle::read_pth_tensor_info has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/pickle.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cb728f8305cb2e87b00cb3b449991b569faf16647859a6d2cc44a8b272da8e"}},{"ruleId":"D2","level":"warning","message":{"text":"micro_hnsw_wasm::insert (cognitive 31): micro_hnsw_wasm::insert has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (9 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":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af2e1f7a87951a31ef186affa0c037bc1e646350095cacced0764cd44f22f18"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_gpu_runner::runner::supervise (cognitive 31): ruvector_gpu_runner::runner::supervise has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gpu-runner/src/runner.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ef80dd6003b017dc130df105740803d5181292cfe36989ef9aabed3e322f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"IncentiveAlignedMPNN::step (cognitive 31): IncentiveAlignedMPNN::step has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/economic.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa8b2ff09d5c89325d2ced0c4d849c6586945d76c2bbbbd4f71607b44783c34"}},{"ruleId":"D2","level":"warning","message":{"text":"GaugeEquivariantMP::forward (cognitive 31): GaugeEquivariantMP::forward has cognitive complexity 31 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 6 (13 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/physics.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"304cdcdb8d8131a524fd9135afaf6efda9ef596f7100524a92114ef6dc5c20d8"}},{"ruleId":"D2","level":"warning","message":{"text":"KFACLayer::update (cognitive 31): KFACLayer::update has cognitive complexity 31 (threshold 15). Drivers by points: loops 10 (22 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/kfac.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f122e0ed2300a9d33ba4a6cd8a8db8dc20fb56709ffbee4cd6d86475df644777"}},{"ruleId":"D2","level":"warning","message":{"text":"AttractorDynamics::karger_contract_fast (cognitive 31): AttractorDynamics::karger_contract_fast has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 7 (9 pts), boolean chains 1 (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/attractor.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be57b98100bcf75ddce7645477edc65f389320570017f821c66d757913e4e11"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_expression (cognitive 31): ruvector_postgres::graph::sparql::executor::evaluate_expression has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5d7b2cebe3e9474763e8cd1c978eb432ffc2af87f9e8d1a0fd0560649cfe09"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverOrchestrator::analyze_sparsity (cognitive 31): SolverOrchestrator::analyze_sparsity has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dc70a07965695c0b36a7cd5fbb6a6db6ae50f884f9baa2b6ab528d8d5d6681"}},{"ruleId":"D2","level":"warning","message":{"text":"NapiSolver::pagerank (cognitive 31): NapiSolver::pagerank has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 7 (12 pts), boolean chains 2 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc4ac4525aa0fd02567f11f06204a3ca3409833ff9a77059b3acbde28789072"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_typesafe_train::export::transplant::map_initializers (cognitive 31): ruvector_typesafe_train::export::transplant::map_initializers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 6 (8 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/export/transplant.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"231625de12856e38566b715cc1d600316fcbe4d8a96144a89d26b4965dd58766"}},{"ruleId":"D2","level":"warning","message":{"text":"AneInfo::detect_ane_tops (cognitive 31): AneInfo::detect_ane_tops has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (31 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a34bc2b3affd9a11ab0595ac4cbe7cb5c0a12ba487b91e794c0418ceb054b8"}},{"ruleId":"D2","level":"warning","message":{"text":"CandleBackend::load_model (cognitive 31): CandleBackend::load_model has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6032cb2adc88897a5357e061fd1939925bc4cbc14188e487d74a4bba1669b819"}},{"ruleId":"D2","level":"warning","message":{"text":"Sampler::sample (cognitive 31): Sampler::sample has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 6 (9 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/sampling.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcb9629fa0784ffdbc3d21986b8fc94e532a8196d76b6c07c3530e95c81053b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::kernels::matmul::gemm_nt_neon_impl (cognitive 31): ruvllm::kernels::matmul::gemm_nt_neon_impl has cognitive complexity 31 (threshold 15). Drivers by points: loops 12 (31 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"2725269ab6b44198965d46f11dd1a5f6dfd4e4a2198e6cb84ed3aee297394965"}},{"ruleId":"D2","level":"warning","message":{"text":"Header::parse (cognitive 31): Header::parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 7 (12 pts), boolean chains 5, loops 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":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"994175368cb9d0bf5585305bbe2698a2317038aa8ccb2f3864a15dc1ed798622"}},{"ruleId":"D2","level":"warning","message":{"text":"Header::parse (cognitive 31): Header::parse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 7 (12 pts), boolean chains 5, loops 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":"patches/candle-core-0.9.2/src/npy.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a3d2800bac4e07772e82de2578b790439292769ef8a405747bc69423592455"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ2K::from_float (cognitive 31): BlockQ2K::from_float has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 5 (9 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"8468c491e35182ab4238aadf8126b6ece6d970d30511b66bcf296e36142c9ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ2K::from_float (cognitive 31): BlockQ2K::from_float has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 5 (9 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeeb11367c623cdb709fb42f2ed18c3600795c1567764add03194d3e4c097d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor.run (cognitive 31): Supervisor.run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, loops 5, error handling 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":"python/portfolio/release_supervisor.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdc58af1a6a09a74379a3a8aaa91336ac82b045ded2120270242c4410b83e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"update (cognitive 31): update has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/spiking-neural/src/index.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"67887ab9f4a6b8c393051bd007019136e21a3f129cb84115c4393e172930b978"}},{"ruleId":"D2","level":"warning","message":{"text":"EscalationLadder::run (cognitive 30): EscalationLadder::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 5 (9 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/monitor/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3949c222d50021dc8d77d61db62b53a7db1597ca3ddd43a4ccf954bb921b795"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseResidualAttention::generate_mask (cognitive 30): SparseResidualAttention::generate_mask has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/sparse.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"03caf79cf94a46172c8040b4e5756e2abc16ec5ffd1a9f55e2e2a9d7aedc8468"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedMaxPool2d::forward_int8 (cognitive 30): QuantizedMaxPool2d::forward_int8 has cognitive complexity 30 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 2 (8 pts), boolean chains 1 (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_pooling.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb75df91adb87cac981291c2658e272b7ae18de8e6c278728c4c5fad7215c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_avx2::matmul_int8_avx2 (cognitive 30): ruvector_cnn::kernels::int8_avx2::matmul_int8_avx2 has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (30 pts) (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab846264d3e3f667d0e7656df0cb9d694c0c42ef1d6dd7cc27a99d1b163ec68c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_neon::matmul_int8_neon (cognitive 30): ruvector_cnn::kernels::int8_neon::matmul_int8_neon has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (30 pts) (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_neon.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45c6c0285bbb3216a160e9de80b47d77f4201e86c67fcae664f5074760aa6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"HypergraphIndex::k_hop_neighbors (cognitive 30): HypergraphIndex::k_hop_neighbors has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 4 (13 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced/hypergraph.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58bbc79ee0e3126213a73b4b0f725df2a7c58b98a2be1a1dfddb3a90ced9994"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphState::apply_delta (cognitive 30): GraphState::apply_delta has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 3 (9 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-graph/src/lib.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4994f8aea7e0136df027fd5e96c3346eb3f9fd37e17aadafa188fedbd7cb0f"}},{"ruleId":"D2","level":"warning","message":{"text":"DomainExpansionEngine::evaluate_population (cognitive 30): DomainExpansionEngine::evaluate_population has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 3 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"190a9dffafee8e38aaaada2021925c45e5cf7f55d24de1879e78686f1847a72b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_fpga_transformer::ffi::c_abi::fpga_infer (cognitive 30): ruvector_fpga_transformer::ffi::c_abi::fpga_infer has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 4 (9 pts), loops 1 (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":"crates/ruvector-fpga-transformer/src/ffi/c_abi.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc0d5df10a7b2b6bf075765a7826348ba9153cedccc799590a0ea613cefab43"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::match_clause (cognitive 30): ruvector_graph_wasm::cypher_exec::match_clause has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 5 (13 pts), boolean chains 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2784b6a7252748463deda7b1d35cf321d9f0644867506383b6263c38d47b04"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::create_clause (cognitive 30): ruvector_graph_wasm::cypher_exec::create_clause has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 2 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"138167004390908d66f42bcda047fd8cf90b2747778ad60a7f8667e779d84edb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::ruvllm-bridge::main (cognitive 30): ruvector_hailo_cluster::bin::ruvllm-bridge::main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 5 (9 pts), boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdabdb4bf85daaa9bdbf9dd7cb518ea776057556a0d6b960b18bdf86be58171b"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkhornSolver::barycenter (cognitive 30): SinkhornSolver::barycenter has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (23 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/sinkhorn.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e42d0232abd669cd7bd3c4998e4d8b02f35f062ae4cb5e2453b388441b13a0"}},{"ruleId":"D2","level":"warning","message":{"text":"SDPSolver::project_psd_small (cognitive 30): SDPSolver::project_psd_small has cognitive complexity 30 (threshold 15). Drivers by points: loops 9 (20 pts), if/else 5 (10 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/sdp.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee29a274a07c42cb69d9ab8f8ec0caf57966a2277a67f98a9c86e1a2d872ff16"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_math::tensor_networks::tucker::compute_left_singular_vectors (cognitive 30): ruvector_math::tensor_networks::tucker::compute_left_singular_vectors has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (30 pts) (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/tucker.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a649464019bedeb4084bfa747c7d2bf2ed27774c7c017bd1e4d3fbb570ccd8"}},{"ruleId":"D2","level":"warning","message":{"text":"BenchmarkSuite::benchmark_simd (cognitive 30): BenchmarkSuite::benchmark_simd has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 3 (13 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/benchmark.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efa6e512ac2bc73493d909e2f7cd6b68f61998a81c81c0f22a28b78097a04c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut::algorithm::exact::certified_cut (cognitive 30): ruvector_mincut::algorithm::exact::certified_cut has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2, 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":"crates/ruvector-mincut/src/algorithm/exact.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad88a71276fb27c833a47aee9359167d2356109596e9b098c51bf2b2409d791"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_solution_modifiers (cognitive 30): SparqlParser::parse_solution_modifiers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c264e00d9aea97196022fc141d3494c3c3b6b2db94c0f95b288d0999c5caa889"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_inline_values (cognitive 30): SparqlParser::parse_inline_values has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69c4f206275d11bc4e9978f19255320d091d4e3cdea3d156c38db850c92721b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::project_solutions (cognitive 30): ruvector_postgres::graph::sparql::executor::project_solutions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (10 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d000b39de021a647de71e1919124a53bdc803e74718f59767eea03ee4d9623b4"}},{"ruleId":"D2","level":"warning","message":{"text":"TieredStore::tick (cognitive 30): TieredStore::tick has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/store.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74b41b3737b2a8bfc987fa754785b38dfa2e655547383edeb9b0b25f9f907f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::gate::new_package_source_gates (cognitive 30): ruvector_weaver::gate::new_package_source_gates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/gate.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4e7d4ad75006660ec481a3408449ec6ec44bf5513fc9c4ffb7e4e6602b8dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::schedule (cognitive 30): Scheduler::schedule has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (5 pts), loops 1 (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":"crates/ruvix/crates/nucleus/src/scheduler.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"372bdff8c32b13741b5596ee76b186e6947d69b59e568bdee10aa1855a19bf34"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_solution_modifiers (cognitive 30): SparqlParser::parse_solution_modifiers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b26a72ce94c54ded73976178251e402a941e695f4e601b1a925f6d012dbe7b"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_inline_values (cognitive 30): SparqlParser::parse_inline_values has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a0f5ca8887b7ad184a00759332167588b3e29ebc163810345a0beea50a4807"}},{"ruleId":"D2","level":"warning","message":{"text":"rvlite::sparql::executor::project_solutions (cognitive 30): rvlite::sparql::executor::project_solutions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (10 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"66776e154c59809c1c59949a745a07a3ac635a19331105f9effb4d0138de3a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cpu::erf::erf_impl (cognitive 30): candle_core::cpu::erf::erf_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24 (28 pts), boolean chains 2 (nesting depth added 4). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/erf.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6b00d57012a12bdf07ac781d694dcfc0d5a1aaa22a32e7e6ba3cf5a3042cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Collection._load_validated (cognitive 30): Collection._load_validated has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, loops 1 (2 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b47478a2c5da26e54d6d7fcc59e59143953fca7c8b3e77397effadfb74ba88"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_acorn::search::acorn_search (cognitive 29): ruvector_acorn::search::acorn_search has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/search.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b817a11289eb476eef09d1accf7f0aa722cdb6645d107dfdd7360374f1125f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_scalar::depthwise_conv2d_int8_scalar (cognitive 29): ruvector_cnn::kernels::int8_scalar::depthwise_conv2d_int8_scalar has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 1 (7 pts), boolean chains 1 (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_scalar.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef07f6b74137f78a5bdcc991971ee52798ff7e776a0e85da564ef8b1c556055"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::scalar::conv_3x3_scalar (cognitive 29): ruvector_cnn::simd::scalar::conv_3x3_scalar has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (22 pts), if/else 1 (6 pts), boolean chains 1 (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a5d9fa2313fb6b513943ad3805ad443064078c4b0895d1e77bd3cfdb27b694"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmCnnEmbedder::extract (cognitive 29): WasmCnnEmbedder::extract has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (14 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn-wasm/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88074bfb0392adb32793afcf7654a669b284dfec898fe765daa1133accb66f6"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStorage::new (cognitive 29): VectorStorage::new has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (6 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a74c7b47ef609b2d724013363084a2ca76ff843b0a6faf8c9ea255e1c21e58"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorShard::replay (cognitive 29): VectorShard::replay has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (8 pts), match/switch 2 (7 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/replay.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9596c6518a391eb32073b2b3f88319fdac0ce839d3347400b344c343d218302a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_gpu_runner::runner::launch (cognitive 29): ruvector_gpu_runner::runner::launch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 5 (8 pts), match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gpu-runner/src/runner.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc455d9ade8c93bda89ae936bc7a280c668f658711c3e2ddbded6eadb2e569a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_remove (cognitive 29): Parser::parse_remove has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c212c3459a3c7e8a712cf6d753bb50534468ce58423f71091e83a1ffabcde5"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifiedTrainer::train_step (cognitive 29): VerifiedTrainer::train_step has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/verified_training.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"3098f18a29834026d9d1e02b2fbeaf60e0006581a10ed1456e888e5858e194d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::mmwave-bridge::scan_for_radar (cognitive 29): ruvector_hailo_cluster::bin::mmwave-bridge::scan_for_radar has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbb20bb2718b5aa15862a2682b7fd5c6c9c5d07119244636005defa8e4e1b87"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::search_layer_ef (cognitive 29): HnswGraph::search_layer_ef has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, 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":"crates/ruvector-hnsw-repair/src/graph.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f2831b7bc8b7f4a5842dc90f7f31a6423294ba44bd3dcd5d6551f0bc2178ec"}},{"ruleId":"D2","level":"warning","message":{"text":"KgeModel::eval_json (cognitive 29): KgeModel::eval_json has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 12 (24 pts), if/else 4 (5 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/pipeline.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"116941a08524799fce94172d67248526d7a16d1a8897bcf792d6c4545550a161"}},{"ruleId":"D2","level":"warning","message":{"text":"KgeModel::eval_json (cognitive 29): KgeModel::eval_json has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 12 (24 pts), if/else 4 (5 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-wasm/src/pipeline.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be31719cdd254c2bb94a244b30b50749dfbb70ed9bc85ba6721da011669ef90"}},{"ruleId":"D2","level":"warning","message":{"text":"AttractorDynamics::exact_mincut_small (cognitive 29): AttractorDynamics::exact_mincut_small has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 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":"crates/ruvector-mincut/src/snn/attractor.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbda2271c12d96a02a5a23d965c24a1d575e5f5238e65fa5915985923db4e181"}},{"ruleId":"D2","level":"warning","message":{"text":"MincutComputer::compute_algebraic_connectivity (cognitive 29): MincutComputer::compute_algebraic_connectivity has cognitive complexity 29 (threshold 15). Drivers by points: loops 12 (21 pts), if/else 6 (8 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/mincut.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39d02f70cb584b23dab41809af07925b511fb3d24af98727b5f08efe1e8465c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_typesafe_core::limits::validate (cognitive 29): ruvector_typesafe_core::limits::validate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/limits.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed0dba1e1d2efcff96b96f2d58005b7e4576c9242fadb74eddc995b53d7bb38"}},{"ruleId":"D2","level":"warning","message":{"text":"Gemma2Attention::forward (cognitive 29): Gemma2Attention::forward has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 8 (13 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a248f58d22401ef9fa468ab09b5ee16096933703c3c4d06cef67761b0f16f"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuousBatchScheduler::schedule_preempted_requests (cognitive 29): ContinuousBatchScheduler::schedule_preempted_requests has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/scheduler.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c5a2fbdf2aedab8eec074e1a37fb816c7ed9ac370423de1e73dbe157ae94d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm_sparse_attention::attention::dense_attention (cognitive 29): ruvllm_sparse_attention::attention::dense_attention has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 6 (13 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e8441d18800e138e0a1f45ece63beaf3e63f25a226343f51668d036a3186b9"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::search_layer (cognitive 29): HnswIndex::search_layer has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cd06ddfd4996c6080f2036d721c5feef3413aa7d51bd4b68198fb54c959b6d"}},{"ruleId":"D2","level":"warning","message":{"text":"VecParse::feed (cognitive 29): VecParse::feed has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/vectors.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"60955d4344c6abed7a34f2bfc0b6b0231816386b8c6fba2a8f0ee7f6cbdf8c32"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::cow_exact_parent_scan (cognitive 29): RvfStore::cow_exact_parent_scan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 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":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf345a7cd26a1c2eb34ac8f57dd4e7cb32bd21ab54a6e3e9edc7a7723e5bb34"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_remove (cognitive 29): Parser::parse_remove has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"449680f74c2975abace2b6fda9afae8712532403c33842dc5fdb4c9b8e2a6812"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::next_token (cognitive 29): Tokenizer::next_token has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/parser.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e26ccad8e50caadff1174a284b4a4afadb54244bf6f19deba9c63fe20bcaa9c"}},{"ruleId":"D2","level":"warning","message":{"text":"CpuStorage::concat (cognitive 29): CpuStorage::concat has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 15 (29 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"df021d38391f4fafd266a45e6f4db322eb0bfd6aa0c5b22d0ed79805d5cb5f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexAdd::f (cognitive 29): IndexAdd::f has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (14 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb43215bc2c695f0480780e03287ccb8cf75fc36cb6edf5e37bb424af1fb1b83"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ4K::from_float (cognitive 29): BlockQ4K::from_float has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 7 (13 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6a861115f19dd7fbf5624cc43dc4d4dd467a753bd35ef24f695ac45a842ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ4K::from_float (cognitive 29): BlockQ4K::from_float has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 7 (13 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"be09f8c8c6e8c6dffb6e8914d7931c3ae3663455a46e105bb6c5960421f68673"}},{"ruleId":"D2","level":"warning","message":{"text":"insert (cognitive 29): insert has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), boolean chains 3, ternaries 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":"npm/packages/agentic-synth/src/adapters/ruvector.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08a86912b06f36563456dcaeeaae1660bce6b6f9dfb6e385b3894cad773758f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_bet4_ivf_bench::pca::project_topm (cognitive 28): ruvector_bet4_ivf_bench::pca::project_topm has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 2 (4 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/pca.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"508390b6909286a5432cfe499426edb91bf25f153b34e9a9c5495de78175c74c"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedDepthwiseConv2d::depthwise_conv_int8_scalar (cognitive 28): QuantizedDepthwiseConv2d::depthwise_conv_int8_scalar has cognitive complexity 28 (threshold 15). Drivers by points: loops 8 (21 pts), if/else 1 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_depthwise.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b02b88a27758c7f984faedf5f203ac85e0717d4fbf13103d23817f0e8d8232"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_coherence_hnsw::search::beam_search (cognitive 28): ruvector_coherence_hnsw::search::beam_search has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (3 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. This shape REPEATS in the file: one other method here (ruvector_coherence_hnsw::search::adaptive_beam_search) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/search.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e628c6ddb5edcd728f06f5b964f61b272e21588191e638bc0542be716caddd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_coherence_hnsw::search::adaptive_beam_search (cognitive 28): ruvector_coherence_hnsw::search::adaptive_beam_search has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2 (3 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. This shape REPEATS in the file: one other method here (ruvector_coherence_hnsw::search::beam_search) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/search.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"95674906fdbfa342cee20ff0caba893bd1162ce17970ef32922cdcda5125a956"}},{"ruleId":"D2","level":"warning","message":{"text":"VamanaGraph::build (cognitive 28): VamanaGraph::build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 6 (9 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/diskann.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47ed61486d925eb67dfbbac5e8baae67f820a9bf93c7b4f845eda9c1748225a"}},{"ruleId":"D2","level":"warning","message":{"text":"FlatGraph::search_filtered (cognitive 28): FlatGraph::search_filtered has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/flat_graph/filtered.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87c2f968a07feb574b314bd27dfaed1e5ceb8fe8c5cd05754d2b8407fcfdc6e"}},{"ruleId":"D2","level":"warning","message":{"text":"EntropyThresholdBeam::search (cognitive 28): EntropyThresholdBeam::search has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afdcf69e618f311dec22287795db5b17fea38ed3f976cd4197ff2f78c7c9208"}},{"ruleId":"D2","level":"warning","message":{"text":"TropicalMatrix::max_cycle_mean (cognitive 28): TropicalMatrix::max_cycle_mean has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 6 (11 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tropical/matrix.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"808c855cf73f80758404708a3c607f760e901394b2aeafe0edd537935d1fce4b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningBank::consolidate (cognitive 28): ReasoningBank::consolidate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (10 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/learning/reasoning_bank.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1f995ca70e6aec56999d54529fa7559e92fb30f9368cce85b3e57b0ce00a28"}},{"ruleId":"D2","level":"warning","message":{"text":"MaintenanceWorker::perform_maintenance_cycle (cognitive 28): MaintenanceWorker::perform_maintenance_cycle has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/maintenance.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8fd0b4bc4f98e9ca32fc1590814a978d1c6c8b22ef4b1b707450f59fdbad20"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::match_simple_triple (cognitive 28): ruvector_postgres::graph::sparql::executor::match_simple_triple has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 1 (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":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f7c3bf3a4aea2d16da5e79770f2b3e82d269638d2bb97a737d3e924af5dc77"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_rabitq::scan::scan_avx2 (cognitive 28): ruvector_rabitq::scan::scan_avx2 has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (24 pts), if/else 3, boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/scan.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b08b98079f76a9b119f3706ba2f2c85e9cc9926859128307d52ebb8947ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_solver::bmssp::dense_direct_solve (cognitive 28): ruvector_solver::bmssp::dense_direct_solve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 8 (14 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42bfc44c84d899d64ddb5b24e9e632af0ba7484eddd9124d01af53da6cc649a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::cli::seo_apply::apply (cognitive 28): ruvector_weaver::cli::seo_apply::apply has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo_apply.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"98411c95ce383c14df0d9f8adda19eeba7055c8e502087d1fdee02a324ba7bca"}},{"ruleId":"D2","level":"warning","message":{"text":"Fat32DirEntry::matches_name (cognitive 28): Fat32DirEntry::matches_name has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/fs/src/fat32.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"93213d5ff04e30bd024fe93cf7728b6474c1b24c698900426d22315c18af0099"}},{"ruleId":"D2","level":"warning","message":{"text":"XLoraManager::apply (cognitive 28): XLoraManager::apply has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 3 (9 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d89a50c53996105f682a92450f396eab48e24dcb5afa15aeac22e831e4dbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningBankIntegration::cluster_trajectories (cognitive 28): ReasoningBankIntegration::cluster_trajectories has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (13 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2b69e3372d2e6b3a50b835bc5476d91e01b28575aeed11aae59796b271345"}},{"ruleId":"D2","level":"warning","message":{"text":"AdapterMerger::merge_weighted (cognitive 28): AdapterMerger::merge_weighted has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 3 (7 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/adapters/merge.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5b132926b24f319b318cfb789243b64157f408eb78052c531ec2c9590ac930"}},{"ruleId":"D2","level":"warning","message":{"text":"ServingEngine::generate_with_callback (cognitive 28): ServingEngine::generate_with_callback has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (6 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa38a98b774dbee96d74b962e97eb8b05f7c178394f87cd1c838e40db99cabe"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::connect_node (cognitive 28): HnswGraph::connect_node has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/hnsw_router.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1386e42d3fadd950f5a9776e0bbf2126671f73357942eb8ff3042cba9a4f9f"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameReader::feed (cognitive 28): FrameReader::feed has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/frame.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"90eef19dff652ebbfff2444d0f4bdb9514edea9b7202497d250966deef97962a"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_wire::stream::descriptor::decode_descriptor (cognitive 28): rvf_wire::stream::descriptor::decode_descriptor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/descriptor.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f879ba3ebec0eabc7087a6d9349adb4cab6a7dde8b4498bbbbffb277dd1f4de3"}},{"ruleId":"D2","level":"warning","message":{"text":"rvlite::sparql::executor::match_simple_triple (cognitive 28): rvlite::sparql::executor::match_simple_triple has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 1 (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":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"531bbbe883d4748a8b9215ac6368a38160f88a2dd6a0a701cbcc9f753d77800f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::queue_consumer::queue (cognitive 28): ruvector_edge_gateway::queue_consumer::queue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (11 pts), loops 2 (4 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/queue_consumer.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a894a4f78cbc48f94a83919668d3b5523f3411f8146c4dc7e8f7cb4847ec4ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"MaxPool2D::f (cognitive 28): MaxPool2D::f has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 1 (7 pts) (nesting depth added 21). 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb26749f80d0e9bcc3515857363d26ceca93193ee10a11d3741244b9c5a8c42"}},{"ruleId":"D2","level":"warning","message":{"text":"MaxPool2D::f (cognitive 28): MaxPool2D::f has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 1 (7 pts) (nesting depth added 21). 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ca474eb6d06eeab331068dbbb31c5380530aff086a83b5bec951f1eeb788f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::read (cognitive 28): Stack::read has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (7 pts), match/switch 2 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/pickle.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7968f0ec39494d74517b0f234f9aaa07ab233a57b420999b9c3aee5785d66164"}},{"ruleId":"D2","level":"warning","message":{"text":"CentroidCache::build (cognitive 27): CentroidCache::build has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/transport/centroid_ot.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b920da83e259868328eafb99c5c691bf098f8f4e6ab4d042e206b783c71ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedConv2d::from_fp32 (cognitive 27): QuantizedConv2d::from_fp32 has cognitive complexity 27 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 4 (6 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3264827f1e0843863fa3067f8b3699672d9ea71de84f3c85faa26baffeb395fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::scalar::avg_pool_scalar (cognitive 27): ruvector_cnn::simd::scalar::avg_pool_scalar has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3 (11 pts), boolean chains 1 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb6b197778e1836221d71e898258c8f5eda5e36ce7771dc2a9cccaba250cc76"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolOrchestrationDomain::score_orchestration (cognitive 27): ToolOrchestrationDomain::score_orchestration has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/tool_orchestration.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2741708d89acf96465ee40e48de28f8a91eff04eacbd4d507726c3efda260d"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::insert (cognitive 27): HnswGraph::insert has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 8 (13 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/graph.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bb58baa294d3c82a6636a2e00c1f25c2feebb70fba7c55cc99288da65e956a"}},{"ruleId":"D2","level":"warning","message":{"text":"FisherInformation::invert_fim (cognitive 27): FisherInformation::invert_fim has cognitive complexity 27 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 4 (9 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/fisher.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bf4d9fd14de94c35133f3aec8ac9e518ad3625a2aed6d4dc51465aa4e92700"}},{"ruleId":"D2","level":"warning","message":{"text":"SOSChecker::find_gram_direct (cognitive 27): SOSChecker::find_gram_direct has cognitive complexity 27 (threshold 15). Drivers by points: loops 10 (21 pts), if/else 2 (6 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/sos.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0218b8b66d7f2362dcd67a9c3a72e82dcf9a1340dfece1e11343ab57a3f9cc5d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_math::tensor_networks::cp_decomposition::pseudo_inverse_symmetric (cognitive 27): ruvector_math::tensor_networks::cp_decomposition::pseudo_inverse_symmetric has cognitive complexity 27 (threshold 15). Drivers by points: loops 11 (19 pts), if/else 3 (8 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/cp_decomposition.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4720ef032f2f7f174935545d4a586d521529d9a7d1023c68ffb38701fe891a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"SpikeDrivenAttention::attention (cognitive 27): SpikeDrivenAttention::attention has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce998e934a265d3ad5cdb038dd0a8e090d556deb93481dc4e92c5465d84d2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::integrity::stoer_wagner_mincut (cognitive 27): ruvector_postgres::integrity::stoer_wagner_mincut has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (11 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/mod.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf849b59651c1af9e89dab427fc4ab82441775d558e478cf87194cca940fb975"}},{"ruleId":"D2","level":"warning","message":{"text":"CandleBackend::sample_token (cognitive 27): CandleBackend::sample_token has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbbd38dbe1de06dad983740822d41b3a62d18abfc0206dbe1f2267866778217"}},{"ruleId":"D2","level":"warning","message":{"text":"ParallelInference::attention_single_thread (cognitive 27): ParallelInference::attention_single_thread has cognitive complexity 27 (threshold 15). Drivers by points: loops 10 (27 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9670e2a7ad7343e2833354be3da27ba617763bde7d7f3ffb77b8bc36ca1094"}},{"ruleId":"D2","level":"warning","message":{"text":"rvagent_backends::gemini::sanitize_schema (cognitive 27): rvagent_backends::gemini::sanitize_schema has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 9 (12 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/gemini.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebff2228faa2dd80726b2a18c84cdddd0e5746e320161cf9028347288ec5d852"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::merge_trailing_vec_segs (cognitive 27): RvfStore::merge_trailing_vec_segs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/dir_growth.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"037e431f0b04aad116938c61057df534ff5192bd5a9d89f552a71307af41ce4a"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::compress::compress (cognitive 27): rvf_runtime::compress::compress has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/compress.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b85ae3714746d0504c00cfb7ee9b658beeaa132b43ecf2bd75b81ac7dc38842"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_types::metadata::validate_segment (cognitive 27): rvf_types::metadata::validate_segment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/metadata.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93ca14fc7e2187bc89f900b1da64e0345f4f6c0a4156b8b0296081982abfe77"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_wire::stream::descriptor::parse_table (cognitive 27): rvf_wire::stream::descriptor::parse_table has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/descriptor.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a9d883daff1980be93233f51c90bea0ad05b9c7a156c3fd6baa674ce5da18d"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ4K::vec_dot_unopt (cognitive 27): BlockQ4K::vec_dot_unopt has cognitive complexity 27 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 1 (nesting depth added 16). 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"16246ca81daf1f65953a26ab3ea9813e9c628e6a49266cd3c4b31e567b39ec3a"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_weights.main (cognitive 27): convert_weights.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (5 pts), ternaries 3 (5 pts), boolean chains 3, error handling 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":"crates/timesfm/scripts/convert_weights.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9121ed955da53bfc91943e439f3bb6bd2d97dc0a199a5423cc3820c7d0a7095"}},{"ruleId":"D2","level":"warning","message":{"text":"SheafNeuralLayer::forward (cognitive 26): SheafNeuralLayer::forward has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (11 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/neural.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"14254043ed42b2e24c42f50b1f9992e3405d5a6952f11b73300d659abf12b48f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_agent_memory::arbitration::arbitrate (cognitive 26): ruvector_agent_memory::arbitration::arbitrate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 7 (10 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/arbitration.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d707bb3fb0c024df763631b72e81997fba7916e1e5c981d490f100644c2dcecd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::inferrer::infer_declaration_name (cognitive 26): ruvector_decompiler::inferrer::infer_declaration_name has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/inferrer.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c67bdc8cc7c8fa005ce30073ff9345be81816467671a08c212eb2c421c21c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_fpga_transformer::backend::compute_topk (cognitive 26): ruvector_fpga_transformer::backend::compute_topk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4596d17c8b3a99379668ee72aa559a358c51fc290f0e3d46a80669b906812f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreGraphTransformer::spiking_step (cognitive 26): CoreGraphTransformer::spiking_step has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"8228ef4a62351c3b20522cde103f86c87a5fadd66097bdb87ce87e7ed7b32e95"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreGraphTransformer::spiking_step (cognitive 26): CoreGraphTransformer::spiking_step has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/src/transformer.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"01176a14154f78d7af94d5322531f9b98a7c68ee673820ea2960932b5b4c5877"}},{"ruleId":"D2","level":"warning","message":{"text":"KFACLayer::invert_matrix (cognitive 26): KFACLayer::invert_matrix has cognitive complexity 26 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 3 (8 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/kfac.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a1e72d4e2a10f7e282315c3c01e70067bd846d90d1011fe447d4f0ff86c8be"}},{"ruleId":"D2","level":"warning","message":{"text":"SpikingNetwork::new (cognitive 26): SpikingNetwork::new has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 4 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/network.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"79afc1b253cfb8a7f44fa892f6955e1c5f6b738582a16879cb18335871cff04e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::workers::ipc::submit_and_wait (cognitive 26): ruvector_postgres::workers::ipc::submit_and_wait has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/ipc.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe62275125ac66e1d02af000b0f772f3e1876999adf5a4f8c1e224080bbb4dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_pq_search::codebook::train_kmeans (cognitive 26): ruvector_pq_search::codebook::train_kmeans has cognitive complexity 26 (threshold 15). Drivers by points: loops 9 (19 pts), if/else 2 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-pq-search/src/codebook.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dd7d0ec2165a0f0b8849599f791fa4d8bf172a46da8cb7e3dc6b18dae22e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_pq_search::ivf_pq::train_coarse (cognitive 26): ruvector_pq_search::ivf_pq::train_coarse has cognitive complexity 26 (threshold 15). Drivers by points: loops 9 (19 pts), if/else 2 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-pq-search/src/ivf_pq.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b856d5b7f62147bd83f69b7c27026fca1dfdcd16978caf72d9d91c728453c647"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverOrchestrator::solve_jacobi_fallback (cognitive 26): SolverOrchestrator::solve_jacobi_fallback has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc99d74b6c364d95d2bc166548afd148773c8913e9f2564ec91ed1fe01f7d214"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_solver::validation::validate_csr_matrix (cognitive 26): ruvector_solver::validation::validate_csr_matrix has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (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":"crates/ruvector-solver/src/validation.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d36aa36f743c64775b77ab73bad78c1c722cc239c55b317bea614ca97accfd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::cli::seo_apply::package_pr (cognitive 26): ruvector_weaver::cli::seo_apply::package_pr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo_apply.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7094a0ad939e0ada230f35be15e742b65af952e400d812fc4c489d381ba908"}},{"ruleId":"D2","level":"warning","message":{"text":"MistralBackend::load_model (cognitive 26): MistralBackend::load_model has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"a045394cc4497a8b2288d0ce9edd7871ab4549ee2d0d36b7ceaa617297077e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffAnalyzer::analyze_locality (cognitive 26): DiffAnalyzer::analyze_locality has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/diff_quality.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0b817ddbb4bba01406546b96d91ce9728039df31ff2e68d8644894d172c9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"CoherenceValidator::detect_contradictions (cognitive 26): CoherenceValidator::detect_contradictions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"97466e495761aabc168d111e9216f1b67e982fb6894a041d03eb93a2d9d2830f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectiveAgent::generate_reflection (cognitive 26): ReflectiveAgent::generate_reflection has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/reflective_agent.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"6516d0ef16464710bd218c19b5fc44e07c2b243f0ba6e4bdf7223f72fdd1357a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicClient::build_request (cognitive 26): AnthropicClient::build_request has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/anthropic.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7148eb7d3eebd19686ac4fac8498929fe074a2673a7b412b9c758d483e56136"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_solver_wasm::engine::run_acceptance_mode (cognitive 26): rvf_solver_wasm::engine::run_acceptance_mode has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/engine.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c39fcffbdd1f0758815892c8ac7ab30c3b3b8cf5069fd5d76ba06cb393e5b9"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_forge_core::container::walk_segments (cognitive 26): rvf_forge_core::container::walk_segments has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (25 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":"crates/rvf-forge-core/src/container.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"692682aad314443011a258f0d5db8d9c334621449fd8782c3dfdda818589fd79"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_primary (cognitive 26): Parser::parse_primary has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (6 pts), match/switch 2 (5 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b96ef20c5e02429bc5d94635c4cd760e2c3fe2bdeadef6cca39aa565db348e8"}},{"ruleId":"D2","level":"warning","message":{"text":"TrainingPipeline::run_training (cognitive 26): TrainingPipeline::run_training has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/training/pipeline.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef07a222d7042268b4c2a99a1fb6312f6bdeb4e1ca8010ae27160f51475311e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::m3_ledger::handle (cognitive 26): ruvector_edge_gateway::m3_ledger::handle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/m3_ledger.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c85f0187a27524b67998f8aad9e3c8fff9d1225d960e881095a70ee216dd5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::rvf_finalize::finalize (cognitive 26): ruvector_edge_gateway::rvf_finalize::finalize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 6 (10 pts), boolean chains 5, 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":"edge/gateway/src/rvf_finalize.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9008e97db4c8817d66e849c54c69041fca3be0aab8d8b2ae5cf2643d9c950996"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::rvf_finalize_step::step (cognitive 26): ruvector_edge_gateway::rvf_finalize_step::step has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (7 pts), boolean chains 6, 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":"edge/gateway/src/rvf_finalize_step.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66ac32a0b7bf1121d7348112bf058e2b9a5a54dafdfdf870d554200760ff964"}},{"ruleId":"D2","level":"warning","message":{"text":"FloatFormatter::new (cognitive 26): FloatFormatter::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 14). 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":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f50a659ee04a2f590e9de2bba15c341ce688874c64b6a2b28a58e7f1c156f2"}},{"ruleId":"D2","level":"warning","message":{"text":"FloatFormatter::new (cognitive 26): FloatFormatter::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 14). 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":"patches/candle-core-0.9.2/src/display.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4c0a09e1d1cd5742d21f8418dc3ff889b1a87f4b6f56b93e5e2e48603e6dd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::read (cognitive 26): Stack::read has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (5 pts), match/switch 2 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63d08b424105260c0124e7ff0ee848c4afc62e20d864d56f0ad3cf6c72cf4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ4K::vec_dot_unopt (cognitive 26): BlockQ4K::vec_dot_unopt has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (26 pts) (nesting depth added 16). 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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bec8a65e33a76618fb2e0e0cd4d4bd508274cedde8b37fbe74a745586aa29e3"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ4K::from_float_imatrix (cognitive 26): BlockQ4K::from_float_imatrix has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 3 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8fab116df716dc7e1e63ee2205488b5f170fe7144cf49813a765819195b052"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::utils::make_qp_quants (cognitive 26): candle_core::quantized::utils::make_qp_quants has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (6 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":"patches/candle-core-0.9.2/src/quantized/utils.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e332bfb74996a7666cb531b6332f34fead08b77606542e7e3dd4a2c77fee79f"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::insert_slice (cognitive 26): Hnsw::insert_slice has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d194494179048b598c007d49ab0c672916eb281a2cd67a24e5938e7c8a30f"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::insert_slice (cognitive 26): Hnsw::insert_slice has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"918e846f4121e82d0ae22257a07aa4900951dbbda7d513bbb70fa0920a1aff5c"}},{"ruleId":"D2","level":"warning","message":{"text":"decompileGguf::readValue (cognitive 26): decompileGguf::readValue has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 8 (11 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"858b5b686afbfdf7fd4ca35cacdca5376ede616b5b4ff1131e00c6726de6a31c"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorIndex::greedy_search_internal (cognitive 25): VectorIndex::greedy_search_internal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a017013e21c6672590298d1bc66aa30681dd33975e4847d08e951a91daabbd"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::bin::ruvbrain_sse::sse_handler (cognitive 25): mcp_brain_server::bin::ruvbrain_sse::sse_handler has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (6 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":"crates/mcp-brain-server/src/bin/ruvbrain_sse.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eb230a6864bd50af7fcaa6c729b2678a6f0090953baff31e7e5321ac93ce28"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::verify_endpoint (cognitive 25): mcp_brain_server::routes::verify_endpoint has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 5 (11 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":2558}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc97bc83a8d6487baf0daf90a3cd3f58364242284f0e9b7b4ea5c7f2442cf17c"}},{"ruleId":"D2","level":"warning","message":{"text":"micro_hnsw_wasm::neuromorphic_search (cognitive 25): micro_hnsw_wasm::neuromorphic_search has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79c5240a616d1093fe086b4b7b520003b32ac555d33f9fb686c3148559917b6"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryCoherenceLayer::create_edges_for_memory (cognitive 25): MemoryCoherenceLayer::create_edges_for_memory has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (22 pts), boolean chains 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":"crates/prime-radiant/src/ruvllm_integration/memory_layer.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"760cefc14b99da69750f0b7b7453c123a08a90bde242e8be15d831516c5ff102"}},{"ruleId":"D2","level":"warning","message":{"text":"FileStorage::load_cache (cognitive 25): FileStorage::load_cache has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"484a5305239522270cf9d180c043973c6ff424d014354544e99fbadf343102fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_agent_memory::witness_signing::verify_signed_chain (cognitive 25): ruvector_agent_memory::witness_signing::verify_signed_chain has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/witness_signing.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb94e10321d41e1db853bb66e48dc445eb84f4a1492c1922733d7b1aac3c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::kernels::int8_wasm::depthwise_conv2d_int8_wasm (cognitive 25): ruvector_cnn::kernels::int8_wasm::depthwise_conv2d_int8_wasm has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 1 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_wasm.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe555ed95db14890a9d7c15ffc2caeed15ea601df0ffdca2cd7ce4be311aecd"}},{"ruleId":"D2","level":"warning","message":{"text":"StageVIModeler::bisect_by_similarity (cognitive 25): StageVIModeler::bisect_by_similarity has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/stage_vi.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0f1298eae6da85292eadfea9d84103dff380c4dd0eba95f24a58cc48f24e44"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::tree::build_inter_module_edges (cognitive 25): ruvector_decompiler::tree::build_inter_module_edges has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 5 (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":"crates/ruvector-decompiler/src/tree.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"46111f0fc42a5d59b183219bb3f544f5ce6fd4fecbd107af3f07f30134a49082"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaHnsw::search_layer (cognitive 25): DeltaHnsw::search_layer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 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":"crates/ruvector-delta-index/src/lib.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e143c94fbfb41091848bded04e8e74b083df74da6d9ab34ae4debff712372a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_snapshot::rvf_summary::inspect_tail (cognitive 25): ruvector_edge_snapshot::rvf_summary::inspect_tail has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (22 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":"crates/ruvector-edge-snapshot/src/rvf_summary.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"33688e81706f9e405acf4660ccf7311d75143d0e8efd32236ba6b341f5fb076c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_store::mem_store::parse::tokenize (cognitive 25): ruvector_edge_store::mem_store::parse::tokenize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (7 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/mem_store/parse.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a10d59e572c04724c37c1202367d13ad1a1bf9fcf9d60fbf3157a18b6cba811"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_store::mem_store::parse::parse (cognitive 25): ruvector_edge_store::mem_store::parse::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/mem_store/parse.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"db47e400ff728d3b17975928993769c9a1fe9825bb6bae9fa3cead3296d019f5"}},{"ruleId":"D2","level":"warning","message":{"text":"EdgeCutMinimizer::coarsen_graph (cognitive 25): EdgeCutMinimizer::coarsen_graph has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/shard.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4890dcf0ef05976deef4a915558772d9624961e2831ff000ab6f8396739eef2d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphSchema::validate_node (cognitive 25): GraphSchema::validate_node has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (6 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":"crates/ruvector-graph/src/schema.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"740b3c8ea161492835f4124043fe3243efd4bd2ec0226a838aadc912c8ccf6af"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectralClustering::compute_embedding (cognitive 25): SpectralClustering::compute_embedding has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/clustering.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9538cd7e13331fe1e6f1849e824c6a8587e1766c00176ec42ac467e1c5ebf86c"}},{"ruleId":"D2","level":"warning","message":{"text":"PolylogConnectivity::delete_edge (cognitive 25): PolylogConnectivity::delete_edge has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (6 pts), boolean chains 1, 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":"crates/ruvector-mincut/src/connectivity/polylog.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c978275a5d874a423278e19cf8de5642f2d089a00d62c24b26f7a409969b325"}},{"ruleId":"D2","level":"warning","message":{"text":"SpikeDrivenAttention::sparse_attention (cognitive 25): SpikeDrivenAttention::sparse_attention has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb06e83734632a7041ba8b89dcc058ddb3c42aaa1a09018e6a1493ea2f97651"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_property_path (cognitive 25): ruvector_postgres::graph::sparql::executor::evaluate_property_path has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9c3ee53832d5e2816a5cea0b8af70947009033c79d518fede2dbec8c275f84"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::scan::parse_hnsw_config (cognitive 25): ruvector_postgres::index::scan::parse_hnsw_config has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 1 (4 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/scan.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"94734b1939d6e0898100f9e52bf6b5b83c523f15b1de30175855c3bb01dee405"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::solver::operators::ruvector_graph_centrality (cognitive 25): ruvector_postgres::solver::operators::ruvector_graph_centrality has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (10 pts), match/switch 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":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"617c1fdf93b2bf60f7ee2ddc004c21446b7fd71838f337c1996ae1bd7c3b1997"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverOrchestrator::solve_dense (cognitive 25): SolverOrchestrator::solve_dense has cognitive complexity 25 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 4 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51e11f189d2acd9b36b53382536c28ae0f6bb440c43fdea2ba4d7169e73983b"}},{"ruleId":"D2","level":"warning","message":{"text":"TrueSolver::project_matrix (cognitive 25): TrueSolver::project_matrix has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (19 pts), if/else 2 (6 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/true_solver.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3c4a6e2cea96de013e1553b1af6f9b98eb248111e1c7cc03bdd0845f3d2d37"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::dtb::search_property_in_root (cognitive 25): ruvix_cli::commands::dtb::search_property_in_root has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"176ee76557abe7e0af34eaa450617e1b959590247d96c12cec63a07518d01f40"}},{"ruleId":"D2","level":"warning","message":{"text":"BitNetBackend::validate_model (cognitive 25): BitNetBackend::validate_model has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"6980c2fbbc6558bd6a260f4290af181df88c45f9e9bbdde8857796069a226729"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorInfo::tensor_type (cognitive 25): TensorInfo::tensor_type has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/tensors.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0860b5514cc1c4e76f2558ad75c0798f160e2ac2d05193f95e32f9b63367f313"}},{"ruleId":"D2","level":"warning","message":{"text":"AdapterTrainer::train (cognitive 25): AdapterTrainer::train has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/adapters/trainer.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f20dfdbb6a8e826f23a5803bf318b7660d993429fa61feb723ff9d62462e305"}},{"ruleId":"D2","level":"warning","message":{"text":"Sampler::sample_topk (cognitive 25): Sampler::sample_topk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (7 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":"crates/ruvllm/src/models/sampling.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0356ea312ed25bae5fa1abb8c4a01048716f2e1dc3a7259158546d158df3149e"}},{"ruleId":"D2","level":"warning","message":{"text":"ContrastiveTrainer::train (cognitive 25): ContrastiveTrainer::train has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"04917e41237ad3199c773989b198684ff08a898a9992851adab312b916ad8bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::quantize::ruvltra_quant::quantize_q4_k_block (cognitive 25): ruvllm::quantize::ruvltra_quant::quantize_q4_k_block has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/ruvltra_quant.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"895efc5d627f1c2cec2897610bc2c1cfbdebc2e9dc93a001e91012c2a82d33a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm_sparse_attention::attention::build_token_candidates (cognitive 25): ruvllm_sparse_attention::attention::build_token_candidates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), match/switch 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":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0be16bc02422fde5ee87622be4ccea715637669a280d9d3568676375a0b8f62"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_index::codec::decode_index_seg (cognitive 25): rvf_index::codec::decode_index_seg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (12 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/codec.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f60fd3b0b0ed986ec826a337e3bebf5e3a86fc25c4a894e652203a689c922e9"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::qr_encode::place_data_bits (cognitive 25): rvf_runtime::qr_encode::place_data_bits has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_encode.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170c1761447b863acf2977a1d078b31ab2f2cfc39b76be363c5b26af801fbfa"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::read_path::parse_manifest_payload (cognitive 25): rvf_runtime::read_path::parse_manifest_payload has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade49bf983a52be3f92ca55dac2977f6fad142b8f5d132ea67ab626818d2da7a"}},{"ruleId":"D2","level":"warning","message":{"text":"rvforge_reader::dock_text::strip_ansi (cognitive 25): rvforge_reader::dock_text::strip_ansi has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 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":"crates/rvforge-reader/src/dock_text.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"61849bd3b907d9e9139e9da9df0dc9598762ea9064b287aad7bed1076e8e6a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next_token (cognitive 25): Lexer::next_token has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (6 pts), loops 1 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/lexer.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62b11f8acab53fdf6c1b93d535642026976ec3832fa300878c806230f9e8e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"CoherenceEngine::recommend (cognitive 25): CoherenceEngine::recommend has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (9 pts), loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/engine.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"379a8ea25b2bcef00fd2c27d118399b5808f9780fb5957229ccc8dfa96299f71"}},{"ruleId":"D2","level":"warning","message":{"text":"rvm_witness::versioned::verify_log_bytes (cognitive 25): rvm_witness::versioned::verify_log_bytes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/versioned.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3248d7cad9c7c1811ca8ee1ac3fd2e14b17aecf00c8b50ed2274a28f5a3367f1"}},{"ruleId":"D2","level":"warning","message":{"text":"sonic_ct::fwi::gradient (cognitive 25): sonic_ct::fwi::gradient has cognitive complexity 25 (threshold 15). Drivers by points: loops 9 (25 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/fwi.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5866fefff0ee3d452d34aff113022221006e3ffe24f1377bc65721dace3223"}},{"ruleId":"D2","level":"warning","message":{"text":"Collection.from_vectors (cognitive 25): Collection.from_vectors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a38d84f9328633ec32e6d07335ec3f4bc74bd77f88b64594f55dd905195b70"}},{"ruleId":"D2","level":"warning","message":{"text":"CohomologyPooling::pool (cognitive 24): CohomologyPooling::pool has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 6 (10 pts), match/switch 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/neural.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c68bc2a47a6bc00239bf21669c9fb046fa6f062f20886c7ca6d7d9566c6f28"}},{"ruleId":"D2","level":"warning","message":{"text":"ThermalSensor::read (cognitive 24): ThermalSensor::read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruos-thermal/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"364c807543b0ef611ae10adbcb741b287d49a68428c304c46f08601b51d61495"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_adaptive_ann::search::beam_search (cognitive 24): ruvector_adaptive_ann::search::beam_search has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/search.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dc9419e040c3be0ff8999b959eb45cd1318ea9ef444e015ba8a0c8b1f28e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"InfoNCELoss::forward_detailed (cognitive 24): InfoNCELoss::forward_detailed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 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":"crates/ruvector-cnn/src/contrastive/infonce.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b966b99d9649db13c9f1257b3a8e2226036d4b49aae03657b3fc8b4d81b9d46"}},{"ruleId":"D2","level":"warning","message":{"text":"TripletLoss::mine_hard_triplets (cognitive 24): TripletLoss::mine_hard_triplets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/triplet.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aa505203ad2127359bc85be54483ab3429d7d3f0550ba1736825ed622f5edc"}},{"ruleId":"D2","level":"warning","message":{"text":"FlatGraph::insert_batch (cognitive 24): FlatGraph::insert_batch has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 1 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/flat_graph.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"00782a9dd8dde3bb773789928d1e3caa31157d249a8b8f0d460551147e26e132"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::compact (cognitive 24): HnswIndex::compact has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 6 (7 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":"crates/ruvector-edge-index/src/hnsw/compact.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58265c7b40602a8a6042bfc85d4e52bd94bc96fb7fa681edb2162e2868845da"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfImporter::rows_from (cognitive 24): RvfImporter::rows_from has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/src/rvf_import.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccda9adc1d442e0f65a1b8fd6af8c99271a55591736a2a9f8e9d1177103dd2f6"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStorage::new (cognitive 24): GraphStorage::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/storage.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"438be8af25ee7b089d56ce2848634f61285fbf9c3298af630269e1f147450d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypedGraph::traverse_from (cognitive 24): TypedGraph::traverse_from has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/typed_graph.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d666defaee88a6e47ea14af14d72304049a3012c7fb96a6dccf57c3758e9eb73"}},{"ruleId":"D2","level":"warning","message":{"text":"DendriticAttention::assign_to_branches (cognitive 24): DendriticAttention::assign_to_branches has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/biological.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"289b3b0c80f2b31be6f72e782fee0af0116f3586e83364f0ede5c35413ad2be5"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreGraphTransformer::granger_extract (cognitive 24): CoreGraphTransformer::granger_extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"4929eb9257ef3665502cb8ec2820043e7842c8d030b56ef741b437f708634069"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreGraphTransformer::granger_extract (cognitive 24): CoreGraphTransformer::granger_extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/src/transformer.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c452e158ec5d182c0c0eca9eb1118e1104f39c31aceb25224076c1cd4ee32590"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::extend (cognitive 24): ruvector_graph_wasm::cypher_exec::extend has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (23 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":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda4909de622ce33906a8b230d88b0068b303784a8b1cb22a8699009932da70b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplacementEdgeIndex::promote_edges (cognitive 24): ReplacementEdgeIndex::promote_edges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (8 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/replacement.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"305bd4e28e1ead141ee3fae696ada17d96e1404bd620d97080a87d94e312821a"}},{"ruleId":"D2","level":"warning","message":{"text":"CactusGraph::root_at_lex_smallest (cognitive 24): CactusGraph::root_at_lex_smallest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59b1080e977feef32a9c21eb02ee37d0cd68ad84df607eb003eddb55560113b"}},{"ruleId":"D2","level":"warning","message":{"text":"Fragmentation::trim (cognitive 24): Fragmentation::trim has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/fragmentation/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9f791f91f01ad81818a9abd2cdcafcd8d07fc9bc89b48308206d6e47d41ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalKCut::find_cut (cognitive 24): LocalKCut::find_cut has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (4 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":"crates/ruvector-mincut/src/localkcut/mod.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacca9d06d307e54657f416f7c817e5cbe3dc250122c51600306c58395d96e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"CausalGraph::transitive_closure (cognitive 24): CausalGraph::transitive_closure has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 5 (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":"crates/ruvector-mincut/src/snn/causal.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e14638d7d08f61d8abf7a4a1bdf522dfc16e7c99a532899708d28e0f90ad89"}},{"ruleId":"D2","level":"warning","message":{"text":"SpikeTrain::cross_correlation (cognitive 24): SpikeTrain::cross_correlation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/neuron.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3457e208ecc6d49d7d50fb4f25466f9761863deadbcfe8ac968161464d53de"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_triples_block (cognitive 24): SparqlParser::parse_triples_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5827e7d8e79a40b33b57179f359cb2bc5c6da9a988d86cb5429778d3ea3e4987"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_relational_expression (cognitive 24): SparqlParser::parse_relational_expression has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c8b5cb57d385482d0210431c12c5dba28f16a5b63f3a4c5f50e9f36e7b4e06"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::search_layer (cognitive 24): HnswIndex::search_layer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 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":"crates/ruvector-postgres/src/index/hnsw.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"916bdb4f4a78b9f699e21ce0566d6c67318e838f7e7a1580d98299ae86707de6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::dag::functions::attention::dag_attention_configure (cognitive 24): ruvector_postgres::dag::functions::attention::dag_attention_configure has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/dag/functions/attention.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12234e03d2129cd9a2bad73e84a92e0a97316f6db5a4bdb4978b0be0e266753"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::cypher::executor::evaluate_return_item (cognitive 24): ruvector_postgres::graph::cypher::executor::evaluate_return_item has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/executor.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a6e9fc7242cb94c36d004a2abfd1472c5818b6e5211751f7e561142f931d0c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_rairs::kmeans::train (cognitive 24): ruvector_rairs::kmeans::train has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 4 (9 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/kmeans.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1157b839c1ffdf9be1c57c882b2aa7c09d65fa102b7aee667d8a86f80f95a12"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_retrieval_receipt::bin::benchmark::main (cognitive 24): ruvector_retrieval_receipt::bin::benchmark::main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, loops 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b659fc56bcb4f9cefc685e4da0aa3067f65cf3d0b11b68c56c6f8c024495fe0a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::cli::cmds::gate (cognitive 24): ruvector_weaver::cli::cmds::gate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/cmds.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dde116f087945ec6f99586800122f4fdffb04f5847307029fc82f676f5a093"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::seo::audit::audit_package (cognitive 24): ruvector_weaver::seo::audit::audit_package has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 3, match/switch 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/audit.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55075c2b4d58ad6948abbf0fd1b2c351eb4c2497b65c743fc3a60e157f0086a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::monitor::display_hex (cognitive 24): ruvix_cli::commands::monitor::display_hex has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/monitor.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"163b7ed5e9a96fb4abb179c0d691ae5ccda96823c380ccede50fa34f9a810860"}},{"ruleId":"D2","level":"warning","message":{"text":"AdapterMerger::merge_average (cognitive 24): AdapterMerger::merge_average has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 1 (3 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/adapters/merge.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f574acd9bdc0c288eabfdbbcbd50a94fcaf27f6f490b088b194f05184c21ae7d"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_cli::cmd::rebuild_refcounts::run (cognitive 24): rvf_cli::cmd::rebuild_refcounts::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/rebuild_refcounts.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"92981a6ed5c0d34a9b9406e170d7c8a1100d446f3f09dec874f1281c3cb8bfbc"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_launch::qemu::build_command (cognitive 24): rvf_launch::qemu::build_command has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 2, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-launch/src/qemu.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"db81aeb562b904fcb9a0d2860f52814dc433ae06c8374fc84369e82e9b27edc8"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::store::scan_preservable_segments (cognitive 24): rvf_runtime::store::scan_preservable_segments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (7 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":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":4767}}}],"partialFingerprints":{"codehealthFindingId/v1":"607739f1ada2adfeb7b431d82cc7343455964dee4d1c083edfabd7a5dde51a81"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_server::stream_client::read_head (cognitive 24): rvf_server::stream_client::read_head has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/stream_client.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef8ee9eacbdb95d1ea58508b8f790ada74b902d4c38a89049a382bd7155503e"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_triples_block (cognitive 24): SparqlParser::parse_triples_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f6c42cd01ca909d6b5a23641abaa746a2649047f8af51cceb6467725fc7ba"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_relational_expression (cognitive 24): SparqlParser::parse_relational_expression has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3846cba208bc8702ff52a364c39270fa23c2ae7184b63e56d0b0752c9854afd"}},{"ruleId":"D2","level":"warning","message":{"text":"rvm_checkpoint::base64::decode (cognitive 24): rvm_checkpoint::base64::decode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-checkpoint/src/base64.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2569d5df33295b3d94a0536197bdccd371701c9b7f435dcf18514b3b3ce1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"FennelPlacer::place (cognitive 24): FennelPlacer::place has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/fennel.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ee440311f05925b9e1df56639e2170779c975fcd5fe567dbf8305ba5da609d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningBank::run_kmeans (cognitive 24): ReasoningBank::run_kmeans has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 4 (10 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/reasoning_bank.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8072d5e30ced4af5e68ea35cfde056168e870f854ad5252676b4e2a33bfba3b3"}},{"ruleId":"D2","level":"warning","message":{"text":"inferPurpose (cognitive 24): inferPurpose has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 11, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8292195ff5ed74d44460fc96a876f033ee6333a72aee05d8161aeb400b4274b"}},{"ruleId":"D2","level":"warning","message":{"text":"PageHinkley::first_alarm (cognitive 23): PageHinkley::first_alarm has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/adaptive.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b307c32c0598005001ee462f07af3c4711ebf54f9ff9337c991d1ee29dbc2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"McpBrainTools::brain_sync (cognitive 23): McpBrainTools::brain_sync has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"1023b765e880301b008dd9dad7288b47e58222afdc93b160b5fb3ec02791ebb5"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::bin::ruvbrain_worker::run_action (cognitive 23): mcp_brain_server::bin::ruvbrain_worker::run_action has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 4 (9 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/ruvbrain_worker.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaa83a2594f6e861e4d3be921b5dc5fc3a90503f5bc8e33c4694d4dc2a8c8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"micro_hnsw_wasm::merge (cognitive 23): micro_hnsw_wasm::merge has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56ce788387dae9ddc642ae5893f4ebaa99912cff56565992e10f77a80fe3cff"}},{"ruleId":"D2","level":"warning","message":{"text":"CohomologyComputer::row_reduce (cognitive 23): CohomologyComputer::row_reduce has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (10 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/cohomology_group.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c708e14a4626c5dd81537107c7e1a73d1574ba5634251bc631672f9cee04930e"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphLaplacian::apply (cognitive 23): GraphLaplacian::apply has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 4 (7 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/pde_attention/laplacian.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b75e535e2b93443b9f87b45fab698f8f246d2e1977b27bf383204d1bebf2b78"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::quantize::graph_rewrite::insert_qdq_nodes (cognitive 23): ruvector_cnn::quantize::graph_rewrite::insert_qdq_nodes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (8 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6210831ea7f10a90f4160b72e46c49dcae709e1b813e2b735d3c647cf4abf22a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::phi::fiedler_vector (cognitive 23): ruvector_consciousness::phi::fiedler_vector has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 3 (5 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"28535ecbc912d3977dc6cb4ec3b86d410c88e6b867443577a330387af371f4b1"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterExpression::evaluate (cognitive 23): FilterExpression::evaluate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/filtered_search.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"049057bd00dbc4ab27e9cf352812a2a63b3b49bbf1f845cf817f3518fced324b"}},{"ruleId":"D2","level":"warning","message":{"text":"FlatGraph::search_layer (cognitive 23): FlatGraph::search_layer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/flat_graph.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c479dc6814038075c4370652be89fc0148b6272f1db8075ede95ee9ec084f81"}},{"ruleId":"D2","level":"warning","message":{"text":"StageIIIEncoder::encode (cognitive 23): StageIIIEncoder::encode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (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":"crates/ruvector-crv/src/stage_iii.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f579231c1d356466ae1e10e25944f0883155ab0d4085543cf4b1b84b31ffdc"}},{"ruleId":"D2","level":"warning","message":{"text":"ParallelBranchAttention::compute_branch_attention (cognitive 23): ParallelBranchAttention::compute_branch_attention has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (9 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/attention/parallel_branch.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e58cd770dc8cba5615d215bdb29104247e0d6b4dfc167922dcf9f410302ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"VamanaGraph::greedy_search_fast (cognitive 23): VamanaGraph::greedy_search_fast has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (19 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":"crates/ruvector-diskann/src/graph.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d219c4bec2c3fe353c3981199e8cd1188f972efb42edc7d71a154cfa6b49d8e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_entropy_ann::search::beam_expand (cognitive 23): ruvector_entropy_ann::search::beam_expand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd0cca3fa5cba541b0ae4886d91ebb90ea085f55bbb5216d10356d691138b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"GATLayer::forward (cognitive 23): GATLayer::forward has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 4 (8 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/graphmae.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"77604833f711a80ec30c605400359fe6a0d520532b7fd3118b5987317a32432b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShardCoordinator::execute_query (cognitive 23): ShardCoordinator::execute_query has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (5 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":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05f545dd88a940e107fd7ff4f11be9528bd8bd4f52953d343f86475b1297d14"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaptiveRadixTree::get (cognitive 23): AdaptiveRadixTree::get has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/adaptive_radix.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"66214168a8a7a6504d37f9681b04f21bc66d62e0d577b7a101116454468eba49"}},{"ruleId":"D2","level":"warning","message":{"text":"GrangerCausalityExtractor::extract (cognitive 23): GrangerCausalityExtractor::extract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e5a995191c113a5191a8837b9163bb051ceb933ec5513d155c2492a7c8542e"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreGraphTransformer::compute_ppr (cognitive 23): CoreGraphTransformer::compute_ppr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (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":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ba7a4b16f2e0791a5ecf02e231347250b5d3a7e8c9866a9215b0470f10c344"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreGraphTransformer::compute_ppr (cognitive 23): CoreGraphTransformer::compute_ppr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (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":"crates/ruvector-graph-transformer-wasm/src/transformer.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e3e2b78c0f34ce7e1e3ed499a552ad68059a83105c9acb7fec1dcf2317a516"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::workers::integrity::stoer_wagner_mincut (cognitive 23): ruvector_postgres::workers::integrity::stoer_wagner_mincut has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/integrity.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddcdfa3db69f31f68e9aeb8fc23f67f5a2c6b2a37289b5d08300f0a5606e5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"RabitqIndex::build (cognitive 23): RabitqIndex::build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (8 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":"crates/ruvector-py/src/rabitq.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae9659053dfbfa54a3d22d009487922dd557fdda5be0329dd594a33ab24d906"}},{"ruleId":"D2","level":"warning","message":{"text":"RaftNode::handle_append_entries_response (cognitive 23): RaftNode::handle_append_entries_response has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (23 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"308ac7144526a651908368824cb9543022c4e102aa5bf50fad32871446d596e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_robotics::cognitive::behavior_tree::eval (cognitive 23): ruvector_robotics::cognitive::behavior_tree::eval has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 5 (7 pts), loops 3 (6 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/cognitive/behavior_tree.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"691e70acc4e2f80c70bc3c18c9ffef685baa1f009d630d92f03d076131ce6380"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage::new (cognitive 23): Storage::new has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (4 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/src/storage.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1d946e6120ad1f99f1e1cef2a9d222bf4f2a9ef6f79524649cda0db2fff7e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ForwardPushSolver::forward_push_core (cognitive 23): ForwardPushSolver::forward_push_core has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/forward_push.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a145d156fda4e9f361cc01fe15e08a6936d2f41fdb142e3c150de793ef58bfcb"}},{"ruleId":"D2","level":"warning","message":{"text":"TrueSolver::neumann_solve (cognitive 23): TrueSolver::neumann_solve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/true_solver.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d6fa1f743e33200252e8ba242f816a9cc40f176c107232b9cee291431340bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_typesafe_train::train::eval::evaluate (cognitive 23): ruvector_typesafe_train::train::eval::evaluate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/train/eval.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d9747aff14fc10decd2aa813fa0236974d3800d4bbd034cc4a156f7e3fd743"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::semver::bounds (cognitive 23): ruvector_weaver::semver::bounds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/semver.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"95141d9c8d6e3545f94df4797e4210f42d9398f269da4582954c146434df5e69"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::dtb::search_and_print_property (cognitive 23): ruvix_cli::commands::dtb::search_and_print_property has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ruvix_cli::commands::dtb::search_and_print_value) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c55eb437632df16f2fc11bcbad8dd308ef92d00c5806778a1fe536486d208c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::dtb::search_and_print_value (cognitive 23): ruvix_cli::commands::dtb::search_and_print_value has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ruvix_cli::commands::dtb::search_and_print_property) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8fd046ac3610a424ed0a1f2a7a036c3e0dcedf1e7484a2748b87217b9ccf83"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore::remove_node (cognitive 23): GraphStore::remove_node has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 2, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/graph_store.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"878deeb250658602ae132bf27d8455cbb424c93d51819c1245c11f1d1ced119d"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsoleFilter::matches (cognitive 23): ConsoleFilter::matches has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 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":"crates/ruvix/qemu-swarm/src/console.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4306bf8e9f28bf90cea0430872c2fb0fe3c4b20f291d5d761a32c5eaf470ab"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantCompressor::decompress (cognitive 23): TurboQuantCompressor::decompress has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c73979589650a2fdd1929d6f34444504f2f529f66b6649a137938f6e7081cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::gguf::quantization::dequantize_q6_k (cognitive 23): ruvllm::gguf::quantization::dequantize_q6_k has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"673269e6f822dcf9044654b1d5d310de549f95aad416a96eead5ef77dc16f669"}},{"ruleId":"D2","level":"warning","message":{"text":"rvagent_cli::display::print_markdown (cognitive 23): rvagent_cli::display::print_markdown has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/display.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2708b76f9e849b32ec6950464be7e61300d8f26288a1751bf5e3e96453d3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_quant::product::kmeans (cognitive 23): rvf_quant::product::kmeans has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (20 pts), if/else 1 (3 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-quant/src/product.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0554c2b9a85f81dac53db418dc3518857672283932b6f0552fd8e5014bfb632"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamIngest::feed (cognitive 23): StreamIngest::feed has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/ingest.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc07fbafb5fbd9e6930e88ad1fe707c7ba81b4edbf3ebb21a83a12da4f2211a"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_solver_wasm::engine::inject_noise (cognitive 23): rvf_solver_wasm::engine::inject_noise has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/engine.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"9536b85e81587f9c292afaebdc7722e6551ea2255776ad7f963cbc32b38390fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_wire::vec_seg_codec::read_vec_block (cognitive 23): rvf_wire::vec_seg_codec::read_vec_block has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/vec_seg_codec.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"667801efeeda9c4328ad991085ce0e5f35452262971009e11303470a9dfefcd5"}},{"ruleId":"D2","level":"warning","message":{"text":"rvm_wasm::validate_module (cognitive 23): rvm_wasm::validate_module has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/lib.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c13c2a682f7fef05b7f2f62252a6c271e4388e9e0d4827e1868e31469c167"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::graph_cypher::precheck (cognitive 23): ruvector_edge_gateway::graph_cypher::precheck has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/graph_cypher.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e770ea18b16e020b9fe905cee7e375d09ca56f730efa33f9c5236eb858f95f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::graph_cypher_dx::render (cognitive 23): ruvector_edge_gateway::graph_cypher_dx::render has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/graph_cypher_dx.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7caeb64d58aa5d2ac0430ac2e2b6583810250b7c8e33795a22fb9a05624510d"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexAdd::f (cognitive 23): IndexAdd::f has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 4 (8 pts), match/switch 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb3cccf086c38c308b3b312e7418a722d62c2b070c274c5034a934b118458e1"}},{"ruleId":"D2","level":"warning","message":{"text":"CudaStorage::copy_strided_src (cognitive 23): CudaStorage::copy_strided_src has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (22 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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bc0ebc0fe08ce8a052b1c4962bf82333dea057209b072d7308748e7d18ef6c"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ6K::vec_dot_unopt (cognitive 23): BlockQ6K::vec_dot_unopt has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f9f1448458b3a5571c9293b8873ae9f52a5efd6735b1022d29a73359e3a599"}},{"ruleId":"D2","level":"warning","message":{"text":"hasBraceBalance (cognitive 23): hasBraceBalance has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"85da887d3b5516664684c4a06ffadea8e86aaefe8b897e24d5a8d83ba120a2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"BrainTrainer::discover_earth (cognitive 22): BrainTrainer::discover_earth has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (3 pts), match/switch 3 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab12b174c2052d7f4779924b613161d2c1fe741e0fe8874282370783f1ebfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraFederationStore::aggregate (cognitive 22): LoraFederationStore::aggregate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e831ab35172526204a475dd94a1cc2c2f44c23a9f867acc1b65e4790c483130"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryWitnessRepository::verify_chain (cognitive 22): InMemoryWitnessRepository::verify_chain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 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":"crates/prime-radiant/src/governance/repository.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0b65eee8c0ece7cf3e5ff397e58f0fc5433c4eac5d883999d1ad5a78330b35"}},{"ruleId":"D2","level":"warning","message":{"text":"SheafAttention::compute_with_mask (cognitive 22): SheafAttention::compute_with_mask has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), 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":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7757b19d619baf2541b326dcfb575cd0d3fb98c48fd5a77a32dec260b06c7cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"DepthwiseSeparableConv::depthwise_generic (cognitive 22): DepthwiseSeparableConv::depthwise_generic has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 1 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f379a5a1a1b7314d1c4504d1769e2176c0790d66bba74356a0169d2cae5ba0dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::scalar::depthwise_conv_3x3_scalar (cognitive 22): ruvector_cnn::simd::scalar::depthwise_conv_3x3_scalar has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 1 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ruvector_cnn::simd::scalar::max_pool_scalar) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2512d96d365e792bf78d13a9ae933e6fa24b19d1660e2e14670d8734dedf6518"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::simd::scalar::max_pool_scalar (cognitive 22): ruvector_cnn::simd::scalar::max_pool_scalar has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 1 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (ruvector_cnn::simd::scalar::depthwise_conv_3x3_scalar) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b3a901f9bbdfbc4fe0b38c7f23747ed3c00b857cd0868cd36034ce8cd7875e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::phi::compute_product_distribution_fast (cognitive 22): ruvector_consciousness::phi::compute_product_distribution_fast has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"917ea4b93257bc95fae98f7ceab146d03d195c6231c7c7e44757f61dc6c96a09"}},{"ruleId":"D2","level":"warning","message":{"text":"StageIEncoder::encode_stroke (cognitive 22): StageIEncoder::encode_stroke has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/stage_i.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfb56ccb654da1ce22a17e5852611edfec7f59de8d4fb3dc988befcfadf3bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::model_decompiler::extract_layers (cognitive 22): ruvector_decompiler::model_decompiler::extract_layers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_decompiler.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffdca1f933bc1e33c4ce06b17a720cedde5718101f08ef61b5b0af56550dbc2"}},{"ruleId":"D2","level":"warning","message":{"text":"VamanaGraph::build_with_rng (cognitive 22): VamanaGraph::build_with_rng has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/graph.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adb38318f6b11b8206f3567fedce9fc9fccc0f2f6bf2571e1e550b6ce0db169"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_fpga_transformer::artifact::pack::unpack_artifact (cognitive 22): ruvector_fpga_transformer::artifact::pack::unpack_artifact has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/artifact/pack.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e9347026bf437620ed63ebe5cb5757fdc6db6564f3036c3ee702d4193b5819"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::worker::main (cognitive 22): ruvector_hailo_cluster::bin::worker::main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/worker.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7063d8f583f24e74d9a2e30208809137b31f22943989f8000f78c726a631e188"}},{"ruleId":"D2","level":"warning","message":{"text":"AlphaComplex::build (cognitive 22): AlphaComplex::build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 6 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/filtration.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1889b7099daeaeae1276c004f7541b9471bebcc796d7653296df1639048a5a05"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkhornSolver::solve (cognitive 22): SinkhornSolver::solve has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (7 pts), boolean chains 4 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/sinkhorn.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a970db3bc4e9f4ec02c2c7dc402e0ad8e75da4995b53d3fb994bd576aec11a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorNetwork::contract_all (cognitive 22): TensorNetwork::contract_all has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/contraction.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e70a7acb76f22411a77110ab45275dd229018fc9cf47ac8651590b0beafd3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreeLevelHierarchy::compute_mirror_cuts (cognitive 22): ThreeLevelHierarchy::compute_mirror_cuts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 4 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d696c3f4d1befc2b938343af67d2ea8ff10d9a84e694dd3b4acabdac004580"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut::canonical::source_anchored::dinic_maxflow (cognitive 22): ruvector_mincut::canonical::source_anchored::dinic_maxflow has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (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":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"4749fa5bf4747cebb6271a5874d34720d9960ca69c0db854ff45934fb5f5df6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut::canonical::tree_packing::dinic_maxflow (cognitive 22): ruvector_mincut::canonical::tree_packing::dinic_maxflow has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (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":"crates/ruvector-mincut/src/canonical/tree_packing/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b57355ad5f89799ce817be061bd4821cd4f022644c3bd8c3c56e1e33c05b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseCSR::from_boundary_edges (cognitive 22): SparseCSR::from_boundary_edges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/spectral.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bdb312a266695f35ad95a8bfafa29bc5284ea0aa984a52d0455b73b847fc13"}},{"ruleId":"D2","level":"warning","message":{"text":"RealityGraph::query (cognitive 22): RealityGraph::query has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (7 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-perception/src/reality.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a315cdd8b270c6def7371f0cf027c7ec1ba52224a0eab5ebd29b5c28804b92"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_update (cognitive 22): SparqlParser::parse_update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafc057b397f29ed99767a834411e0848fa93df22be5958a540f2d345ea502bc"}},{"ruleId":"D2","level":"warning","message":{"text":"TripleStore::remove (cognitive 22): TripleStore::remove has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/triple_store.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de9c6548649dc2e495ce72852936e4dc285f4b3485043bd89f1698bd81a6f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::execute_describe (cognitive 22): ruvector_postgres::graph::sparql::executor::execute_describe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5279f5e8245cdeaa86085a012f36accd5be7db314ad2d829ccaa95386cbeb52"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::cli::sources::prs (cognitive 22): ruvector_weaver::cli::sources::prs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 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":"crates/ruvector-weaver/src/cli/sources.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"37880cf7eda688a70a688b9c94ba8445e745760a1c88a2aaa7a0b788dc78569b"}},{"ruleId":"D2","level":"warning","message":{"text":"BpeTokenizer::token_to_bytes (cognitive 22): BpeTokenizer::token_to_bytes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/tokenizer.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73f628312ce2344c3c8f94a34c416c81bcabfe9548174df37e022f4e3f1f5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"HadamardTransform::hadamard_butterfly_neon (cognitive 22): HadamardTransform::hadamard_butterfly_neon has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 2 (3 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (HadamardTransform::hadamard_butterfly_avx2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8445ad6b8eff59d0d677f6a97f61bca57dbd59f8d4d221c7f51a45170212904"}},{"ruleId":"D2","level":"warning","message":{"text":"HadamardTransform::hadamard_butterfly_avx2 (cognitive 22): HadamardTransform::hadamard_butterfly_avx2 has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (19 pts), if/else 2 (3 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (HadamardTransform::hadamard_butterfly_neon) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17753bab5c584490e4442ffa7612e67608c61561d3fc8997f91b61036c549dc"}},{"ruleId":"D2","level":"warning","message":{"text":"SpeculativeDecoder::generate_tokens (cognitive 22): SpeculativeDecoder::generate_tokens has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 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":"crates/ruvllm/src/speculative.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"42298b4a534fb83fbc905c9d103e52159ea3f7b06de836a70c2465e9b2c30b04"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm_cli::commands::chat::run (cognitive 22): ruvllm_cli::commands::chat::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (10 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/chat.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b191df71f9eb36525f51b9fefad51651c566e0bc91880bcad1e3a00dcac1eecb"}},{"ruleId":"D2","level":"warning","message":{"text":"Diffuser::make_bidir_kv (cognitive 22): Diffuser::make_bidir_kv has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_retrieval_diffusion/src/lib.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ffca5fb3970eaec5b2490d83e9817831425eed6acec7a98c749066eb881b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"rvagent_cli::tui::render_frame (cognitive 22): rvagent_cli::tui::render_frame has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (9 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/tui.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"099a04a18ca1db986a3148641477b02e916e71ef4afe12ff3044a7b342ae9584"}},{"ruleId":"D2","level":"warning","message":{"text":"UnicodeSecurityChecker::check (cognitive 22): UnicodeSecurityChecker::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/unicode_security.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea08b40ea7545fc094fc4054c20e23d722ca5aff199efded336c52d69970f321"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_wasm::open::parse_vec_entries (cognitive 22): rvf_wasm::open::parse_vec_entries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wasm/src/open.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb43734596c8f1bc6ac3cc15e039c4ff6c1f8b576c83187b9c6bd86d36b4810"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_update (cognitive 22): SparqlParser::parse_update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed8d0a4ae6396b26266b9f371a35a4453c5269e281a627fb4722fb9e8896292"}},{"ruleId":"D2","level":"warning","message":{"text":"rvlite::sparql::executor::execute_describe (cognitive 22): rvlite::sparql::executor::execute_describe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc063f49035b24234243049b801c3e3b3870da0cb3f280d76cc127abc9b7797"}},{"ruleId":"D2","level":"warning","message":{"text":"ProofVerifier::mark_nonce (cognitive 22): ProofVerifier::mark_nonce has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/verify.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"56baa2797711f26a6792ad3e979cd968906c447170e70214e90bd87200569b8d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::api::serve (cognitive 22): ruvector_edge_gateway::api::serve has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (22 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":"edge/gateway/src/api.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e70b7cae5a6ba4a10c8764f12657fabaf65933cb513361c3f7905c1f9dbb361"}},{"ruleId":"D2","level":"warning","message":{"text":"CpuStorage::binary_impl (cognitive 22): CpuStorage::binary_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3367dedb24cc46167175b3743d447d87010f3faed7f7d35375a7afe0191ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"CpuStorage::binary_impl (cognitive 22): CpuStorage::binary_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"110c6ae28757a807cc43bb63d8c0ad9ca70345895dcf9f312698efe5b54251e1"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ3K::to_float (cognitive 22): BlockQ3K::to_float has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f820c9bff320443c6d1371d982c3a98609c622d37f9b87e98a83d7a6d341b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ3K::to_float (cognitive 22): BlockQ3K::to_float has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (7 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a61fe175d2bd64b48ab191ae35d0b34f0bead847c4c524018fefab14c32f658"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ6K::from_float (cognitive 22): BlockQ6K::from_float has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 3 (7 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd51547083c379f3d1acae534ed8fb8f3657685082bd57985859f2fbb282862e"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ6K::vec_dot_unopt (cognitive 22): BlockQ6K::vec_dot_unopt has cognitive complexity 22 (threshold 15). Drivers by points: loops 9 (22 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8741f45372b689218165f3e76915d1526c540389badffc40042dae44fae691d"}},{"ruleId":"D2","level":"warning","message":{"text":"resume_release.precheck (cognitive 22): resume_release.precheck has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), error handling 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":"python/portfolio/resume_release.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea5a82b2f7e7f1fa980ffdea081d2fc1547f735eb3f548a4149a889465b5d28"}},{"ruleId":"D2","level":"warning","message":{"text":"domain (cognitive 22): domain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (6 pts), boolean chains 4, 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":"npm/packages/e-means/integrations/clustering-validation.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8fd711ffcafac86e98ae68974d41dd156cc4bf35de74311354a15345874d12"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorIndex::vamana_insert (cognitive 21): VectorIndex::vamana_insert has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fe31aec369da4e32ad5b0d979c289215533fb1f53cad78c19ef3a00f9f90fa"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonCrawlAdapter::query_cdx_live (cognitive 21): CommonCrawlAdapter::query_cdx_live has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), match/switch 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":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"988cfdb46c050329c021ddee2b9f208647869753d71733656ad616b717350147"}},{"ruleId":"D2","level":"warning","message":{"text":"micro_hnsw_wasm::spike_search (cognitive 21): micro_hnsw_wasm::spike_search has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"308468cd2965bd7e2f1dcd63a6c3b68c582e5bc211e55d2074aa63e76f952f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryCoherenceLayer::find_conflicting_memories (cognitive 21): MemoryCoherenceLayer::find_conflicting_memories has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/memory_layer.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb2f601b7b2486bfb4ec954722fcbb2a9952577b1844466343aa6ba6c74c35b"}},{"ruleId":"D2","level":"warning","message":{"text":"FileStorage::recover_from_wal (cognitive 21): FileStorage::recover_from_wal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ce98dc401b19fdcc14ca87a9a8ab64b1d63b820157a7b7d33f8e66aa1c6e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmCriticalPathAttention::compute_critical_path (cognitive 21): WasmCriticalPathAttention::compute_critical_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts), match/switch 1 (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":"crates/ruvector-attention-unified-wasm/src/dag.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5125f9d943afde6e0423b4df5bfcdadd0835c176bdf84c96abbd1d659de1c33"}},{"ruleId":"D2","level":"warning","message":{"text":"InfoNCELoss::forward_with_pairs (cognitive 21): InfoNCELoss::forward_with_pairs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/infonce.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"17048c35003766d6a1ab917da10488e94bbd8d323b94684fc621ec4e30414927"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::quantize::graph_rewrite::fuse_batchnorm_to_conv (cognitive 21): ruvector_cnn::quantize::graph_rewrite::fuse_batchnorm_to_conv has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (10 pts), loops 3 (6 pts), if/else 2 (5 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acd8e65d6c96e14e7777559d7aeb4fe0c3211dc42135343b95b1692d8f46287"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantumCollapseEngine::collapse_to_mip (cognitive 21): QuantumCollapseEngine::collapse_to_mip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/collapse.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fd91d234311794f5bddd73e38d22df69d6258a2f5db75d8db083169eca7294"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_core::quantization::kmeans_clustering (cognitive 21): ruvector_core::quantization::kmeans_clustering has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 1 (3 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc8ab9a8ad6512ba99c4f5b48ab6d992380d7a8fec638cc7deb208355a6e2b1"}},{"ruleId":"D2","level":"warning","message":{"text":"CriticalPathAttention::compute_critical_path (cognitive 21): CriticalPathAttention::compute_critical_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts), match/switch 1 (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":"crates/ruvector-dag/src/attention/critical_path.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"495fcd652d0b1f0c3dda1d2204258455d18f3eeea1f8f7f1d8b8fa7f8fb8306b"}},{"ruleId":"D2","level":"warning","message":{"text":"HierarchicalLorentzAttention::compute_depths (cognitive 21): HierarchicalLorentzAttention::compute_depths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (10 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/attention/hierarchical_lorentz.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a5612e87b685217564a3d8c15df1ce5a5400077c19e1fa339c31f4d7667c39"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanningDomain::score_plan (cognitive 21): PlanningDomain::score_plan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/planning.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b4b3a37919bb0dddd09d456601083c43a5bd27e2bc62c74da78aa868eff68f"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorShard::ensure_index_with (cognitive 21): VectorShard::ensure_index_with has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/persist.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f95c9bc8bbb7c64de6f74d0108069b749956a4d71a38bcd4169c17b66ecbff1"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorShard::plan_upsert (cognitive 21): VectorShard::plan_upsert has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/write.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd35b0d22804cc7342a8ac3eb67fbbe86049d5845b5c5ef9cc10b8dbb5c0b37e"}},{"ruleId":"D2","level":"warning","message":{"text":"GeodesicMessagePassing::propagate (cognitive 21): GeodesicMessagePassing::propagate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/manifold.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"656ede921dde521cbb226e2c2b507f529349005cbb5a3da40034fbb9c3eff934"}},{"ruleId":"D2","level":"warning","message":{"text":"RetrocausalAttention::causal_pass (cognitive 21): RetrocausalAttention::causal_pass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (10 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc9c12296ac685c2ab4e34d56595a2559d0187d8409e1cc48bf71a5f250bbad"}},{"ruleId":"D2","level":"warning","message":{"text":"HailoEmbedder::open_inner (cognitive 21): HailoEmbedder::open_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo/src/lib.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e12745495e40b7f8bc2321e3717ac7ace844aa4d3ad90a80ed0c7e15dc52094"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hyperbolic_hnsw::poincare::frechet_mean (cognitive 21): ruvector_hyperbolic_hnsw::poincare::frechet_mean has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 6 (9 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw/src/poincare.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c94f21d393573f823a1ad07488ed8c8f244b84d20f38105a0e7ef1b72a04bd"}},{"ruleId":"D2","level":"warning","message":{"text":"KgeModel::add_triples_json (cognitive 21): KgeModel::add_triples_json has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdb33f98c9458726afe5f156c3e855993d1537d5733ef0622fa7d0845e00006"}},{"ruleId":"D2","level":"warning","message":{"text":"KgeModel::add_triples_json (cognitive 21): KgeModel::add_triples_json has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-wasm/src/ops.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5862bd43f533f3175ae0e4a99f43bb03689024fa54ce55816a825e982a35588"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorTrain::dot (cognitive 21): TensorTrain::dot has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/tensor_train.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"78721638872c3bbfc0c3c1caa859d36f52bdde8fc9ed342c88af4eff74665639"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::insert (cognitive 21): HnswGraph::insert has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 6 (8 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-matryoshka/src/hnsw.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dab30b6bce3481d6bd61b07e84d5e5a3c9117db8a85c27dd878733db96d66f5"}},{"ruleId":"D2","level":"warning","message":{"text":"CactusGraph::enumerate_min_cuts (cognitive 21): CactusGraph::enumerate_min_cuts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d404ae23d8d86ac89176bb87f6084a8afbb9b2c9f155b734ddca8b9754fc1167"}},{"ruleId":"D2","level":"warning","message":{"text":"EulerTourTree::split (cognitive 21): EulerTourTree::split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (21 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/euler/mod.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"49984a2c431abae0a82d9215e4a4b09b32c875024f9d4e46e6f7c17f82daf26b"}},{"ruleId":"D2","level":"warning","message":{"text":"SubpolynomialMinCut::certify_cuts (cognitive 21): SubpolynomialMinCut::certify_cuts has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 3 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0750cce07cbd0587ba4303f096133b1708d3512e5b9c4b553bad28aa6fec0578"}},{"ruleId":"D2","level":"warning","message":{"text":"SpeculativeDecoder::verify_drafts (cognitive 21): SpeculativeDecoder::verify_drafts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/speculative.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ade1f2ca658c72b0771d20c35b768503235949b09a4a63a46c2d74e921dabb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_perception::coherence::detect_boundary (cognitive 21): ruvector_perception::coherence::detect_boundary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 6 (9 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-perception/src/coherence.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"325d95f056ce307a0de2268ac6220e66b47ce4ef93b536e861e186b2612819f2"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_negated_property_set (cognitive 21): SparqlParser::parse_negated_property_set has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ca51a670e1acb32b70a01fd9ccb423825a6966a50b194bd8cbdc56adad956d"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::insert (cognitive 21): HnswIndex::insert has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 6 (8 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"48eab0ccdd7d4b57907e8958416ba54d5a9c2f5dbca2c7825de5dd95e235a733"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_group (cognitive 21): ruvector_postgres::graph::sparql::executor::evaluate_group has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (8 pts), match/switch 2 (7 pts), if/else 2 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"0873e1d51dca5b0aac9af7111020545ac6baf453a687805e10dcf389b50a83b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::hnsw_am::hnsw_insert_vector (cognitive 21): ruvector_postgres::index::hnsw_am::hnsw_insert_vector has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07d9812e2a08a86be61fdd76b9244780a5bee589c3ef0e33647a278293ed07c"}},{"ruleId":"D2","level":"warning","message":{"text":"RoboticsDomain::score_skill_sequence (cognitive 21): RoboticsDomain::score_skill_sequence has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/domain_expansion.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16b8f0e791245ee041032b4946c7f783215bd1df48b0b0da116f82c8ea585a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_robotics::perception::clustering::cluster_point_cloud (cognitive 21): ruvector_robotics::perception::clustering::cluster_point_cloud has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/perception/clustering.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcbc23676f2450134152db2e8fef168d5f88a669ede1beb33763a765c2dd6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalStorage::list (cognitive 21): LocalStorage::list has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (20 pts), 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":"crates/ruvector-snapshot/src/storage.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4e9d7fc6ebc776a3afba0c5f76924e6a6a029ba6c6a576a5e53b9e47118571"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_staged_workspace::adapter::handle (cognitive 21): ruvector_staged_workspace::adapter::handle has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (17 pts), if/else 1 (2 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-staged-workspace/src/adapter.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcddbfcc0b0621b6f589e47f6e09d0decdb9eb3ae747d4410efc10bb4ccc6a79"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_typesafe_core::engine::fit::crossfit_class_logits (cognitive 21): ruvector_typesafe_core::engine::fit::crossfit_class_logits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine/fit.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"879520bbdb6a922ab026728e9b340e8ebe164461d947768df0e7f32585134960"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::cli::seo::propose_cmd (cognitive 21): ruvector_weaver::cli::seo::propose_cmd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f964a3801314065f09b98cfdc3de76b293cd22a043e30aef63006bdb930a03"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::gate::gate (cognitive 21): ruvector_weaver::gate::gate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/gate.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2714aa932e7188008a6a9c09bcfad5897c69fab73e32a998c552cd0fd12cf"}},{"ruleId":"D2","level":"warning","message":{"text":"TierRouter::route (cognitive 21): TierRouter::route has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/proof/src/routing.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e16258f24278dcc61d5fd3d32000861b91a33bf1ab4a5378bec9c6dc30f9f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"CandleBackend::get_safetensors_files (cognitive 21): CandleBackend::get_safetensors_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e8b79b463f19a6effc79c80e44f38b42160026fe7d4fe2b9c87a6643dfd655"}},{"ruleId":"D2","level":"warning","message":{"text":"CandleBackend::generate_detailed (cognitive 21): CandleBackend::generate_detailed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b807b83c3659a467d4e2d413866de6bd5181fe3032f1502e97fb6ec6af811261"}},{"ruleId":"D2","level":"warning","message":{"text":"RlmEmbedder::embed (cognitive 21): RlmEmbedder::embed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/rlm_embedder.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7121c92b1a8ddb4dc143de358e4063ab359a54e65d10afc9334ff4d821fb77"}},{"ruleId":"D2","level":"warning","message":{"text":"PretrainPipeline::run_synthetic_phase (cognitive 21): PretrainPipeline::run_synthetic_phase has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 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":"crates/ruvllm/src/claude_flow/pretrain_pipeline.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b99d19861fa31c1c4bbd8984c895ed465e1066520a2e651911a64c4a822b416"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorCategory::classify (cognitive 21): ErrorCategory::classify has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/error_recovery.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f2ea01b03aef9d57593238af5221a2e83b829187c8008548e04613e871261b"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolDatasetGenerator::generate_param_value (cognitive 21): ToolDatasetGenerator::generate_param_value has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/tool_dataset.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbfb0750342727387e72a52d373a67399cde38b75858aa5c261931cdb3a88ca"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskContext::from_metadata (cognitive 21): TaskContext::from_metadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (7 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/context.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca74b60f0bc87a1bb6183888e5dc6d10eb7e2123a65cdaec2a018c9ead54b6c6"}},{"ruleId":"D2","level":"warning","message":{"text":"StateBackend::ls_info (cognitive 21): StateBackend::ls_info has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, 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":"crates/rvAgent/rvagent-backends/src/state.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0cd617e17941c828a6a1ba5d4796392380460f208cd420cdf0ef70e80659d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseIdSet::deserialize (cognitive 21): SparseIdSet::deserialize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/sparse_ids.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49b10b075a8229d94a98368b20328eefbe5fcc4f2a362e65a76356ceb872db6"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::read_path::inspect_tail (cognitive 21): rvf_runtime::read_path::inspect_tail has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ce0a450131c52da93c24d530a556d98e84e01b0cbad1e112a8b535cbf57d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_server::http::serve_static_file (cognitive 21): rvf_server::http::serve_static_file has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/http.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40ad6009572da8664def89a250d9ca29e74d4292660917054267bc840196f19"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaptiveSolver::compute_range (cognitive 21): AdaptiveSolver::compute_range has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/engine.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa05604947e19b589e1d37871c4d01cf683fe85d3fdc70a4ffa586e1f67aa42"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_forge_core::inspect::declared_capabilities (cognitive 21): rvf_forge_core::inspect::declared_capabilities has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf-forge-core/src/inspect.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"527a13b8669194b2b2f45e0232fec78f7a7197e8e1c6bf4141ca66cc3ce3f0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::scan_number (cognitive 21): Lexer::scan_number has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/lexer.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f9820e1f5d0d7bce5332ec0ea8c6e4e2505937bf7b1fa36f8e31ae0aa286a6"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_negated_property_set (cognitive 21): SparqlParser::parse_negated_property_set has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fbca0b6dcacd23cc16c9743153869354eb0e89d0708cea01a3ad8819809d80"}},{"ruleId":"D2","level":"warning","message":{"text":"rvm_coherence::mincut::stoer_wagner_mincut (cognitive 21): rvm_coherence::mincut::stoer_wagner_mincut has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/mincut.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ff5d15bfba0b22c031c1e7e63eea42368f0f910128bf9f4003570e967e4a70"}},{"ruleId":"D2","level":"warning","message":{"text":"rvm_memory::reconstruction::decompress (cognitive 21): rvm_memory::reconstruction::decompress has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/reconstruction.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"056a70bfb33146b09b9c91b0c6e6ed9f9d86c9faa3a8d27fdaca0ad47d8c935f"}},{"ruleId":"D2","level":"warning","message":{"text":"sonic_ct::reconstruction::landweber (cognitive 21): sonic_ct::reconstruction::landweber has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 3 (7 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/reconstruction.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"acac9f28a12a773c17a5de0cd70bf387281a704c85e738939c308484a1619339"}},{"ruleId":"D2","level":"warning","message":{"text":"AvgPool2D::f (cognitive 21): AvgPool2D::f has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2187087c65f29a4974497b5d82a7e2f63f32b9ca043cf9455289cf689a1f08"}},{"ruleId":"D2","level":"warning","message":{"text":"AvgPool2D::f (cognitive 21): AvgPool2D::f has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca3737b4c921a237d733f688fa8ae78b28204e0f0213786614f8ad32375d8fd"}},{"ruleId":"D2","level":"warning","message":{"text":"MatMul::f (cognitive 21): MatMul::f has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 6, loops 3 (6 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"109e7ac4ac851d5e2b555f731688522b199db20131f3e44ee626d20072ecb3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"MatMul::f (cognitive 21): MatMul::f has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 8, if/else 6, loops 3 (6 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f23f78d21b43aad14bd9bd6eb003ede0296f70323cde296b93086b4468e2cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ2K::from_float_imatrix (cognitive 21): BlockQ2K::from_float_imatrix has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c72be3fa6141c14e70583c8e8c2f5ab9388a0bcdfdb46a4499baf28ed63fd9e"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ6K::from_float (cognitive 21): BlockQ6K::from_float has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 2 (6 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (BlockQ6K::from_float_imatrix) 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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c4b118eeeb15701041b561ed5e7010b574d7cc27df41af33b40ea146692d85"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ6K::from_float_imatrix (cognitive 21): BlockQ6K::from_float_imatrix has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 2 (6 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (BlockQ6K::from_float) 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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40e71910c431c67db04cff67371e58200c650b897777b9cda2a1dfecae85ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"isInsideStringOrComment (cognitive 21): isInsideStringOrComment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, 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":"npm/packages/ruvector/src/decompiler/reference-tracker.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9815e1774bfedaaa80f123a5aa311c1f46aa01e1f8fccf8517271bbc065392f9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/static/chatui/welcome.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"31359b4f430f1a8150dda71ec853a6db3d8f1bb46c595671e2fe7ea8a26fb39a"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactGraph::recompute_components (cognitive 20): CompactGraph::recompute_components has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5, boolean chains 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/shard.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"922b89f1398cfc42f7f2da210d497a755568bc43d78593d326b9396a520c7e04"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::web_ingest::ingest_batch (cognitive 20): mcp_brain_server::web_ingest::ingest_batch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/web_ingest.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c52b6279919c8b8d3657752467332eba000802b53c9fb41e81880a229b8f46"}},{"ruleId":"D2","level":"warning","message":{"text":"prime_radiant::simd::matrix::matmul_blocked (cognitive 20): prime_radiant::simd::matrix::matmul_blocked has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (20 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/matrix.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"510d2ed46992883a36c6bb7107a3642938b73aa415eda1c03ad8d57e3e878aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cli::cli::graph::run_shell (cognitive 20): ruvector_cli::cli::graph::run_shell has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1547f8c1383fb9dfa89f4e4650dca08a77826674ad4b3e6538247d42012163"}},{"ruleId":"D2","level":"warning","message":{"text":"GreedyBisectionPhiEngine::compute_phi (cognitive 20): GreedyBisectionPhiEngine::compute_phi has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e94bc2aec4c508797570a47717c1046cfd402a72c79fb20bf01cf0ff49d95d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::parser::extract_declarations (cognitive 20): ruvector_decompiler::parser::extract_declarations has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 3 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/parser.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"806e72d50c791bacda7ab16d46a633e3ac370c6e795f1b56f7962ea3119a9f60"}},{"ruleId":"D2","level":"warning","message":{"text":"CoherenceBeam::search (cognitive 20): CoherenceBeam::search has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (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":"crates/ruvector-diverse-beam/src/search.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6117b22bf1b3448dd393d0f8c9c228a3dba2412426f7fc2e16f379237e5b051a"}},{"ruleId":"D2","level":"warning","message":{"text":"RustSynthesisDomain::score_solution (cognitive 20): RustSynthesisDomain::score_solution has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/rust_synthesis.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5721d44d182d3f6641b46b0d9c53e627402c3b048e5142a66ec5f6eafa9cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_authz::client::validate_registration (cognitive 20): ruvector_edge_authz::client::validate_registration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-authz/src/client.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"def7901921b82a20d9bcf53def42736d49f85f7ece3533adc7a89626590f2a95"}},{"ruleId":"D2","level":"warning","message":{"text":"LagrangianAttention::forward (cognitive 20): LagrangianAttention::forward has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/physics.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e281d75be86d46743c6a6d0305c534cc9b3f522b3abe18330501ee5e5157d73b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_transformer::verified_training::check_invariant (cognitive 20): ruvector_graph_transformer::verified_training::check_invariant has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/verified_training.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"22687a57e62a2f9fd3e2230dda2f4d7dad722150fee722fa177f9085ade13c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"HyperbolicHnsw::search_layer (cognitive 20): HyperbolicHnsw::search_layer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw/src/hnsw.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"887a7e4837fd2b867dd44558ecc90a77626747b4f03d93e7980bb961f81519e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectralClustering::normalized_cut (cognitive 20): SpectralClustering::normalized_cut has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/clustering.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"4422d866ab1e13a733ed5a02eaeec9b663d02693681fff89096cd33660964363"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_math::tensor_networks::cp_decomposition::update_factor_als (cognitive 20): ruvector_math::tensor_networks::cp_decomposition::update_factor_als has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/cp_decomposition.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b265e583d4891e1b58d2585a43e924d9b14dd3eab0cb398747a6bd997d8300a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreeLevelHierarchy::build_preclusters (cognitive 20): ThreeLevelHierarchy::build_preclusters has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6a1798b47a47b758042236cc3eac0f3bc1420b085b381b4e09cd025927a2f5"}},{"ruleId":"D2","level":"warning","message":{"text":"PolylogConnectivity::find_replacement (cognitive 20): PolylogConnectivity::find_replacement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/connectivity/polylog.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf41b40cebb072bed84d9ba70afff2ceb5c9b2c01e8c59fdaf85c81179bdb085"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut_gated_transformer::attention::window::sparse_attention_with_mincut_mask (cognitive 20): ruvector_mincut_gated_transformer::attention::window::sparse_attention_with_mincut_mask has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/window.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"957e342bd0d0f72993668073aa832e17cb6df99d09fe43c50b98265b8e02899d"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_projection (cognitive 20): SparqlParser::parse_projection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 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":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5060ef062f2cae6f6c5289746311c50199a267198cc711719a24131eb3921b83"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductQuantizer::kmeans (cognitive 20): ProductQuantizer::kmeans has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/product.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f484185e0c55fd7cd3d3460749cbf279affb7dc1384ce864b7d206012d02fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::evaluate_binary_op (cognitive 20): ruvector_postgres::graph::sparql::executor::evaluate_binary_op has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 3 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f1cc787413501d2d203b88281a1914702c1bb7af32ab1a552240c245932579"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::triple_store::parse_literal_string (cognitive 20): ruvector_postgres::graph::sparql::triple_store::parse_literal_string has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/triple_store.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e95b454bd4401de2d305bc4f653c641792a2f88b6c9b7fa0c5e935f671396be"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::traversal::bfs (cognitive 20): ruvector_postgres::graph::traversal::bfs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/traversal.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca934df44ee078ef49f63c7a271d911979122f296eb92b96bb12605d93cd8560"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::scan::parse_ivfflat_config (cognitive 20): ruvector_postgres::index::scan::parse_ivfflat_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (4 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/scan.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"148fd86c0576323c5942f8f4902c380452beaa6a3b7cb28ac422304bda07e2cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_pq_search::main (cognitive 20): ruvector_pq_search::main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 5, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-pq-search/src/main.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2de8d062b03bcbd615594345511fb1e45624385604050a8281880b877c3c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_py::graph::cypher_eval::eval_binary (cognitive 20): ruvector_py::graph::cypher_eval::eval_binary has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 9 (14 pts), boolean chains 3, if/else 3 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph/cypher_eval.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e22a9464d3a1b8a841038ad70e035a1b91ff646efb2ae429e8d0783140fb65"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_retrieval_receipt::bin::benchmark::run_state_anchor_interval (cognitive 20): ruvector_retrieval_receipt::bin::benchmark::run_state_anchor_interval has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (7 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b0572a2ff0735139ab1b8bf0e1b7fe5f25b1271f4cf7631a65857629f21431"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_robotics::planning::neighbors_into (cognitive 20): ruvector_robotics::planning::neighbors_into has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/planning.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f36f97b5f19a52f1e4b00cb9fd5d147939ad5c39c7945ff1dd25ec27b5a1db3"}},{"ruleId":"D2","level":"warning","message":{"text":"ConjugateGradientSolver::solve_inner (cognitive 20): ConjugateGradientSolver::solve_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"398ec471e9e5d67b467b24f5bc421a1f758dee0c8405e4f588ac415e1abdec1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_solver_wasm::neumann_solve (cognitive 20): ruvector_solver_wasm::neumann_solve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 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":"crates/ruvector-solver-wasm/src/lib.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed37a531d0053a3c1a69395b52707f41014e90781d1913f10d97f113f1db719b"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiProbe::train (cognitive 20): MultiProbe::train has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 2 (5 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/heads/probe.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb996b88b070ca4052819d346963db3ebaa8e588228c9538f0e596ef1265ee34"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::propose::propose (cognitive 20): ruvector_weaver::propose::propose has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/propose.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"186a5e90f416b2d38b5c63261a83284438c47b5ecdce1c7b9f4433de3d38c712"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::scan::walk (cognitive 20): ruvector_weaver::scan::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/scan/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ea0cecbbb9372ac2d2e9bbc821f39b1ee87558c859826fc8658f0e944e414c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::seo::propose::propose_package (cognitive 20): ruvector_weaver::seo::propose::propose_package has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/propose.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"db665c369c78cc5b88edf6cdd59e44bb52fdf68d7a1a5bd8fcdbee7fc38564ac"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::monitor::auto_detect_port (cognitive 20): ruvix_cli::commands::monitor::auto_detect_port has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/monitor.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2182a4eb4e7030384819a03096fb0f7f5f80e59e984c24028033319e3fb831"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::security::execute_audit (cognitive 20): ruvix_cli::commands::security::execute_audit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/security.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e20122d656d76b800532b6a37eab0b7e5d2f471c12c4cd31e42df82832777b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_rpi_boot::config::parse_arg (cognitive 20): ruvix_rpi_boot::config::parse_arg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/rpi-boot/src/config.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b481f541ee01df05f2002ba3edd932a04c1fd58e5fe27a75a07321f37a90a54"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalSuite::citation_correctness (cognitive 20): EvalSuite::citation_correctness has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/eval.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc56ce0651694df70861e6437b2b563278b2b91de484ae9077553c209134b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelSelector::apply_criteria (cognitive 20): ModelSelector::apply_criteria has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (8 pts), boolean chains 3 (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":"crates/ruvllm/src/claude_flow/model_router.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"c853179edfda2a1f072fd5b5bd5ce4634e83614b145d7d57a74ee7aaf9055ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffAnalyzer::analyze_minimality (cognitive 20): DiffAnalyzer::analyze_minimality has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/diff_quality.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"001311847383fa00111cdd0111f4621000c2258885b193e7ab9dbb6162cce038"}},{"ruleId":"D2","level":"warning","message":{"text":"CoherenceValidator::validate_semantic_consistency (cognitive 20): CoherenceValidator::validate_semantic_consistency has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f875d2542e27800b4550e7558f708d92d818798b2d629a8e2d5f7296dccd3e65"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfidenceChecker::identify_weak_points (cognitive 20): ConfidenceChecker::identify_weak_points has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/confidence.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eca2ddf92172b18f5ed42beb454fdac05637d390fbead572f8c5e0f81bcf835"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorPatternLearner::suggest_recovery (cognitive 20): ErrorPatternLearner::suggest_recovery has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/error_recovery.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"801c144e8d87748a24d3970b602bf17a6c4c9e4779fafa768c401beabbeeaeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinuousBatchScheduler::schedule_prefill_requests (cognitive 20): ContinuousBatchScheduler::schedule_prefill_requests has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 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":"crates/ruvllm/src/serving/scheduler.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffb14e0889511045c61a988f4a2c8a6c32aa9d73534123e4865000409acabdc"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiClient::build_request (cognitive 20): GeminiClient::build_request has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/gemini.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5740c7300114e4e1967847bff3df25f23f33370a0bf288d4eaf3bd56cb75d10"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::insert (cognitive 20): HnswGraph::insert has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 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":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41e4635b03caa447348ddab8dfd4658ae738485adff5958fe636de2bd49e78c"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgressiveIndex::search_layer_a_only (cognitive 20): ProgressiveIndex::search_layer_a_only has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/progressive.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"222397dc7a4f14d865e66d3929a129632bc113c363b9042dde108ff7be60cdfa"}},{"ruleId":"D2","level":"warning","message":{"text":"MicroVm::shutdown (cognitive 20): MicroVm::shutdown has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-launch/src/lib.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"009025c5f5ecd95b6cec608c4ddcd53b12c34606acdfd7d174a478109f2e3c22"}},{"ruleId":"D2","level":"warning","message":{"text":"QrEncoder::encode (cognitive 20): QrEncoder::encode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_encode.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fe45f23e7a9bd23acfef72765cc87ea0800cf9ce8cdd58b7ad8fe19b758479"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::query_exact_scan (cognitive 20): RvfStore::query_exact_scan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab771407d60d6d7afbf20df6ee188c61700547e610fa56cb236b000e22712b99"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::compress::decompress_with_limit (cognitive 20): rvf_runtime::compress::decompress_with_limit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/compress.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea915420385525256ff83daf3f4f43a4c3a9364ed5f68927cb6c2b790ed818ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::index_path::decode_graph (cognitive 20): rvf_runtime::index_path::decode_graph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/index_path.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"302790e6f82f4f6da36042272a6e9ac9068beaf70e9112d0cb6c9e9ec4d30f40"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamDescriptorBuilder::build (cognitive 20): StreamDescriptorBuilder::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/builder.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6380deabbdce9ec923a4234100be793674da0efc08c2c60484f418ed9ab613"}},{"ruleId":"D2","level":"warning","message":{"text":"rvforge_registry::bin::rvforge-registry-check::check_packages (cognitive 20): rvforge_registry::bin::rvforge-registry-check::check_packages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/bin/rvforge-registry-check.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"96739af8593a63cc89367f00d8eab88c0433f30b4b56e5cfed605a61fb331657"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_projection (cognitive 20): SparqlParser::parse_projection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 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":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"404db69e890c8a3e228cfe47d18205cb6872cb5590fb164be743bc6bd8695d78"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionManager::create (cognitive 20): RegionManager::create has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/region.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ae7e832b0aeec750d36789b0f39fadd6e19bcdb7ea8c49a586882d1f4ccbe8"}},{"ruleId":"D2","level":"warning","message":{"text":"sonic_ct::model::train (cognitive 20): sonic_ct::model::train has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (10 pts), loops 4 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/model.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b3721d822580284ac1b112101523f6dd4e8d61b11e43b166f73ce23e8f9ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"sonic_ct::reconstruction::sart (cognitive 20): sonic_ct::reconstruction::sart has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/reconstruction.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"68590cbce5cf6dceca6b083a003ebd8c5614f8f6a103aa7e175f69d819cfc2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"sonic_ct_wasm::sct_vol_step (cognitive 20): sonic_ct_wasm::sct_vol_step has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (3 pts), match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct-wasm/src/lib.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"478ee01aeca324de81f59f2d67e67453722de1512204a93b861fb1b8c66b8329"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvTranspose1D::f (cognitive 20): ConvTranspose1D::f has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d022d3c87cc7823ea8f82e25828c5d3cb7721ce9b0e9fe7174c64080149824b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ConvTranspose1D::f (cognitive 20): ConvTranspose1D::f has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (8 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"82293c3213a16efec177bee6b23e5b352066b78265c45972a1725250fc303985"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ8K::from_float (cognitive 20): BlockQ8K::from_float has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 4 (7 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada19f4bd1f8568d30f98a2ddfdfadb455615d4f718bd34d1cdfe4af6ae0c843"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cuda_backend::gemm_config (cognitive 20): candle_core::cuda_backend::gemm_config has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 6, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6eab68832d099e85110693f49927d2e40f870846f17991b46298eff9d32f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cuda_backend::gemm_config (cognitive 20): candle_core::cuda_backend::gemm_config has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 6, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b99231fa3cfbc136135bdc7ac45ac85ebce00f1a55511ef256372e708f496ba"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::avx::vec_dot_q3k_q8k (cognitive 20): candle_core::quantized::avx::vec_dot_q3k_q8k has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0578f54b639e8decb87643895ed0cb7eb1c500456eca889e112ea828803a2bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::avx::vec_dot_q3k_q8k (cognitive 20): candle_core::quantized::avx::vec_dot_q3k_q8k has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 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":"patches/candle-core-0.9.2/src/quantized/avx.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"351ceafa07897e7d1fa1e81db061e84bf7db732365ed5194ed482fceb6ec349d"}},{"ruleId":"D2","level":"warning","message":{"text":"isStatementBoundaryAfterBrace (cognitive 20): isStatementBoundaryAfterBrace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (6 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":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a3765b580fcab66701e38686351a3f7282d9066ef884d6cb36af47402f6e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::bin::local::brain_search (cognitive 19): mcp_brain_server::bin::local::brain_search has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ced47ca18eecf2fbf4debcfef84e075da96dad7f77fd47ee6bf4dfdd6883b4"}},{"ruleId":"D2","level":"warning","message":{"text":"photonlayer_core::detector::capture_with (cognitive 19): photonlayer_core::detector::capture_with has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-core/src/detector.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5126025b7b5f7db0d2e6cc09999cb821dd42f378554b4123afa87d299b8ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"EdgeFeaturedAttention::compute_with_edges (cognitive 19): EdgeFeaturedAttention::compute_with_edges has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 6 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/edge_featured.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ada1bfbb8dffb95815a90db1b8b27f7ca9901bba5ff4a88602249aa23e0c45"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_bench::bin::turbo4_ablation::main (cognitive 19): ruvector_bench::bin::turbo4_ablation::main has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (7 pts), if/else 3 (6 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/turbo4_ablation.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c877591984a1231a49e50822e74adfccf26adbee375509ce03cd6379fabe5af"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedDepthwiseConv2d::from_fp32 (cognitive 19): QuantizedDepthwiseConv2d::from_fp32 has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 4 (6 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_depthwise.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a79605db347006a7c6ddee7bd038138f05f90b0ab222809ae6d133ce1e0d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_cnn::quantize::graph_rewrite::fuse_zp_to_bias (cognitive 19): ruvector_cnn::quantize::graph_rewrite::fuse_zp_to_bias has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (8 pts), loops 3 (6 pts), if/else 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8818fa0d7720752c280329c57ff84a6c6ac86c12a3b1722c158dbc582c0c415"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_dag_wasm::compute_attention (cognitive 19): ruvector_dag_wasm::compute_attention has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag-wasm/src/lib.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb505cda824339cc8c56475457f0789023e61f646998ef9952b8181da23c25d"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaHnsw::connect_node (cognitive 19): DeltaHnsw::connect_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-index/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0428c7b55905227741f24b20bca888ebf6831577b51cbfd56c8707c99b6b3466"}},{"ruleId":"D2","level":"warning","message":{"text":"PayloadIndex::add (cognitive 19): PayloadIndex::add has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-filter/src/index.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3d436b7b2d8f0420400c1d2d46ecda9afb6147660cf6edeb47de72a8da430d"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::matmul (cognitive 19): Tensor::matmul has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/tensor.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"597ec4fd93779bf5a3b9af0b2f4d93fff81644e38bb03af7b3cfceb48a342215"}},{"ruleId":"D2","level":"warning","message":{"text":"Federation::execute_federated (cognitive 19): Federation::execute_federated has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (8 pts), loops 3 (6 pts), if/else 4 (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":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee59119cd65652c0b38959531488df5a2a81cb43790a9b447c1dbbf3549cc91"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphCondenser::condense (cognitive 19): GraphCondenser::condense has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/condense.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a315ffc960d2a0f42710432f75cef6c34167d4f0d972d890821367e2480c62"}},{"ruleId":"D2","level":"warning","message":{"text":"GromovWasserstein::solve (cognitive 19): GromovWasserstein::solve has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"50818de83ca3b99db870f50063d793937357aacd816fce28ee03b8736495bf3c"}},{"ruleId":"D2","level":"warning","message":{"text":"SOSChecker::is_psd (cognitive 19): SOSChecker::is_psd has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/sos.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef38bc61d6879f28abfb045d183fdf9d179b6d4302753c91d91107aca3f6c26"}},{"ruleId":"D2","level":"warning","message":{"text":"TropicalNeuralAnalysis::decision_boundary_complexity (cognitive 19): TropicalNeuralAnalysis::decision_boundary_complexity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (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":"crates/ruvector-math/src/tropical/neural_analysis.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea07311de09459f1145ba3532bf272f664c35cc2147cac247ab28d04f7754dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedInstance::query (cognitive 19): BoundedInstance::query has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/instance/bounded.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d65286d0fcb8fd1d715df094774b6d4fcb68eeb9f7321a58ef791a0f08d50b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SimdDistanceOps::relax_batch (cognitive 19): SimdDistanceOps::relax_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/simd_distance.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"74811957faaf0a84da824401067f0c0718b2af649e3dd78706ea937dbe690eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"MetaCognitiveMinCut::strange_loop_step (cognitive 19): MetaCognitiveMinCut::strange_loop_step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 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":"crates/ruvector-mincut/src/snn/strange_loop.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"586d886789954e1deb9ecf0089abaa51aad3a441752e6189cabc21185fd12137"}},{"ruleId":"D2","level":"warning","message":{"text":"EpropNetwork::forward (cognitive 19): EpropNetwork::forward has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/plasticity/eprop.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f3e9bc7687a9d44c230f419cb4900a7268c7fb991d2235be7c2fd951815229"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_quads (cognitive 19): SparqlParser::parse_quads has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"5241913be658bd903384cf9343d87fc9325aa1ec5f2db97ee84b151cb7462d52"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::connect (cognitive 19): HnswIndex::connect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (19 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":"crates/ruvector-postgres/src/index/hnsw.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aaf13bd6bf879813e56bf70c866dbb86516b0e516882e8983021a8be314d48"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::apply_modifiers (cognitive 19): ruvector_postgres::graph::sparql::executor::apply_modifiers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0130964687e760b1145ec45db581aee883d8b93ac0635816216521a6b14ed434"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_solver::forward_push::forward_push_with_residuals (cognitive 19): ruvector_solver::forward_push::forward_push_with_residuals has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/ruvector-solver/src/forward_push.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d59ce8e121f0db9556f8ffe6d95d30a5690d2ba3fab72d6ab360e87e4e1f545"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_sota_bench::bin::sota_streaming::main (cognitive 19): ruvector_sota_bench::bin::sota_streaming::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sota_streaming.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcec49d4afe53c1ed5d1bd7df9fe7a75ace0039030904383f77ceca76b59199d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_sota_bench::bin::sota_vdbbench::main (cognitive 19): ruvector_sota_bench::bin::sota_vdbbench::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sota_vdbbench.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe1d3ea6bbedd21f4e07308be74ab2c65735f968644bcc6f92892199a074fee"}},{"ruleId":"D2","level":"warning","message":{"text":"Quantizer3Bit::dequantize (cognitive 19): Quantizer3Bit::dequantize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/precision/quantizers.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"298d5b730f0e5bdab96cd8af15acd654a7dc5966e065926eb8d11728816eff30"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_typesafe_core::engine::fit::fit_class_artifact (cognitive 19): ruvector_typesafe_core::engine::fit::fit_class_artifact has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine/fit.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b518a9498089c929de297b537ca6f93f3f4561c5e41a2d0cf5209310c9748bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::dtb::print_structure_summary (cognitive 19): ruvix_cli::commands::dtb::print_structure_summary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"719f8e6ce696694791d69a15bad2e153392d403f7400188fd4c02ca56798ad19"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::dtb::search_and_print_nodes (cognitive 19): ruvix_cli::commands::dtb::search_and_print_nodes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24f85eb469c08bda4f8d491365c0b22ed908831735d51361bb3f7e9d99d508e"}},{"ruleId":"D2","level":"warning","message":{"text":"DeviceTree::parse_structure_block (cognitive 19): DeviceTree::parse_structure_block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/dtb/src/parser.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c605b6f9bb6f688170c1017a0daabe7ff801234353b206c748c7927d8fd7fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"Fat32Fs::read_directory (cognitive 19): Fat32Fs::read_directory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/fs/src/fat32.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c20cd372a52546f784ce2f7690453ddb427eab343cffd8b2f708d26abd91e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_fs::path::normalize_path (cognitive 19): ruvix_fs::path::normalize_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/fs/src/path.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ef43421e09484e280347ea4362101acfc6b169df41ae2d5869edc11586ffc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::select_next_task_at (cognitive 19): Scheduler::select_next_task_at has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/sched/src/scheduler.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa6919479d8e557039bdf2b412fb4063b8a211ea5a03ee6b2450a5c3a84ea87"}},{"ruleId":"D2","level":"warning","message":{"text":"BitNetBackend::load_stacked_experts (cognitive 19): BitNetBackend::load_stacked_experts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d284b3bb43f85cf0436cb1be978a8a226008323b4c220e917b31b025ad5741"}},{"ruleId":"D2","level":"warning","message":{"text":"BitNetBackend::discover_tensors (cognitive 19): BitNetBackend::discover_tensors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beaa3043f2be82e47df2fc910f5b6c2f88ddca126e262ed6d52c4729064aadf"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRouter::classify_task (cognitive 19): AgentRouter::classify_task has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 9. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/agent_router.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a608f798d383d40dfff91a0f95d406f8bbe91954ecb55f5a541a03a4cde8cc2c"}},{"ruleId":"D2","level":"warning","message":{"text":"rvagent_a2a::server::push::deliver_webhook_impl (cognitive 19): rvagent_a2a::server::push::deliver_webhook_impl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/server/push.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3492000f25081bf3d2e281dfcc40af80ffa83ee0cd1f5fd777de45c471baec6f"}},{"ruleId":"D2","level":"warning","message":{"text":"McpToolRegistry::validate_args (cognitive 19): McpToolRegistry::validate_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), boolean chains 1 (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":"crates/rvAgent/rvagent-mcp/src/registry.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7b3f12581b14a6d3cec2305a8e390ce01c0bb8a9aa40aa21c8c7e3dfe0fc1d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedSeed::parse (cognitive 19): ParsedSeed::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_seed.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"5867cbcd06c31fb43515ed1ef914ecb4896f83bd94d74e57c1d7b0b1a5ff74c0"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_server::tcp::handle_connection (cognitive 19): rvf_server::tcp::handle_connection has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/tcp.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21c0d7af8e3643de805b91e597328cdd453fd6b31495c439ae4fb8df81077c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::match_node_pattern (cognitive 19): Executor::match_node_pattern has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/executor.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fba593382e6e84c47f077389e72b6690685a726477f18d72ec650beb6f1fd0c"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_quads (cognitive 19): SparqlParser::parse_quads has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6210873d6156a917888ca54f33e7a1bff8ce9f6f41b7948b5adaf81b58218c"}},{"ruleId":"D2","level":"warning","message":{"text":"SqlEngine::insert (cognitive 19): SqlEngine::insert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/executor.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a949baa2fcc6480bc633cef95e12bad0c96fdf60ca8fe2c359b25070f7201b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rvm_memory::reconstruction::compress (cognitive 19): rvm_memory::reconstruction::compress has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/reconstruction.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a107ab09e25e665392099073079c4c5cdc9cefe373a845eb5564045f7c80d50e"}},{"ruleId":"D2","level":"warning","message":{"text":"PolicyEvaluator::evaluate_rule (cognitive 19): PolicyEvaluator::evaluate_rule has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/policy.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"473dfd2fb484e2748bd793c0ccddacc16fc713e07d40701bbe135d2fc29a26b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::graph_cypher::estimate (cognitive 19): ruvector_edge_gateway::graph_cypher::estimate has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 2 (7 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/graph_cypher.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4e3dd73e1ff74deb72313da799923b2a6cc85ef915e300848e5d7afa80df62"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::registry_sweep::sweep_scope (cognitive 19): ruvector_edge_gateway::registry_sweep::sweep_scope has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (3 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":"edge/gateway/src/registry_sweep.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f2edcc2dce944c1cd907aa3a16a3cc84282223f82df53895d246bf38c6e1f1"}},{"ruleId":"D2","level":"warning","message":{"text":"MatMul::f (cognitive 19): MatMul::f has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6, loops 2 (4 pts), match/switch 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"480b287c6362469db745dc381ad0232dfd10cbf3650c2a86333b239daf844f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"MatMul::f (cognitive 19): MatMul::f has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6, loops 2 (4 pts), match/switch 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf4caeb4650b99a6946487af34ccdda799b7693b26afd91303acbc64b17c9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalStorage::reduce_op (cognitive 19): MetalStorage::reduce_op has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b4cfc18f48a650f0a543d409de7c674b8b136d4b16e911bdb49316431767a6"}},{"ruleId":"D2","level":"warning","message":{"text":"MetalStorage::reduce_op (cognitive 19): MetalStorage::reduce_op has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 2 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b5b62260286485f8b53ca3c68c03c423da1a01915440c3dd3d743804755fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ5K::to_float (cognitive 19): BlockQ5K::to_float has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e718cdaf4e401daaf473ddf30e3c637f11a8330e82dbc65a5de1c23ad9445a"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ5K::to_float (cognitive 19): BlockQ5K::to_float has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfe290f4e4a10cdc35cc4653d93e5a905576be6eaebb0a25b463c33a4c9d2ce"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ8K::from_float (cognitive 19): BlockQ8K::from_float has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 3 (6 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"574181547c6a877eb511edc67345b40367222298127913aaa0f041a955f1623e"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::write_bytes (cognitive 19): Tensor::write_bytes has cognitive complexity 19 (threshold 15). Drivers by points: loops 9 (18 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/convert.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d4384fc6a349237c11f02698ff91e1f1292472ef671cfc601bfe99bf8123bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::reverse_update_neighborhood_simple (cognitive 19): Hnsw::reverse_update_neighborhood_simple has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ed6e7b0a48558df52f03a984cdca64e836173a2efd25be0614faa516beca35"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::reverse_update_neighborhood_simple (cognitive 19): Hnsw::reverse_update_neighborhood_simple has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e07de223dc02d922405aaef501135e13d6ef743f3389452a62890dcbe7f77ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Collection._search_rabitq (cognitive 19): Collection._search_rabitq has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f710b80e19f49b6910c3f09bb161da6ef6741711cae85d5b45051540f9742d12"}},{"ruleId":"D2","level":"warning","message":{"text":"reconstructRunnable (cognitive 19): reconstructRunnable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, error handling 2, loops 2, ternaries 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 4 belong to 16 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/reconstructor.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f20379fdd345024736beccae956f0270035f9a518ecaecdd52503da257c6c10"}},{"ruleId":"D2","level":"warning","message":{"text":"inferParamType (cognitive 19): inferParamType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 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":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9a139c1a34e5fddcfc1b99b3a6860565a5e8d6e7b3880d8ccdbd588d366042"}},{"ruleId":"D2","level":"warning","message":{"text":"skipRegex (cognitive 19): skipRegex has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d7ab7fbdcc414b0c3b1b0a33babf915c58c510da989ddd374e9ef96d748ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"findMainBundle (cognitive 19): findMainBundle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 1 belongs to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/npm-fetch.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3146c8fd730a4030246f74064e4427df26598c10c9a8503f42c4536bb12a65"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeGraph::remove_node (cognitive 18): KnowledgeGraph::remove_node has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"411edd96a34ad65d0447cf00b68686616f2184b19f3b5479957c2e08b9432f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"FirestoreClient::load_from_firestore (cognitive 18): FirestoreClient::load_from_firestore has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), loops 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":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6238a814a91d584a28fd5547f809dec7a1f579e2ea07ee5bb052196cd71b8db"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::vote_memory (cognitive 18): mcp_brain_server::routes::vote_memory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b972f802870fc92088567657e93e869ea05369aa188b75006169e4b4ee81ce"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::routes::publish_node (cognitive 18): mcp_brain_server::routes::publish_node has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":5164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3db36377b345c984f54a96fa2638087ccbbac0ab13e79706ef643247f561389"}},{"ruleId":"D2","level":"warning","message":{"text":"RiskGate::evaluate (cognitive 18): RiskGate::evaluate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/neural-trader-strategies/src/risk.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb31b304c4777d8ec73d8f52072bdb59befd43ec166d97c394aa93460c686f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"TopologyGate::compute_coherence_metrics (cognitive 18): TopologyGate::compute_coherence_metrics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/topology.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f139ccce2cf197af1cd4fa45ec6d3266c0a96c6c04aaf64e5ecb7c32162f4951"}},{"ruleId":"D2","level":"warning","message":{"text":"SheafDiffusion::diffuse_adaptive (cognitive 18): SheafDiffusion::diffuse_adaptive has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/diffusion.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e141970edfaeb431f1bca59351bda1c7d122c47d96b697fb3ddbdf5e045623"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryLineageRepository::verify_no_cycles (cognitive 18): InMemoryLineageRepository::verify_no_cycles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/repository.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cc06cbff3957900db34bfc6486fd435ec40bc3929dcdb3b70a8f1398950f32"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryCoherenceLayer::create_semantic_edges (cognitive 18): MemoryCoherenceLayer::create_semantic_edges 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":"crates/prime-radiant/src/ruvllm_integration/memory_layer.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ddc9159fd6cf603081331d625c1bac704800a9ea87f775cc31312331ba6e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"AcornGraph::build (cognitive 18): AcornGraph::build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/graph.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3209f69c7178ed16600ae2ed167f811833e165dc0391b9f7bc1c006dd7783c96"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::pid::specific_information_cached (cognitive 18): ruvector_consciousness::pid::specific_information_cached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 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. This shape REPEATS in the file: one other method here (ruvector_consciousness::pid::specific_information) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/pid.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe68b01a376d3daea0a09ac67e1445e106174ef946a903c1821d9a0dba553ef"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::pid::specific_information (cognitive 18): ruvector_consciousness::pid::specific_information has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 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. This shape REPEATS in the file: one other method here (ruvector_consciousness::pid::specific_information_cached) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/pid.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7452daf69b67f79bcbf08087f09d40bae39a1015141416311d7541d4b8747a18"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeGraph::get_neighbors (cognitive 18): KnowledgeGraph::get_neighbors 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":"crates/ruvector-core/src/advanced_features/graph_rag.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56e3bce58ff82f6145bc9daa1502bb5044186647dffa1a6525ad042fd71bb68"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorDB::search_filtered (cognitive 18): VectorDB::search_filtered has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db/filtered.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c675ed20bc6a9442ec5dd0b1bc7c42c1799f07e428f851dec6fa00e3a5d875"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_core::encoding::codecs::f32_to_f16_bits (cognitive 18): ruvector_core::encoding::codecs::f32_to_f16_bits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/encoding/codecs.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"863c8f222734232a83fe583f7469fb005dbe62ffb45bfbe606919361c0e43fa8"}},{"ruleId":"D2","level":"warning","message":{"text":"DagSonaEngine::hash_dag (cognitive 18): DagSonaEngine::hash_dag has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (16 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/sona/engine.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"58aad2694ec6f32d1cbeb441438cc7366a3622ee26f69e1a67c36f7539b722c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::model_safetensors::parse_safetensors_file (cognitive 18): ruvector_decompiler::model_safetensors::parse_safetensors_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_safetensors.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b7986ae9ad6062ce73b891ef9db8aad748e2dce52adc85050d54f065faabb0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::neural::infer_names_neural (cognitive 18): ruvector_decompiler::neural::infer_names_neural has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/neural.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f3251e54a06952fc01c63deddc2ca8e810f609fecb65def45d41540aee4030"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::repair_links (cognitive 18): HnswIndex::repair_links has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/hnsw/compact.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9e1e1f183543ce97f3b8af331e0c0c282a24c76f4f593a2397ed9709b77b12"}},{"ruleId":"D2","level":"warning","message":{"text":"Header::decode (cognitive 18): Header::decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-quant/src/persist/format.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafc1cebcc6e14e2ba51a3d84d0c0dabd5d1d62a34db3a17ccdd44f21348b945"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreSession::accept_inner (cognitive 18): RestoreSession::accept_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 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":"crates/ruvector-edge-snapshot/src/restore.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"95983effa2c860401ae095599a68ea39db88fdd5893cd7de07c302fd201a88ef"}},{"ruleId":"D2","level":"warning","message":{"text":"P::where_clause (cognitive 18): P::where_clause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/mem_store/parse.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc82c784202ffded3f9820e6889f6cc1a6196ee310def98433cf04af5b42712"}},{"ruleId":"D2","level":"warning","message":{"text":"SpikingGraphAttention::step (cognitive 18): SpikingGraphAttention::step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/biological.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed2af7806aac08caf0831b89240f2b539c2850c7232a938d6699581b26305fc"}},{"ruleId":"D2","level":"warning","message":{"text":"HamiltonianGraphNet::forward (cognitive 18): HamiltonianGraphNet::forward has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/physics.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce14d3cbb427aa4192ab308736059a13192cefdb7352b35c32a086863ca25ac7"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphCoarsener::greedy_cluster (cognitive 18): GraphCoarsener::greedy_cluster has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/self_organizing.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"837e51a067ccfb9e10eca6a94d86d50cdd389907c92c6a6eb325b0a401f25a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreGraphTransformer::causal_attention_graph (cognitive 18): CoreGraphTransformer::causal_attention_graph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"02373d4ab4a0f447d36078bdf1a7316fe639d789030e799f4e7d8c64618cd07e"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreGraphTransformer::causal_attention_graph (cognitive 18): CoreGraphTransformer::causal_attention_graph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/src/transformer.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5bdc6836a862a44517c7464895c3864c7cdfa5f846c40c4d7ef78b3b5380ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::binary (cognitive 18): ruvector_graph_wasm::cypher_exec::binary has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9 (16 pts), boolean chains 1, if/else 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfce3f6346079f91dffa93ad18595af4b4f7cb18c3459af6c9d88dddb1bb266"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_lsm_ann::segment::greedy_search_internal (cognitive 18): ruvector_lsm_ann::segment::greedy_search_internal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-lsm-ann/src/segment.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a721b8acc55cbe54f6419fcc606e4f812b9f6b6ea2e5b65418267b51f810122"}},{"ruleId":"D2","level":"warning","message":{"text":"SOSChecker::extract_squares (cognitive 18): SOSChecker::extract_squares has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/sos.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5395ac108bbb8e191a9be3ec1786e90fb1e2d77523394d86fa05c1f959c307b2"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkContraction::greedy_order (cognitive 18): NetworkContraction::greedy_order has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/contraction.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc5154e69853bf5f489ea70a5ec3853984ed02095c583e5d248c363b473fbdc"}},{"ruleId":"D2","level":"warning","message":{"text":"TropicalEigen::power_iteration (cognitive 18): TropicalEigen::power_iteration has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tropical/matrix.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52304739123df30a799126cb166a6f58983c6073a340225f733a142459c1740"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswMaxSim::search_tokens (cognitive 18): HnswMaxSim::search_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-maxsim/src/hnsw.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b478f2295e3f1069ae43994e8ff9e3c86f247ce916da305fadc87a45f524fe7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpanderDecomposition::local_cut_search (cognitive 18): ExpanderDecomposition::local_cut_search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ruvector_mincut::expander::bfs_local_search) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54b952dadc5f9cae05363b39a5c57b643db46860dde677206e2a0070d794bce"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueNetwork::update (cognitive 18): ValueNetwork::update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/optimizer.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3e55dfe5baa53c40535ed90e88eeb77353e4869183aee8d7e72e8d1d28469e"}},{"ruleId":"D2","level":"warning","message":{"text":"MinCutWrapper::process_instances (cognitive 18): MinCutWrapper::process_instances has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (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":"crates/ruvector-mincut/src/wrapper/mod.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"538144b56ca876c997d66ff1610ebea1a1cb59a10cd8edd2db605bb561b1986a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut::expander::bfs_local_search (cognitive 18): ruvector_mincut::expander::bfs_local_search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ExpanderDecomposition::local_cut_search) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e769c56eb317490d2eaa0fca7162eb4748a7c1abdea75c1f59baa95f39b52f"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockInt4Weights::from_f32_with_block_size (cognitive 18): BlockInt4Weights::from_f32_with_block_size has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (9 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/quant4.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d857942d81a784ca391ac042982982ddcc9e045a475bd3037c6627270a0e0d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"KVQuantQuantizer::quantize_value_nonuniform (cognitive 18): KVQuantQuantizer::quantize_value_nonuniform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecbcffd8524b7eea2b7219930735f016990e86945003dded34a1cf74179a454"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut_gated_transformer::flash_attention::flash_attention_forward_i8 (cognitive 18): ruvector_mincut_gated_transformer::flash_attention::flash_attention_forward_i8 has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/flash_attention.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f586d921caaa28fa7acdf12a400ebc42baa2bbe975d1d2a49f7d7f3e2eaa1b87"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut_gated_transformer::kernel::qgemm::qgemm_i8 (cognitive 18): ruvector_mincut_gated_transformer::kernel::qgemm::qgemm_i8 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"67583a48295768ebaceba413cee3d069c913187e573551cf37e9f8fa39b6ef58"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_mincut_gated_transformer::kernel::qgemm::qgemm_i8_avx2 (cognitive 18): ruvector_mincut_gated_transformer::kernel::qgemm::qgemm_i8_avx2 has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"602a0237a0ab9c935a5fb859f678cf6617ae5eabe37a37c2311cef8fb10e7447"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::attention::operators::ruvector_linear_attention (cognitive 18): ruvector_postgres::attention::operators::ruvector_linear_attention has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4, match/switch 2, boolean chains 1 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f6490950e852d57b8a315c57c33b4de2a43305d006d8d11034c856f8842c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::ivfflat_am::write_inverted_list (cognitive 18): ruvector_postgres::index::ivfflat_am::write_inverted_list has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"593950381161e48c6a953205d1638645764e2cdf758efe1bd249c5920b10139f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::solver::operators::ruvector_graph_pagerank (cognitive 18): ruvector_postgres::solver::operators::ruvector_graph_pagerank has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda84039495ba0cfc86445465ddccd6ce9d7faf2f4af9fe0cf83c3b762dc4dce"}},{"ruleId":"D2","level":"warning","message":{"text":"RaftNode::handle_append_entries (cognitive 18): RaftNode::handle_append_entries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fca912217275d7b99f7590a9e37caf5a96ecdf3deb1bfd4758f9058ae832cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_rulake::bin::rulake-demo::main (cognitive 18): ruvector_rulake::bin::rulake-demo::main has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 6 (8 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/bin/rulake-demo.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7120727cba959e6ca6b5a2abc4e68b341a7c1f33046f72105338dcbb8fa81d"}},{"ruleId":"D2","level":"warning","message":{"text":"BackwardPushSolver::backward_push_core (cognitive 18): BackwardPushSolver::backward_push_core has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/backward_push.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"308dbb9f924cf154aaf4f08f271c80079265ec1991f9f6368684ffeb2f4829f6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_streaming_qng::bin::benchmark::main (cognitive 18): ruvector_streaming_qng::bin::benchmark::main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, loops 3, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/bin/benchmark.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbcf47ce4eb5c30dc88802c06440d13dcb2071779425f7e8b8f0f82f9e5a555"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_typesafe_train::leakage::assert_no_leakage (cognitive 18): ruvector_typesafe_train::leakage::assert_no_leakage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (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":"crates/ruvector-typesafe-train/src/leakage.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51f14847e24e19bf4b984d2468a709fdf8a0d4691564c9b6010f8e7645028fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_weaver::release::range_signals (cognitive 18): ruvector_weaver::release::range_signals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/release.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e787cd53a83fcdc2f0f7425d0ace10cc57f0552e2193579e8520b2aba4ccae0"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::dtb::generate_dts (cognitive 18): ruvix_cli::commands::dtb::generate_dts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b28387db9c4ae519808616aff2115f76b77b8f4b0471a1e6d5513c23d542bf"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreMLStreamIterator::sample_token (cognitive 18): CoreMLStreamIterator::sample_token has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CoreMLBackend::sample_token) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34062550959a5ed088f3f653c0f0071219f5217933ae858477ab2d7458a73e0"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreMLBackend::sample_token (cognitive 18): CoreMLBackend::sample_token has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CoreMLStreamIterator::sample_token) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"897a4250f2eb77e238efbbc8435e7693fcaf01fea55621a3c72e93371a75765c"}},{"ruleId":"D2","level":"warning","message":{"text":"Gemma2Model::forward (cognitive 18): Gemma2Model::forward has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 4 (5 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"31faba0d272021df513eb8a0ddefffeb778753104412b4b1ae1aee6241f00eea"}},{"ruleId":"D2","level":"warning","message":{"text":"Phi3Attention::forward (cognitive 18): Phi3Attention::forward has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa302721c2606737f5c555baf5740a66ff158e0facbaa2a81183e996df572c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"RlmEmbedder::compute_context_embedding (cognitive 18): RlmEmbedder::compute_context_embedding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/rlm_embedder.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f6a493cafb430e14760b5fd3e97e46d4808c893bff744eefe59baef7f26b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"MythosConfig::validate (cognitive 18): MythosConfig::validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/config.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9519706b02e1e63c22e7f30dea2999fb62847ba8ee54b39ce3ae36415eadc38"}},{"ruleId":"D2","level":"warning","message":{"text":"RuvLtraAttention::forward (cognitive 18): RuvLtraAttention::forward has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9f98464a99b1ca965f1b4f08d66ef8594cf2ba6121bb4bb4f5868dc2e46b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantCompressor::decompress_single (cognitive 18): TurboQuantCompressor::decompress_single has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bbcb73ea045e111bc922d4c2c271958c536ea2bb8e2b56d0d6404d1342a355"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::kernels::attention::batched_attention_scores_neon (cognitive 18): ruvllm::kernels::attention::batched_attention_scores_neon has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (18 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ca09c33d8cbe3172e88285405b6466fe2b98dc1cfe573f81ad742a78c9476c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm_wasm::workers::feature_detect::optimal_worker_count (cognitive 18): ruvllm_wasm::workers::feature_detect::optimal_worker_count has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (18 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":"crates/ruvllm-wasm/src/workers/feature_detect.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"115658202209aad9dd77fa561c21e68e18957553d2494aa65c7f5c7efe2292a8"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetLedger::try_consume (cognitive 18): BudgetLedger::try_consume has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/budget.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ef560f1da5f35a2712d820087958c155c4e61ff86bf1f1f069cb5ab7f3009d"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalShellBackend::execute (cognitive 18): LocalShellBackend::execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/local_shell.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"473aac8a19411028eb791bdb857650016cd8ff08d965d437e26758025b287d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_cli::cmd::verify_attestation::find_attestation_witness_payloads (cognitive 18): rvf_cli::cmd::verify_attestation::find_attestation_witness_payloads has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_attestation.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aabddd7a3e55328bd70ffed1c0125da905f844bc19d6ec2a12f0e6a6fab72e"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_index::codec::encode_index_seg (cognitive 18): rvf_index::codec::encode_index_seg has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (6 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/codec.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4079d47f089f915e15dcba1729cfbacb60c109c3d3bc18cc4cc30c80f33fc00d"}},{"ruleId":"D2","level":"warning","message":{"text":"CowEngine::flush_writes (cognitive 18): CowEngine::flush_writes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/cow.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccadc1e5380f3b351432517872ee49b7162bd333701bdd3df94ea9ad7569fda"}},{"ruleId":"D2","level":"warning","message":{"text":"rvforge_registry::bin::rvforge-registry-check::check_witness (cognitive 18): rvforge_registry::bin::rvforge-registry-check::check_witness has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/bin/rvforge-registry-check.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53bcc4ba533eb7079e220fcb094dec166862d33f50f51128c26fb6f8aabfede"}},{"ruleId":"D2","level":"warning","message":{"text":"rvlite::sparql::executor::apply_modifiers (cognitive 18): rvlite::sparql::executor::apply_modifiers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e10340a807003515f628020bdd4375595ec42c6b56a3adb3af373ff127d6b0"}},{"ruleId":"D2","level":"warning","message":{"text":"DerivationTree::find_parent (cognitive 18): DerivationTree::find_parent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/derivation.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab2cc6429843be47a03c3e74badb9189db0804e8b715633ae05e7ddd20f1e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"rvm_coherence::mincut::minimum_cut_phase (cognitive 18): rvm_coherence::mincut::minimum_cut_phase has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/mincut.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe1a28f2a0ffec2533225bf5c827a00bc13350f07c621cf6977a57ff7aade25"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningBank::compute_embedding (cognitive 18): ReasoningBank::compute_embedding has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/reasoning_bank.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f918cb46915c392b74af81e5f8c8f5cfd627b309686c721e64d8a9db8064ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Gather::f (cognitive 18): Gather::f has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4663b6940763e6ae557acd2b7372eef5e7c0e9f8a16dbe4e524ba6327d5a42fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::fmt_dt (cognitive 18): Tensor::fmt_dt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 2 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf704d045b026f9704a4d857213b0b24120f2df19588b399f4d1871acfa3b923"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::fmt_dt (cognitive 18): Tensor::fmt_dt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 2 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/display.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce28ec7e787e86aff61690085818e0bbffc810611e0295ac289c0a10e54ba9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::search_filter (cognitive 18): Hnsw::search_filter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), 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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de272e286ba057c4a9dad8309eb0b4c1419d360b0eba0716b3df39badcfd74b"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::search_filter (cognitive 18): Hnsw::search_filter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), 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":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed898b450616a23f0bb97e49f6d4e5817023cf62a13fe4fa1ffce0060654ef6"}},{"ruleId":"D2","level":"warning","message":{"text":"llamaindex._match_filter_value (cognitive 18): llamaindex._match_filter_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 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":"crates/ruvector-py/python/ruvector/integrations/llamaindex.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"344577015b4906a89aa4ed38cebf7e7afbdca609fb21d71de3304687bfd78d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"predictName (cognitive 18): predictName has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/name-predictor.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d66a348ed4d04646df582ed1524843769270d95a45ea1755cc07f83ca19f64"}},{"ruleId":"D2","level":"warning","message":{"text":"LearnedWeights::fit (cognitive 17): LearnedWeights::fit has cognitive complexity 17 (threshold 15). Drivers by points: loops 11 (17 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/weight_learning.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"52541e37e5ac584305bce85fd78a316c84ad98204bcebaabb5b3cd129aa78973"}},{"ruleId":"D2","level":"warning","message":{"text":"emergent_time::wheeler_dewitt::bipartite_constraint (cognitive 17): emergent_time::wheeler_dewitt::bipartite_constraint has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/wheeler_dewitt.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c651141f03182e73562aadfa9507ca9a1ac96c18ad65f58e87ccb0f31c4fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeGraph::add_node (cognitive 17): KnowledgeGraph::add_node has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 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":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c24e1317e3e1589e9ad11fef3bfa1be13b5ad41afc2f3c4f2b48e4636fe960"}},{"ruleId":"D2","level":"warning","message":{"text":"FirestoreClient::keyword_search (cognitive 17): FirestoreClient::keyword_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"50beee034761ec91fe146652c630eac9bdfafa106747fc460b923e562b4cfbb5"}},{"ruleId":"D2","level":"warning","message":{"text":"photonlayer_bench::mnist::digit_to_image (cognitive 17): photonlayer_bench::mnist::digit_to_image has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/mnist.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0be727c06c1df7cf7bace8a52f715abd6f0ac5b552e169d017f83d0a279d59"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_attention_cli::commands::repl::run (cognitive 17): ruvector_attention_cli::commands::repl::run has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 2 (7 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/repl.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c1b890a1dbc45242abe0ee97966f4e9721a8b5b54418612db4435df2febb68"}},{"ruleId":"D2","level":"warning","message":{"text":"BnBIvf::search_nprobe_abandon (cognitive 17): BnBIvf::search_nprobe_abandon has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/kernel.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cc98bd91ab69dd6ee4c4701aae93cd2bc31d3108a22157f129e013aab10973"}},{"ruleId":"D2","level":"warning","message":{"text":"CapGraphIndex::search (cognitive 17): CapGraphIndex::search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-capgated/src/cap_graph.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"243ecc20667845e5bebf34041cf13b61d94ad5ac859359c4ae559f3b4c789976"}},{"ruleId":"D2","level":"warning","message":{"text":"ParallelStochasticPhiEngine::compute_phi (cognitive 17): ParallelStochasticPhiEngine::compute_phi has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/parallel.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"755968c0c0796202298cb09933240a4c4dfd0048593fb8fcf9a2f642f5c32b31"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::emergence::greedy_merge (cognitive 17): ruvector_consciousness::emergence::greedy_merge has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 2 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/emergence.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f120d47be3f993b18d3d6635fc3da6f5d3b898083b6d08c10bcf3f1bb81cf85"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::emergence::state_distribution_distance (cognitive 17): ruvector_consciousness::emergence::state_distribution_distance has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (5 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/emergence.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68cafe4129d78405ca4eaef0706a87b556fed52f59a03f304fe3a6f92094912"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::geomip::compute_product_local (cognitive 17): ruvector_consciousness::geomip::compute_product_local has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 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":"crates/ruvector-consciousness/src/geomip.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bd99e7d6b3cab8e25a0f8a6fc02877fdf0f0242d85fc76ef6f47ba4336214d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_core::advanced_features::opq::kmeans (cognitive 17): ruvector_core::advanced_features::opq::kmeans has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/opq.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"55444c4fcabfdfe56008e9590c87c94fffd31d3f1b3586f3efa1f386051babd1"}},{"ruleId":"D2","level":"warning","message":{"text":"StageIVEncoder::encode (cognitive 17): StageIVEncoder::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (7 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/stage_iv.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ede7d88f0450b8b5e8b60f38eb374dcee1a6f7bc62aec711b87a31f3616a6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"StageVEngine::encode (cognitive 17): StageVEngine::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (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":"crates/ruvector-crv/src/stage_v.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7008e582dc0d8fc10bdfac02a4bec34aca7e05f4e37092bd14d0103d1b1a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryDag::compute_depths (cognitive 17): QueryDag::compute_depths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/dag/query_dag.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2352393cf8ebe91d9afbc334514760ef5c407319f882f1504d4b87cc256fd5e3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_dag::sona::reasoning_bank::kmeans_pp_init (cognitive 17): ruvector_dag::sona::reasoning_bank::kmeans_pp_init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/sona/reasoning_bank.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"611d929ac2af546aeab8d7ba9f0605d2a79a93454625cf214221122f7d09cc6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_decompiler::beautifier::indent_braces_into (cognitive 17): ruvector_decompiler::beautifier::indent_braces_into has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/beautifier.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d9de02415a6159f885d820a51567d98d7ea5b695a84b60c1d725894d0ecb10"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_diverse_beam::bin::benchmark::main (cognitive 17): ruvector_diverse_beam::bin::benchmark::main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/bin/benchmark.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"570ab9b5671de8f653c3842c060044ea145b4572ce4704b1f9f9f99b3bb19307"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_analytics::format::decode_payload (cognitive 17): ruvector_edge_analytics::format::decode_payload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-analytics/src/format.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7637bda67481190832ce26f912ee38f67454f779c238cbd42e8788e477ef8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceUrl::parse (cognitive 17): ResourceUrl::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-auth/src/resource.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c342dcf8ad3cb884acf2d208b59668d6393d12c7c926e35176dad0253095b273"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::list_packages (cognitive 17): Registry::list_packages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), match/switch 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-registry/src/registry/list.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"38be8f69a5260f3bcd5aea1062a110256e87c7002d350f6eec9f797fec890f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"TenantLedger::idem_store (cognitive 17): TenantLedger::idem_store has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ledger/idem.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b49dea26bbb4f99e7c570f1b4eb943ea1fcd6071ff2f3bb7acb1060a948bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_store::shard::rerank::exact_top_k (cognitive 17): ruvector_edge_store::shard::rerank::exact_top_k has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/rerank.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e894d4170235022695c18c3385150525695680b46cb91c3f3fe1d540e8bb5a1"}},{"ruleId":"D2","level":"warning","message":{"text":"HyperbatchIterator::reorder_bfs (cognitive 17): HyperbatchIterator::reorder_bfs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/cold_tier.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d572f4201b28893391209ad801926845679c363074db8a51da095a7dd17f1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"SimdTraversal::parallel_dfs (cognitive 17): SimdTraversal::parallel_dfs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/simd_traversal.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f7771ea30be94a026718bcdce786eeda10228bef06d9f49bba0aa86a27e45c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::eval (cognitive 17): ruvector_graph_wasm::cypher_exec::eval has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), loops 2 (4 pts), if/else 1 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4271e13b1550ff6d9f5ffbeb1cf4c646721dd6a6d7ae9c65a9493d83195397"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_wasm::cypher_exec::incident (cognitive 17): ruvector_graph_wasm::cypher_exec::incident has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cce800448170bbb31c46f561873fff5ea20e8c0381b435803585f869a55a18b"}},{"ruleId":"D2","level":"warning","message":{"text":"HailoClusterEmbedder::embed_batch_blocking_with_request_id (cognitive 17): HailoClusterEmbedder::embed_batch_blocking_with_request_id has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/lib.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8be384d5c1b04f73a5dbd1e742dbadae3537eede5f2192002b9d324372e1ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::bin::mmwave-bridge::run_serial (cognitive 17): ruvector_hailo_cluster::bin::mmwave-bridge::run_serial has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4616a4c8c3cba1ad93aa4010f044272b0be73e7edb06fd8e68c8c6251bc01c"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_kalshi::ws_client::pump_frames (cognitive 17): ruvector_kalshi::ws_client::pump_frames has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 1 (5 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/ws_client.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94ab81987b33f046c7e4f0b41890334a274a7dcd862c67c96981b2ea53944d5"}},{"ruleId":"D2","level":"warning","message":{"text":"ContinualUpdate::grow (cognitive 17): ContinualUpdate::grow has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/optimize/continual.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d6b4f916cd0bb12aff802f97078fe8414e715fb41ca038791d57d76a0bc366"}},{"ruleId":"D2","level":"warning","message":{"text":"KgeModel::train_json (cognitive 17): KgeModel::train_json has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (9 pts), if/else 6, loops 1 (2 pts) (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/pipeline.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd63aa615b81ebbc61b0069a5ac35792316d57a79429e079caf027dba49611d4"}},{"ruleId":"D2","level":"warning","message":{"text":"KgeModel::train_json (cognitive 17): KgeModel::train_json has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (9 pts), if/else 6, loops 1 (2 pts) (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-wasm/src/pipeline.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dc5ee30c6baac243c25d7a50218887e4b8ee141e37b60d32705d21aee99f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"WassersteinDistance::wasserstein_finite (cognitive 17): WassersteinDistance::wasserstein_finite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/distance.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20ddbfff508d0329eea3c881da4081d5f4468a1085bc1cbed7be44014dd45ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductManifold::project (cognitive 17): ProductManifold::project has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 6 (8 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae85bd56073b9b59bac3f4ef3aa36264dd5cd82a043c51f7549cf9bfa974a24"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductManifold::frechet_mean (cognitive 17): ProductManifold::frechet_mean has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"efab716fad9ece830b080308c2a5d1014eef3dd830d7b3f12ab1b924ab1bee8c"}},{"ruleId":"D2","level":"warning","message":{"text":"SphericalSpace::frechet_mean (cognitive 17): SphericalSpace::frechet_mean has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spherical/mod.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b55934367a53eed0a7483d0a13c126c74410ebb3c4e9e3a4658caf68e9f3eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"CactusGraph::split_at_edge (cognitive 17): CactusGraph::split_at_edge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec211a5efa4f27ed80b960595849b966837e03f69975160a7f8a0315a6185da0"}},{"ruleId":"D2","level":"warning","message":{"text":"GomoryHuTree::build (cognitive 17): GomoryHuTree::build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/tree_packing/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91b798b3fd1edf6e32735dea96d1efb37a6b285f6afb1882fd6a9cd9017d2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreeLevelHierarchy::grow_expander (cognitive 17): ThreeLevelHierarchy::grow_expander has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5857a298e0aeed307be2b83b3002ec89f896614f0d19f93c0efe695458d1b96a"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreeLevelHierarchy::build_clusters (cognitive 17): ThreeLevelHierarchy::build_clusters has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9eb0c77a94d7642aea85ce529c3a89231771d6936ff9b55448e148ec26546ac"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamicGraph::connected_components (cognitive 17): DynamicGraph::connected_components has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/graph/mod.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4303ae6fbee073b312b066d56c7c6915cb18d2de87184aaee0e474658db1664"}},{"ruleId":"D2","level":"warning","message":{"text":"BmsspJTreeLevel::native_shortest_paths (cognitive 17): BmsspJTreeLevel::native_shortest_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/level.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6d44b77c70be28e3ad57710dd46573ffc567ff6f97c14e9b8121f4d87c7324"}},{"ruleId":"D2","level":"warning","message":{"text":"DeterministicLocalKCut::insert_edge (cognitive 17): DeterministicLocalKCut::insert_edge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/localkcut/deterministic.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bed3890844d36f80daa40b8bf6c233d85167204c7930c77b207d74f125bddc"}},{"ruleId":"D2","level":"warning","message":{"text":"MinCutMonitor::notify (cognitive 17): MinCutMonitor::notify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/monitoring/mod.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fee188cb97f049c83d3f5c62313b0d49f42561f06bade8b517715822f4b47b"}},{"ruleId":"D2","level":"warning","message":{"text":"BenchmarkSuite::benchmark_cache (cognitive 17): BenchmarkSuite::benchmark_cache has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 1 (4 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/benchmark.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914b85432cd7c4cb1ab8e12bea90168001754715625d902d76a54553843a857"}},{"ruleId":"D2","level":"warning","message":{"text":"RoadRouter::distances (cognitive 17): RoadRouter::distances has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/routing/mod.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"843c54f0ad8907a1514eb90b3cc28a885855a59610333bafd8681b8ace60f6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"RuFieldRouter::ingest_json (cognitive 17): RuFieldRouter::ingest_json has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/routing/rufield.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceef6bb715f98a320488880cd3eded79e2eb4d67802cb7f6588b857808b27ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"AttractorDynamics::karger_stein_with_skip (cognitive 17): AttractorDynamics::karger_stein_with_skip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/attractor.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c794ea2f25dd014a1ae1fd396955bc89f859d67dd991b202df9c60eb8a03208"}},{"ruleId":"D2","level":"warning","message":{"text":"PolicySNN::run_until_decision (cognitive 17): PolicySNN::run_until_decision has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 1 (2 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/optimizer.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b621429f812ec674e91c10d010855378a8b81179a66171ecd5ab834f384ea2b9"}},{"ruleId":"D2","level":"warning","message":{"text":"SubpolynomialMinCut::grow_expander (cognitive 17): SubpolynomialMinCut::grow_expander has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"499aa691eb8bb76df071f4db24c2e9c4ba78ac2ab95f784f0f647846ff2ed41f"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaptiveKVCache::attention (cognitive 17): AdaptiveKVCache::attention has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 1 (2 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/manager.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82ca456f35afe379973b7d17e89b103951703c269fd185562a0579a866d907f"}},{"ruleId":"D2","level":"warning","message":{"text":"Mr60Parser::feed (cognitive 17): Mr60Parser::feed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mmwave/src/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd54937245f34fefe93697647c3b696afc4af2437e9d4895f858cd2202c40b1"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_prefixed_name (cognitive 17): SparqlParser::parse_prefixed_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"071c215be73255ce1ba3238f402f8c80aecdf12f2a89caab286521fd68522693"}},{"ruleId":"D2","level":"warning","message":{"text":"IvfFlatIndex::train (cognitive 17): IvfFlatIndex::train has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"16553bc17f05cc3be915e9e90d1e92ea10f3b865cda3e017b714ddbdb8a5b9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"MaintenanceWorker::perform_tier_management (cognitive 17): MaintenanceWorker::perform_tier_management 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":"crates/ruvector-postgres/src/workers/maintenance.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaa0a5aa88636306954ced28e16a9dfe7729e6c0d13c21119f3fdadae1a7fef"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::cypher::executor::evaluate_expression (cognitive 17): ruvector_postgres::graph::cypher::executor::evaluate_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/executor.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"2063dddf2ef457aa13df5aae6bd9cf7518c0702dce3f4510aa15e449ba0b6e21"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::graph::sparql::executor::left_join_solutions (cognitive 17): ruvector_postgres::graph::sparql::executor::left_join_solutions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d99bde87a927baaf8e77d2498d3f6129af1db1707465bf9f7a41f0f848a2e35"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::bgworker::perform_maintenance_cycle (cognitive 17): ruvector_postgres::index::bgworker::perform_maintenance_cycle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/bgworker.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e971736665dc6256acd259c967a9e155e840a108ab8cf1edcb9f56e8fd767f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::hnsw_am::search_layer_for_insert (cognitive 17): ruvector_postgres::index::hnsw_am::search_layer_for_insert has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3866a7ebb52f062b7f8a770c39fc6ca061852ff97bb7d2482371396376bce973"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::ivfflat_am::kmeans_cluster (cognitive 17): ruvector_postgres::index::ivfflat_am::kmeans_cluster has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (5 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"b042dd4799b749ff50f8b8565e8125edf08a51569f1511a53e74b5c600242cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::ivfflat_am::read_inverted_list (cognitive 17): ruvector_postgres::index::ivfflat_am::read_inverted_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06293d7fc4a410b03ca0e1af899526c5d27f402ad17a005f0042d9a3c3db73a"}},{"ruleId":"D2","level":"warning","message":{"text":"NeumannSolver::solve (cognitive 17): NeumannSolver::solve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/neumann.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b471686ac746c86c85fe5388686a9fb70aad2abe20a2cca77df0050a2c7a535a"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_solver::backward_push::backward_push_with_transpose (cognitive 17): ruvector_solver::backward_push::backward_push_with_transpose has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/backward_push.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"921d95f40f8262c849ee4029eaec4967780f7b4411086bacd6ca30e15eba7a56"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_solver_wasm::power_iteration_ppr (cognitive 17): ruvector_solver_wasm::power_iteration_ppr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-wasm/src/lib.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5a37bb9836ed5249d5fe2e5f6581843c3bedd7a3595b02f77bcc8b7c3c7835"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_spann::kmeans::kmeans (cognitive 17): ruvector_spann::kmeans::kmeans has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 1 (3 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-spann/src/kmeans.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d45a6833ef6f5071d68f387be0aed7203592f283f0ed8720966a17a7bf7b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebook::train (cognitive 17): Codebook::train has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 1 (4 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/pq.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d499959911acb12b69581818247a272cea654c3e441203bbc8570cd77128d54"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_temporal_tensor::store_ffi::tts_tick (cognitive 17): ruvector_temporal_tensor::store_ffi::tts_tick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/store_ffi.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae786dece8c95c956322ff0ea161cab42ac38e3053f2cb3a60097177b4421a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::export_embedded (cognitive 17): Engine::export_embedded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine/embedded.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4727052ca211612165fb322d157b6fd4b7a0fd0d01acb78b85cebb5644f2c678"}},{"ruleId":"D2","level":"warning","message":{"text":"PortableDB::layer_search (cognitive 17): PortableDB::layer_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/portable.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97e7c7d7dba3ad2a2963a6fcfeaa24d0ce8d95b8fe2cfbd5a775b4ec26fc296"}},{"ruleId":"D2","level":"warning","message":{"text":"PortableDB::add (cognitive 17): PortableDB::add has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/portable.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee146b7c292e8ca9c5c298249f8d126d88e420126553854b91d7463a2de9abe"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::keys::execute_generate (cognitive 17): ruvix_cli::commands::keys::execute_generate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"crates/ruvix/crates/cli/src/commands/keys.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f614901e407ec828f1caedcb64a81c1cf0ca78d971c6dcee3d54a698b9f5403"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCapabilities::select_compute_backend_for_model (cognitive 17): SystemCapabilities::select_compute_backend_for_model has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e359bdb49a8481435cd1da25b9cd7bde74b6f685dd5036b9bb4a14bfdd6a71"}},{"ruleId":"D2","level":"warning","message":{"text":"BitNetBackend::forward_gqa_cached (cognitive 17): BitNetBackend::forward_gqa_cached has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 1 (3 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d674219e5ce6967046e00f187e200eec9a56bdf9ca3cec5ff50cdf289c124d"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalSuite::refusal_calibration (cognitive 17): EvalSuite::refusal_calibration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/eval.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38cb5a8b0977be833229b97f80707cb2c78baf80f2639ba0b64d03296369646"}},{"ruleId":"D2","level":"warning","message":{"text":"HooksIntegration::fallback_routing (cognitive 17): HooksIntegration::fallback_routing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 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":"crates/ruvllm/src/claude_flow/hooks_integration.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"40958cf2bfacf88c8a37e06a9fd46aed941e069d153be670961417dd6300d12e"}},{"ruleId":"D2","level":"warning","message":{"text":"LoraAdapter::forward_simd_neon_impl (cognitive 17): LoraAdapter::forward_simd_neon_impl has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f67c170d4c537c92eb7231a3f177f64b010384bf3021122f97968ecb2ffbb0"}},{"ruleId":"D2","level":"warning","message":{"text":"CoherenceValidator::compute_simple_embedding (cognitive 17): CoherenceValidator::compute_simple_embedding has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5eb7a104ed93a3de04b064431722d069b6f54fd1aa7e92d985b686a419b9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantCompressor::dot_in_rotated_space (cognitive 17): TurboQuantCompressor::dot_in_rotated_space has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47b4ffbe3cd7ee372e95051285e689a3d52eab516ec0682ba1ff0854cb602b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Pattern::infer_category (cognitive 17): Pattern::infer_category has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reasoning_bank/pattern_store.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"987ec590b5400c2b2579bcb51da6f3ad1da9930e49d947115ca472cf70896909"}},{"ruleId":"D2","level":"warning","message":{"text":"ServingEngine::handle_completions (cognitive 17): ServingEngine::handle_completions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46c186e587b9220bbc6835069fa469ffd60e0a149abf856facb18b06ab4c8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::claude_flow::model_router::contains_ci (cognitive 17): ruvllm::claude_flow::model_router::contains_ci has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/model_router.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5560a8f00240647fae93fc29190137cb15537347d5a923d893e69a383ac722f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rvagent_a2a::artifact_types::from_a2a_artifact (cognitive 17): rvagent_a2a::artifact_types::from_a2a_artifact has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/artifact_types.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"023231040106f72cea408982c694898d247d11d602a773a685150854ef09f1a3"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemBackend::grep_sync (cognitive 17): FilesystemBackend::grep_sync has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63df8b2407c06df02e7fa6a02f83154c958f308876e5e286afffe1ee695330d"}},{"ruleId":"D2","level":"warning","message":{"text":"PatchToolCallsMiddleware::before_agent (cognitive 17): PatchToolCallsMiddleware::before_agent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/patch_tool_calls.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2472a794c6b49d1ad26aba67c757a8f4e0939881966a56b711e6eec02338dbb3"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_cli::cmd::verify_witness::extract_witness_segments (cognitive 17): rvf_cli::cmd::verify_witness::extract_witness_segments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_witness.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"096e3703894edf1128d52e50cbfccf44ac15c7f597d5f9ddd8ed20ff2eada2c2"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_import::bin::rvf_import::main (cognitive 17): rvf_import::bin::rvf_import::main has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 5 (7 pts) (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-import/src/bin/rvf_import.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33ccad23a85fc506d54112593a30735f081e2cfb5eb8c60c00847475c60b05f"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamIngest::publish_index (cognitive 17): StreamIngest::publish_index has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (4 pts), boolean chains 2, loops 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/ingest.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b95e4d0b3bf69da5745755d9dd8f06ef3b43fe19c88d57d3156e768f5b727b"}},{"ruleId":"D2","level":"warning","message":{"text":"RvfStore::query_routed (cognitive 17): RvfStore::query_routed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0936f70df0eefacea89deb10065ac54973720fd0c392a2de8f5e7d5bd94d81"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpTransport::fetch (cognitive 17): HttpTransport::fetch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/stream_client.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7197033fc2f2bbcfb4866fca5e91859d52cbd8e9ac8b24ec504aa6521ee8ede9"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_server::ws::handle_socket (cognitive 17): rvf_server::ws::handle_socket has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/ws.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"052ed2c1af97bf5a2cbc05677268dc56628971ff6feb827cd4143c08c9fecc9b"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataSegment::decode (cognitive 17): MetadataSegment::decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, loops 4 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/metadata.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"815a2c1aaf316d5aa678b2d03417204d34a16d7e6ca7db0f515286977d676d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::create_relationship (cognitive 17): Executor::create_relationship has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/executor.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bd6f2440363f72846efaaac3b218ec6deaf211cf7c35ee56d6b018cfdb50a3"}},{"ruleId":"D2","level":"warning","message":{"text":"SparqlParser::parse_prefixed_name (cognitive 17): SparqlParser::parse_prefixed_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d583bf84249d74cae82c1d2b895937cd8cccea792aa3230bf8a5b4e6156166"}},{"ruleId":"D2","level":"warning","message":{"text":"rvlite::sparql::executor::left_join_solutions (cognitive 17): rvlite::sparql::executor::left_join_solutions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce7c6a92122c1a063dc48d6a27cd1d151ec653c1a487e7f9ca177eb6343ef26"}},{"ruleId":"D2","level":"warning","message":{"text":"DerivationTree::collect_subtree (cognitive 17): DerivationTree::collect_subtree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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":"crates/rvm/crates/rvm-cap/src/derivation.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fbc912d45a1aee3b5fe1572fc75f1d6d1c30e0ef9cc0fa727e935a9e3a21f0"}},{"ruleId":"D2","level":"warning","message":{"text":"rvm_proof::verify (cognitive 17): rvm_proof::verify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4fd0c2a1aa04d73d99056190a715b9f6eca24ac6f8e2f82008e8e72cc5577e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_gateway::m3_shard::handle (cognitive 17): ruvector_edge_gateway::m3_shard::handle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/m3_shard.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2cd993e3e5f70f9c72fa0cdb5493b00db765146076b0c420a77fa6edee7c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"Conv1D::f (cognitive 17): Conv1D::f has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 1 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f397c8ac1ede7a83e3230427b22ca337b3eddab36af64d4b77e1a6eb334f929b"}},{"ruleId":"D2","level":"warning","message":{"text":"Conv1D::f (cognitive 17): Conv1D::f has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 1 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"437ce5137e78b149721d94880bb181abf8e7d14b618d3b512136f8d2d145a065"}},{"ruleId":"D2","level":"warning","message":{"text":"Im2Col1D::f (cognitive 17): Im2Col1D::f has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d6b1d86b110e55fa6dcc32e6b13d6b01763316f5ae8535db19589a9444c08b"}},{"ruleId":"D2","level":"warning","message":{"text":"Im2Col1D::f (cognitive 17): Im2Col1D::f has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aaf6f914678fd34a498bd8ee0a2d430075c30e57a2d95ebe74cec64456fd8f"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ2K::vec_dot_unopt (cognitive 17): BlockQ2K::vec_dot_unopt has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"491b107f6cc06bf23edcb4f66126f17002355f47695b3fae6141918896a97113"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::cat0 (cognitive 17): Tensor::cat0 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Tensor::cat_contiguous) 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":"patches/candle-core-0.8.4/src/tensor_cat.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8f81a3b9af8ab22f512c9dc9ada08709097fc1f50a87bd9770846a19fd72e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::cat_contiguous (cognitive 17): Tensor::cat_contiguous has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Tensor::cat0) 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":"patches/candle-core-0.8.4/src/tensor_cat.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a36c61b58ec9e0ce5edd576e15c6a12b05c033da4ffb2075eb0e494e4b9764f"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::cat0 (cognitive 17): Tensor::cat0 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Tensor::cat_contiguous) 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":"patches/candle-core-0.9.2/src/tensor_cat.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6b83deda008fcdfe5dd6a569f8c6ad682ed921d0d7db9265e17977f3314d2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::cat_contiguous (cognitive 17): Tensor::cat_contiguous has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Tensor::cat0) 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":"patches/candle-core-0.9.2/src/tensor_cat.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96a9971308b230d1d7649f362f524ab33ad1b184248d9e386fa5918fca98db9"}},{"ruleId":"D2","level":"warning","message":{"text":"Scatter::f (cognitive 17): Scatter::f has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), match/switch 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a974b186f967735c259f4d27c1e44fa4284e03461e23843d053f4b9facfd3d3"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cpu_backend::utils::binary_map (cognitive 17): candle_core::cpu_backend::utils::binary_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (5 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"648b47fc978211707d2c18f6c654c52d4e454e4d8fe7369a0b20102d00aa03db"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::cpu_backend::utils::binary_map (cognitive 17): candle_core::cpu_backend::utils::binary_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (5 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/utils.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8fcf26e33ce6fb0675ea76d884fc7e92ecaed5d0fb14d57ec9999dc9252765"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::simd128::vec_dot_q2k_q8k (cognitive 17): candle_core::quantized::simd128::vec_dot_q2k_q8k has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/simd128.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b089c47a8bf7e4110f1a188a6453deedd8d20a50ccc266db09c87af36da472"}},{"ruleId":"D2","level":"warning","message":{"text":"Collection._search_hnsw (cognitive 17): Collection._search_hnsw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21665037cc3e6465f83ba629481c35d69872fe33546993568cbec00c0662546"}},{"ruleId":"D2","level":"warning","message":{"text":"salesforce.sync_records_to_collection (cognitive 17): salesforce.sync_records_to_collection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/integrations/salesforce.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd917fb2fdb06ff980c4c0b72703bfdae1377f053309aef6f6515fd4808c261"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchWithCache (cognitive 17): fetchWithCache has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (5 pts), boolean chains 4, error handling 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/loader.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9963ee22216a96e2aac1f1671b689f234c6da2e549d283992d45281d6aaf64de"}},{"ruleId":"D2","level":"warning","message":{"text":"scorePatternMatch (cognitive 17): scorePatternMatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/name-predictor.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d87190b69e8b9ed9749c905b81408bb9f095187234de375a2a4206803c07912"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchWithCache (cognitive 17): fetchWithCache has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (5 pts), boolean chains 4, error handling 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/pkg/loader.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b05941e799dabe2286aacdc17efb43e5c3317203bbec11c936e73c2273506c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ByzantineAggregator::aggregate_weighted (cognitive 16): ByzantineAggregator::aggregate_weighted has cognitive complexity 16 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 4, boolean chains 1 (nesting depth added 3). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/aggregate.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78e789a9ffb37594401b9f96459acc2e783cc3eb65721dcd2f1e21336c11c82"}},{"ruleId":"D2","level":"warning","message":{"text":"KnowledgeGraph::compute_edge_strengths (cognitive 16): KnowledgeGraph::compute_edge_strengths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fec0efbdb768ebdd72d1b39b3c414a1d7a22f61dbcd07f520c2bb363a4a8ca"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonCrawlAdapter::test_connectivity (cognitive 16): CommonCrawlAdapter::test_connectivity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"9911fc4a479d49836384a0618e969d7075fa1b846e79979c1755b8b66a50fe92"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_brain_server::bin::local::aidefence_scan (cognitive 16): mcp_brain_server::bin::local::aidefence_scan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9241855bd0afb37782381959b9d55d79c50b422802fca53d835798af380f586"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_gate::schema_cache::write_canonical (cognitive 16): mcp_gate::schema_cache::write_canonical has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 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":"crates/mcp-gate/src/schema_cache.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8858d5f8497226abf5d125301c447f210d1942803100c8a523d1a5205bed44cb"}},{"ruleId":"D2","level":"warning","message":{"text":"HyperbolicAdapter::frechet_mean (cognitive 16): HyperbolicAdapter::frechet_mean has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3 (4 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/hyperbolic/adapter.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf3a774e84287e1d04fb0b0ea3983ca7e71664b65f0c72e4675b59ca0001bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"MinCutAdapter::compute_isolation (cognitive 16): MinCutAdapter::compute_isolation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/adapter.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"89162e9c50e28f9f6054c18d99fa4b986099f473057585c1ae4d5e1cd100be2e"}},{"ruleId":"D2","level":"warning","message":{"text":"HysteresisTracker::update (cognitive 16): HysteresisTracker::update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/neural_gate/gate.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"52625234dbd282bce05f12fd7a5273dcd521af057c410fc892ccce97c2e5cb31"}},{"ruleId":"D2","level":"warning","message":{"text":"RestrictionMap::apply (cognitive 16): RestrictionMap::apply has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3, match/switch 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/restriction.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60e950183c0cc271093ebf3ae223d43ba49389a28ab97e66abcf3c9aefc7a74"}},{"ruleId":"D2","level":"warning","message":{"text":"FlashAttention::compute (cognitive 16): FlashAttention::compute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sparse/flash.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0ca83c0b0d7e6a75957e783c2b0e86ef50ee7c79c4fe89777b179caa163258"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_attention_wasm::utils::random_orthogonal_matrix (cognitive 16): ruvector_attention_wasm::utils::random_orthogonal_matrix has cognitive complexity 16 (threshold 15). Drivers by points: loops 8 (16 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/src/utils.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b765611678e97b28cdb91bce1adb9f69dce1b94187792d0515db88215fe7777e"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::ces::compute_relations (cognitive 16): ruvector_consciousness::ces::compute_relations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/ces.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c7c7cc1667991190a8262e7abe81566d5aecad9ffebf6cba06e38f22e2e595"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_consciousness::iit4::product_distribution (cognitive 16): ruvector_consciousness::iit4::product_distribution has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (6 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/iit4.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"93017cd6435a413a8aea99215bf1ff77c5dbf9256bd30a35bf33ace13d54e2a2"}},{"ruleId":"D2","level":"warning","message":{"text":"HypergraphIndex::remove_entity (cognitive 16): HypergraphIndex::remove_entity 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":"crates/ruvector-core/src/advanced/hypergraph.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b3ef9a73358ac48f4db2e4c025eea06d39acaa7c8e374a49117ed18e2e2ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"TopologicalAnalyzer::compute_clustering_coefficient (cognitive 16): TopologicalAnalyzer::compute_clustering_coefficient has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced/tda.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"573bafa5e7c85e7447c4cb4747f8a79ab9e0b99938edf04ff607e02b9b5afd3d"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerEncoder::layer_forward (cognitive 16): TransformerEncoder::layer_forward has cognitive complexity 16 (threshold 15). Drivers by points: loops 8 (16 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/transformer.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0029b22121191753e369560322ac5dc1bc9bb86724c2c1e57fd678a42b394fb8"}},{"ruleId":"D2","level":"warning","message":{"text":"PolicyKnobs::crossover (cognitive 16): PolicyKnobs::crossover 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":"crates/ruvector-domain-expansion/src/policy_kernel.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0982a81c7d6826a82510cf507664b9f691e23781c42e4af488bd408e8aa3c43"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_authz::confidential::authenticate (cognitive 16): ruvector_edge_authz::confidential::authenticate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-authz/src/confidential.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b764726adb0aa06a4a4dc5ce7344234bd7cc74d85a0945a24b5c3d1fb1a9fca7"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::parse (cognitive 16): HnswIndex::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, loops 1, 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":"crates/ruvector-edge-index/src/hnsw/codec.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88bf629434fb8c1bc424831da4b8ca83610a52ca066cad3be38a41e610ed9c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Version::parse (cognitive 16): Version::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-registry/src/version.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a918e37591d8e1ac5e5e93e7fa4677744973f6f60fde4d99f5255cb7d48988c"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorShard::delete (cognitive 16): VectorShard::delete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4, boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/delete.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e4df67ade92bfad25e8b8e8a30f4c69c803872e250723f3e23a3f5e687638b"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_edge_store::ops::vector::vector_delete (cognitive 16): ruvector_edge_store::ops::vector::vector_delete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/vector.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9bf169e60859a6bebe64534c9859fe2b6f92e35433974c0aa58f45312a2f02"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_function_call (cognitive 16): Parser::parse_function_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"678ab8fac247c81084be3b23b85d1978510993f8f672fb03e4e3118595cd63b2"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDB::load_from_storage (cognitive 16): GraphDB::load_from_storage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/graph.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"561ab7e2e4d8b7b72eecf5c29c57dd959258e3e8cf2349cd89f8250a5609470c"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionManager::commit (cognitive 16): TransactionManager::commit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 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":"crates/ruvector-graph/src/transaction.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"757ddc2ff9f352857f4f86b2ea6c46bd29077e173e603a8e04a9ea05cf83fa30"}},{"ruleId":"D2","level":"warning","message":{"text":"PlantedPartition::generate (cognitive 16): PlantedPartition::generate has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (7 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/synthetic.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63e09d77d98438b8a071d347e87b9deedd033d46caca81b8ed43f8cf8b24b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphCoarsener::coarsen (cognitive 16): GraphCoarsener::coarsen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/self_organizing.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dda926786a464343a14c60ef08060c1e0f2772fc97ed56b6a9a986aa658da3"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph_transformer::temporal::topological_sort (cognitive 16): ruvector_graph_transformer::temporal::topological_sort has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ad9a865f88ab589439d1d30d2c0212ac2a4c2fb93bf50775709357a9acb4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_hailo_cluster::health::probe_one (cognitive 16): ruvector_hailo_cluster::health::probe_one has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/health.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa98d76dd25c24db22ba84e6e76655c2505215f730781adc34c2871f84c1b4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::greedy_search_one (cognitive 16): HnswGraph::greedy_search_one has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/graph.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d5aea0bd0bc67d0a41b3c8fd2348176d7f32519015c87b62b1296850b74f23"}},{"ruleId":"D2","level":"warning","message":{"text":"KgeModel::predict_json (cognitive 16): KgeModel::predict_json has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 10 (11 pts), if/else 5 (nesting depth added 1). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"092d2caa35820eeca1c77ee6cfd2f67ea5331fa33f21a7d3cf13458a2b51c04c"}},{"ruleId":"D2","level":"warning","message":{"text":"KgeModel::predict_json (cognitive 16): KgeModel::predict_json has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 10 (11 pts), if/else 5 (nesting depth added 1). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-wasm/src/ops.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e49a546f447aae81bd8419f6558f59f6561e893cad4b91ca8926e85e128fdb2"}},{"ruleId":"D2","level":"warning","message":{"text":"BottleneckDistance::can_match (cognitive 16): BottleneckDistance::can_match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/distance.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"813ceb8a94db790aaf9defa1b4ad36b8bf55ca18175fa73332e0b2d68b8f5afc"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswGraph::search_layer_impl (cognitive 16): HnswGraph::search_layer_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-matryoshka/src/hnsw.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"644696b092ff4e1a5a6fe67edfd38562ca2c4453c58e61780911319f4fd1452e"}},{"ruleId":"D2","level":"warning","message":{"text":"ApproxMinCut::ensure_sparsifier_connectivity (cognitive 16): ApproxMinCut::ensure_sparsifier_connectivity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/approximate.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59affdd0d117b118bc4255f96b4b7d94d5c6631b7011030edf589ec69a771f4"}},{"ruleId":"D2","level":"warning","message":{"text":"GomoryHuTree::partition_on_edge (cognitive 16): GomoryHuTree::partition_on_edge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/tree_packing/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"04661420a65bf51820821580cc07c15e38fc02b5b68675569ab52af10908959b"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreeLevelHierarchy::update_expander_edges (cognitive 16): ThreeLevelHierarchy::update_expander_edges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 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":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eb9587f5b73b020a02ba71b062fa55e71f526362c2c3f275866807fc75e9bc"}},{"ruleId":"D2","level":"warning","message":{"text":"PathDistanceCache::update_predictions (cognitive 16): PathDistanceCache::update_predictions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/cache.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8eafef4cf2ff2261425102b9054b5e8814a60241407fbf37e0df5657d34522c"}},{"ruleId":"D2","level":"warning","message":{"text":"DegreePresparse::presparse (cognitive 16): DegreePresparse::presparse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/dspar.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f6f0b5239e7a5dcb6a512a4ce4a1e3b17d9db0ff8078e8928468f1df53a5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"SimdDistanceOps::relax_batch (cognitive 16): SimdDistanceOps::relax_batch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/simd_distance.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f4a92145b08fb87db258938aa102dc21623fd506e4847e533ab37ca59dbf26"}},{"ruleId":"D2","level":"warning","message":{"text":"WitnessTree::build_spanning_tree (cognitive 16): WitnessTree::build_spanning_tree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 5 (8 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/witness/mod.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2160028f0dbad169ecfdcd0a6e9aee8576bcfc0a44b6630b6babb6bb2805baf7"}},{"ruleId":"D2","level":"warning","message":{"text":"SQuatQuantizer::gram_schmidt (cognitive 16): SQuatQuantizer::gram_schmidt has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 1 (2 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/squat.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6221b7e96af4dbe867dcb0da4ff954662079bc58a7442accd992fd8c8fbb47ce"}},{"ruleId":"D2","level":"warning","message":{"text":"FlashAttention::forward_tiled (cognitive 16): FlashAttention::forward_tiled has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 3 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/flash.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"15126d098bb45abb9d306a9dfc5b2b56b8e65cdf3b99e33a83b4750122999d73"}},{"ruleId":"D2","level":"warning","message":{"text":"HealingWorker::check_health (cognitive 16): HealingWorker::check_health has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/worker.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c581a374f17e36d9cb0144a27cb4305cac4d2f980d6636b32885de8c1acb862d"}},{"ruleId":"D2","level":"warning","message":{"text":"LargePayloadSegment::try_allocate_range (cognitive 16): LargePayloadSegment::try_allocate_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/ipc.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36bce73c418ae8349cbf83602c2129f140d2f3c5bb7366d1c03f4534e558393"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::healing::functions::ruvector_healing_configure (cognitive 16): ruvector_postgres::healing::functions::ruvector_healing_configure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/functions.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf88bf75cb70f315bf4c0eca3d82a574346f7aeeb52b8f0df42ba5b612af841"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_postgres::index::hnsw_am::hnsw_build (cognitive 16): ruvector_postgres::index::hnsw_am::hnsw_build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e0f277b675b230995fdd329b76bc6069f3156b2cfa37088f285437da7d0da1"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_rabitq::scan::scan_scalar (cognitive 16): ruvector_rabitq::scan::scan_scalar has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3, boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/scan.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba755455c0d3990e6ee577ecf3263eebc79935edd899440272d42546eb1d0db3"}},{"ruleId":"D2","level":"warning","message":{"text":"FailoverManager::start_monitoring (cognitive 16): FailoverManager::start_monitoring has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/failover.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"096f3a3f3739d8f3e8a711fb87729850b8425c8d273a7f0c4203a6aea0529f39"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_retrieval_receipt::bin::benchmark::run_signing_batch (cognitive 16): ruvector_retrieval_receipt::bin::benchmark::run_signing_batch has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5a166f0c9b3d11ef9120a97fd33763c755163abae54ac94c476e240f142e18"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_robotics::planning::astar (cognitive 16): ruvector_robotics::planning::astar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/planning.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6a4486287ce231a10728f60a5dc9e43d8d5b1ece01ec157f7ee91887b98d6f"}},{"ruleId":"D2","level":"warning","message":{"text":"HnswIndex::insert (cognitive 16): HnswIndex::insert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/src/index.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2478eb2ffcec8e69e7c795c26d47ea4c57ba37979dc5b29b3e419aacc0e99574"}},{"ruleId":"D2","level":"warning","message":{"text":"BmsspSolver::solve (cognitive 16): BmsspSolver::solve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80131b9b200116778f390bd043c9eadbef93ec26fa838b0ffaa0223900a6132"}},{"ruleId":"D2","level":"warning","message":{"text":"Codebook::update_one_pass (cognitive 16): Codebook::update_one_pass has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/pq.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8736ae98f96ca4e3f8d6194d3d208b89187854a9e11c3a337e111ff5c3dfbcdd"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::decide (cognitive 16): Engine::decide has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff80049dba7cf69b34b9b9bae30f5060027a643bd26cef48a205f44b553bee6"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::admit_rows (cognitive 16): Engine::admit_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"804e37474c6726015cf24c15441153f5149fb19ddaa7816e628aff9d0ada6334"}},{"ruleId":"D2","level":"warning","message":{"text":"Sampler::next_batch (cognitive 16): Sampler::next_batch has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/sampler.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afd87e38067546bb807e6d5e0e078b774da1e63a9652c72bc1a3f3caa873b21"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvix_cli::commands::dtb::execute_validate (cognitive 16): ruvix_cli::commands::dtb::execute_validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c06baae62a4e003e895d61e0c119d777d2b41a61b0583c46d6f8ec929b9a99"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplayEngine::verify_state (cognitive 16): ReplayEngine::verify_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 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":"crates/ruvix/crates/nucleus/src/checkpoint.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade22c3c1101bed478254ce19f7d422ce715bdc4cdee4bdc9828118e9cc2b6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"PartitionManager::select_next_partition (cognitive 16): PartitionManager::select_next_partition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/sched/src/partition.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d155c4276ccea5afefa1874731a703368fd35401f349c710bc31ca1fc336428"}},{"ruleId":"D2","level":"warning","message":{"text":"Phi3Model::forward (cognitive 16): Phi3Model::forward has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 4 (5 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e3c65118a8d018ae57f20dcd8b5757bf0dd18f5707b82fc9aaec547f5d496"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningBankIntegration::get_recommendation (cognitive 16): ReasoningBankIntegration::get_recommendation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 5 (7 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc61be3ad05a2d5710cc2fc496c467e163870594ab975055827b6cead22359c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningBankIntegration::consolidate (cognitive 16): ReasoningBankIntegration::consolidate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1865ecc69263eae350ea54fab83a829aa0bc37af1cad9feb8be2bb9d8907500"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelCard::to_markdown (cognitive 16): ModelCard::to_markdown has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (8 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/model_card.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1802f2b909301e3b692630135d41bc96f55ed4152e7950204e36d1147632e799"}},{"ruleId":"D2","level":"warning","message":{"text":"RuvLtraModel::forward (cognitive 16): RuvLtraModel::forward has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 4 (5 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63ff1df10d6941d7898d3bb2f8f5d06fdb92ccea98faafe99ad88f8a954c4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"DiversityAnalyzer::detect_mode_collapse (cognitive 16): DiversityAnalyzer::detect_mode_collapse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/diversity.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3989d96b95afd14a59d63d52518449a1249ae61176fae12138f63b68a4b22282"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternConsolidator::find_mergeable_patterns (cognitive 16): PatternConsolidator::find_mergeable_patterns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reasoning_bank/consolidation.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b163cdd59963f1a3a1dc02c9c373831666b9c69f87fbf0b5b4f53e4a8a9bd340"}},{"ruleId":"D2","level":"warning","message":{"text":"PatternStore::merge_similar (cognitive 16): PatternStore::merge_similar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reasoning_bank/pattern_store.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c8fe85d2b6dd8e65511d365ec334ec5a3e853884a0619932ca0d3d1bbf876a"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetGenerator::augment_examples (cognitive 16): DatasetGenerator::augment_examples has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/claude_dataset.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd405cceb2fe58a951c060fc10d84a171091d2c5ede343aea9130ec13ed4826"}},{"ruleId":"D2","level":"warning","message":{"text":"McpToolTrainer::predict_tool (cognitive 16): McpToolTrainer::predict_tool has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/mcp_tools.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"312dfb2429d8852f914c71bf0b9164d379bbd962223e39476a99a802c9520143"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvllm::kernels::quantized::quantize_to_q4k (cognitive 16): ruvllm::kernels::quantized::quantize_to_q4k has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/quantized.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b2579ab1326040032080a8f0df507d287ec04b9ceb34b81d1171f0586ce88"}},{"ruleId":"D2","level":"warning","message":{"text":"Retriever::generate_fast (cognitive 16): Retriever::generate_fast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (8 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_retrieval_diffusion/src/lib.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"408e8019027c4b9a524ff0efae7b8d791187a4c520db71b057bf990a3d389bbe"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalFsBackend::execute (cognitive 16): LocalFsBackend::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-tools/src/local.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"2478dcac98116b9f5e73db59283eae50d88e09f29239ebaef507e245caf73eca"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmMcpServer::execute_tool (cognitive 16): WasmMcpServer::execute_tool has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/mcp.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"9321c4df68306d910485f51f51a15c6b9d9d57fb0d3c54a25da54df54cd4d946"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmRvfBuilder::parse_internal (cognitive 16): WasmRvfBuilder::parse_internal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/rvf.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25ce521b66873b5b5f5f9e30f1202eaef7e45f43c45918e17cd364d8b0c11a1"}},{"ruleId":"D2","level":"warning","message":{"text":"AgiContainerBuilder::build_sections (cognitive 16): AgiContainerBuilder::build_sections 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":"crates/rvf/rvf-runtime/src/agi_container.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ba960d3be76a408e3e4cde703e6ae208cf499c071a2fd92cccc75b159865ae"}},{"ruleId":"D2","level":"warning","message":{"text":"QrEncoder::to_ascii (cognitive 16): QrEncoder::to_ascii has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_encode.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"d032327f2dcc3ee9913f75803b6cced2a4ffc8ebfb4c2063b9cbbb634debf398"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::qr_encode::generate_codewords (cognitive 16): rvf_runtime::qr_encode::generate_codewords has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_encode.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f947d02b3903407abd71a088ae0dbe64ab1c88e69eddfdc972c4eb9c7edf8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf_runtime::qr_encode::place_finder_pattern (cognitive 16): rvf_runtime::qr_encode::place_finder_pattern has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_encode.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0b5b737f29b122d49957f00648a1bfaf5c361e3313d4964e4ad24bcb041d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"rvforge_registry::bin::rvforge-registry-check::check_publisher_signature (cognitive 16): rvforge_registry::bin::rvforge-registry-check::check_publisher_signature has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 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":"crates/rvforge-registry/src/bin/rvforge-registry-check.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a18f6221ac9fc2a71f9cc4776337481584a56f78ee59e7d057644b543f0af5"}},{"ruleId":"D2","level":"warning","message":{"text":"rvlite::sparql::executor::evaluate_binary_op (cognitive 16): rvlite::sparql::executor::evaluate_binary_op has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 1 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e318641ec55d6f591010748ad8ab18b853a4b6539b9e15b33e8ad6e91fbea04"}},{"ruleId":"D2","level":"warning","message":{"text":"ProofVerifier::verify_p3 (cognitive 16): ProofVerifier::verify_p3 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/verify.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0dbbee3344193c28c70af00f2e434e18ff3e5cfef2ba9e56f3a6533e93257a"}},{"ruleId":"D2","level":"warning","message":{"text":"BuddyAllocator::find_first_free (cognitive 16): BuddyAllocator::find_first_free has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/allocator.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baab61594e7a2252da8732302643da7fece19183fd6aef22d1bf6c4080dbc05"}},{"ruleId":"D2","level":"warning","message":{"text":"ReconstructionPipeline::reconstruct (cognitive 16): ReconstructionPipeline::reconstruct has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/reconstruction.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c82961bfacd7ed00f67306641c9e5d13fece64ee4eb91613bda5240409e81e"}},{"ruleId":"D2","level":"warning","message":{"text":"ReduceSum::fold_impl (cognitive 16): ReduceSum::fold_impl has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5b1cb6ef176269c5d00cbdb794c730044383466e5bea5657be35b1a88aa630"}},{"ruleId":"D2","level":"warning","message":{"text":"ReduceSum::fold_impl (cognitive 16): ReduceSum::fold_impl has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d34e447ae27101aba7bcf0730f61046d16766e53701ee115accd2d7a41cd3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockQ2K::vec_dot_unopt (cognitive 16): BlockQ2K::vec_dot_unopt has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (16 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc804a32e9ae44cb8f4420510302e5ee7bbc120d9db5802575f2b6a6feab3fa8"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::sorted_nodes::walk (cognitive 16): Tensor::sorted_nodes::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb4088627b03bc2e054c1efdb9b5ceb3f079ec1a0022ef0bc93da173a6d10ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::sorted_nodes::walk (cognitive 16): Tensor::sorted_nodes::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/backprop.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dc55fec9075051b31c9785f10fc63581dbefcda7ef7ac52d133bf06df094fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Tensor::fmt (cognitive 16): Tensor::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 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":"patches/candle-core-0.9.2/src/display.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aff1aeb9a4a80c26a9ee05ef3819eb39c4cdde277a79b519dc0b70a31c1fd7a"}},{"ruleId":"D2","level":"warning","message":{"text":"candle_core::quantized::simd128::vec_dot_q2k_q8k (cognitive 16): candle_core::quantized::simd128::vec_dot_q2k_q8k has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (16 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/simd128.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ef60a4006ae8bb99a0d2c8e69e8d68ca8fdf00301b71c821025d3c0d6fd26e"}},{"ruleId":"D2","level":"warning","message":{"text":"Hnsw::edges_above_endpoint_level (cognitive 16): Hnsw::edges_above_endpoint_level has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff59f03ebad24f795e650d23bacfba6149105d53cacbfbd718aa66c05f12cc1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.serve (cognitive 16): cli.serve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 4 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/cli.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9f5275b5abd695aab98638d08a329a2d46cbd6c458b29b6e705cbcaa2afb4d"}},{"ruleId":"D2","level":"warning","message":{"text":"RuVectorStore.add_texts (cognitive 16): RuVectorStore.add_texts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/integrations/langchain.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e70d7c9ba78cf4d9aa78d3d8c87a25fbe4119ba0612c5ec7b916a78679b5c87"}},{"ruleId":"D2","level":"warning","message":{"text":"ruvector_graph.reachable (cognitive 16): ruvector_graph.reachable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/portfolio/ruvector-graph/src/ruvector_graph/__init__.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3966e2d65b6cb110a021b10af580e11ca3eb89f1ba350978be3aca1adef6ef8"}},{"ruleId":"D2","level":"warning","message":{"text":"isPrivateAddress (cognitive 16): isPrivateAddress has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f395e0b333151cc1b84733d6ff7abade5a0ad299504f16b13c1b39190ace937"}},{"ruleId":"D2","level":"warning","message":{"text":"expandCommaExprs (cognitive 16): expandCommaExprs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 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":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9906024c42d1ed1d45680f0d5e811f54daf7eb3af22fb4191c42ca46a51a2df"}},{"ruleId":"D2","level":"warning","message":{"text":"generateJSDoc (cognitive 16): generateJSDoc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c36ac6b150a3a0c4a0d89e18d4bf4f16a6bcfb623f3b21eeffedb9884ba58fb"}},{"ruleId":"D2","level":"warning","message":{"text":"addIntentAsync (cognitive 16): addIntentAsync has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5, loops 2 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/router/index.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4412a27d934827da9fa4c820aea245241c9cbc66db54e599bed83440e677ae92"}},{"ruleId":"D2","level":"warning","message":{"text":"insertBatch (cognitive 16): insertBatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/adapters/ruvector.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f355a89ab1decb94a66df30fd52d9d140c4048b96d30944adc17b16bc9f64770"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshotOptions (cognitive 16): snapshotOptions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/quantization.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62ae782c2007be011bfe9134522d0887e7c5a970db95404cf4ad349df77d269"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/routes.rs: FileTooLong \u2014 5917 significant 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 110 free functions. The bar is 500 significant lines; this is 5417 over it, 11.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16adfad7754db50c09fad554b62ea8638b130acb50ea93b4f7dfedd03317c4ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolDatasetGenerator.define_mcp_tools: MethodTooLong \u2014 define_mcp_tools runs 940 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 840 over it, 9.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":"crates/ruvllm/src/training/tool_dataset.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"9231fde030a739e762b623d596d4ed758021146fe5f10bb6f44843fd99004ecf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tensor: TooManyMethods \u2014 210 methods, declared across 14 files: src/tensor.rs (145), src/tensor.rs (18), src/custom_op.rs (12), src/conv.rs (7), \u002B10 more file(s). The bar is 30 methods; this is 180 over it, 7.00\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e69679db5dcf01f819fc5f30c09d3f26777c0a94483edc8bad16d6cd088999"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RvfStore: ClassTooLong \u2014 2733 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 137 methods, 2 blocks, lines 156-4561. The bar is 400 significant lines; this is 2333 over it, 6.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a412a7d44b1492aafed245eefbeddc60e0d846da773665737a32ba6456596d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 3010 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: RvfStore (2 blocks, 156-4561). The bar is 500 significant lines; this is 2510 over it, 6.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c25c46f61f5e22aea91790e268d92aa272bbd78958c9d9369b2ad2b05408ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu_backend/mod.rs: FileTooLong \u2014 2368 significant 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 1868 over it, 4.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a563af79a861229bf7ea95ad3789e30b8f04faa041dd59dab7d00563ec06283e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RvfStore: TooManyMethods \u2014 137 methods, declared across 7 files: src/store.rs (96), store/policy_api.rs (20), store/filtered_query.rs (8), store/custom_segments.rs (4), \u002B3 more file(s). The bar is 30 methods; this is 107 over it, 4.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8836acc37cb7fdd63b766b4b5c5b9618ecb5656441819f5fa6de62d603fae5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tensor.backward: MethodTooLong \u2014 backward runs 444 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 344 over it, 4.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/backprop.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ead3287d7ff95d6ef66373f1a113177325267d3fce02f718ec5ce7146eeb819"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tensor.backward: MethodTooLong \u2014 backward runs 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 334 over it, 4.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":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbe96a21de2c7b851c0621c275bde449f02136620c51e8d954ab6e0c5848c12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::bench::main: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::bench::main runs 432 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 332 over it, 4.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f06037a58f82fca8dec8c9f18e24146f13bc84ae710107dbad68cbec54546e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cuda_backend/mod.rs: FileTooLong \u2014 2139 significant 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 1639 over it, 4.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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"360eb69748ca0ce1a37e75c8b6b8544a2688d2424f8fb7ca941e24a533a4d452"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bitnet/backend.rs: FileTooLong \u2014 2096 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: BitNetBackend (4 blocks, 612-3370). The bar is 500 significant lines; this is 1596 over it, 4.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6cf8bd8ffef254870758eed4ae599f110c5d5b0a0aa4b65d5c37e3424e3a36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::embed::main: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::embed::main runs 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 303 over it, 4.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c54302197e47fe520b7b6b696e112cc22f05dfca1fd93da3fa0eeacc8aad3c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskGenerator.build_templates: MethodTooLong \u2014 build_templates runs 400 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 300 over it, 4.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/task_generator.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d3d05ff3524f7657d3ada32fb13e744109043a06ebd755d74ac5db45af9b17"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetalStorage: ClassTooLong \u2014 1570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 3 blocks, lines 71-1912. The bar is 400 significant lines; this is 1170 over it, 3.93\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb87523ca362f5a2d8dd7fb605887a4b29224da2cd27d74b348955f97d40a444"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetalStorage: ClassTooLong \u2014 1569 significant 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, 3 blocks, lines 74-1922. The bar is 400 significant lines; this is 1169 over it, 3.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"069b9e7fa75d54dfafe4a9a02632298f227f4df8d0a4ee206233339b02290229"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BitNetBackend: ClassTooLong \u2014 1557 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 4 blocks, lines 612-3370. The bar is 400 significant lines; this is 1157 over it, 3.89\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee15fa3c661583a253343cd30b956f5b44c7b3bdb15219a11e36af567af1eca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu_backend/mod.rs: FileTooLong \u2014 1906 significant 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 1406 over it, 3.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7066bb3e08276285524436fcd3d3657a11c491e89471db38211bb279e3c39a7d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tensor: ClassTooLong \u2014 1518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 4 blocks, lines 45-3116. The bar is 400 significant lines; this is 1118 over it, 3.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6b61db126569cb5cf4a3b171bf5ca87de6890ede2fb32c6436f658a84c01aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metal_backend/mod.rs: FileTooLong \u2014 1784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: MetalStorage (3 blocks, 71-1912). The bar is 500 significant lines; this is 1284 over it, 3.57\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bd24af600a6e05c7923e8987eccb64aaec0d71ec0be220091a4364f302f991"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metal_backend/mod.rs: FileTooLong \u2014 1780 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: MetalStorage (3 blocks, 74-1922). The bar is 500 significant lines; this is 1280 over it, 3.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cc8e6e29da694adc5fd654364e901af23fa3594301f3f25006adcbf39f6059"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quantized/k_quants.rs: FileTooLong \u2014 1744 significant 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 1244 over it, 3.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f896a5f0f8b51a3a3d005bdfd817fc18ccb57ef8616b86aedd1b974ea5310f15"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkerPool.generate_worker_script: MethodTooLong \u2014 generate_worker_script runs 343 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 243 over it, 3.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/pool.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fa2c6c9c6a8ff1a869ac4d6ee614813554836e2d60ce20404ea1cdc37b798d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tensor.rs: FileTooLong \u2014 1690 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: Tensor (4 blocks, 45-3116). The bar is 500 significant lines; this is 1190 over it, 3.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65248370c7436268494c607b3490e2caf7a26fc16c8d7806d6e0c0ad3e2ba4a8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tensor: ClassTooLong \u2014 1327 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 210 methods, 3 blocks, lines 45-2583. The bar is 400 significant lines; this is 927 over it, 3.32\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfca19ae1abacb74262b0150ff58a1ef13ba83dd3ed0589bcc2f6d09f0758317"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::stats::main: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::stats::main runs 324 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 224 over it, 3.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/stats.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e98e6443aba7fbe98de0e2b10882b21ea72023ce4e34e6077290fbbe3cb8b8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cuda_backend/mod.rs: FileTooLong \u2014 1607 significant 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 1107 over it, 3.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"096b0d4c32b6b4f183163902d87935fc0974c6a888e117d751dc2e9a7d9df9ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/hooks.rs: FileTooLong \u2014 1580 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 1080 over it, 3.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19fb0a7f3e24a9a74c8e13fdacf5c24bc169b1e6c92cb8d7f577bef7bbabaf9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CpuStorage.to_dtype: MethodTooLong \u2014 to_dtype runs 309 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 209 over it, 3.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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcc0366061f9a6c98addcd7455f933649d4e6fa7acba62faf69ff8b5031a010"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sparql/parser.rs: FileTooLong \u2014 1500 significant 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 1000 over it, 3.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40ad7076ad1fc259956ba97026ca4c76229cbd5b3c23ba87ec12c8c9a6145ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tensor.rs: FileTooLong \u2014 1499 significant 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: Tensor (3 blocks, 45-2583). The bar is 500 significant lines; this is 999 over it, 3.00\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a20cb10e14d7b17713d13c68190c9a23e3f5a25d1025925ee883eb893701c16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sparql/parser.rs: FileTooLong \u2014 1475 significant 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 975 over it, 2.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65f55011b98e7f98f5d7b3551e6862dbe527ed0120f8f553092ec2215d376aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolDatasetGenerator: ClassTooLong \u2014 1163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 2 blocks, lines 435-2029. The bar is 400 significant lines; this is 763 over it, 2.91\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/tool_dataset.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"1433ba85bfd3f78f8221cf999cf9f74448d0907748e58e35005579b9fc89a4fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: training/tool_dataset.rs: FileTooLong \u2014 1401 significant 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 83% of them inside a single declaration: ToolDatasetGenerator (2 blocks, 435-2029). The bar is 500 significant lines; this is 901 over it, 2.80\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/tool_dataset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"905ef57c4ea754e9a6309d37225ebcce4d21d2a68854b6a35c70cb17491f83d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_retrieval_receipt::bin::benchmark::main: FunctionTooLong \u2014 ruvector_retrieval_receipt::bin::benchmark::main runs 270 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 170 over it, 2.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d55d06ad563b825ba60b751192cd65b7dd2e3a89d4c3529f8121d2630b766ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/attention.rs: FileTooLong \u2014 1349 significant 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 849 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fdc85098f02a0708c7527b399bd03f806e40354ca256b889b995a88889e080"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quantized/k_quants.rs: FileTooLong \u2014 1339 significant 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 839 over it, 2.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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7816e930fec39303be4d2ea20c17a4df802c31e8b6eead9c7ed75ab43a76641f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/hnsw_am.rs: FileTooLong \u2014 1311 significant 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 811 over it, 2.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbda937ac2d4170f6c8f97d0270a0511ae698e6e6eef69f4c2a84bacde00c1d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_temporal_tensor::quantizer::dequantize_f32: FunctionTooLong \u2014 ruvector_temporal_tensor::quantizer::dequantize_f32 runs 262 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 162 over it, 2.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd7fe4a0bdc00ca1ee3f041f743777f42d2980af9a86efd3bc212063d741c52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrainTrainer.discover_space: MethodTooLong \u2014 discover_space runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a84a8a6117261669dc4c2cb2f063dbc4461ea78936234d18ddcfae8c976b270"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CpuStorage: ClassTooLong \u2014 1038 significant 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, 3 blocks, lines 22-3024. The bar is 400 significant lines; this is 638 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"40742f4764a850b565bb7a1fac42e3ffd4828e16faf0fab398a01c5b090bd2c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::worker::main: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::worker::main runs 259 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/worker.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4793528920f5081b456ce5724655758959a4cd51cfbc140235bd4ceecb0e72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/ivfflat_am.rs: FileTooLong \u2014 1276 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 776 over it, 2.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef8b8d0e70533be98ecddabbd1429529a9310fb1c16d7ceef48b65db6e8d05f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SparqlParser: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac2aa024efcd20114ba28f283ab7fa73365a125879a741037e868790f2ab758"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SparqlParser: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"794fe69cdd590d1e007cd69deb5f74d3498c1e234a4935a135f7264b8b8915a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/candle_backend.rs: FileTooLong \u2014 1176 significant 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 676 over it, 2.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e1f8112714487e49ec61ecb573e3f40e04d8918e67646b995b2373d8b8842d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CudaStorage: ClassTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 3 blocks, lines 1192-2469. The bar is 400 significant lines; this is 509 over it, 2.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99c5fe234ce7fa2bdf94beb1f273c3437864aa819240927c8563aaf7cbda9ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_weaver::queue::build: FunctionTooLong \u2014 ruvector_weaver::queue::build runs 226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 126 over it, 2.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/queue.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"351ceb93e6a334ebd15d06e1486a7e1c3b372e9220382ecbe96ef1a6cfd37f33"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FirestoreClient: ClassTooLong \u2014 899 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 56 methods, 3 blocks, lines 45-1518. The bar is 400 significant lines; this is 499 over it, 2.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf01c11243c0a37ad68883979ec94d5c7c726f4a517fea7df9ce3fa75ef44c6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.optimize: MethodTooLong \u2014 optimize runs 224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine/optimize/campaign.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f93fd79db591799457eb0bddd4e00782144a3692ddb9e819e9485a9877d778"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm::kernels::matmul::gemm_tile_12x4: FunctionTooLong \u2014 ruvllm::kernels::matmul::gemm_tile_12x4 runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bc7177e1a7e2bfee14ca6a081d727f678024080c14ea70337467cde8e22caf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetalStorage.unary_impl: MethodTooLong \u2014 unary_impl runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ee2b230fa0429afb51fc6a8d5650913eb6902346ff457a3e19d3177927d0cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hnsw.rs: FileTooLong \u2014 1081 significant 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 581 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae094ea15c7da7f9475c2ab73fc269fe75c8c7d283850a9f240b184594cbfad3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::ruview-csi-bridge::main: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::ruview-csi-bridge::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":"crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0747fee6739d6690a0a2a1cbb7833860c04e5b40ea2d246bdccff529739d3a2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/local.rs: FileTooLong \u2014 1073 significant 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 573 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa7b36d1463afea12b4d78296f5ff4b8dfa03b032ce9ba247d4c1e1ea58656d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sparql/executor.rs: FileTooLong \u2014 1073 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 573 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f4e77b15b4222998c78f7f6932645182be1247d45fbd6defb0b1cf587f81cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 570 over it, 2.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ae3aea9c54578b8dcdc62ddc2082c59f688e4fe85ec4e97c85186ad8cfd92a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VectorShard: TooManyMethods \u2014 64 methods, declared across 8 files: shard/mod.rs (21), shard/persist.rs (11), shard/maintain.rs (9), shard/write.rs (8), \u002B4 more file(s). The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7006e4ae1ce9f6b6c789c11719f1b871daea6a104efab96cbf632b72e14eae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_streaming_qng::bin::benchmark::main: FunctionTooLong \u2014 ruvector_streaming_qng::bin::benchmark::main runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/bin/benchmark.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e08269609972ff869abe01b63cad50dfa7f937d6bd17203d26ac6441d61e2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::mmwave-bridge::main: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::mmwave-bridge::main runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"162f260ae8b85b98c1b77b3e382121348977827016579432dd9019c43c0d41eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: distance/simd.rs: FileTooLong \u2014 1048 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 72 free functions. The bar is 500 significant lines; this is 548 over it, 2.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a2b1652ec16bcc8edb12e5f543e14ef07a6e7d7da1acc223fea2f96467e87a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hnsw.rs: FileTooLong \u2014 1044 significant 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 544 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":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de05eae85007cc4173107edd516de50eb2c1f15805290269ad65b3c06db16b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_typesafe_train::train::run: FunctionTooLong \u2014 ruvector_typesafe_train::train::run runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/train/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa14ab57b2958ae1c4198ae4a69cc5f43ff7a0a54162dcd505402b59ccb5ce0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RvfStore.compact: MethodTooLong \u2014 compact runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"8487e982c2dfe348d8d1efb48298e189dc544972c490c83c295cc8e92ed2740a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_brain_server::gist::research_and_write_with_gemini: FunctionTooLong \u2014 mcp_brain_server::gist::research_and_write_with_gemini runs 203 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0b1b7b20f12249d6f1c06847928825c5581d1fd7927f7c63001951e81cbc0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/embeddings.rs: FileTooLong \u2014 1005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 505 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/embeddings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a7c4ce2a36c9e8f1b8dce36c6e91a299b7c93895be550d622a6b1b0def5c32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpBrainTools.list_tools: MethodTooLong \u2014 list_tools runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b27f69129801b7c5329198726dc9676b39b083353848ca0e688846fff212890"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/http.rs: FileTooLong \u2014 993 significant 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 493 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5f9e71434e8cd9a131091fc33ce3cf774c09cd322da301990b60f2bb07793b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubquadraticSparseAttention: ClassTooLong \u2014 792 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 6 blocks, lines 75-1822. The bar is 400 significant lines; this is 392 over it, 1.98\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1cd9a309cabfea08bc8ae1aff614285fdd9de422ead9d2cd4ca908c957d10c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pipeline.rs: FileTooLong \u2014 979 significant 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 479 over it, 1.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6447ab77f7bbe37e16a4de5edbd0712b102d7420d7fbf175347201dd962b600d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kernels/attention.rs: FileTooLong \u2014 971 significant 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 471 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e83d884606ebaee33a01b50d419ceb5f4eac27a23a8c7c8037ba946e5adbc8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/coreml_backend.rs: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 460 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a738de900b27c3db69c3172c6926f25db910237b248d2bf6402fa19216456f21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RealContrastiveTrainer.train: MethodTooLong \u2014 train runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/real_trainer.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3457d22f27cc8cc0820e24b835318b6614127efff56a933e8a06162b2b5ead"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rvf_server::http::discover: FunctionTooLong \u2014 rvf_server::http::discover runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/http.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"9648e2d4eb426c50d1d62f17539a29ae425855348cdd4f4b1a89f4fba33b4ae5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kernels/matmul.rs: FileTooLong \u2014 954 significant 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 454 over it, 1.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":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c654dd7796bd841254e12feb9479d72aadd648f3da17bc8a3f5f44313a6eb1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_cli::main: FunctionTooLong \u2014 ruvector_cli::main runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/main.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b1a7d563288eb839cd53f9e2d41cb668a893e4d9c2627de662e3e85f86e15d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_lsm_ann::bin::benchmark::main: FunctionTooLong \u2014 ruvector_lsm_ann::bin::benchmark::main runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-lsm-ann/src/bin/benchmark.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"69460b5ebf94ffb8be7bc053c30cee0ec1591d5557c7c823dd3e24b12439bb3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CandleBackend.load_gguf: MethodTooLong \u2014 load_gguf runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa178316371151858362b5286f53187ec683c76fd14d7fe22bf3de31117cebe2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RoboticsToolRegistry.register_defaults: MethodTooLong \u2014 register_defaults runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/mcp/mod.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61e7a85172686022d60ccdb30ffa88eed563aec213be38943ad188db794dea8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FirestoreClient: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"854a28dfc6014f08ab65fde6aef957b20c1b561c0268efd44bcb0b078b536527"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 926 significant 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 97% of them inside a single declaration: FirestoreClient (3 blocks, 45-1518). The bar is 500 significant lines; this is 426 over it, 1.85\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1e6a334c3c9ff7a9cc66ed9cb782d976fd6bae25d33f334d16cb824989d333"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::ruvllm-bridge::main: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::ruvllm-bridge::main runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08f0b7030f4017b18b3b1a5d449ea48d506f1c0fd912e77f0d3bfd65b45191d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cypher_exec.rs: FileTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"134f4be3745d32c9da2232d4815a4c7beff8d79df7ae4f00318842cdea53e95b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetalStorage.binary: MethodTooLong \u2014 binary runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"2528e21461d327bcb4213a40fe1614d0a66d0259c564412d3a5e04bc9f7be00f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/simd_intrinsics.rs: FileTooLong \u2014 890 significant 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 390 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"972d95595d2b0937c1e40b7c3831bf0e619c1e909ad69d513363320290b83c0b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkerPool: ClassTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 49-1131. The bar is 400 significant lines; this is 292 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/pool.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddde2e21d5eaf68c290df921e1b4df0e522a78f0a7454500c4bdbfae8f9b705"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agenticdb.rs: FileTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 365 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6cd5879bfacdb44b77e3b6cd7436783c6b6a3b464303ddc7823de5503ac254"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/op.rs: FileTooLong \u2014 861 significant 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 361 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f069fed5bc466a3547adedf75b372c665d2ed536ba1be0a6b3b459e92c88576"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hnswio.rs: FileTooLong \u2014 858 significant 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 358 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"723af055259b618aca93ef50797d0762416a7f73502781e8cf415195dc46516f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hnswio.rs: FileTooLong \u2014 858 significant 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 358 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"169953f98e6addee61ea8ab5e03bee7bf2c8891c173464d902d9bf1b0431a2fe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CpuStorage: ClassTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 3 blocks, lines 20-2448. The bar is 400 significant lines; this is 285 over it, 1.71\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24a5914822a997627337b9dd1e504f94b3533cf4cd0210c76b29941efef796c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cypher/parser.rs: FileTooLong \u2014 851 significant 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 351 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfd7a89e5770ad9628ca9c7d3f033757afd380ca1a1eb1cb2f01b0374e6aea0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/libext.rs: FileTooLong \u2014 851 significant 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 64 free functions. The bar is 500 significant lines; this is 351 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f6f8c002e285788f08f2087aee883af61ef7dde3a6a851f96fbb4b31e8ab92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/libext.rs: FileTooLong \u2014 851 significant 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 351 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/libext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fb5a1f4329686310fb9a206bc2434189ab24238e525d586e1be12815dec85a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_bench::bin::turbo4_ablation::main: FunctionTooLong \u2014 ruvector_bench::bin::turbo4_ablation::main 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":"crates/ruvector-bench/src/bin/turbo4_ablation.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"242f18fa421940771217bcd2ef9fbcd93cff20c6a88a75fc6177931f499cefe0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: McpBrainTools: ClassTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 3 blocks, lines 34-956. The bar is 400 significant lines; this is 275 over it, 1.69\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c5818c69249cad98f21e350d9c01a79cff5166d9766eba2b4d9376e8216d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_maxsim::main: FunctionTooLong \u2014 ruvector_maxsim::main runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-maxsim/src/main.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f669b70fb1a870e883a3d3f7a4fc6310747d7cd1ed75d762d8a46691ad3a0f15"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RvfStore.ingest_batch_internal: MethodTooLong \u2014 ingest_batch_internal runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ad2585a9f059119204978bbad8a73159d900ca555f9657219fdd8dca118781"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_edge_gateway::m3_ledger::handle: FunctionTooLong \u2014 ruvector_edge_gateway::m3_ledger::handle runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/m3_ledger.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa8512b2ed8018b55c826f4c8387de32c796fc5f5fe59d743caa3797671a3e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/kv_cache.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":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d165bbd3d38db54e22340595d39aa4a2467d94bbade0eb22c1ae1ea64f1f592c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/mistral_backend.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). The bar is 500 significant lines; this is 329 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4248cb604166fb6c46d717996e9279ca33176db77b9fd043e4d7cb03c91f5eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubquadraticSparseAttention.forward_gqa: MethodTooLong \u2014 forward_gqa runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fc327d6109f56167953aeccf0645aeb819734f7a8106f563678fb538f85421"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Kernel: 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":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45ca5e02dffe56bade912f5a9f59de291f239f16fe9cbf5788cd95876b4ed81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transformer.rs: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: CoreGraphTransformer (3 blocks, 249-1191). The bar is 500 significant lines; this is 316 over it, 1.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/src/transformer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"659e0f655c96b19ee6375ae403f77c6cde2622f998ddb3e671429a2d64f86c3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RvfStore.restore_cow_state: MethodTooLong \u2014 restore_cow_state runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":3753}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5c120ce61ad5bd4729167dca330b3796df5d40129e06fb99aa01cf8953d64d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_adaptive_ann::bin::benchmark::main: FunctionTooLong \u2014 ruvector_adaptive_ann::bin::benchmark::main runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/bin/benchmark.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30c11a22063edc164eeff7361197f92bffb4b31882f9c605248d7a2ca0ce735"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebGpuInference.matmul: MethodTooLong \u2014 matmul runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/webgpu/compute.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ff489a0c6a5bdeca1233e05bd6726e273f0b30268c6d384e44fbce028f5a6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm::kernels::matmul::gemv_neon_impl: FunctionTooLong \u2014 ruvllm::kernels::matmul::gemv_neon_impl runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a3bdeffc8ec73d8c6505be113ab5f1924ac40e90d139aacf62aabf1b210279"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rvf_cli::cmd::verify_witness::run: FunctionTooLong \u2014 rvf_cli::cmd::verify_witness::run runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_witness.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edd6c344e1ebf03579f5124558b88f8e40ac9f7041af8332e25a8372ec0310d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transformer.rs: FileTooLong \u2014 785 significant 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 77% of them inside a single declaration: CoreGraphTransformer (3 blocks, 229-1108). The bar is 500 significant lines; this is 285 over it, 1.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caa92dee404d70bd2fd1f7f123c5468661ad73061c7b411fed128e1fc484db5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Kernel: TooManyMethods \u2014 47 methods, declared across 2 files: src/kernel.rs (35), src/shell_backend.rs (12). The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/kernel.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4b0ff9a3c95177428a05db719d4d93f54408bc6535079b4ab7e8e52393fd15"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: sonic_ct_wasm: TooManyFunctions \u2014 47 free functions. The bar is 30 free functions; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct-wasm/src/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c6f4a8131c97e2d4e354e1a05d5d800c079295d2c56b879353d09108736e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VectorDB.open: MethodTooLong \u2014 open runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d6ffad710ae388c7988936a4eeefed734fd6dd915e761fb24ae577030cc57f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubquadraticSparseAttention.forward: MethodTooLong \u2014 forward runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1bb788f6596c4409e349b28dc08fdbb1c72df20fe218c3b0150678378d7063"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubquadraticSparseAttention.forward_flash_inner: MethodTooLong \u2014 forward_flash_inner runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ba64457913061389ae27a6d680b3a643502cae02b96fb7854fd778eefe61e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrainTrainer.discover_earth: MethodTooLong \u2014 discover_earth runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"154ef1529873615971f5bb4d7a04baf4541553e19c3da08a76447c307e3a7967"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiskAnnIndex.load_impl: MethodTooLong \u2014 load_impl runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/index.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77723ee86b2edcf7380a346afc86563bfe1c8f00947c336a04a3e4ab34f6f2a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CoreGraphTransformer: ClassTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 3 blocks, lines 249-1191. The bar is 400 significant lines; this is 219 over it, 1.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/src/transformer.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"798323748447b2174337a08889610c410f236115706191076a08ed29e858365f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_postgres::index::ivfflat_am::ivfflat_ambuild: FunctionTooLong \u2014 ruvector_postgres::index::ivfflat_am::ivfflat_ambuild runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"996a0ec4903a383ac34b9dcafb959a78cca5b01fceaca63425a366fcf9cfe40c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Storage: ClassTooLong \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), 0 methods, 2 blocks, lines 10-849. The bar is 400 significant lines; this is 215 over it, 1.54\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":"patches/candle-core-0.9.2/src/storage.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbe534d7494ad16a329b366130a743832f811be25ec597ecfdcac54a0230a44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: claude_flow/pretrain_pipeline.rs: FileTooLong \u2014 761 significant 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 261 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/pretrain_pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da98ae3ff40c1e1f4b8fbd78edbf15a420bfa9bce52b33c5d6bf29bf976c2dd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MetalContext: ClassTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 41-1019. The bar is 400 significant lines; this is 208 over it, 1.52\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e33fd150c381407cd45d4f0bcf30fa3cb4f95586898b0ed51703174039e46d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/autodetect.rs: FileTooLong \u2014 760 significant 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 260 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f57dc6f062939ef70102f83123746cb9ee0c9ced3600c64c02cee9d388dfbb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::bench::write_prom_textfile: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::bench::write_prom_textfile runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78ddaede2d98320dfa86bea8437e60e4ce42174fe1a19ee0ff9010b932619b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_weaver::seo::propose::propose_package: FunctionTooLong \u2014 ruvector_weaver::seo::propose::propose_package runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/propose.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8babc0d59e9bbfe2bc5f91218b6a4c18496a50a63f4731bcc5e6373fed4d802"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CoreGraphTransformer: ClassTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 3 blocks, lines 229-1108. The bar is 400 significant lines; this is 205 over it, 1.51\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1d52c1d3d36769a6ce171938ab5a91f1c9d728a3dbaf33b9852a6373d34da3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamIngest.query_with: MethodTooLong \u2014 query_with runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/ingest/query.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f812e7a7f961e0258c0076b0275a6925deb210baab5f12ded74de778c8b1715"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: training/claude_dataset.rs: FileTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: DatasetGenerator (2 blocks, 333-1116). The bar is 500 significant lines; this is 253 over it, 1.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/claude_dataset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a122ef971e9936c51dbb3d835eebd037b8733294740393ac54f815f554857e1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: 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":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8ba72342baebf34e0cc0853c00ac40ff5d3120cbe488f575290f337b375722"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetalStorage.unary_impl: MethodTooLong \u2014 unary_impl 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":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56c3efd7527e3615bb3385ecd066ccb411364e314226e464c1095387bf8f3f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 749 significant 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 249 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7002d403b5b404290e756936d19b4c50fcfb37ffd1c6c3cac84aa1c1ad97fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_entropy_ann::bin::benchmark::main: FunctionTooLong \u2014 ruvector_entropy_ann::bin::benchmark::main runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/bin/benchmark.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f827f2ae5b9b71f99c0cad493b3097f56d52454be420e986aa25b82422511f21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoraAdapter.forward_simd_neon_impl: MethodTooLong \u2014 forward_simd_neon_impl runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"14455affaee195d7871fea034e0ab6de36b43feaf53034d04e2c64fd0fd448fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rvf_server::http::discover_dyson: FunctionTooLong \u2014 rvf_server::http::discover_dyson runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/http.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"599a2edd7600ace4408fdbf11596d6164ab86e80e3adbdfc702ef95f2af5d12b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CpuStorage.to_dtype: MethodTooLong \u2014 to_dtype runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdf02ed7c759c79bcc76bb2f0ea69a507dd294c2bca64d707f352e7db0c3824"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cypher/parser.rs: FileTooLong \u2014 744 significant 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 244 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ed4781e07ababde7d61241e420f9113adc6c4b30875b4437bbfd5a45fcd211"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/temporal.rs: FileTooLong \u2014 743 significant 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 243 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bd043b94af634ea5e73aa507e54a971c1283bd11b5acd86fb615f815b3ff88"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_gpu_runner::runner::launch: FunctionTooLong \u2014 ruvector_gpu_runner::runner::launch 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":"crates/ruvector-gpu-runner/src/runner.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b544633e31fced4c86d80b96acc8d59cbcd28cacfa881b990eb706e2ecbefe9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_weaver::readme::render: FunctionTooLong \u2014 ruvector_weaver::readme::render 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":"crates/ruvector-weaver/src/readme.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e114508b994de1358114d97ae3035a2ed1f745b15af745587dc77011342ab2e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BitNetBackend.forward_mla_cached: MethodTooLong \u2014 forward_mla_cached 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":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7cfe5c9756da2ef2a95f5363708ba02e18af41f87f3375e22fae9912020677"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_edge_gateway::ingest::run: FunctionTooLong \u2014 ruvector_edge_gateway::ingest::run runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/ingest.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4108ec69248fcc963f5662df5664f792dda978351a0cca438dd1191ef79638"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/speculative.rs: FileTooLong \u2014 734 significant 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 234 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/speculative.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d855a5e8decf330a50d6b3a237ac95d4af40de12d5ff7e5f12a13aaccb37f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CudaStorage: ClassTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 3 blocks, lines 997-1886. The bar is 400 significant lines; this is 187 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d005964143c020773928a90488db3a36b3137aad7c653e9f3ff474132f7f5cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ruvector_postgres::graph::sparql::functions: TooManyFunctions \u2014 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/functions.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"10310592f1b7c17b00c057aed2a8411efebd05a22e05618c4f41af205b417771"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ac8ab8b5b34202cbe24f1485f2b6b9e64343aa11e718f2b5233ac31e4fb302"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BrainTrainer: ClassTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 128-901. The bar is 400 significant lines; this is 185 over it, 1.46\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bb6d21f38fa0c42d1c0238159c044084c760af9e754709c3c911e426db1714"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 65 free functions. The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"188c5851ea4e61e815005a9ef1b9d5ddb05bfd09057ea053580484cb83e857e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rvf_server::http::witness_log: FunctionTooLong \u2014 rvf_server::http::witness_log runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/http.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b51285c35855cb37047148cab601761c9052f437dc8b9cba687a9cff0ee575"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/serve.rs: FileTooLong \u2014 726 significant 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 226 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/serve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4964056e784770eb45d97c07b30a9ce197a9bc33f92c2ab8305a29642ff4fee3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_recall_bounded::bin::benchmark::main: FunctionTooLong \u2014 ruvector_recall_bounded::bin::benchmark::main runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/bin/benchmark.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e3aa208ea00c3e99cf8299be6a8b2b6e0ae58ab78ae47b6b934cf52f3e36c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/rdt.rs: FileTooLong \u2014 723 significant 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 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/rdt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"727d4592118ce7a71fec40506f423d0ab568ada8605c6caa4b31df06dc60d4b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: claude_flow/task_generator.rs: FileTooLong \u2014 720 significant 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: TaskGenerator (3 blocks, 314-1041). The bar is 500 significant lines; this is 220 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/task_generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4e2bef82e83ba3e7c6f31bb7c86d3ac8e6a40480e23d4c42e8389a28ba9b6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/op.rs: FileTooLong \u2014 720 significant 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 220 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":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc75f111610e4ebab9a05638bbec3d1fd67caf9ed0bfe58ef418f3717520315f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_diverse_beam::bin::benchmark::main: FunctionTooLong \u2014 ruvector_diverse_beam::bin::benchmark::main runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/bin/benchmark.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f808acaf1a10ee69587c9ac22f92c2c2054d03e6cb1623df613c1c53bfcb7dd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CudaStorage.copy_strided_src: MethodTooLong \u2014 copy_strided_src 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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"05244499479475b7ab7882b3f0cb573b912d5ca6f7c288be5d7fa5398345a748"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Hnsw: ClassTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 741-1740. The bar is 400 significant lines; this is 175 over it, 1.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8df7584d0631db1c266ec2d1cf9d26c178f800e5c64f54d4e93673d3549ca3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatasetGenerator: ClassTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 333-1116. The bar is 400 significant lines; this is 175 over it, 1.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/claude_dataset.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e376d0e0dd8b3ac9c4de9330ae70f63924ae7253c32ec1fee1c9e7cbc90aee9c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: KnowledgeGraph: ClassTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 3 blocks, lines 21-1027. The bar is 400 significant lines; this is 174 over it, 1.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c5ae5c97b4633f4aa72e67b5c6b93b12fad96e1966aaa80f18b64492c79438"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workers/pool.rs: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: WorkerPool (3 blocks, 49-1131). The bar is 500 significant lines; this is 217 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":"crates/ruvllm-wasm/src/workers/pool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1730e58d00e3b5e4e7031966031c68c772fc405fb41b31490d515da87db3a626"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HnswIndex: TooManyMethods \u2014 43 methods, declared across 4 files: hnsw/mod.rs (28), hnsw/codec.rs (8), hnsw/search.rs (5), hnsw/compact.rs (2). 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":"crates/ruvector-edge-index/src/hnsw/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00d4899d9df9fd2ba3f63d495838591b302caa39922f8a85bb13da8dcad2a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BitNetBackend: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b537374b54160fd0725a68e457cab4967c084660b23bc9ff708ce93bca15a02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_router_cli::main: FunctionTooLong \u2014 ruvector_router_cli::main runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-cli/src/main.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a18dead8b579584c1cd2afbdd410c487a1be93db6e5e053fdec46837fc2c48"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Storage: ClassTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 2 blocks, lines 9-788. The bar is 400 significant lines; this is 170 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44afa50588faf0b9d9447e9f7193733686f2f8f311dfdd052ec4622313ca6f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_brain_server::main: FunctionTooLong \u2014 mcp_brain_server::main runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5cbc72325a381afcec9e9afe3a97a04cc31831c40cd2289d6957028f8822b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GpuCoherenceEngine.compute_energy: MethodTooLong \u2014 compute_energy 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":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d462c21fd5c05b05d91c44fbb7922b193c07a806ef258599bd71dbcf57118e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AppState: TooManyFields \u2014 42 stored fields. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e71a385e93b5e4d9a23ab6b612cb0640c6d1b17952149ac577a1de605aa3ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tools.rs: FileTooLong \u2014 697 significant 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 97% of them inside a single declaration: McpBrainTools (3 blocks, 34-956). The bar is 500 significant lines; this is 197 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad23cf4967f711bf1cfcd5b2e7df7a7eb64084bff643f3cf313601a32035875f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 696 significant 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 196 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9096b3222ec932bf458922862c745724ca97ee6b2eeda7840223441596a8cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/manifold.rs: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 195 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/manifold.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20ab730ba570e5018e08e97a3b5aa7f6e912b6fad973030b2b052a660f69c50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/dtb.rs: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 195 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a8beab681464babe81da1ab72919ad3e7f1b8967fff254eeeba4d1bba304b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpHandler.handle_tools_list: MethodTooLong \u2014 handle_tools_list runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/mcp/handlers.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d367c47b8dea7cd8a4b5860c697ac09772609dea96cac764c7a4bb06487fc5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GpuCoherenceEngine.upload_graph: MethodTooLong \u2014 upload_graph runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aeb9f4931cf9af8da5316e82c69e49d2c9fe765a635a2e3ab93caa59705299"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: KnowledgeGraph: TooManyMethods \u2014 41 methods, declared across 2 files: src/graph.rs (33), graph/rebuild.rs (8). The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d7bcf75f08051705e5a656318dc5a6ecdb0490b1b4a4e43a21844bff326609"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/bench.rs: FileTooLong \u2014 683 significant 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 183 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7442f64cb999daea1552ebc6d1d39b8f023a71258553b3a86d6e8cad5bc4094b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/ruvltra.rs: FileTooLong \u2014 683 significant 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 183 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"815a004eb492ed665ed32826728fd3be14c4990341645b068d4e30b626a6a789"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 682 significant 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 67% of them inside a single declaration: GraphDatabase (2 blocks, 58-1103). The bar is 500 significant lines; this is 182 over it, 1.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bebd6ad7dc9f7439682a019dc56e8e82754fed13973e5e91181f86a4e6616c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_spann::bin::benchmark::main: FunctionTooLong \u2014 ruvector_spann::bin::benchmark::main runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-spann/src/bin/benchmark.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff8f62a8e50acac9d38e7e4f7cf9ff206e789c393b324915663529ce1fc4a6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: claude_flow/model_router.rs: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 179 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/model_router.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"254f61de88b53dc6879f6dcac864606d738885839fc8a45806155467cd5ae27b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ThreeLevelHierarchy: ClassTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 3 blocks, lines 229-1266. The bar is 400 significant lines; this is 143 over it, 1.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"696aca7b0e13da0b37a3204464e491249dd65028c50433755c03dde79cdc35fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: claude_flow/reasoning_bank.rs: FileTooLong \u2014 676 significant 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: ReasoningBankIntegration (3 blocks, 533-1222). The bar is 500 significant lines; this is 176 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc57ef9950b1eb3d7790010d962b908e66f88933ea00cab036f9c652d069a5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FirestoreClient.firestore_list_checked: MethodTooLong \u2014 firestore_list_checked runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb9964c6a1bde46e68c297ef1b75265a9124bd02a0758559266445ed1857753"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MistralBackend.load_model: MethodTooLong \u2014 load_model runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57aeb796236570ee91c29d0a4b059dd3fff55ec7bc4b795f50f2f62ae625ff4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Hnsw: ClassTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 734-1626. The bar is 400 significant lines; this is 136 over it, 1.34\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":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c5bd490b54b82cb771670ee3b52454e91fbe699507bb213ce7b7ccf9f4c627"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HefPipeline.open_inner: MethodTooLong \u2014 open_inner runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo/src/hef_pipeline.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dbcdd7ecd97bd7cc2418803d16fde643db3037c14e8915ce5cc5aed94a17ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_sota_bench::bin::sota_all::main: FunctionTooLong \u2014 ruvector_sota_bench::bin::sota_all::main runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sota_all.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8878bf6565ef8667d8576059744e7883fed215292f86cf338d927dc99a887f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stack.read: MethodTooLong \u2014 read 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":"patches/candle-core-0.9.2/src/pickle.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdecae6ff6defdcb9f70eaf4f8be13d117d8bc35d3b6cb633f9b231ed963114"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/memory_pool.rs: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 167 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/memory_pool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b54ed831fb673d6213638420902185e22bb26758fab299ea92e4ddb6940bea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ThreeLevelHierarchy: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8005ba38089de5eac26c7be36aab159f6246becaeb1af3d5b14e73dd0c77ffea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ruvector_postgres::operators: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/operators.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"277f3e505e3a20e21e17f802396f6268376d78eba1b9693e4af01d6fb59e0bba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: McpHandler: ClassTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 20-815. The bar is 400 significant lines; this is 132 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/mcp/handlers.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"206d819d2eac64ddba7e0ffbe16ee475390ef83974b82b8fa092ea806a160084"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: canonical/mod.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: CactusGraph (2 blocks, 172-1003). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1710932c220ef0bc291bb7dcff864da14f3d0f444b270b9bd44c755450882e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: candle_core::quantized::utils::make_qx_quants: FunctionTooLong \u2014 candle_core::quantized::utils::make_qx_quants runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/utils.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a0d72bcc629df5e20c9cd4e437104e5916fee54157054d824f215f165a7217"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataMap.from_hnswdump: MethodTooLong \u2014 from_hnswdump runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de5200356302dc7cea014f3256ae7ebd488545a74e469a49b0ca26f92c96a02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataMap.from_hnswdump: MethodTooLong \u2014 from_hnswdump runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9265509bfe9495a4ef451b97abf2156a84ecb93c26e3ad48e42cbe2cb5ccb4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graph.rs: FileTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: KnowledgeGraph (3 blocks, 21-1027). The bar is 500 significant lines; this is 164 over it, 1.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fe9b788baa1e524e3e0cfa244cb5fb784cd562b03eb39cc8c36403b0376c68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bindings.rs: FileTooLong \u2014 663 significant 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 163 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaf638e8f621b5278ab00a8c648e449423dede1604ff5ee43c5fd6d39192b25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trainer.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), about 88% of them inside a single declaration: BrainTrainer (2 blocks, 128-901). The bar is 500 significant lines; this is 162 over it, 1.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":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cadec25e6d4ef8232f978b3b795604f8345da0a3565dd56779b475a380b89dd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubpolynomialMinCut: ClassTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 2 blocks, lines 202-1154. The bar is 400 significant lines; this is 129 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba01ff059ef2525476c7b1ddce89bfc2ed3899c73b7c5ddd52df882942752b60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cluster/hierarchy.rs: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: ThreeLevelHierarchy (3 blocks, 229-1266). The bar is 500 significant lines; this is 161 over it, 1.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":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b23babdd0044c0a9051331937849bc031e7271a0e5ba059436a4bf7b9a8f57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: training/real_trainer.rs: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: RealContrastiveTrainer (2 blocks, 166-855). The bar is 500 significant lines; this is 161 over it, 1.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":"crates/ruvllm/src/training/real_trainer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9c59a2e73338eaebf3337d49b65c3f5e7d74c93ded936df877f0e1a2e12bff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: photonlayer_cli::cmd_privacy_gate: FunctionTooLong \u2014 photonlayer_cli::cmd_privacy_gate runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-cli/src/main.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f15e6e9069d2d509ef81d74e25ba85a81d8d03bf45b284811e92473668951"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm_cli::commands::serve::run: FunctionTooLong \u2014 ruvllm_cli::commands::serve::run runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/serve.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2901c668f7534244e3b21243162c4d6cd085259f408056bf6231774fe40d05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quantized/cuda.rs: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/cuda.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd040b72cc96823cd36481a20633ae14a0d410467b5b44b20829ca717335ca8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: TieredStore (4 blocks, 406-1223). The bar is 500 significant lines; this is 155 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":"crates/ruvector-temporal-tensor/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c2814b8fa8a70dafc097460a0ffa59517c15e6b9e9c341707110115be1aa75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProblemDetector.detect_problems: MethodTooLong \u2014 detect_problems runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/detector.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecc9e8bb7ee418f9b99325a1846e71680162b2e591bb1d144051acb2a703a3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_edge_gateway::registry_upload_core::upload_call: FunctionTooLong \u2014 ruvector_edge_gateway::registry_upload_core::upload_call runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/registry_upload_core.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"27566d51ea512a65f37a27e0120056cb9f9ebf8aafdfc094272c81c602671f04"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FilesystemBackend: ClassTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 3 blocks, lines 32-857. The bar is 400 significant lines; this is 121 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":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefd0fc459458e31fe57abb87f14430e3b7dd0e1a999d98b522a66078e39e503"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm::backends::lattice_backend::adapter::configuration: FunctionTooLong \u2014 ruvllm::backends::lattice_backend::adapter::configuration runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/lattice_backend/adapter.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bfc2b08fe5e389ec097d24d13864edc5eaeba0b8a083224adda2613a3b623b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rvf_runtime::read_path::parse_manifest_payload: FunctionTooLong \u2014 rvf_runtime::read_path::parse_manifest_payload runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc93ff8f874adcbf2c04e8f2bb8e9feaadddb8acd6a8704e1e8cd5c0775bd080"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CpuStorage.concat: MethodTooLong \u2014 concat 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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c885cecfb5ac71aba543a4f26b515133696098c8b3478fdbeb9ee4880360d68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: claude_flow/hooks_integration.rs: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: HooksIntegration (2 blocks, 334-1041). The bar is 500 significant lines; this is 146 over it, 1.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/hooks_integration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e726aac6a046a7f7dc8546236fcb7ff67159d60d98b87f51b9796e7b24050b00"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm::backends::lattice_backend::adapter::validate_tensors: FunctionTooLong \u2014 ruvllm::backends::lattice_backend::adapter::validate_tensors runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/lattice_backend/adapter.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfd86f5f8bda9ab44d673379c32e4a686f665687754845786e7d759cb61a27f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuvLtraRegistry.new: MethodTooLong \u2014 new runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/registry.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b3ac82b5fca85ab40bf32cb6b7fe68b130a63163c7b9e6a823a05b0b1df7ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lora/micro_lora.rs: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 143 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50072847df6f7dc84d477c3d0435ee5a28eb8af669c2f0556660c48e21b670c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gallery.rs: FileTooLong \u2014 642 significant 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 142 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":"crates/rvAgent/rvagent-wasm/src/gallery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aee7bdce7f318def2a8492fbbe93c82b26cdb0c745eb0244ceb0a63ec6658f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_gnn_rerank::main: FunctionTooLong \u2014 ruvector_gnn_rerank::main runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn-rerank/src/main.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"438b381d6afa5e2d28a21ad0407f8e964d47fe9e8f763413283ae3e1878068f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_retrieval_receipt::bin::batch_latency::main: FunctionTooLong \u2014 ruvector_retrieval_receipt::bin::batch_latency::main runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/batch_latency.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe5b0142566b9da986ee31c5963c11e7e6e22f7fa9a80a9f6d64604d0903323"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpClient.connect_stdio: MethodTooLong \u2014 connect_stdio runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/mcp.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3163c96fe2a2716e424e13ad9592cc95674033211e72357c34df8639986718"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stack.read: MethodTooLong \u2014 read 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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0187afccc4b645fc174a3093cf45d0b4485021f698b96d840760ca89bb411301"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskGenerator: ClassTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 314-1041. The bar is 400 significant lines; this is 111 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/task_generator.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"830bdd8a756d17db693a945d7b2a5a3142f4f95b2cd77a6ad2ff92d58ffdd939"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArenaCactus.build_from_compact_graph: MethodTooLong \u2014 build_from_compact_graph runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/canonical_witness.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d4aaaea4d07331f754dfcaf8babafe9a48d5b3f5c8dd424d1343db3f4fc0ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_postgres::graph::sparql::executor::evaluate_property_path: FunctionTooLong \u2014 ruvector_postgres::graph::sparql::executor::evaluate_property_path runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"039995d404567671745a28697a8255a897f89f7e600ac3bd22365c0b9d2f2a4b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConjugateGradientSolver.solve_inner: MethodTooLong \u2014 solve_inner runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1b4e2e8f76565b6c9688a59dcb6be0e1439291cd287a667b35eb27a7d2912e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/benchmark.rs: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 134 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":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d39ee7676dd183fd726ca21a4f5585d39b39bb1f3b1f91dc57030d9d99be989"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: claude_flow/claude_integration.rs: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 134 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":"crates/ruvllm/src/claude_flow/claude_integration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96578e58798309f534eb5ebbcf0e88e925be7c279398390d45c9ee32eae8b405"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 134 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":"crates/ruvllm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b3195821bfd8be3eaa7f3df1299b505a7cc7ae82a59594cfc2f587b11b2545"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Storage: TooManyMethods \u2014 38 methods, declared across 2 files: src/storage.rs (35), src/storage.rs (3). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ada87d9813fd97236f9e8e048a335d9f532dd447a1768d109ac6f3f8ee7e88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MemSqlStore.run: MethodTooLong \u2014 run runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/mem_store/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7e7b62db83ee74fffa3b7718df10ca006b1d574698bb95205e1e82e9ee4501"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentGraph.run: MethodTooLong \u2014 run runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/graph.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"89eeb671e5aaec0dcbfc280fcf4dd4efb254067aec0831989a0eac5fa50e9431"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rvf_cli::cmd::verify_attestation::run: FunctionTooLong \u2014 rvf_cli::cmd::verify_attestation::run runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_attestation.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6441d887bed7dc4f4d17bd28ce54702c415ce2b4c04b9aa0eae811661ce7cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Phantom.build_slice: MethodTooLong \u2014 build_slice runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/phantom.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"351b443aa003e648d4127de0ffcff8ce7d1ae57e59ad016742fc5bcf86e7cfdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metal/context.rs: FileTooLong \u2014 629 significant 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 97% of them inside a single declaration: MetalContext (2 blocks, 41-1019). The bar is 500 significant lines; this is 129 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":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e239f50c78a02a9134514335058d0fd4cb9d7b471eddda875a2e83125214e292"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quantize/pi_quant.rs: FileTooLong \u2014 628 significant 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 128 over it, 1.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":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"790a63b3d9802787e83e18dd3d0c1dd33673fee9792c7891ccefd6aff10d8680"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CactusGraph: ClassTooLong \u2014 500 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 2 blocks, lines 172-1003. The bar is 400 significant lines; this is 100 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"097f0007ceb474b66342ad683c0641491620ceacfa7839719779822b21ea3069"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolOrchestrationDomain.score_orchestration: MethodTooLong \u2014 score_orchestration runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/tool_orchestration.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"309b10277294322f0d661b5f1305b787367ab34a3a9c652b8c200185f1071628"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_weaver::cli::seo_apply::package_pr: FunctionTooLong \u2014 ruvector_weaver::cli::seo_apply::package_pr runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo_apply.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3098a4eebeb3754076006881a0b258b25eb9d251f74237724199c4912fd762"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm::kernels::matmul::gemm_nt_neon_impl: FunctionTooLong \u2014 ruvllm::kernels::matmul::gemm_nt_neon_impl runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"542859f1b15cbd4d35c601a36923c608b30d2b73cab39256caafc7d29cde8dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quantized/mod.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"979f27d936ec24c2bcf48e51928d7d58ca73b8af0b16d1da57a9c673b90a0480"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/symbolic.rs: FileTooLong \u2014 623 significant 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: NeuralSymbolicBridge (3 blocks, 229-1027). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9b38af76d37d352b599559f3539abc7f5016fcb7646a970484f98fab247b59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: subpolynomial/mod.rs: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: SubpolynomialMinCut (2 blocks, 202-1154). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af682302a90a74387a998e97ef8c2128985851661de856fcf9383529ab41eb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/biological.rs: FileTooLong \u2014 621 significant 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 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/biological.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1edc8858d221cbcfe1979cd97a9d9c104859a951cbe03173c6ea2991f96a1f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/storage.rs: FileTooLong \u2014 621 significant 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 99% of them inside a single declaration: Storage (2 blocks, 10-849). The bar is 500 significant lines; this is 121 over it, 1.24\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":"patches/candle-core-0.9.2/src/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd8602fa080dccb73be97c5fec4c155ae7b11b07b0ac30cc5fbd16fdb8a70c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_weaver::scan::scan_dir: FunctionTooLong \u2014 ruvector_weaver::scan::scan_dir runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/scan/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f273cce0ad3905809243b7e188b2c35920197b419400d61f5afa4a38bc7328f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContrastiveTrainer.train: MethodTooLong \u2014 train runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4285aef444c4d844efbad3fe68e390ae0e883c1ef8f849d0e7e55ea6c1c545"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/consensus.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: PbftReplica (2 blocks, 440-1136). The bar is 500 significant lines; this is 119 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8924e28076ea25a9e2e02b76b9f2dfa74889d977fb03b92a48f9bbc49d1632"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ServingEngine: ClassTooLong \u2014 494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 3 blocks, lines 122-1070. The bar is 400 significant lines; this is 94 over it, 1.24\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3046582524ff271c549cdb3e90f60a3c51d84623efd5f493c10167e1ca0129"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Registry: TooManyMethods \u2014 37 methods, declared across 7 files: registry/mod.rs (14), registry/flow.rs (9), registry/blobs.rs (5), registry/list.rs (3), \u002B3 more file(s). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-registry/src/registry/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1399071b2adfe179e491d8ff6b2f61b2a1218a2ed0af8f36abaae5f8efc3d8cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Registry: TooManyMethods \u2014 37 methods, declared across 3 files: registry/mod.rs (23), registry/witness.rs (8), registry/publish.rs (6). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/registry/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3317b28b29fad0c1b9ce42eae258e1cb64b3690bece08421c48d9cea9e6e82"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: candle_core::mkl: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; 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":"patches/candle-core-0.8.4/src/mkl.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9932e4faca7dc8dc7756a12701a6922f8331a1b6202987a7bd646c2fc938bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hybrid::main: FunctionTooLong \u2014 ruvector_hybrid::main runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hybrid/src/main.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc557a7904d1023d08a672fbc3e7e28cba97e7b848e110153e42f8ada162fbaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MlaAttention.forward: MethodTooLong \u2014 forward runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/attention.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1dbcc22381ebdaeead713e1bfa7529e7b518ff638a743cf037ff4a6cef01fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RvfStore.restore_metadata: MethodTooLong \u2014 restore_metadata runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":4371}}}],"partialFingerprints":{"codehealthFindingId/v1":"492e393eb61e608883099ce774b0a2fda3ff5eb77ba87737301055329aa271df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attention/operators.rs: FileTooLong \u2014 613 significant 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 113 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":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eaaa88a14924a70d7189c9d71a9caa503ddb810bb85330bccd969126983f50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quantize/ruvltra_quant.rs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 112 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/ruvltra_quant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bf6260046935fcd667df8d6cd69d64596e5a71cd53ae6c67335cfe17ba7c5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AdaptiveRadixTree.insert_recursive: MethodTooLong \u2014 insert_recursive runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/adaptive_radix.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02281581f0dd5e7ec4baab0e5f6fb69947a5e02cb67a277170432d491474dc7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CandleBackend.generate_detailed: MethodTooLong \u2014 generate_detailed runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2b96ecc569f77da803f0fb4fb3218c9cd2330780ce7c276714df1d0273d597"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IntelligentContextManager.prepare_context: MethodTooLong \u2014 prepare_context runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/context_manager.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d39fc77aa574350dcccfbdbfb42d2ec0387160b2e3dc7f3e845825ac3c8505"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PretrainPipeline.generate_training_script: MethodTooLong \u2014 generate_training_script runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/export/pretrain.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4281adaaabbd58ba872f7742063ad31c44bbe282d4b87b73dc925463a62c239"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm::quantize::pi_quant_simd::pi_dequantize_neon: FunctionTooLong \u2014 ruvllm::quantize::pi_quant_simd::pi_dequantize_neon runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant_simd.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49364da5d46909256782c9af2a98034184265f5edc86e8eda2e134a81ada7a0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: candle_core::accelerate: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a868676a347a043d2dbf608bcd056b93775195d3c12057bc29741307857a33e9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RealContrastiveTrainer: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 2 blocks, lines 166-855. The bar is 400 significant lines; this is 80 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/real_trainer.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d9dc7b9df8b116bdffa40def6bc2034334af189cff79b56356ae0a5f4d0cd8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HnswIo.load_point_indexation: MethodTooLong \u2014 load_point_indexation 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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"1687a0e80219dace76e32cc2f3670072dc3720b2339051308748181355152cf7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HnswIo.load_point_indexation: MethodTooLong \u2014 load_point_indexation 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":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef34744731b7c6d83786d238f9af6cf0aa563684864bd6d3f0697d456f83c0b5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Kernel: ClassTooLong \u2014 479 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 47 methods, 3 blocks, lines 99-878. The bar is 400 significant lines; this is 79 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/kernel.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c242954d8cf563c23a384cad2c70e8bed6ede949773a3269c9dd6c5d672ecb9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RoboticsDomain: ClassTooLong \u2014 477 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 4 blocks, lines 110-794. The bar is 400 significant lines; this is 77 over it, 1.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/domain_expansion.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"93342f22fd842013ff59ed4a4e3b827bb1624094ecaf0dcf1ca158aa53dc8aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruos_thermal::main: FunctionTooLong \u2014 ruos_thermal::main runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruos-thermal/src/main.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"143349cd14efeab01019022f2afa199e8a214ec7b6bccad07e89066017c3f54e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::fakeworker::main: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::fakeworker::main runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/fakeworker.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9169aae2f6b1423b3e6a7e7f8e35f399fbcc6a6d3f339122da6556221feda0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_temporal_tensor::quantizer::quantize_and_pack_f32: FunctionTooLong \u2014 ruvector_temporal_tensor::quantizer::quantize_and_pack_f32 runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb99bb4e2fe2c34c8428e12b797725a3988460a2662cd8416eab89586464082"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CudaStorage.to_dtype: MethodTooLong \u2014 to_dtype runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"6907bc4573f84e03f107a6063277a2aa72fe4731c1d92993ab84957b72077494"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetalStorage.reduce_op: MethodTooLong \u2014 reduce_op runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ddc470bf51bbfb851529c494b1182fd03b8d5e94a9267a4eac1fe2fd74ad55"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TieredStore: ClassTooLong \u2014 475 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 4 blocks, lines 406-1223. The bar is 400 significant lines; this is 75 over it, 1.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/store.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"4444b79897666a501ddc9bed6567f4272671ccb1dd98d7fb816ed7ac7533d803"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gist.rs: FileTooLong \u2014 592 significant 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 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6518bd1278d1eb3f728abe411de01c6a2474043a2644e69e7c854309bbe4770c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: Kernel (2 blocks, 235-1098). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b146f845a6fd954f4621663adc9397b19f67a4bccd89e72fc3835b549fa285"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/backprop.rs: FileTooLong \u2014 592 significant 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: Tensor (30-729). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/backprop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d80b2c0b1892a15a4c27822b3ae4732d16780e4c0afb7449e8d4704189b382e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pickle.rs: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 90 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/pickle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30eb622dbc0b42a02323b31a91187d880341b6231f45badae1bc902246692099"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_rulake::bin::rulake-demo::main: FunctionTooLong \u2014 ruvector_rulake::bin::rulake-demo::main runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/bin/rulake-demo.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94d2a72e0ebc869cefa29c3e87228fa690758e9823da43b12cfec290f215e02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm_cli::commands::chat::run: FunctionTooLong \u2014 ruvllm_cli::commands::chat::run runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/chat.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"784e46c03d367f79599594ac23c0a0ced69ab6409cbe54ce9f7b7ef107935578"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvllm_cli::main: FunctionTooLong \u2014 ruvllm_cli::main runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/main.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8540b6f30924ae4f36d2631005d7d2076fe7790315586946696ef2ec577c183a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetalStorage.reduce_op: MethodTooLong \u2014 reduce_op runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b2aa55a822009a609fcfd4b141ec9effb5285703a70d1823f43ea708467fb8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RvfStore: TooManyFields \u2014 35 stored fields beside 137 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":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e509bd1dc46f65babe639dc33cfedd8ba034ca00718681a82fefad4bb50e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SubpolynomialMinCut: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a0d67df828533a277effb6217e11e9bda723e4d8165bbc3f87fcf0b0907941"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RvfDatabase: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/src/lib.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"242a0e6e5ce0a7c7a575c8193aa59afcc4d96337330391b888de96029cb4cbb7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rvf_wasm: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wasm/src/lib.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b851010c0ba86ea107682e1b399cdc237783ba9f4e806da1fb84642677627be5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StatusResponse: TooManyFields \u2014 35 stored fields. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54b449f29eb503a7e1aace0648c555a85b0b16e2be24dbc0883c4c2dfd3b95c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WasmMcpServer: ClassTooLong \u2014 464 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 3 blocks, lines 163-858. The bar is 400 significant lines; this is 64 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/mcp.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7383bc7db7bafadd471ffcaa28fb7e7e33e359f2a7812bd2b4954547a5d1094"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NeuralSymbolicBridge.run_inference: MethodTooLong \u2014 run_inference runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced4538477c331b94f8b10a4ce90a0faf9fc8e8e70955708c1b47b214a02244a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_cli::cli::hooks::init_hooks: FunctionTooLong \u2014 ruvector_cli::cli::hooks::init_hooks runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64aff267df8781e4fbe47fb43583620edd06fd47c861e2364dae1dfb3cee2c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CandleBackend.load_safetensors: MethodTooLong \u2014 load_safetensors runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b04220a64d1dd48a3c4cea3d772072e40b4e8a99be1e4fb8ba75eccf75c1a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/operators.rs: FileTooLong \u2014 578 significant 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 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccfa14666751eb355f63d19cbd15ca839be5bb499c1a9adac03656945115827"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: serving/engine.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: ServingEngine (3 blocks, 122-1070). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e05bfdeea45f688a229352da337a75d796ef23ddab40fa556e4e06afbeb0129"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/backprop.rs: FileTooLong \u2014 578 significant 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: Tensor (30-714). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31eaff429bfffb9853ad4ad6e90b3caa878b2728ef4b164990f33b4ad92d20e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SolverOrchestrator: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 3 blocks, lines 293-1069. The bar is 400 significant lines; this is 61 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6aa78217799255b81d290122754250d18c9447e295f8c50131496046d8e271"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HooksIntegration: ClassTooLong \u2014 460 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 2 blocks, lines 334-1041. The bar is 400 significant lines; this is 60 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/hooks_integration.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b0c9df99a9d78e413e53fa2be521ff52ef77a6775672be03d10ae99a8defbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/storage.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: Storage (2 blocks, 9-788). The bar is 500 significant lines; this is 75 over it, 1.15\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":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec29ef174d7c344afbbd7d09f62086be49605fa845518433bc94cc813d161454"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_brain_server::gist::format_academic_gist: FunctionTooLong \u2014 mcp_brain_server::gist::format_academic_gist runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db13f89dafe84daa1064cc8342d051b0b0307a08029bdf69f32f36b6ad2f170"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/ruvltra_medium.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra_medium.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bc420fc0963b5fe96dc00a3def7423a676bc95327742beb28a282b0233c115"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pickle.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db23f69cb610ac4efcd1b134763d7747998229db97d063336814a1593a24504b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CommonCrawlAdapter: ClassTooLong \u2014 458 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 3 blocks, lines 747-1446. The bar is 400 significant lines; this is 58 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bb46705e868b228635b40843345c638f9f0f21a700c2f07dfc4bc1bca74145"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CudaDevice: ClassTooLong \u2014 458 significant 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, 6 blocks, lines 34-710. The bar is 400 significant lines; this is 58 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1e3f0fe06c82ae99863ef0e2ef35f5a39ba9c1b46f6371c706748acc14221a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/router.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: SolverOrchestrator (3 blocks, 293-1069). The bar is 500 significant lines; this is 70 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a022505040674641a3f1eeea1a2c81f0b39f228dd956f6ef5d4c2ac9644e5bb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/read_path.rs: FileTooLong \u2014 570 significant 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 70 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f736f55868a8037f3e392eb59bb1bdbf0ead947186d3ba1d97f9a6f51652fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_matryoshka::bin::benchmark::main: FunctionTooLong \u2014 ruvector_matryoshka::bin::benchmark::main runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-matryoshka/src/bin/benchmark.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e45f03ab3e91e960fef92a79ecd5067c44fff6ec90559dcd5e5b17bd2deeb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rvf_ebpf::precompiled::build_minimal_bpf_elf: FunctionTooLong \u2014 rvf_ebpf::precompiled::build_minimal_bpf_elf runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-ebpf/src/lib.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3344cc136abe7f481d853f22f50675b187bd72265e17308d80dd212143bd611"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tokenizer.next_token: MethodTooLong \u2014 next_token runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/parser.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44ca53dc46bfdafaa7118a46e8002d71a6e808eba1b559180e997f998c5a578"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/hybrid_pipeline.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: HybridPipeline (3 blocks, 351-997). The bar is 500 significant lines; this is 69 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/hybrid_pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab772cd9c36ba065ee0a86622ffc9faac45cfc6529406831672e98c72f505ce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphDatabase: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 58-1103. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36a3d6203eb4c72a483082e21cea4780aac61e6fbead1d1dbe1909b45c7909e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Intelligence: 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":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"568008df29594ef5af703de069167b12aaba8676d62397e83d6e7885967e5b66"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TenantLedger: TooManyMethods \u2014 34 methods, declared across 4 files: ledger/mod.rs (13), ledger/usage.rs (9), ledger/catalog.rs (8), ledger/idem.rs (4). The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ledger/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31df1db25b9e04ed9a2211589c2223b16205ba927781a159a465407e8494cf7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EulerTourTree: 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":"crates/ruvector-mincut/src/euler/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a1a8ae5e0717390dc001017030152ff204659737334da63445e79e5e6a9ac0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RvLite: 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":"crates/rvlite/src/lib.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83e5171922a70ed57c94f3c92780e498c55479475b45a540baaacdb386972d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VectorShard.plan_upsert: MethodTooLong \u2014 plan_upsert 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":"crates/ruvector-edge-store/src/shard/write.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8b8a1c115a778dd820e954a260ab647a49e60624facc424dffb43578df92d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VerifiedTrainer.train_step: MethodTooLong \u2014 train_step 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":"crates/ruvector-graph-transformer/src/verified_training.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d375c37b42fca5a7cde39a77ef7041226c468d1e81f6c0624bf38f793f3311"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_temporal_coherence::benchmark::main: FunctionTooLong \u2014 ruvector_temporal_coherence::benchmark::main 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":"crates/ruvector-temporal-coherence/src/benchmark.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b37030469d0015528e747f1aa96b9aa234cc3ba0cc64c37b42072e38dd2e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reflection/reflective_agent.rs: FileTooLong \u2014 563 significant 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 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/reflective_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db210ce2cce740df6853e9e7c15cf285934fad84847f674f5bd3df5484539beb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Kernel: ClassTooLong \u2014 449 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 2 blocks, lines 235-1098. The bar is 400 significant lines; this is 49 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2b97b85eb2b52e89505c95b8d276370c98395a5b7c60ef946939f3258ba63b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gguf/quantization.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdc14570682654c3567d643d1d3396ca0cdb4eae1f0cd813f7f7051e4ffba8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: candle_core::quantized::utils::make_qx_quants: FunctionTooLong \u2014 candle_core::quantized::utils::make_qx_quants 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":"patches/candle-core-0.8.4/src/quantized/utils.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"374b51bbf8ba11c5ea79c36c570431c74f49413419d2ea0d7e37864ffc5c6d47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coherence/engine.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb42cd5885b426024f751c8a0ccc73ac325150a11a0f5051751fab7288737c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/gemma2.rs: FileTooLong \u2014 557 significant 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 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"736744085a547f085688ac2ec78dccb08111a8c38e132a84a369e471e72f8520"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_coherence_hnsw::bin::benchmark::main: FunctionTooLong \u2014 ruvector_coherence_hnsw::bin::benchmark::main runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/bin/benchmark.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bc1f7d15f9256f84efedda00fd1b83c74743135d71a3a21e0f3f559a76003b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_postgres::graph::sparql::executor::evaluate_expression: FunctionTooLong \u2014 ruvector_postgres::graph::sparql::executor::evaluate_expression runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afd4a3ab55975d51dca67381b9e214e3a9d69500f7abc2a62314a4b2ced14c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quantize/turbo_quant.rs: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: TurboQuantCompressor (2 blocks, 163-737). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96492bf651bc8b39e8049d5a04f6b86d67c611cd55297aaa39739f20c927e409"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/postgres.rs: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: PostgresStorage (2 blocks, 126-843). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/postgres.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6755d54aa9c3a75e5d9c5f7b2dee1e64c82b04b920393bec0bfa09e19bdc3f2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruvector/collection.py: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb019712c4b26145c672f89a31066841012c6aac9d564cf77db8f89852fd7459"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProductManifold: TooManyMethods \u2014 33 methods, declared across 2 files: product_manifold/manifold.rs (20), product_manifold/operations.rs (13). The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e824904f9fab5a2e2cf73472ec02e1c6f7cd3118dc9f0c178dc623983787a88"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VectorCache: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/cache.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e094c45372783c5467e0e1b2704db4cd0f40ccf144aca64a1918bcd8d43b4b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TensorNameMapper: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"225580e0e870af1b351947f765b024c3d850fbe9a7e8a6fa39f39e5c361884ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NeuralSymbolicBridge: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 3 blocks, lines 229-1027. The bar is 400 significant lines; this is 40 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e89c832c3572d5454c459dc4e8ddb903fff81fae3e208d7c3503b333739b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_brain_server::web_ingest::ingest_batch: FunctionTooLong \u2014 mcp_brain_server::web_ingest::ingest_batch runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/web_ingest.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea19cf5267c3d86a3b50e55483a355a784bf27a44a7c631d4b9764a69b8904f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_speculative_ann::bin::benchmark::main: FunctionTooLong \u2014 ruvector_speculative_ann::bin::benchmark::main runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-speculative-ann/src/bin/benchmark.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5ba3e4eb887225f901a5bdb32376e16e2119ed38dc1903dce7c404440b2786"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RealContrastiveTrainer.export_gguf: MethodTooLong \u2014 export_gguf runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/real_trainer.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"838f5e359ab720c068d547f6e29d7229383eebf3451a0a7f8c248da6ca289719"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SafeTensorsExporter.export_engine: MethodTooLong \u2014 export_engine runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/export/safetensors.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"957dd54eb675f82c3e613d8f9e5c3c49d98e1eab60f59848242bef9650b0bdda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/notify.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: ResendNotifier (2 blocks, 122-724). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49aff2e3b9aa48a3b5b85c484ab379d8a3e36e699397e64aa18368484482cda1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: claude_flow/hnsw_router.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: HnswRouter (2 blocks, 331-906). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/hnsw_router.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9289447f1e79bb70e2abecd001a8f67e1ffb27f9064d1df1532d3c66082307"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MistralBackend: ClassTooLong \u2014 439 significant 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, 4 blocks, lines 711-1423. The bar is 400 significant lines; this is 39 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cd8f33d61624f3913babe50be1693c76569110195cc7bf608a5db61d20c037"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/handlers.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: McpHandler (2 blocks, 20-815). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/mcp/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"747f20c3134224ca0f29147ea0eb8f07cfedb158ce8d1e80e61862c2c6769b81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bitnet/rlm_embedder.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/rlm_embedder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b8a34231813378cc6083777c7303095a70108570808fc01e03ec8b738f0100"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: WasmMcpServer (3 blocks, 163-858). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/mcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376db1b5d442d2421a512e9488cac7d45b8cedf95441269aff3a5e9c6fe6dfbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_agent_memory::main: FunctionTooLong \u2014 ruvector_agent_memory::main runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/main.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc05473d9e68af730f7f342b5d3227d62f4e8653e4b90f3beb1903a88301f9ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hnsw_repair::benchmark::main: FunctionTooLong \u2014 ruvector_hnsw_repair::benchmark::main runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/benchmark.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6796f7dff3f8288f36404a62921f09f9bd6fc16ab30ae0a676f60f12fe89f9a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_retrieval_receipt::bin::benchmark::run_signing_batch: FunctionTooLong \u2014 ruvector_retrieval_receipt::bin::benchmark::run_signing_batch runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"549f2ae0001a45cc1d4f3b66379b3146853d41f34214d274be48a35c0df61a7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TieredStore.tick: MethodTooLong \u2014 tick runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/store.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96539d1e1b78a597cc4e94ba22c753c04129752470b00c8a39ebc8758b2910d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_weaver::seo::audit::audit_package: FunctionTooLong \u2014 ruvector_weaver::seo::audit::audit_package runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/seo/audit.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56a934e3ca57329ade675d1a3a62315cceec9d7f260d6228e5e149d25514f4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/stats.rs: FileTooLong \u2014 544 significant 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 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9e23433c25674c1999d322d21a7f7a7960508c3b8dab06e67a9612d3cb87bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/filesystem.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: FilesystemBackend (3 blocks, 32-857). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f735ede4044d40d84096d6c122ea19f83b14668cf6f54a18aec7212dd4b7793"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_hailo_cluster::bin::embed::print_help: FunctionTooLong \u2014 ruvector_hailo_cluster::bin::embed::print_help runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd9f946dcdd388fe7dc6471c66b9f00668b8e8b3e0993fa80e1f67e94c4d710"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tensor.sorted_nodes: MethodTooLong \u2014 sorted_nodes runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/backprop.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3bc37e974a7c65fd6db535679b407ea145aa9b8c77d196ee35bc6648d0d90b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RealEvaluationHarness: ClassTooLong \u2014 431 significant 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 53-796. The bar is 400 significant lines; this is 31 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/real_harness.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c885875d8f5251d9a51582e4470dcd82bdf81d08731216737223997647f1a692"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ResendNotifier: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 122-724. The bar is 400 significant lines; this is 29 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa1204b208af61ac25550864ec67586c99ce96138c52486d0ce50a561d7ec03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/qr_encode.rs: FileTooLong \u2014 535 significant 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 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d1283943c51b02463f8124e56cf7079c4828e3ccc7acf9211a129a5e5dcace"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fat32.rs: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 33 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/fs/src/fat32.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"098e3f41185a233eaa47b94c20d404aea55d1e5635a36f931edb98e178d64361"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: healing/strategies.rs: FileTooLong \u2014 530 significant 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 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/strategies.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60da07d0fc53126645dc0b2155bf0449ff90cc9f8065aad1cedba70a4ba84d7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResendNotifier.send_help: MethodTooLong \u2014 send_help runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"2891c3fe61ca15e5104c4c36b1454a6c5678167a31457bc07030a135dee3ccdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_memory_admission::bin::benchmark::main: FunctionTooLong \u2014 ruvector_memory_admission::bin::benchmark::main runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/bin/benchmark.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f3edf2a437e41489c1fdca489b15eb5208074fe614e5d37570ab95bb8a7fdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_weaver::cli::seo_apply::apply: FunctionTooLong \u2014 ruvector_weaver::cli::seo_apply::apply runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo_apply.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa5dd5d06ec110c4a0dfa05f0bce7af9f94e236c62925befe3efef5654ee04d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_weaver::propose::propose: FunctionTooLong \u2014 ruvector_weaver::propose::propose runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/propose.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"946232e6c13b71741bd713f80c2bbc3e1f809a36e5a5a4906e959e0fda72b242"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecurrentBlock.forward: MethodTooLong \u2014 forward runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/recurrent.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e01f001c3c4612e2c086af1537ba1b8fd870ebb26d80c97a91e43bddd152da5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RvfStore.boot_with_ancestry: MethodTooLong \u2014 boot_with_ancestry runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":3531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d950be3c0c5e3bc58d0ca316877749ee88387d976fba3ef03564635e27e8b733"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tensor.sorted_nodes: MethodTooLong \u2014 sorted_nodes runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0821638c0e9b72d03496037ae5c2a2d968e95634ae8ff6f98246eff6bea101e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/kernel.rs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: Kernel (3 blocks, 99-878). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/kernel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d370fac72615893a5dc3c3656d4a6d6e5df032470a472675412544dc992d34c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backbone/mobilenet.rs: FileTooLong \u2014 528 significant 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 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/mobilenet.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b57d91c4ff60b978f07ff3f20945fce583574cff2a04e2cc5d5a6409e9410a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql/parser.rs: FileTooLong \u2014 527 significant 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 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f18e7d6b1bdfd0bcbcea1a9b3331e23726050509ccbfc45a9bab0eb0c9de0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/embed.rs: FileTooLong \u2014 526 significant 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 26 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df295561d54eda54a1ea53cba20bd787df91992fb277930eeb7bc4b191e8192b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.rs: FileTooLong \u2014 525 significant 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 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18a9181bbf71e7145e3a10ea5111d52b97968eaca38ae5b7e7d31422c9aef0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_query_cache::bin::benchmark::main: FunctionTooLong \u2014 ruvector_query_cache::bin::benchmark::main runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-query-cache/src/bin/benchmark.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b930263db3a1f4cbf11c62f0b20ca43fa7e8990b47a9fe7c2ec11b75541ee9ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lexer.next_token: MethodTooLong \u2014 next_token runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/lexer.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b463a323d9a0183592dd836dd75d8402bcafcf81058a33a225be812a8e6d84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reflection/error_recovery.rs: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/error_recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6286b8955464030807a51fbf5befa0d4cb5062231376bbefd571868856edb68b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/file.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: FileStorage (5 blocks, 174-768). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a7b85e3018fd8fb88139aa8937ad068a9d058ddfe644e68ebcce0ea393a053"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: substrate/restriction.rs: FileTooLong \u2014 523 significant 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 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/restriction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"472766c479db74cc345896f426c84e4c000fc8d07a2e14c8a1463828f99870d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgenticDB: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 3 blocks, lines 135-1447. The bar is 400 significant lines; this is 18 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24ac4472a75e9df84c60559d1975356cb446846e0409bbd19a707f47abd7756"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quality/scoring_engine.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: QualityScoringEngine (3 blocks, 138-762). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/scoring_engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1152ef537fd5881bb8b7c4445aeae5c7422f35e64945f907dbe26c6e7a2c9f64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tokenizer.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/tokenizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"527a64e148a2101ce3a752f508ba1be3289d159f7fa0b81494e94fae4aa7ca63"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileStorage: ClassTooLong \u2014 417 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 5 blocks, lines 174-768. The bar is 400 significant lines; this is 17 over it, 1.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"858a8a06efcb118afb367d0aaaf20f336b3ebe9cb3f19828c3a0665b19f24965"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/neural-trader-wasm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc53ee7f652b02430bfd9ceede497b6b073b3157d96ecbd8e1b6e02642adcb47"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolOrchestrationDomain: ClassTooLong \u2014 415 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 4 blocks, lines 99-658. The bar is 400 significant lines; this is 15 over it, 1.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/tool_orchestration.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6976116a0057c4083ebcdfc52dbafc50d8284864a15fad45af39eee6dc2d55a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/domain_expansion.rs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: RoboticsDomain (4 blocks, 110-794). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/domain_expansion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af5538f9dc2670c1443e03fefac2017f1c19d7eb0f33516549eee1d1a6ce12c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphDB: 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":"crates/ruvector-graph/src/graph.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bc768fd70115801cfbfa674b2eb9f107ec304ce3b5ff8a40217a7358eafe23"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CandleBackend: 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":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3e947679c2005ec8f263aaade20fd032aafc19ac8031f12b03573db7d1046a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuvTokenizer: 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":"crates/ruvllm/src/tokenizer.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c96c3db53f187cea91ade1d0c02cf90134da60b5a3b48265be54c0fe812139"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: rvforge_reader::commands: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; 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":"crates/rvforge-reader/src/commands.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a18516c93b00ece512bb7e5fd1d87de6177c3b89fe91a2a3a82ec5dceaa4f6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HnswGraph: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 2 blocks, lines 179-874. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d468c75fafc77d78e13026b5011acb6dc7e7b50679d26ac127909487e7ef27d0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GpuCoherenceEngine: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 124-770. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbbf5c26eae0ef8b0ffb76161d190b2926d5308c63b21ca15d06d057a74fcf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 515 significant 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 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22ac51f5d32d0bd320f9d1abc464acd352ebf5197c051e187e0743edb77e8a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sparql/executor.rs: FileTooLong \u2014 515 significant 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 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d273fc9fb9e0fa01b83c1e7ac800b23336742b19b9826eb17021529f3d101d32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_rabitq::scan::scan_avx2: FunctionTooLong \u2014 ruvector_rabitq::scan::scan_avx2 runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/scan.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6c9ea9b281eed7ce4eb9b1bbd4260b4eda75e25373dcba6a3160d6aafae3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backends/lattice_backend.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/lattice_backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae2359970fd89aeb083ac182807e2257172a9b51e869c8be884ca666bb6a1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/qr_seed.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_seed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821046056b825fb08088f2785638faae3602624d50c87226ead1f546a8a9ccc2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RvfDatabase: ClassTooLong \u2014 411 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 2 blocks, lines 511-1158. The bar is 400 significant lines; this is 11 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/src/lib.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb422527853c41bea395f0a21236c1c47fcdcb2ec4ed891b33c7984be5ff12bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reflection/perspectives.rs: FileTooLong \u2014 513 significant 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 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/perspectives.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fceb9416a6568a3fd5803b76154977e670a0a6ed8b6ed57fbd16ab81c6c01d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ruvector_integration.rs: FileTooLong \u2014 513 significant 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 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/ruvector_integration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25763b3c2741099b9ae93c712753d088258e50088c1a864ef967cc5d747b7ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/kernels.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/kernels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed59b29932886d51f7161ab439bd4faf1f3d1c72e0c4c484320cc8c46eb1d8dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webgpu/compute.rs: FileTooLong \u2014 510 significant 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 66% of them inside a single declaration: WebGpuInference (2 blocks, 301-821). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/webgpu/compute.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce3673ef65e1c00d728434c2e7e05713a3577d5057a1eb79bfa6f6d5a605fd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_cli::cli::hooks::generate_completions: FunctionTooLong \u2014 ruvector_cli::cli::hooks::generate_completions runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"4577bedfb44af81a13662bf38c5a8742639013df0cf3bb071cd8d7ea1a8ca537"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_cluster_rag::bin::benchmark::main: FunctionTooLong \u2014 ruvector_cluster_rag::bin::benchmark::main runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/bin/benchmark.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"06be96840f8e38afca2e3a7310d2bcabad64bfd16fe70190392f391e8d4615ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_sota_bench::bin::sift1m_bench::main: FunctionTooLong \u2014 ruvector_sota_bench::bin::sift1m_bench::main runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sift1m_bench.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7611d5b261d972afec0f475b57618dae2bd1198f8ae27aa48e915961c69df731"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rvforge_reader::install::flow::install_for_host: FunctionTooLong \u2014 rvforge_reader::install::flow::install_for_host runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/install/flow.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5451d8f95d416d32a8464014689895489f01adab85fa2b0c78428daf0dd8535"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TripleStore.query_with_graph: MethodTooLong \u2014 query_with_graph runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/triple_store.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7145a88725a0f017ee5aa8956f6c0fe80160c2ff03ec4e3f9103ef8dba52560f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: simd/avx2.rs: FileTooLong \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). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae592c4dcebfe74406b2d2a6bea841bf03c3f5ead4539fe2b38740a17b47b480"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quality/validators.rs: FileTooLong \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). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/validators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15095b80139eab5ddfb0e6d69761facb89438d64f108695ef9dd58af841d3d80"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HybridPipeline: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 3 blocks, lines 351-997. The bar is 400 significant lines; this is 7 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/hybrid_pipeline.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee809306591963748801945d53e7c0ab575db072b681ba03f4ecb86ad2c8888f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReasoningBankIntegration: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 3 blocks, lines 533-1222. The bar is 400 significant lines; this is 6 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbaf1ff606c6e020cc09cdbb01dcb94926b08eb3e359b754c8a3b84d4809ffe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine.rs: FileTooLong \u2014 507 significant 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 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6734669bcc17e7aa8a7d0c4aba7cac136fac8aa25481fff983d2d8034993a283"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gpu/engine.rs: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: GpuCoherenceEngine (2 blocks, 124-770). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bfdc234e925711fa7f901e427ce47c95ddfe558ecfb5a31cf0e14253f8ccdb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DiskAnnIndex: ClassTooLong \u2014 404 significant 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 65-701. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/index.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61c13262b0836043b238fe060c6c94f2f9ad863c40d94bbfd6991be53bf57bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: training/mcp_tools.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). 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":"crates/ruvllm/src/training/mcp_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacf29d9bcd475947f9ea7016727795e7dfb140264c77ff2d585cee2c717a4b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_fpga_transformer::artifact::pack::unpack_artifact: FunctionTooLong \u2014 ruvector_fpga_transformer::artifact::pack::unpack_artifact runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/artifact/pack.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c514c6e9c99247d3409ff7c7863e61b59928954752eae7dfbdfc16bd96b18f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ruvector_postgres::graph::sparql::executor::compute_aggregate: FunctionTooLong \u2014 ruvector_postgres::graph::sparql::executor::compute_aggregate runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd6163aff727b35fb09f1ad1c0fcdb59c866b390da79f8771dcfa4cb29c2eef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/phi.rs: FileTooLong \u2014 503 significant 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 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d783341b778b1661064569f9812bfe296f4614cdbf0a28140b387a25fcc742"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cpu/erf.rs: FileTooLong \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). The bar is 500 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/erf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"917673296450848d5011977c996811f290fdfb3bb9d6596e77688e97f690f631"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (12 members, 6 shared lines): crates/ruvector-attention-unified-wasm/src/neural.rs:101-111 | crates/ruvector-attention-unified-wasm/src/neural.rs:172-182 | crates/ruvector-attention-unified-wasm/src/neural.rs:224-234 | crates/ruvector-attention-unified-wasm/src/neural.rs:270-280 | crates/ruvector-attention-unified-wasm/src/neural.rs:317-327 | crates/ruvector-attention-unified-wasm/src/neural.rs:369-379 | crates/ruvector-attention-wasm/src/attention.rs:70-80 | crates/ruvector-attention-wasm/src/attention.rs:128-138 | crates/ruvector-attention-wasm/src/attention.rs:173-183 | crates/ruvector-attention-wasm/src/attention.rs:212-222 | crates/ruvector-attention-wasm/src/attention.rs:252-262 | crates/ruvector-attention-wasm/src/attention.rs:297-307 \u2014 These 12 members are variants of one another: a block of 6 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/neural.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"644093cdba169a9629452adde0440c2ef110881cee3d4ead17ed453137afedd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (8 members, 20 shared lines): crates/ruvector-attention/src/curvature/fused_attention.rs:278-302 | crates/ruvector-attention/src/curvature/tangent_space.rs:167-191 | crates/ruvector-attention/src/info_geometry/fisher.rs:162-186 | crates/ruvector-attention/src/pde_attention/diffusion.rs:176-200 | crates/ruvector-attention/src/topology/gated_attention.rs:240-264 | crates/ruvector-attention/src/transport/cached_projections.rs:68-92 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:289-313 | crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:119-146 \u2014 These 8 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/fused_attention.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7d850242b78527f6f1ec5690753a6764ec1c2e42740b0ab3506348df611b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 14 shared lines): crates/ruvector-attention/src/curvature/fused_attention.rs:318-333 | crates/ruvector-attention/src/pde_attention/diffusion.rs:222-237 | crates/ruvector-attention/src/topology/gated_attention.rs:280-295 | crates/ruvector-attention/src/transport/centroid_ot.rs:327-342 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:316-331 \u2014 These 5 members are variants of one another: a block of 14 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/fused_attention.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1fd9e249f78b439518b9c243270ef421d042633cc69b2b5a3172ce068cf5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 88 shared lines): crates/ruvector-graph/src/cypher/parser.rs:215-353 | crates/ruvector-graph/src/cypher/parser.rs:356-455 | crates/rvlite/src/cypher/parser.rs:207-342 | crates/rvlite/src/cypher/parser.rs:349-445 \u2014 These 4 members are variants of one another: a block of 88 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ea17d0502884ec6577300c4445d643119b5d38319020fc1986f072c4b50d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 46 shared lines): patches/hnsw_rs/src/hnswio.rs:436-524 | patches/hnsw_rs/src/hnswio.rs:536-613 | scripts/patches/hnsw_rs/src/hnswio.rs:436-524 | scripts/patches/hnsw_rs/src/hnswio.rs:536-613 \u2014 These 4 members are variants of one another: a block of 46 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf36d3f777b064c43aee660be25f4beb42de10e01964b8c0e52759e20cbf3ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 40 shared lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1252-1311 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1450-1525 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1454-1512 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1716-1789 \u2014 These 4 members are variants of one another: a block of 40 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62a9432a61ce591a67eaa4850235f81f5da7ce63a58801db1653c52fa8753a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 30 shared lines): crates/ruvector-cnn/src/simd/neon.rs:18-83 | crates/ruvector-core/src/simd_intrinsics.rs:652-724 | crates/ruvector-core/src/simd_intrinsics.rs:732-793 | crates/ruvector-core/src/simd_intrinsics.rs:861-923 \u2014 These 4 members are variants of one another: a block of 30 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f71a36082df5c30a6d6e4c57d5ec1e66942fb6e46da8944127e9c5824ea34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 22 shared lines): patches/hnsw_rs/src/hnsw.rs:1535-1584 | patches/hnsw_rs/src/hnsw.rs:1595-1684 | scripts/patches/hnsw_rs/src/hnsw.rs:1421-1470 | scripts/patches/hnsw_rs/src/hnsw.rs:1481-1570 \u2014 These 4 members are variants of one another: a block of 22 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf3026e9d93faf030779cac254124e134a63ac5436a0eabbb4119536bdf8bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 20 shared lines): crates/ruvector-core/src/simd_intrinsics.rs:207-268 | crates/ruvector-core/src/simd_intrinsics.rs:278-328 | crates/ruvector-core/src/simd_intrinsics.rs:339-396 | crates/ruvector-core/src/simd_intrinsics.rs:406-461 \u2014 These 4 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c114fc2a5522a7fd1992b3121136b4e654a6be7c737b512817a4256758616e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 20 shared lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1252-1311 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1454-1512 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1514-1577 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1791-1871 \u2014 These 4 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d16fafa6823e2a1e63f1efef63b6739bea271735061825bdaa26059774c71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 17 shared lines): patches/candle-core-0.8.4/src/tensor.rs:594-612 | patches/candle-core-0.8.4/src/tensor.rs:1606-1628 | patches/candle-core-0.9.2/src/tensor.rs:662-680 | patches/candle-core-0.9.2/src/tensor.rs:1930-1952 \u2014 These 4 members are variants of one another: a block of 17 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efed044812d7cac67f6104f6b0cc4df0345b8e910431b6355c0e2ac32748a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 17 shared lines): patches/candle-core-0.8.4/src/tensor.rs:1631-1659 | patches/candle-core-0.8.4/src/tensor.rs:1662-1700 | patches/candle-core-0.9.2/src/tensor.rs:1955-1983 | patches/candle-core-0.9.2/src/tensor.rs:1986-2024 \u2014 These 4 members are variants of one another: a block of 17 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"309a96b99be4d1c4de8aad028952c1f5aa607aa751d88d6f32654f3c32808e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 11 shared lines): patches/candle-core-0.8.4/src/safetensors.rs:279-297 | patches/candle-core-0.8.4/src/safetensors.rs:306-332 | patches/candle-core-0.9.2/src/safetensors.rs:434-452 | patches/candle-core-0.9.2/src/safetensors.rs:461-487 \u2014 These 4 members are variants of one another: a block of 11 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"faca6fbd025807c018edb4bd02a7732dd587f2a22e0fb70f0ceb9f9a4d2aefd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 9 shared lines): crates/ruvix/crates/boot/src/manifest.rs:642-708 | crates/rvf/rvf-quant/src/binary.rs:46-85 | crates/rvf/rvf-runtime/src/store.rs:4767-4841 | crates/rvf/rvf-wasm/src/segment.rs:17-81 \u2014 These 4 members are variants of one another: a block of 9 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/manifest.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"b963115a642bd21880e05d48ea95f04a1217a191bd63aa2c8ccb05d1b077451a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 7 shared lines): crates/ruvector-bench/src/bin/memory_benchmark.rs:93-194 | crates/ruvector-bench/src/bin/memory_benchmark.rs:196-300 | crates/ruvector-bench/src/bin/memory_benchmark.rs:302-398 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:131-182 \u2014 These 4 members are variants of one another: a block of 7 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/memory_benchmark.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3649fe9694f5619f4cdd478a56cdfdc21d686491a2dc02bd26bf6a978dc5ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 4 shared lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:890-1009 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1095-1149 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:997-1117 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1298-1350 \u2014 These 4 members are variants of one another: a block of 4 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd78d9d772c5c93df2245ab257dff761fc8af8e664464fdf691d0e083d529cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 110 shared lines): crates/ruvector-cnn/src/kernels/int8_avx2.rs:96-230 | crates/ruvector-cnn/src/kernels/int8_neon.rs:85-226 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:92-241 \u2014 These 3 members are variants of one another: a block of 110 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"633174c2320f9571bc181de544e9a98ebd4119517958414c853c78f3bbf2fa7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 57 shared lines): crates/ruvllm-wasm/src/workers/pool.rs:716-798 | crates/ruvllm-wasm/src/workers/pool.rs:880-970 | crates/ruvllm-wasm/src/workers/pool.rs:979-1081 \u2014 These 3 members are variants of one another: a block of 57 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/pool.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c84d2df6d40275d2f9b702db41d182538af7348c8cadf54e6d5c4eb9aac89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 54 shared lines): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:98-202 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:204-305 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:307-409 \u2014 These 3 members are variants of one another: a block of 54 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1485ad06720c72b1ad669d8359620d38525a416a2c9748ee68fafcd20bdd08a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 34 shared lines): crates/ruvector-entropy-ann/src/search.rs:79-143 | crates/ruvector-entropy-ann/src/search.rs:212-283 | crates/ruvector-entropy-ann/src/search.rs:338-447 \u2014 These 3 members are variants of one another: a block of 34 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44ceb60edc1bda7f3e6eedca4feabb7d198595d54b9c849009a9cccebaad85d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 24 shared lines): crates/ruvector-cnn/src/simd/neon.rs:219-290 | crates/ruvector-cnn/src/simd/neon.rs:308-373 | crates/ruvector-cnn/src/simd/wasm.rs:283-352 \u2014 These 3 members are variants of one another: a block of 24 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1955b367ed487e54c0c5fe2e7fa2297ed4cfe6ca727f576a1964b1db9b71db64"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 24 shared lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1514-1571 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1819-1881 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2004-2066 \u2014 These 3 members are variants of one another: a block of 24 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1684e3e8686859e3d35768ae88ff931e08ddf0e55da60eb417e850adfae873c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (546 shared lines): patches/candle-core-0.8.4/src/backprop.rs:163-713 | patches/candle-core-0.9.2/src/backprop.rs:165-728 \u2014 These two members are variants of one another: 546 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":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dc6fcb1869a3658ac04d3614f4181d753ecc7ff4d3c94f2d9307e40e6000aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (134 shared lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:266-402 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:285-423 \u2014 These two members are variants of one another: 134 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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"61585f2653e4e453e7222011257d6d72f127c19398d36e71319dd936e07433d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (113 shared lines): crates/ruvector-cnn/src/simd/avx2.rs:211-351 | crates/ruvector-cnn/src/simd/avx2.rs:370-500 \u2014 These two members are variants of one another: 113 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"33645519ca34a58fb1f8245c72fd1af664d57ad147c7e04888d91b5f7a682df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (95 shared lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:916-1019 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:962-1069 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21a1d69354e0dfa0a6e2ca4ceeb00443468cbc981b000cafda8e1d79f8e6710"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (87 shared lines): patches/candle-core-0.8.4/src/npy.rs:102-195 | patches/candle-core-0.9.2/src/npy.rs:109-202 \u2014 These two members are variants of one another: 87 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":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed9348e37ea1417b32f3f20e65f99bac0f0606b155c00f3aab1f40357ccc823"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (81 shared lines): crates/ruvector-postgres/src/graph/sparql/executor.rs:1232-1407 | crates/rvlite/src/sparql/executor.rs:607-697 \u2014 These two members are variants of one another: 81 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0175db751869283cbecf7351b9d096a9b5a12eaca8e41df3ed8dc3309a7104c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (76 shared lines): crates/ruvector-coherence-hnsw/src/search.rs:188-279 | crates/ruvector-coherence-hnsw/src/search.rs:292-386 \u2014 These two members are variants of one another: 76 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/search.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ac334af8f76b3d97a8d73d6a2123e48512cddd24f67476644caa570a8b95fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (65 shared lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1027-1101 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1077-1153 \u2014 These two members are variants of one another: 65 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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"986bb0cfcb132be1fe0856d4f0b3993b2543c9ff918e129160d6357efc606bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): crates/ruvllm/src/backends/coreml_backend.rs:686-764 | crates/ruvllm/src/backends/coreml_backend.rs:1106-1187 \u2014 These two members are variants of one another: 62 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0828e79171d62c1ccb517b5a2c61cbfb03295edc1bf15256319a189759c026"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): crates/ruvllm/src/backends/phi3.rs:277-364 | crates/ruvllm/src/models/ruvltra.rs:515-616 \u2014 These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79f7ec23b0a1e5be8111297cc31620c0e0fbd1a85f90a7c480df2109b6e2091"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (52 shared lines): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:420-507 | crates/ruvector-profiler/src/config_hash.rs:20-93 \u2014 These two members are variants of one another: 52 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63bc100264232f1cb795acdea2edb70336865bf3b5918d1f75034758d3ae5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (52 shared lines): crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:304-390 | crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:420-504 \u2014 These two members are variants of one another: 52 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/flash_attention.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e961dc3181643daebd30fde3e8190cc633fcbef374415832ff412ad8397114"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (50 shared lines): crates/ruvector-postgres/src/graph/sparql/executor.rs:224-347 | crates/rvlite/src/sparql/executor.rs:195-260 \u2014 These two members are variants of one another: 50 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2400012bb580ec566f9abecd5ec092f4b717edecec0c5e5c240e8385db26ff7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (47 shared lines): crates/ruvllm/src/quantize/pi_quant_simd.rs:456-571 | crates/ruvllm/src/quantize/pi_quant_simd.rs:733-823 \u2014 These two members are variants of one another: 47 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant_simd.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87057ab3e6a94612a799509c518e488e8884b841b13d0760a53553016a9e48c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1669-1717 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2194-2242 \u2014 These two members are variants of one another: 44 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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d442914fe7f533e3b240f1b7d73d68c3ebdfee17c298887ef85dafb1046f784"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (43 shared lines): crates/rvf/rvf-runtime/src/store.rs:343-408 | crates/rvf/rvf-runtime/src/store.rs:430-497 \u2014 These two members are variants of one another: 43 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f609ef03045640d5c5c8dcc0e24eef7816eefeab1b6e313d9cf9274673109629"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): crates/ruvllm/src/metal/operations.rs:400-507 | crates/ruvllm/src/metal/operations.rs:530-616 \u2014 These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/operations.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec485833046feec300ee15797aea5718ddb509375225eefcc265af7ff9d4db0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): crates/ruvector-pq-search/src/codebook.rs:192-253 | crates/ruvector-pq-search/src/ivf_pq.rs:179-238 \u2014 These two members are variants of one another: 38 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-pq-search/src/codebook.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a782d0eab92aa9b723118361872d458c81d7c0d894f877f292df4398e3af928"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1457-1505 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1949-1995 \u2014 These two members are variants of one another: 36 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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b8b5a7aeaff7bb9db24cb6db348ad0e6f94c49e314fcd5addb449ce62521d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1345-1389 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1768-1810 \u2014 These two members are variants of one another: 33 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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cd61515f6b506eb55b3f751f7e0ea12601da53e4811f2a2a51d899755290f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:109-162 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:118-177 \u2014 These two members are variants of one another: 33 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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f95bc4b6e93304a77ac923d59f71bc7f339c71823ad54125b74770b99cab4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): crates/ruvector-postgres/src/index/hnsw_am.rs:1669-1806 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1540-1660 \u2014 These two members are variants of one another: 31 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2770b8a174bb97888568fc8155bdd88fa5c25c3ec2de83e384b2b52d53cbe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): crates/ruvector-diskann/src/distance.rs:264-309 | crates/ruvector-diskann/src/distance.rs:367-408 \u2014 These two members are variants of one another: 31 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/distance.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ee60b36383fdcaacf253903661bbef75353cc264b012d8128cadd2225aa0e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): crates/ruvector-diverse-beam/src/search.rs:102-141 | crates/ruvector-diverse-beam/src/search.rs:259-315 \u2014 These two members are variants of one another: 31 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/search.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e0208dc261809f9e1e241b757fa5fa5214417fc26e8b66683955e9db1d0e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (28 shared lines): crates/ruvector-math/src/product_manifold/manifold.rs:452-498 | crates/ruvector-math/src/spherical/mod.rs:226-273 \u2014 These two members are variants of one another: 28 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"153a6383b9095ad9d376f1a97143209eb794ee67dfe1bbfc583f763455d38b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): crates/emergent-time/src/agentic_time.rs:564-639 | crates/emergent-time/src/weight_learning.rs:126-200 \u2014 These two members are variants of one another: 23 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30ddbfadc20765cd6b3dd0bcec94a4202ed916aff01c6eb96f56c6bf9e24441"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (21 shared lines): crates/mcp-brain-server/src/types.rs:687-721 | crates/mcp-brain/src/embed.rs:50-88 \u2014 These two members are variants of one another: 21 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b7183541ac318da0528ba558ca673e6eec982941dfc05822e246ceb5640b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (20 shared lines): crates/ruvector-speculative-ann/src/bin/benchmark.rs:157-183 | crates/ruvector-speculative-ann/src/bin/benchmark.rs:247-284 \u2014 These two members are variants of one another: 20 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-speculative-ann/src/bin/benchmark.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d85d7e9a3ae9d5c21cccf6b55dfcba0c7fb8c57598588f422d7d0000d47e09a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (86 corresponding lines): patches/candle-core-0.8.4/src/display.rs:200-285 | patches/candle-core-0.9.2/src/display.rs:211-296 \u2014 These two members are one piece of code written twice and then edited apart: 86 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f2de57a67a0422739b4cda6b4b26211922ee463e8884af2613684bf5041ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1585-1641 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1930-1987 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"082a90d767f4e24d08eb4e5f4e6f991b5c472879dc8f2d10beaf531f7599b0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/ruvector-graph-node/src/cypher_exec.rs:191-248 | crates/ruvector-py/src/graph/cypher_eval.rs:181-261 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f63d45f42ca149fe7bfdf8f8c641c96f2e9829c602bf8ab00711ea895015553"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): patches/hnsw_rs/src/libext.rs:463-525 | scripts/patches/hnsw_rs/src/libext.rs:463-525 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"686240f9c90f63497821bddef4a3506c848fe1fa89ee430e7e1041641963bab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): patches/hnsw_rs/src/libext.rs:539-620 | scripts/patches/hnsw_rs/src/libext.rs:539-620 \u2014 These two members are one piece of code written twice and then edited apart: 82 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe83177be50e76d12d916cfc6bc974475811f2a9edcda8098559463bda69535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2203-2241 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2727-2765 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a7899bf766e2fbbff22616ea862a98e4f718c0f23e0b4abab5beccde868395"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1716-1746 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2142-2173 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca4e0e7eeeba67ae71e75b2697f0fbe7aaf4f7eeca43b0d0ae8dc6a8af8291e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): patches/hnsw_rs/src/libext.rs:971-1027 | scripts/patches/hnsw_rs/src/libext.rs:971-1027 \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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ed94ad487b1315e3829d3d997e1b956789f1c7ac1cc7a271a7d4c61db0ac16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): patches/hnsw_rs/src/libext.rs:919-958 | scripts/patches/hnsw_rs/src/libext.rs:919-958 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"509e23dc5ddf39430b6ce81c48ae04dee7c330df9ad07260fbd301aff08c429f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:717-766 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:767-817 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3cd9de992cedda9dee05c6bacd22ee868266e83b2266d5e44540b572bc1e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): patches/hnsw_rs/src/hnswio.rs:1126-1178 | scripts/patches/hnsw_rs/src/hnswio.rs:1126-1178 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4357cd54bcb79ab6c294be9bf683d938cf41e6276b4b55e632277ce3ee32fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1397-1448 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1889-1940 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93e2b4d168a3b9c1202b7f6793a6dca4ae4efb58597a271a6c2ae261b35232a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:392-425 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:416-452 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"170097d2f50563595ec42365978c325fb6eed7b58c5838a35e411c3c0929761d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): patches/candle-core-0.8.4/src/sort.rs:11-52 | patches/candle-core-0.9.2/src/sort.rs:11-52 \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":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d47543c01f4ecd051a0b4273d566321a7a7a32cfd01406838dcaff433dc7d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruvector-postgres/src/graph/sparql/executor.rs:1181-1226 | crates/rvlite/src/sparql/executor.rs:547-587 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6649ac1c8c23738298b6e9e8adef3666d4a7a6c00ea62509ed4c7b98950ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2249-2296 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2773-2820 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b931618fa6ac5027500ba3604629f6caa1a0731a15ec066ac7adbb2e86f33b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): patches/candle-core-0.8.4/src/storage.rs:246-264 | patches/candle-core-0.9.2/src/storage.rs:255-273 \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":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7163801aa5efe79f46fa53960c3a6cd2725356d33e8048a1af0d277c62b93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvector-attention/src/moe/expert.rs:211-243 | crates/ruvector-attention/src/sparse/linear.rs:119-173 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/moe/expert.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc51c364cbce3311c7f1f3386e39315049157f90a36f9f71aeef46884f6d5ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): patches/hnsw_rs/src/libext.rs:134-832 | scripts/patches/hnsw_rs/src/libext.rs:134-832 \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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2b0f5d0b9f524426b94c88cdc04e9b2b67d3ae046de1e2ddb2c598873e5a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): patches/hnsw_rs/src/libext.rs:689-722 | scripts/patches/hnsw_rs/src/libext.rs:689-722 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d1d3ab5c10c8103aaa344b06762f66eaff18857d1d708336624fdd9ee9533b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-robotics/src/perception/obstacle_detector.rs:123-164 | crates/ruvector-robotics/src/perception/scene_graph.rs:99-137 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/perception/obstacle_detector.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3408d0820bf4edcdc83e308260b6bccaf52a9f933c7b94e5e4272d8377c55ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): patches/hnsw_rs/src/hnswio.rs:1181-1212 | scripts/patches/hnsw_rs/src/hnswio.rs:1181-1212 \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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be1f7ca9aac4994cfc1ed016057282d63048af24df3560bcdf7672608dfce5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/photonlayer-bench/src/learn.rs:107-144 | crates/photonlayer-bench/src/mnist_bench.rs:229-254 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/learn.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18267bee8ad4f123b4234b2af322b6d4cad336e8960367c568f5372965066d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/photonlayer-bench/src/decoder.rs:11-32 | crates/photonlayer-bench/src/privacy.rs:163-183 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/decoder.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"702b3987a8eaa7ccbf18c08eb4ffc0ef9f6e6214d54d1c7402cf704a90a784d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-attention/src/graph/dual_space.rs:14-26 | crates/ruvector-attention/src/moe/expert.rs:103-115 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/dual_space.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14ba65efdb323caa0595480ade3a1314215143d301e85e70f9e80f567c47c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/quantize/pi_quant.rs:839-869 | crates/ruvllm/src/quantize/pi_quant.rs:964-1061 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"af38ed5ce753ddb95b9ab81fbb55d9f7254fb0d115e90b6302e47f9ca9ea3911"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-bet4-ivf-bench/src/kernel.rs:240-278 | crates/ruvector-bet4-ivf-bench/src/kernel.rs:290-307 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/kernel.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c12901d0f27b33fe7c929c5b44af134765061787d3a4da620891f1e6ba9b35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-delta-wasm/src/simd.rs:118-146 | crates/ruvector-delta-wasm/src/simd.rs:155-178 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-wasm/src/simd.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57ed9c03f94297f4211153a79ef93922fe6d0cd2e7ed8ce27306086ae081976"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/mcp-brain-server/src/cognitive.rs:94-155 | crates/ruvllm/src/quantize/quip.rs:645-683 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/cognitive.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf3d0fad452383c370c348303368224b193644bd924be8bd08c55b97a5d9aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-cnn/src/layers/pooling.rs:97-114 | crates/ruvector-cnn/src/layers/pooling.rs:199-216 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/pooling.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38ddd2ee61e9930959a2bf21f06b91ff31a53f617ff06b43e01e4145b5543a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-core/src/advanced_features/mmr.rs:199-209 | crates/ruvector-core/src/advanced_features/product_quantization.rs:293-312 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/mmr.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7136c7b48fea97ad5877dd83ab98fd62431b9f23980646fc4e959743a604fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-solver/src/cg.rs:142-159 | crates/ruvector-solver/src/cg.rs:163-180 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d7e4864970548d9e58841ffa64783059570d8bcc98c4d6c06fd6ab14f7ce29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:80-97 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:80-97 \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":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"13066036527a41041fbfffb268ee2ae962d9d94ab5a834f2d662816fd9c98b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (29 members, 50\u002B identical tokens): crates/mcp-brain/src/embed.rs:402-413 | crates/prime-radiant/src/attention/diffusion.rs:247-257 | crates/prime-radiant/src/attention/topology.rs:226-236 | crates/prime-radiant/src/ruvllm_integration/traits.rs:350-364 | crates/prime-radiant/src/storage/file.rs:556-567 | crates/prime-radiant/src/storage/memory.rs:196-210 | crates/prime-radiant/src/storage/postgres.rs:861-875 | crates/ruvector-attention-unified-wasm/src/lib.rs:262-280 | crates/ruvector-attention-wasm/src/utils.rs:18-32 | crates/ruvector-attention/src/training/loss.rs:42-47 | crates/ruvector-attention/src/training/mining.rs:64-69 | crates/ruvector-cli/src/cli/hooks.rs:657-669 | crates/ruvector-cluster-rag/src/lib.rs:60-69 | crates/ruvector-core/src/advanced/neural_hash.rs:347-357 | crates/ruvector-core/src/advanced_features/graph_rag.rs:490-501 | crates/ruvector-core/src/simd_intrinsics.rs:1191-1196 | crates/ruvector-dag/src/sona/reasoning_bank.rs:189-198 | crates/ruvector-diverse-beam/src/lib.rs:60-70 | crates/ruvector-gnn-wasm/src/lib.rs:347-365 | crates/ruvector-graph-transformer/src/biological.rs:63-120 | crates/ruvector-hybrid/src/main.rs:44-53 | crates/ruvector-mincut-gated-transformer/src/spectral.rs:753-777 | crates/ruvector-nervous-system/src/integration/ruvector.rs:392-402 | crates/ruvector-postgres/src/routing/router.rs:410-424 | crates/ruvector-spann/src/distance.rs:19-28 | crates/ruvllm-wasm/src/hnsw_router.rs:295-309 | crates/ruvllm/src/context/working_memory.rs:559-573 | crates/ruvllm/src/quality/coherence.rs:687-701 | crates/ruvllm/src/quality/diversity.rs:738-752 \u2014 These 29 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 29 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 29 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/embed.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b8d9331609823f4595b5c260168b50a801b71ee0ae34bd20c6a9a79274494a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (21 members, 50\u002B identical tokens): crates/photonlayer-bench/src/privacy.rs:61-138 | crates/prime-radiant/src/simd/matrix.rs:315-325 | crates/ruvector-attn-mincut/src/gating.rs:11-24 | crates/ruvector-cnn/src/backbone/mobilenet.rs:353-481 | crates/ruvector-consciousness/src/rsvd_emergence.rs:49-153 | crates/ruvector-graph-condense/src/gnn_eval.rs:153-166 | crates/ruvllm-wasm/src/workers/mod.rs:315-329 | crates/ruvllm-wasm/src/workers/pool.rs:808-869 | crates/ruvllm/src/backends/gemma2.rs:523-538 | crates/ruvllm/src/backends/gemma2.rs:639-662 | crates/ruvllm/src/backends/phi3.rs:399-414 | crates/ruvllm/src/backends/phi3.rs:517-540 | crates/ruvllm/src/kernels/matmul.rs:845-855 | crates/ruvllm/src/kernels/matmul.rs:1165-1175 | crates/ruvllm/src/models/ruvltra.rs:643-667 | crates/ruvllm/src/models/ruvltra.rs:815-862 | crates/ruvllm/src/models/ruvltra_medium.rs:643-666 | crates/ruvllm/src/models/ruvltra_medium.rs:736-758 | crates/ruvllm/src/qat/lora_qat.rs:681-691 | crates/ruvllm/src/qat/lora_qat.rs:694-706 | crates/ruvllm/src/qat/lora_qat.rs:709-720 \u2014 These 21 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 21 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 21 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/privacy.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"636db6509956d21908dd1bf64ea7bc1907e5dd1eb9d2725781558c95fe6e8581"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (13 members, 50\u002B identical tokens): crates/ruvector-postgres/src/attention/operators.rs:92-168 | crates/ruvector-postgres/src/attention/operators.rs:187-237 | crates/ruvector-postgres/src/attention/operators.rs:291-328 | crates/ruvector-postgres/src/attention/operators.rs:341-417 | crates/ruvector-postgres/src/attention/operators.rs:427-508 | crates/ruvector-postgres/src/attention/operators.rs:517-556 | crates/ruvector-postgres/src/attention/operators.rs:566-640 | crates/ruvector-postgres/src/attention/operators.rs:651-752 | crates/ruvector-postgres/src/attention/operators.rs:762-843 | crates/ruvector-postgres/src/gnn/operators.rs:27-64 | crates/ruvector-postgres/src/gnn/operators.rs:75-98 | crates/ruvector-postgres/src/gnn/operators.rs:156-193 | crates/ruvector-postgres/src/gnn/operators.rs:213-302 \u2014 These 13 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 13 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 13 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9a8588a0ef0e2fca85dca4ae3a56ffedc37634a39aeb61d1255bf4b0a02a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): crates/mcp-brain/src/embed.rs:402-413 | crates/prime-radiant/src/attention/adapter.rs:163-173 | crates/prime-radiant/src/attention/diffusion.rs:247-257 | crates/prime-radiant/src/attention/topology.rs:226-236 | crates/ruvector-attention/src/topology/coherence.rs:263-273 | crates/ruvector-cnn-wasm/src/lib.rs:170-184 | crates/ruvector-crv/src/stage_ii.rs:166-177 | crates/ruvector-diverse-beam/src/lib.rs:60-70 | crates/ruvector-query-cache/src/lib.rs:107-115 | crates/ruvector-spann/src/distance.rs:19-28 | crates/ruvllm-wasm/src/hnsw_router.rs:295-309 | crates/ruvllm/src/qat/reasoning_loss.rs:389-403 \u2014 These 12 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/embed.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"500fe30dae15a1d4d008f2edfbc61c740ea256cf80cb85d578784b2455983025"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): crates/ruvllm/src/metal/context.rs:116-162 | crates/ruvllm/src/metal/context.rs:241-288 | crates/ruvllm/src/metal/context.rs:301-343 | crates/ruvllm/src/metal/context.rs:361-415 | crates/ruvllm/src/metal/context.rs:440-495 | crates/ruvllm/src/metal/context.rs:510-573 | crates/ruvllm/src/metal/context.rs:585-640 | crates/ruvllm/src/metal/context.rs:651-704 | crates/ruvllm/src/metal/context.rs:709-751 | crates/ruvllm/src/metal/context.rs:766-821 | crates/ruvllm/src/metal/context.rs:838-907 | crates/ruvllm/src/metal/context.rs:926-980 \u2014 These 12 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba6286bc2c8eae73c4d630666213e72b51dc99013e48ead37fe6198dabd40bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): crates/ruvix/crates/cli/src/commands/dtb.rs:570-615 | crates/ruvix/crates/cli/src/commands/dtb.rs:617-669 | crates/ruvix/crates/cli/src/commands/dtb.rs:671-719 | crates/ruvix/crates/cli/src/commands/dtb.rs:738-791 | crates/ruvix/crates/cli/src/commands/dtb.rs:820-877 | crates/ruvix/crates/cli/src/commands/dtb.rs:911-963 | crates/ruvix/crates/cli/src/commands/dtb.rs:965-1012 | crates/ruvix/crates/cli/src/commands/dtb.rs:1014-1067 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"862adc8e58d6793c3f8347c2f7de3aaf8b8a8c290e92b4082eeb861c038ea812"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:565-594 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:606-634 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:671-708 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:720-758 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:683-715 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:727-758 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:798-834 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:846-883 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dd9b378e52db4cf6e80626fa9cb55c5cfa8c10851ff4cdd9f3a40dbd34ff68"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/quantized/avx.rs:442-523 | patches/candle-core-0.8.4/src/quantized/avx.rs:526-635 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1171-1250 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1361-1447 | patches/candle-core-0.8.4/src/quantized/neon.rs:234-315 | patches/candle-core-0.8.4/src/quantized/simd128.rs:179-266 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1372-1452 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1626-1713 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf6cfaadd4b3c4c1fa2facc73afa9a1f35285c591c7634e912b5ce8609a9f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/mcp-brain-server/src/routes.rs:6745-6775 | crates/mcp-brain-server/src/routes.rs:6781-6829 | crates/mcp-brain-server/src/routes.rs:6836-6885 | crates/mcp-brain-server/src/routes.rs:6892-6932 | crates/mcp-brain-server/src/routes.rs:6939-6969 | crates/mcp-brain-server/src/routes.rs:7044-7181 | crates/mcp-brain-server/src/routes.rs:7227-7271 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6745}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaeffc8ce7b745f78d1095165177744baa826cff70713b8204e7249551423fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/prime-radiant/src/coherence/energy.rs:581-629 | crates/ruvector-acorn/src/dist.rs:9-36 | crates/ruvector-attention/src/transport/centroid_ot.rs:147-176 | crates/ruvector-diskann/src/distance.rs:218-246 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:87-116 | crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:171-223 | crates/ruvector-math/src/product_manifold/manifold.rs:161-192 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/energy.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68fb383bc75e0682b6da3ed1fabb7580dd682471c15252553b4f6c14b0b7e3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/ruvector-attention/src/graph/dual_space.rs:277-297 | crates/ruvector-attention/src/graph/edge_featured.rs:343-364 | crates/ruvector-attention/src/graph/rope.rs:290-310 | crates/ruvector-attention/src/moe/moe_attention.rs:184-204 | crates/ruvector-attention/src/sparse/flash.rs:163-183 | crates/ruvector-attention/src/sparse/linear.rs:181-201 | crates/ruvector-attention/src/sparse/local_global.rs:139-159 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/dual_space.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17debf0e11282a2b1a0407ac30fb94f12808a4945edaa45b10deb6a71ad7df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/ruvector-bench/src/bin/comparison_benchmark.rs:94-139 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:141-186 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:188-242 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:244-301 | crates/ruvector-bench/src/bin/latency_benchmark.rs:109-152 | crates/ruvector-bench/src/bin/latency_benchmark.rs:220-272 | crates/ruvector-bench/src/bin/latency_benchmark.rs:274-331 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedcab15cfda48e8907afa14c2fdee06d8da623fb074e77677dc85869efb239c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/ruvector-cli/src/cli/hooks.rs:657-669 | crates/ruvector-core/src/advanced/neural_hash.rs:347-357 | crates/ruvector-dag/src/sona/reasoning_bank.rs:189-198 | crates/ruvector-embed-core/src/pooling.rs:67-76 | crates/ruvllm/src/context/working_memory.rs:559-573 | crates/ruvllm/src/reasoning_bank/pattern_store.rs:381-395 | crates/sona/src/types.rs:352-366 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"65108cf74f6315cef0ddfbb65f70563580e1ca80b9448e9c6b75e78ad7c747aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/ruvector-fpga-transformer/src/backend/native_sim.rs:281-288 | crates/ruvector-fpga-transformer/src/backend/native_sim.rs:449-457 | crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:283-290 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:454-487 | crates/ruvector-sparse-inference/src/ops.rs:203-213 | crates/ruvllm/src/training/grpo.rs:288-303 | crates/ruvllm/src/training/grpo.rs:460-471 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a128e1f24fb457a4ddc86a1ded97169c0b18413a8d158471656db974a0cf29d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/ruvector-graph-transformer-node/src/lib.rs:107-118 | crates/ruvector-graph-transformer-node/src/lib.rs:158-182 | crates/ruvector-graph-transformer-node/src/lib.rs:230-242 | crates/ruvector-graph-transformer-node/src/lib.rs:296-308 | crates/ruvector-graph-transformer-node/src/lib.rs:332-352 | crates/ruvector-graph-transformer-node/src/lib.rs:469-481 | crates/ruvector-graph-transformer-node/src/lib.rs:506-518 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/lib.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e6bf24c6a4092df15988937f2b4f100bbe86907d627228ef567d893a892e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/ruvector-temporal-tensor/src/f16.rs:62-93 | crates/ruvllm/src/bitnet/backend.rs:3497-3521 | crates/ruvllm/src/bitnet/gguf_export.rs:66-90 | crates/ruvllm/src/gguf/quantization.rs:1034-1060 | crates/ruvllm/src/kernels/quantized.rs:918-944 | crates/ruvllm/src/quantize/quip.rs:722-745 | crates/ruvllm/src/quantize/ruvltra_quant.rs:892-917 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/f16.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7672150abdb9fedae11a71449a61012524a9fdc7823bed878e099e15ebb74e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvector-attention-cli/src/commands/serve.rs:110-132 | crates/ruvector-attention-cli/src/commands/serve.rs:137-161 | crates/ruvector-attention-cli/src/commands/serve.rs:166-190 | crates/ruvector-attention-cli/src/commands/serve.rs:195-218 | crates/ruvector-attention-cli/src/commands/serve.rs:223-246 | crates/ruvector-attention-cli/src/commands/serve.rs:251-276 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/serve.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3aba4b9028fe908531b880789c223ff77cc2407dd538ec1a69b09b67f25a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvector-cnn/src/layers/conv.rs:394-439 | crates/ruvector-cnn/src/layers/conv.rs:630-659 | crates/ruvector-cnn/src/layers/quantized_conv2d.rs:231-281 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:186-232 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:43-94 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:134-201 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6153f8c55aea6be4867342734d68be79c6e491ae95fdeff244191355e9783a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvector-graph-transformer-node/src/transformer.rs:71-96 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:81-106 | crates/ruvector-verified/src/proof_store.rs:71-98 | crates/ruvix/crates/nucleus/src/witness_log.rs:204-230 | crates/rvf/rvf-crypto/src/attestation.rs:45-90 | crates/rvf/rvf-crypto/src/witness.rs:42-58 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5b809870ad0a7f3e7ce9afb9bd7f0f3cf92c617cc81a17c267a14bd49147c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvector-hailo-cluster/src/bin/bench.rs:31-671 | crates/ruvector-hailo-cluster/src/bin/embed.rs:30-630 | crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:37-367 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:138-452 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:50-329 | crates/ruvector-hailo-cluster/src/bin/stats.rs:31-488 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bd986f7b9cc097f7aa7dfbf17afdd96ddb93645a8fccf48f5a9fd82ad18685"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:263-290 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:293-317 | crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs:84-108 | crates/ruvector-rabitq/src/rotation.rs:220-237 | crates/ruvector-turboquant/src/rotation.rs:186-210 | crates/rvf/rvf-quant/src/rabitq.rs:102-118 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"27070a3f26f3dc9174ce36cf6b09e6fe93a296b611ceec0a4f8bc1c3dfe6a374"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvector-sota-bench/src/runners/hybrid.rs:46-94 | crates/ruvector-sota-bench/src/runners/lsm_ann.rs:13-81 | crates/ruvector-sota-bench/src/runners/matryoshka.rs:61-119 | crates/ruvector-sota-bench/src/runners/mteb.rs:154-235 | crates/ruvector-sota-bench/src/runners/rabitq.rs:26-69 | crates/ruvector-sota-bench/src/runners/vdbbench.rs:56-144 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/runners/hybrid.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da0ad57472999f2d531672431cdf7cae0b579fdb5f7e454bdcb9e6de5e1ae9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvix/crates/smp/src/barriers.rs:86-98 | crates/ruvix/crates/smp/src/barriers.rs:110-121 | crates/ruvix/crates/smp/src/barriers.rs:132-143 | crates/ruvix/crates/smp/src/barriers.rs:179-190 | crates/ruvix/crates/smp/src/barriers.rs:200-211 | crates/ruvix/crates/smp/src/barriers.rs:242-254 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/smp/src/barriers.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c11a8f8e398609ad1cfa5d76dedecce77581797dd221f4fb0e264ea0deb5feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvllm/src/kv_cache.rs:457-502 | crates/ruvllm/src/kv_cache.rs:534-565 | crates/ruvllm/src/kv_cache.rs:593-629 | crates/ruvllm/src/kv_cache.rs:703-728 | crates/ruvllm/src/speculative.rs:989-1138 | crates/ruvllm/src/speculative.rs:1166-1222 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"76058983cecf24a95ccc22f15320d637383d984dcdb3c47d9d5279dc1e913025"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/ruvllm/src/models/openmythos/mod.rs:392-415 | crates/ruvllm/src/models/openmythos/mod.rs:427-472 | crates/ruvllm/src/models/openmythos/mod.rs:488-533 | crates/ruvllm/src/models/rdt.rs:794-816 | crates/ruvllm/src/models/rdt.rs:826-859 | crates/ruvllm/src/models/rdt.rs:870-904 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1434d6d2010466139758fc1cc3f327e51506d832c049bce445d8380fc556a179"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/conv.rs:154-190 | patches/candle-core-0.8.4/src/conv.rs:224-256 | patches/candle-core-0.8.4/src/conv.rs:281-314 | patches/candle-core-0.9.2/src/conv.rs:168-205 | patches/candle-core-0.9.2/src/conv.rs:239-271 | patches/candle-core-0.9.2/src/conv.rs:308-341 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c8a6022e6fbbe3a269cab8d64c647a635dda250d0ee8ef19814df954048b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:304-339 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:345-381 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:417-448 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:322-357 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:363-399 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:435-466 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee7e5e204a5d76497793853ac335da8501f8fa8f232c0f3875f5532d5834e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1256-1321 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1330-1412 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1421-1530 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1364-1438 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1447-1529 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1538-1647 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7094df0491f1ad8c76c59a5d3dc9cc7bde0c285371583ac64c44a4be9a2216be"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:83-105 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:115-129 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:240-254 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:109-130 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:140-160 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:271-291 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d747bc621f2930150a09934be260747d7d2e2d5ae42a061141dbf714649e19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/mcp-brain/src/tools.rs:363-451 | crates/mcp-brain/src/tools.rs:692-754 | crates/ruvllm/src/policy_store.rs:382-428 | crates/ruvllm/src/quality/validators.rs:179-195 | crates/ruvllm/src/witness_log.rs:592-663 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c1eee5953524206743b88d889f47de2f0c6e6b4955ce52e20ede1f80355b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/prime-radiant/src/substrate/edge.rs:207-227 | crates/prime-radiant/src/substrate/edge.rs:253-289 | crates/prime-radiant/src/substrate/edge.rs:328-350 | crates/prime-radiant/src/substrate/node.rs:85-103 | crates/prime-radiant/src/substrate/node.rs:115-137 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/edge.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc42a191e1702af2acbba1d78cf740cf1438757ec1b1189b8953bda16f3de4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ruvector-attention/src/curvature/fused_attention.rs:353-370 | crates/ruvector-attention/src/pde_attention/diffusion.rs:256-273 | crates/ruvector-attention/src/topology/gated_attention.rs:316-333 | crates/ruvector-attention/src/transport/centroid_ot.rs:362-379 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:357-375 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/fused_attention.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5e823914f8b008a47b3edb536a7610fefcbf06826bbf23c255a78ca6b5a37c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ruvector-graph-node/src/lib.rs:672-697 | crates/ruvector-graph-node/src/lib.rs:706-721 | crates/ruvector-graph-node/src/lib.rs:979-1013 | crates/ruvector-graph-node/src/lib.rs:1023-1058 | crates/ruvector-graph-node/src/lib.rs:1083-1102 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0539031b8fcfcf1cddf0488a37171075ec12ce67b1c115505c3bb15270e3508"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ruvector-nervous-system-wasm/src/wta.rs:216-251 | crates/ruvector-nervous-system-wasm/src/wta.rs:257-287 | crates/ruvector-nervous-system-wasm/src/wta.rs:291-321 | crates/ruvector-nervous-system/src/compete/kwta.rs:78-107 | crates/ruvector-nervous-system/src/compete/kwta.rs:113-140 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/wta.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddc5479c1597ef1cff0b3e89e7367387042fde59e467ad2c96a8ae6331c0fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ruvector-postgres/src/attention/flash.rs:65-90 | crates/ruvector-postgres/src/attention/flash.rs:97-177 | crates/ruvector-postgres/src/attention/mod.rs:142-163 | crates/ruvector-postgres/src/attention/operators.rs:427-508 | crates/ruvector-postgres/src/attention/operators.rs:762-843 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/flash.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d429de2d425217f66a6421ad832a60ea14b265b2cfa5c2b088e38b01a955e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ruvix/crates/nucleus/src/checkpoint.rs:191-229 | crates/ruvix/crates/nucleus/src/checkpoint.rs:237-272 | crates/ruvix/crates/nucleus/src/graph_store.rs:497-562 | crates/ruvix/crates/nucleus/src/vector_store.rs:379-432 | crates/ruvix/crates/nucleus/src/witness_log.rs:552-583 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/checkpoint.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebde629fa70907657f99d181e9734e016265c6045ce59c13bb61ec48a69153e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ruvllm/src/backends/gemma2.rs:674-701 | crates/ruvllm/src/backends/phi3.rs:552-582 | crates/ruvllm/src/kernels/matmul.rs:986-1161 | crates/ruvllm/src/models/ruvltra.rs:679-709 | crates/ruvllm/src/models/ruvltra.rs:815-862 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ce4e2e9e70d83f1cdf6068144e6e55257939b1a17ef9b0a8a56a8c40bf8b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/ruvllm_sparse_attention/src/attention.rs:137-340 | crates/ruvllm_sparse_attention/src/attention.rs:373-499 | crates/ruvllm_sparse_attention/src/attention.rs:1073-1186 | crates/ruvllm_sparse_attention/src/attention.rs:1306-1512 | crates/ruvllm_sparse_attention/src/attention.rs:1912-2028 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cfa5111ad9ae171637e36df71188bd27985e360718f28ab7f97f56447ca5a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/rvAgent/rvagent-mcp/src/client.rs:32-51 | crates/rvAgent/rvagent-mcp/src/client.rs:69-88 | crates/rvAgent/rvagent-mcp/src/client.rs:95-113 | crates/rvAgent/rvagent-mcp/src/client.rs:116-134 | crates/rvAgent/rvagent-mcp/src/client.rs:137-155 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/client.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9366aa0cb752a4928ca04fb45b7264f059cf2fcdee98d41d814a7fc66e2586c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:297-306 | crates/rvf/rvf-adapters/claude-flow/src/memory_store.rs:281-291 | crates/rvf/rvf-adapters/sona/src/experience.rs:287-296 | crates/rvf/rvf-adapters/sona/src/pattern.rs:278-288 | crates/rvf/rvf-adapters/sona/src/trajectory.rs:278-287 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"95715cd4d41947bc69873f47f3094af49b659e48f9208634088ca70b4b051e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/rvf/rvf-runtime/src/store.rs:531-782 | crates/rvf/rvf-runtime/src/store.rs:2472-2522 | crates/rvf/rvf-runtime/src/store.rs:2569-2628 | crates/rvf/rvf-runtime/src/store.rs:2682-2736 | crates/rvf/rvf-runtime/src/store/dir_growth.rs:129-221 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9567b56f0699ed67f5ae956bfc87c46ee406f86ea02a0db8ab9d283f11f7b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/rvf/rvf-runtime/src/store.rs:2409-2434 | crates/rvf/rvf-runtime/src/store.rs:2530-2555 | crates/rvf/rvf-runtime/src/store.rs:2636-2661 | crates/rvf/rvf-runtime/src/store.rs:2744-2769 | crates/rvf/rvf-runtime/src/store.rs:2776-2805 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"7020bd832852c27a2a8ebedcbec44321730b19b77700e05d60c6e1f92065e03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:741-796 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:965-1027 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1034-1115 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:937-992 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1161-1223 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cc82063e6ed4988c8176d949f6403d7ac1272761ddda1a00dbac973826b6a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1034-1115 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1122-1205 | patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:132-277 | patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:286-379 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1230-1313 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"2641019adefe435255435c4ee715418de6fd52f53e87abaeef549cdff905b40b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:472-508 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:520-553 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:525-567 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:579-619 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:631-671 \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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"be51a63a676da4f39875e3f9a7281da9168520bbdb489f2c610712fe1e9b6262"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:780-816 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:826-849 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:905-940 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:950-980 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:997-1032 \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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cba1102f4a0b407334219a740d8f62e0f42f0ba34be032d1544d9525e777548"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/quantized/k_quants.rs:631-649 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1768-1786 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:662-680 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:692-710 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2195-2212 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b8918f7f3d350134e28d3c2ddfe363a90c900abc6a18bac44b5e1f48d174c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/tensor.rs:2243-2266 | patches/candle-core-0.8.4/src/tensor.rs:2281-2301 | patches/candle-core-0.9.2/src/tensor.rs:2566-2589 | patches/candle-core-0.9.2/src/tensor.rs:2604-2624 | patches/candle-core-0.9.2/src/tensor.rs:2931-2970 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a0dfb76cbdcd93dd0a664287377b0a1f8fbe82a907b518b5bce10f4f4e8643"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/prime-radiant/src/attention/adapter.rs:105-135 | crates/ruvector-attention/src/topology/gated_attention.rs:178-210 | crates/ruvector-gnn/src/search.rs:61-94 | crates/ruvllm/src/bitnet/backend.rs:2201-2246 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"958d3b7d48b392397d9b70a3c678bd2d701ff168d7258b0463976ba282cb8213"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/prime-radiant/src/simd/energy.rs:159-204 | crates/prime-radiant/src/simd/energy.rs:228-270 | crates/prime-radiant/src/simd/vectors.rs:49-109 | crates/prime-radiant/src/simd/vectors.rs:285-346 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"613345f4d1d9084dc5e1c87e2ec4fd60917398806559e393690bc2d33ff30555"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-attention-node/src/async_ops.rs:138-183 | crates/ruvector-attention-node/src/async_ops.rs:193-238 | crates/ruvector-attention-node/src/async_ops.rs:273-350 | crates/ruvector-gnn-node/src/lib.rs:384-425 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/async_ops.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c644d7d8ea4d99b6115a3559c6e4ce306c0fa9e3e7ed9d52c3b3034155225c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-attention-node/src/async_ops.rs:453-538 | crates/ruvector-attention-unified-wasm/src/neural.rs:43-56 | crates/ruvector-attention-wasm/src/attention.rs:23-36 | crates/ruvector-crv/src/stage_ii.rs:101-128 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/async_ops.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea6162f669907e363162f863455f516fe5ea72c53c2c11d4f0c56a14bbdeefb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-attention-node/src/training.rs:58-66 | crates/ruvector-attention-node/src/training.rs:135-143 | crates/ruvector-attention-node/src/training.rs:198-203 | crates/ruvector-attention-node/src/training.rs:855-871 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/training.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ea2a6580a01356723ebe7e9003ffc3121e68f3c2cd5abec94dfa678c837fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:136-178 | crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:186-235 | crates/ruvector-attention/src/sheaf/sparse.rs:395-447 | crates/ruvector-gnn/src/layer.rs:507-531 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeb4133fc741da1ef582adb6137ddae94f492b56b68e745dcf84c7340ff2235"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-cli/src/cli/hooks.rs:702-717 | crates/ruvector-mincut/src/snn/optimizer.rs:641-662 | crates/ruvector-robotics/src/cognitive/memory_system.rs:113-126 | crates/ruvllm/src/context/working_memory.rs:358-378 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3001a5610a7b9181d51ae0f7cd937dbfb7f211ca34d3cec2f293a25a53e79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-cnn/src/quantize/graph_rewrite.rs:142-216 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:225-284 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:412-440 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:446-474 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacb61e58bb36de142a1377b84926399e3351d60287d5b5a448df70a2669f847"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-cnn/src/simd/avx2.rs:152-185 | crates/ruvector-cnn/src/simd/neon.rs:153-200 | crates/ruvector-cnn/src/simd/scalar.rs:71-93 | crates/ruvector-cnn/src/simd/wasm.rs:119-168 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4fd1ca42f495326d1bd714dc17484c622c526cbaa99828f3821b93132b0e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-core/src/advanced_features/matryoshka.rs:206-261 | crates/ruvector-core/src/advanced_features/matryoshka.rs:277-325 | crates/ruvector-core/src/advanced_features/matryoshka.rs:338-423 | crates/ruvector-core/src/advanced_features/multi_vector.rs:174-213 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/matryoshka.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4345eb72fa323c56de4746b05ba8904e0d3de8991d9e4a00b479ce6e6a858f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-domain-expansion/src/planning.rs:287-366 | crates/ruvector-domain-expansion/src/rust_synthesis.rs:238-333 | crates/ruvector-domain-expansion/src/tool_orchestration.rs:303-392 | crates/ruvector-robotics/src/domain_expansion.rs:537-621 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/planning.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"685f2c3c9ad62e7b7501f46fb22ded593481879085b127c15577e78ccc5cfdf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-filter/src/evaluator.rs:162-195 | crates/ruvector-filter/src/evaluator.rs:197-224 | crates/ruvector-filter/src/evaluator.rs:226-253 | crates/ruvector-filter/src/evaluator.rs:255-286 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-filter/src/evaluator.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50d903b32d599834f37c88a69b314606c8914be6fbfd8b8ce121a2041a45b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-gnn/src/compress.rs:310-328 | crates/ruvector-postgres/src/quantization/binary.rs:25-38 | crates/ruvector-postgres/src/types/binaryvec.rs:39-61 | crates/ruvector-router-core/src/quantization.rs:116-136 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/compress.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b09f36cacdd3a939271886e1ddf7f724a909b89692ecebfcc681bc45a0fde5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-graph-transformer-node/src/lib.rs:332-352 | crates/ruvector-graph-transformer-node/src/lib.rs:572-592 | crates/ruvector-graph-transformer-node/src/lib.rs:657-669 | crates/ruvector-graph-transformer-node/src/lib.rs:738-755 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/lib.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb104c397d84a09c940d26d0355f2f4806a5b3f6f694b6dd6625e61f7bfd391"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-graph/src/cypher/parser.rs:509-536 | crates/ruvector-graph/src/cypher/parser.rs:1091-1239 | crates/rvlite/src/cypher/parser.rs:499-526 | crates/rvlite/src/cypher/parser.rs:994-1110 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf2c6a13d2a53402a067dc2d2e1a1cd89643810cc04eab3f9071f94fa77a571"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-graph/src/cypher/parser.rs:605-641 | crates/ruvector-graph/src/cypher/parser.rs:643-701 | crates/rvlite/src/cypher/parser.rs:595-631 | crates/rvlite/src/cypher/parser.rs:633-691 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"1739ef284042d6ade68533fe24f96ffebbef9ac28fdc0402f7ae46d5e4bf6530"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-graph/src/cypher/parser.rs:703-729 | crates/ruvector-graph/src/cypher/parser.rs:731-767 | crates/rvlite/src/cypher/parser.rs:693-719 | crates/rvlite/src/cypher/parser.rs:721-757 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf25bb8b22fd2eaa4d7d5905953093bdc451f5d1accee54130ae741d08d0b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-namespace-merge/src/lib.rs:71-79 | crates/ruvector-query-cache/src/lib.rs:120-128 | crates/ruvector-speculative-ann/src/lib.rs:62-70 | crates/ruvector-streaming-qng/src/lib.rs:89-97 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-namespace-merge/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"452ad15089cf785862487677fac2179acf4d08b7e013dda1523c47aa83f0c254"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/distance/simd.rs:163-202 | crates/ruvector-postgres/src/distance/simd.rs:503-558 | crates/ruvector-postgres/src/distance/simd.rs:674-695 | crates/ruvector-postgres/src/distance/simd.rs:1339-1436 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b432dae85e9386639ff67bf8dabf5052a811dc60a0d04d4df988c1b4a1caca"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/distance/simd.rs:452-493 | crates/ruvector-postgres/src/distance/simd.rs:503-558 | crates/ruvector-postgres/src/distance/simd.rs:568-599 | crates/ruvector-postgres/src/distance/simd.rs:609-645 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"958145963fb90b63af20fab54fd8f75438f46679056d6924121121cee760639c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/graph/sparql/executor.rs:437-478 | crates/ruvector-postgres/src/graph/sparql/executor.rs:489-545 | crates/rvlite/src/sparql/executor.rs:287-363 | crates/rvlite/src/sparql/executor.rs:381-422 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a101dae428cc3179428dbb5e910baa84cb5e44936036634c7090d981d00213c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/graph/sparql/parser.rs:1680-1711 | crates/ruvector-postgres/src/graph/sparql/parser.rs:1713-1764 | crates/rvlite/src/sparql/parser.rs:1719-1750 | crates/rvlite/src/sparql/parser.rs:1752-1803 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc253c0fb2d5d389660f7ebcd7545cf56c48f7cc56ff50a71afdf4831c14c4ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/graph/sparql/parser.rs:2127-2205 | crates/ruvector-postgres/src/graph/sparql/parser.rs:2207-2226 | crates/rvlite/src/sparql/parser.rs:2166-2244 | crates/rvlite/src/sparql/parser.rs:2246-2265 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84e405976879ddbd08d315b890aee095a65ef600a3385d56585bda714775a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/hyperbolic/operators.rs:31-44 | crates/ruvector-postgres/src/hyperbolic/operators.rs:107-120 | crates/ruvector-postgres/src/hyperbolic/operators.rs:146-159 | crates/ruvector-postgres/src/hyperbolic/operators.rs:185-198 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hyperbolic/operators.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e7c59b916f43b6b355ffa1496bc49c137426d9edb647c5a15f93fe0e98c806"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/sparse/distance.rs:21-45 | crates/ruvector-postgres/src/sparse/distance.rs:84-121 | crates/ruvector-postgres/src/sparse/distance.rs:127-159 | crates/ruvector-postgres/src/sparse/distance.rs:184-213 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/sparse/distance.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64ba3d7ccc8781812ff9aea58fe2f99999125057cbbbf89d61e50227572c547"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/types/binaryvec.rs:350-362 | crates/ruvector-postgres/src/types/productvec.rs:369-381 | crates/ruvector-postgres/src/types/scalarvec.rs:395-407 | crates/ruvector-postgres/src/types/sparsevec.rs:436-448 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"865afd2b9e9b85b0c0b37ab7804b0def28429ea48fef45065894af9226360223"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-postgres/src/types/binaryvec.rs:374-385 | crates/ruvector-postgres/src/types/productvec.rs:393-404 | crates/ruvector-postgres/src/types/scalarvec.rs:419-430 | crates/ruvector-postgres/src/types/sparsevec.rs:460-471 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d195ee69b15cd89de0a3cf13e303dfc448a17cc6532b68d74e667ffd7c0984"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-robotics/src/rvf.rs:136-153 | crates/ruvector-robotics/src/rvf.rs:158-191 | crates/ruvector-robotics/src/rvf.rs:199-220 | crates/ruvector-robotics/src/rvf.rs:267-296 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/rvf.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c6c1d20a64264bf777a6cfaa489517e14cac199b9757c4694aaeeede04b245"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-solver-wasm/src/lib.rs:482-552 | crates/ruvector-solver/src/cg.rs:324-343 | crates/ruvector-solver/src/neumann.rs:455-478 | crates/ruvector-solver/src/true_solver.rs:306-406 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-wasm/src/lib.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9b23ff6bd6a53e84b2d47b91f1356f0892f7d3dd598816fb93c78425b11a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-sparse-inference/src/model/gguf.rs:405-438 | crates/ruvector-sparse-inference/src/model/gguf.rs:441-474 | crates/ruvector-sparse-inference/src/model/gguf.rs:477-517 | crates/ruvector-sparse-inference/src/model/gguf.rs:526-550 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd24825abc5ad09748f986e184e1c53f55d2e0f3f16b7fb81db8f526f665034"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-streaming-qng/src/dataset.rs:32-47 | crates/ruvector-streaming-qng/src/dataset.rs:50-64 | crates/ruvector-streaming-qng/src/dataset.rs:67-81 | crates/ruvector-streaming-qng/src/dataset.rs:84-98 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/dataset.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb51de593be5fbff2f386733d270c9b24c115a5d1a3457c031b111110b9218f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvector-wasm/kernels/rmsnorm.rs:82-154 | crates/ruvector-wasm/kernels/rmsnorm.rs:168-249 | crates/ruvector-wasm/kernels/swiglu.rs:96-138 | crates/ruvector-wasm/kernels/swiglu.rs:154-194 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rmsnorm.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfa87bd7f218197de47b4941475b6f5779a3052dae7774f919a61dc4723c44e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvix/crates/cli/src/commands/dtb.rs:216-315 | crates/ruvix/crates/cli/src/commands/dtb.rs:323-387 | crates/ruvix/crates/cli/src/commands/dtb.rs:395-423 | crates/ruvix/crates/cli/src/commands/dtb.rs:527-566 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"557cb18c2cba0e3183e4893489c5b0c09e18787a5d4b5a2d685cbbf29bb2860d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvix/crates/net/src/icmp.rs:249-267 | crates/ruvix/crates/net/src/ipv4.rs:396-416 | crates/ruvix/crates/net/src/udp.rs:119-163 | crates/ruvix/crates/net/src/udp.rs:172-212 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/icmp.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"55813edc5d4f259f42ba1de65a079c5ac95721f9626bd5b549d966de59466ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvix/crates/nucleus/src/kernel.rs:468-496 | crates/ruvix/crates/nucleus/src/kernel.rs:529-557 | crates/ruvix/crates/nucleus/src/kernel.rs:566-594 | crates/ruvix/crates/nucleus/src/kernel.rs:601-625 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/kernel.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b8668adfd85da32543873893f48527105ed4f60404c38d48073ec08009dbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvllm/src/backends/coreml_backend.rs:1278-1348 | crates/ruvllm/src/backends/coreml_backend.rs:1354-1411 | crates/ruvllm/src/backends/coreml_backend.rs:1413-1511 | crates/ruvllm/src/backends/coreml_backend.rs:1513-1555 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5af702c6f72baff1810a8248ec5a6a30ec04b8f96c2c0fe306f392779c58ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvllm/src/backends/gemma2.rs:563-571 | crates/ruvllm/src/backends/phi3.rs:441-449 | crates/ruvllm/src/models/ruvltra.rs:737-746 | crates/ruvllm/src/models/ruvltra_medium.rs:717-725 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f33165268d99959d9672953a4b5f92e551a8b1a9576c9c07fc007765c68c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvllm/src/backends/gemma2.rs:754-808 | crates/ruvllm/src/backends/phi3.rs:633-671 | crates/ruvllm/src/models/ruvltra.rs:913-951 | crates/ruvllm/src/models/ruvltra_medium.rs:802-857 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a620e09c9a97f3fe733c563735e6643f309710b9f276b20c1e32c7fe411c492"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvllm/src/backends/gemma2.rs:852-927 | crates/ruvllm/src/backends/phi3.rs:723-791 | crates/ruvllm/src/models/ruvltra.rs:1033-1101 | crates/ruvllm/src/models/ruvltra_medium.rs:937-990 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"997179f542796b9540f4468e2d03e60898c5fc93c0496d544e032f2244e897f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvllm/src/backends/phi3.rs:80-99 | crates/ruvllm/src/backends/phi3.rs:102-121 | crates/ruvllm/src/backends/phi3.rs:124-143 | crates/ruvllm/src/backends/phi3.rs:146-165 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"300bef27c5f7854a3e75611fc78470d187ac3a17d10163c3d4db364f1d59d5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvllm/src/models/ruvltra.rs:236-278 | crates/ruvllm/src/models/ruvltra.rs:281-312 | crates/ruvllm/src/models/ruvltra.rs:315-342 | crates/ruvllm/src/models/ruvltra_medium.rs:304-373 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca847b6e1abff8ecfab8ff5810566234aa763cb5ea75f80ae955ed29376be40"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ruvllm/src/quality/coherence.rs:741-753 | crates/ruvllm/src/quality/scoring_engine.rs:859-873 | crates/ruvllm/src/reasoning_bank/distillation.rs:190-206 | crates/ruvllm/src/reflection/error_recovery.rs:373-387 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"649353587b1f837539b6f6739892ad6256b7e60a98d4ca99c2728892c72f9c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cpu/mod.rs:70-92 | patches/candle-core-0.8.4/src/cpu/mod.rs:113-132 | patches/candle-core-0.9.2/src/cpu/mod.rs:89-111 | patches/candle-core-0.9.2/src/cpu/mod.rs:132-151 \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":"patches/candle-core-0.8.4/src/cpu/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b203ac6f41b4e6f99f5ff3bb1a51c547cb028e4091b84482c063a9cb28fd2f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:813-855 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:875-930 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1009-1051 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1071-1126 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea84ec5d19a8e319569369bed04220cd69635a06b30c403bd1af29e8e60206b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:359-409 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:861-899 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:417-460 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1044-1088 \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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2aadf22814d73d0c39de69c027a0a25b6dc0a6483b7ea6731cdc70c8b0c8e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/metal_backend/mod.rs:164-213 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:215-264 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:179-230 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:232-283 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a5b0cede6315d6068f8633bc57b3402d9db21072a3ada845484d78ad511591"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1172-1207 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1214-1249 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1225-1261 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1268-1304 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb637adf28908cbd28d52f6dcbe54e0b0af29c6db40c1f90e90195c14e97267"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2043-2071 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:2079-2107 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2042-2071 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2079-2108 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b6bf9f511b837289574ffe014eff2b51a034c670b6b4d35744022a97f56430"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/npy.rs:257-276 | patches/candle-core-0.8.4/src/npy.rs:279-300 | patches/candle-core-0.9.2/src/npy.rs:284-303 | patches/candle-core-0.9.2/src/npy.rs:306-327 \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":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"68622ac9d2f97f9098e90a65a06adcb8473a7c40e030aec8f8e9870df8a87577"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/npy.rs:378-389 | patches/candle-core-0.8.4/src/npy.rs:391-407 | patches/candle-core-0.9.2/src/npy.rs:405-416 | patches/candle-core-0.9.2/src/npy.rs:418-434 \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":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"03911fbf72796bb86043817bf1e8afb001b3f9f8cdb23cefb1194cd076f2ed11"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/quantized/k_quants.rs:295-326 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:496-532 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:312-348 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:523-563 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f850f2587ea93a59dcfb538c706e77b57b42b8e373e16d08e441eb944cff1e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/quantized/k_quants.rs:369-390 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:463-494 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:393-414 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:489-521 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda4515839080ade5401b1d7085b25c56d893fa2a910b7474da948f1d771b636"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1313-1341 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1528-1563 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1579-1606 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1874-1908 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ebff9e6a13de06ddcec9a957d420507699b7dfa86f0cb1d8a949c13d8ee0d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/quantized/mod.rs:452-461 | patches/candle-core-0.8.4/src/quantized/mod.rs:528-549 | patches/candle-core-0.9.2/src/quantized/mod.rs:752-761 | patches/candle-core-0.9.2/src/quantized/mod.rs:859-880 \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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c33de0e741eef5c7ab2c7b38c64f32562c33881dc6869c94ba0725c75849c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/safetensors.rs:98-121 | patches/candle-core-0.8.4/src/safetensors.rs:128-153 | patches/candle-core-0.9.2/src/safetensors.rs:115-138 | patches/candle-core-0.9.2/src/safetensors.rs:145-170 \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":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4770eda4bdbf6e4fe0620748daeed60581c94c3ec6a8ee2b856cca0bf179f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/tensor.rs:1170-1189 | patches/candle-core-0.8.4/src/tensor.rs:1208-1227 | patches/candle-core-0.9.2/src/tensor.rs:1351-1370 | patches/candle-core-0.9.2/src/tensor.rs:1389-1408 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb2bc2550849b2983f25112915783ec637924ca1a8c3058e6c4a646e4bbeb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.8.4/src/tensor.rs:2143-2154 | patches/candle-core-0.8.4/src/tensor.rs:2157-2164 | patches/candle-core-0.9.2/src/tensor.rs:2466-2477 | patches/candle-core-0.9.2/src/tensor.rs:2480-2487 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11e1e9ac3f4c151da47510a2ea1c3080654649f3b508b9d5f26c5f8311c9491"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:470-513 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:525-567 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:579-619 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:631-671 \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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7841cfd24eb3284628e0402a35feaa5cf79af0c96c0f2f94af74ffcafb1688a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.9.2/src/quantized/k_quants.rs:884-940 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1200-1295 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1514-1577 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1791-1871 \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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c77056fe9c0f3b048aa554bfd811e96f1ec9fb870e3babd680cd3f46b1a743"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/candle-core-0.9.2/src/quantized/mod.rs:482-500 | patches/candle-core-0.9.2/src/quantized/mod.rs:506-535 | patches/candle-core-0.9.2/src/quantized/mod.rs:543-578 | patches/candle-core-0.9.2/src/quantized/mod.rs:581-606 \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":"patches/candle-core-0.9.2/src/quantized/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb13cd9390fee39ab8acbe64fbe08da7d06400bc4f5967b07f1595cba6669385"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/hnsw_rs/src/hnsw.rs:589-600 | patches/hnsw_rs/src/hnsw.rs:607-618 | scripts/patches/hnsw_rs/src/hnsw.rs:582-593 | scripts/patches/hnsw_rs/src/hnsw.rs:600-611 \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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a49682b328fc2b874d78b2829e49d185d61f2a8bbbcb9426d1277a6b041d6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): patches/hnsw_rs/src/hnswio.rs:1068-1115 | patches/hnsw_rs/src/hnswio.rs:1303-1340 | scripts/patches/hnsw_rs/src/hnswio.rs:1068-1115 | scripts/patches/hnsw_rs/src/hnswio.rs:1303-1340 \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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c631c61fb92eae75c7612ccbb50a2a917a9ee44da3ead0c6fe050b7c0082e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (116 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:416-531 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:529-645 \u2014 These two members are one piece of code written twice and then edited apart: 116 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0ed31345102a10ef3ee16b1d64e18a0257c49ea118e2c9b3ae0f1939087c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (127 corresponding lines): patches/candle-core-0.8.4/src/backprop.rs:35-161 | patches/candle-core-0.9.2/src/backprop.rs:35-163 \u2014 These two members are one piece of code written twice and then edited apart: 127 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ca917073995cea0c1ab23e355098aceac7057f8b1a572690d16a4031c49c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (136 corresponding lines): patches/hnsw_rs/src/hnsw.rs:927-1069 | scripts/patches/hnsw_rs/src/hnsw.rs:920-1055 \u2014 These two members are one piece of code written twice and then edited apart: 136 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6449aadf27f48d6080842a75b448eeb9c50313035b0deda7f6621caaa4ae973"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (123 corresponding lines): crates/ruvector-graph-node/src/cypher_exec.rs:434-556 | crates/ruvector-py/src/graph/cypher_exec.rs:148-270 \u2014 These two members are one piece of code written twice and then edited apart: 123 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"185a3a2ea4481b845fa41bbe5dbe387af9d6b0c47fa8f431c2a8c1f484f92f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): patches/candle-core-0.8.4/src/quantized/metal.rs:36-115 | patches/candle-core-0.9.2/src/quantized/metal.rs:36-117 \u2014 These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"63392c84a8adf8a543c3713c64c0e594b3726576f17fce871d882dbcf0ffbc7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (139 corresponding lines): crates/ruvector-postgres/src/graph/sparql/triple_store.rs:324-462 | crates/rvlite/src/sparql/triple_store.rs:193-333 \u2014 These two members are one piece of code written twice and then edited apart: 139 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/triple_store.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d02c753d717eed7dcd0b2342178e9e8618c5e005fa107aa325f51e96b22a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (103 corresponding lines): crates/ruvllm/src/kernels/norm.rs:66-168 | crates/ruvllm/src/kernels/norm.rs:227-337 \u2014 These two members are one piece of code written twice and then edited apart: 103 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/norm.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee33290539b4e2609578ffcf62da1f9739e82293695ee72980412d28e1f3e134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1011-1092 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1119-1198 \u2014 These two members are one piece of code written twice and then edited apart: 80 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7ad80cf57c787b3d12e1ff8759e296db78fb261aad8e710e6755963bb674d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (78 corresponding lines): patches/candle-core-0.8.4/src/display.rs:443-520 | patches/candle-core-0.9.2/src/display.rs:454-557 \u2014 These two members are one piece of code written twice and then edited apart: 78 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e21122626e8eff33e1cba45bdc0581f86dd107c7d6239b16befb089c3aab50d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1643-1713 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2061-2139 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b741da013d6b5ee6d175757e986905a0c6e24ded385ae4d570215721753d047"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): crates/ruvllm/src/models/openmythos/attention.rs:127-219 | crates/ruvllm/src/models/rdt.rs:543-633 \u2014 These two members are one piece of code written twice and then edited apart: 91 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/attention.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b66f21cf7e5ce5a0b07383bb946ee508cfd9d666995451a062b705f546421a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:845-908 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:885-954 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7fd795c436c5388ab22b88da3972257377ebb715f801c008729c517461dfa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): patches/candle-core-0.8.4/src/quantized/cuda.rs:391-442 | patches/candle-core-0.9.2/src/quantized/cuda.rs:552-603 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f589d0fdd74c61310c77a2359b85e30e82a3d79f7f56a265da67fec7604f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2047-2115 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2523-2603 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b6d9bdc5df7afaad7b7772000527b3f3f3ef5c0d82cc8e57a34985f2391670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:769-832 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:820-882 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"623e4f8b848025e32ce9f35a2dab1a70c29825da35f17827a4cebca9581ebd69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): crates/ruvector-cnn/src/kernels/int8_avx2.rs:251-339 | crates/ruvector-cnn/src/kernels/int8_neon.rs:246-324 \u2014 These two members are one piece of code written twice and then edited apart: 79 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"662515f19175077f3afdced3baa813a3215f6f3ecb16a85a4ca7aaa57e9ab11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:265-326 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:302-373 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1419f8550642cccc0165e68b2a42f76e84627d9e635b23db45f6ffef277e412"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): crates/ruvector-postgres/src/graph/sparql/executor.rs:1431-1508 | crates/rvlite/src/sparql/executor.rs:721-785 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabfe882d914f51700221a5f4597bdd163bdf1f12fea519ad42d5255ec56cf15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (83 corresponding lines): crates/ruvllm/src/models/sampling.rs:76-165 | crates/ruvllm/src/models/sampling.rs:169-251 \u2014 These two members are one piece of code written twice and then edited apart: 83 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/sampling.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf9d7c56455f620d726a73899391f9932476d36cc94a7575128cc9f08728d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1385-1442 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1553-1610 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fea55d4c949248939d7f16dc8388b9640644f77fe554356889f4f04c5fa9a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): patches/candle-core-0.9.2/src/safetensors.rs:214-283 | patches/candle-core-0.9.2/src/safetensors.rs:312-378 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57026a13c6abc750ee186e83f2b2f0307ef1c8661655c488309883b78e04491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): crates/ruvector-solver/src/backward_push.rs:178-288 | crates/ruvector-solver/src/backward_push.rs:414-487 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/backward_push.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf2b1f9563d21cab80523fd694758ca523c5d443252cef5791f5e952bdb104c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:623-676 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:813-872 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe022a7dd51b50eb3f653dfe77b79967f4f2438b037d9efc871747dd9263831"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1452-1504 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1620-1673 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5371c462118463dfdcb2fde7fb7cbad3db3e1675a5cd811f25d167c02fa3086"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): patches/candle-core-0.8.4/src/quantized/cuda.rs:307-365 | patches/candle-core-0.9.2/src/quantized/cuda.rs:349-407 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58c4045aae82d3fc7f577df3878a1671b355cf2944ead2e69848bade0a393ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): crates/ruvector-postgres/src/solver/operators.rs:238-298 | crates/ruvector-postgres/src/solver/operators.rs:439-506 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5edbec9a538d01147615597ca6ea67ea2cb25d2fae8c1f5af690d51b4bff5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): patches/candle-core-0.8.4/src/quantized/cuda.rs:235-295 | patches/candle-core-0.9.2/src/quantized/cuda.rs:277-337 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"98331bb515f1cfa7879b6f16ac72e55354177736634e39a5b0e9f1d06c8861f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): crates/rvf/rvf-index/src/progressive.rs:144-227 | crates/rvf/rvf-index/src/progressive.rs:327-394 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/progressive.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0f9dfae76f0a3c3a2673c87a13345259dc2f5272233bf46b840d8ae5004d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2614-2664 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2666-2701 \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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa55f38116833ed5b1785d5235f2d1ee72f5e40ad0b7e73bfafbcdb1ebdd8f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2378-2412 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2414-2447 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e3ece8ab8254149854aabf013907e1c26e68dd58229ef9b2a08c34f6f49763"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): patches/candle-core-0.9.2/src/cpu_backend/mod.rs:3061-3122 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:3124-3184 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":3061}}}],"partialFingerprints":{"codehealthFindingId/v1":"138fb9557bcc9e58d45196a13cad420b9720397e8da21dc2872c794f465fd675"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): crates/rvAgent/rvagent-backends/src/anthropic.rs:285-367 | crates/rvAgent/rvagent-backends/src/gemini.rs:331-412 \u2014 These two members are one piece of code written twice and then edited apart: 82 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/anthropic.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6615bb06f4afe8373a916b8b207a3c61ebeec2ebbcdb213dbe6e432f266796"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:1268-1334 | crates/ruvector-postgres/src/distance/simd.rs:1441-1496 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a118db5a3b83a3b65aac0e8c6c9bf4fd669d77b8e89f0fd34589a3af70b1d5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): crates/ruvector-cnn/src/kernels/int8_avx2.rs:357-432 | crates/ruvector-cnn/src/kernels/int8_neon.rs:340-412 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b6aaa99a53ab354baf8fb9acf5c90327893c985d5d77e6eb14831e27f1c720"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): crates/ruvllm/src/bitnet/tl1_avx2.rs:126-196 | crates/ruvllm/src/bitnet/tl1_wasm.rs:141-214 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/tl1_avx2.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2421d99c2287550f41d65bbe5034ba4a3e1e95a78388a71bfb66a8f8b8526976"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): crates/ruvector-wasm/kernels/rope.rs:86-155 | crates/ruvector-wasm/kernels/rope.rs:162-222 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rope.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9c0df1b25508f1fe833a256dd3562121fd7e4a347c750a2a41d7c18082a137"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): crates/rvAgent/rvagent-core/src/rvf_bridge.rs:363-395 | crates/rvf/rvf-types/src/qr_seed.rs:136-183 | crates/rvf/rvf-types/src/witness.rs:222-260 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/rvf_bridge.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe77e580fd12b521a1c36c143ede00e7c383b124faad9ec2eb72e22bab5a98f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 51\u002B corresponding lines): patches/candle-core-0.8.4/src/quantized/cuda.rs:74-124 | patches/candle-core-0.8.4/src/quantized/cuda.rs:131-181 | patches/candle-core-0.9.2/src/quantized/cuda.rs:108-161 | patches/candle-core-0.9.2/src/quantized/cuda.rs:168-221 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 51 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":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"569deeb38048f793184fbbe0beb7cae640bda5bde951c0986441679548287678"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): crates/rvf/rvf-runtime/src/store.rs:252-324 | crates/rvf/rvf-runtime/src/store.rs:3345-3418 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"940a29b9f6748aa8ed8215b433f0144f8f479983448c8dc1a2b6451426877a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): crates/ruvector-core/src/storage.rs:72-158 | crates/ruvector-graph/src/storage.rs:97-165 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5d381cd54c0378d264cb30fb12c81d93bcadd3ca743bc4203c8b49ff22ab2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:126-192 | crates/ruvector-core/src/simd_intrinsics.rs:1116-1168 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e0c77dd46641cd822eca1383e873921ceaa2761b0d69bf80769d7316677f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-graph-node/src/cypher_exec.rs:140-184 | crates/ruvector-py/src/graph/cypher_eval.rs:127-174 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b177b82cdd2a37a41670bcb81db93551aaa29e3e7d215c1e0f0b1beb9b241d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): crates/ruvector-solver-node/src/lib.rs:687-751 | crates/ruvector-solver-node/src/lib.rs:1027-1100 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"27326ac74be91c30397b5fa46a048286506c1bf8b3d20c80170327e822c1da26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:458-501 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:595-643 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc612b228fdeb45898bd4fa3e6e2613ba88de50b5553f912e89fdec2f6b1135"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/ruvector-edge-store/src/ops/vector.rs:233-278 | edge/gateway/src/vectors.rs:247-298 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/vector.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c9af612f043be1f6547417eca24573607f1dd17220959f8a5dd15d57bdfbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:511-554 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:653-701 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b14a9c90f87daf25639efe2393daee435394c7081bbe81773e8832325d5a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/ruvector-graph/src/executor/operators.rs:131-167 | crates/rvf/rvf-runtime/src/filter.rs:162-205 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/executor/operators.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc05756d2bd32b8dde9aa9246d19b0f6cafccb4dba6c23ed1a465f1e56a6cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): crates/ruvector-postgres/src/index/hnsw.rs:330-415 | crates/ruvector-postgres/src/index/hnsw_am.rs:1222-1287 \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":"crates/ruvector-postgres/src/index/hnsw.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2a98d859635f064e3a89f34177bf64c9c63e0d5a4593ff842e7b152a4d611c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1629-1674 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1779-1823 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c36c98806c848094a371e75b51e0eaa806e31b34ee288aed5cf9d85ee68a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2304-2345 | patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:397-432 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede593f4b2844f93eedae443fd7f2fb4373f669c60d5ccc8472f52db4d9f3f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:793-837 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:828-877 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94338526290c6f1febfa9e75608e6ed69ca6da52aad82e82a4dfea7a3762da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:193-210 | patches/candle-core-0.9.2/src/quantized/mod.rs:318-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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce13eaae15c6326824b6a2cb76f86d71accf67a87c49ccd72f6aba54e1f34d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1294-1333 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1405-1451 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3cb3be2de788f59526a9881379561b2c0e6a41e71d6cfbb0526990775c0105"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:565-611 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:749-801 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5ac6dceb6124537e521931320b88153c8aa42e8f947df9697628bb36679fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): crates/mcp-brain-server/src/aggregate.rs:18-72 | crates/mcp-brain-server/src/aggregate.rs:78-139 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/aggregate.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"37383d16f91bab2a740ad698a6db9a20673c480da234ed0aaf241fdeced6dc47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): patches/candle-core-0.8.4/src/quantized/metal.rs:138-188 | patches/candle-core-0.9.2/src/quantized/metal.rs:194-244 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dc9823accd689110fa5247a79703e55e1bb178c0c2187de80084f196b54469"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 45\u002B corresponding lines): crates/ruvector-cnn/src/simd/avx2.rs:682-726 | crates/ruvector-cnn/src/simd/neon.rs:444-493 | crates/ruvector-cnn/src/simd/wasm.rs:423-474 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 45 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a74f843feeef33a495659c3ef1fef4bcbbd26f100ece4f86070f8f3526bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1109-1165 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1161-1218 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f11380c583510ea714fde268aadfd5db5e456369063a78c2105597f35d6065"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/ruvector-adaptive-ann/src/graph.rs:59-119 | crates/ruvector-coherence-hnsw/src/graph.rs:73-131 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/graph.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4603dacb8fb888e48ac3d6ee91111ab57402a089cad009e00c6b3a6f002d9bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/ruvector-solver/src/simd.rs:238-300 | crates/ruvector-solver/src/simd.rs:310-356 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78ef1daecceab5df290102c6d7d8617008f3f182598930b8925d6014ee00c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): crates/ruvector-attention/src/sheaf/attention.rs:307-363 | crates/ruvector-attention/src/sheaf/attention.rs:404-485 \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":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"43208a6e499cf3668f8208f5d0454bb3b6de0eb9f5fb9fd4d6430cdf68108b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/rvf/rvf-runtime/src/store.rs:2231-2293 | crates/rvf/rvf-runtime/src/store.rs:2311-2397 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"10917a392df65e5ee0f9426419ccc7798132dead6cb2cae678d46223d4b665db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): crates/ruvllm/src/kernels/attention.rs:882-950 | crates/ruvllm/src/kernels/attention.rs:1113-1200 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e7711ce14e026da379dc49785ad6aaaf0bb33465234b82e4fcaa709d84d797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:143-188 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:143-189 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"156ee57128f705ff4619f75b0481edacdfd2123769ba52c48fedebba5e8d595e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs:97-147 | crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs:155-200 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ecea27a6cc51bce4087b75000446f9040fc104ba71ba36ade3c1722031e950"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): patches/candle-core-0.9.2/src/cuda_backend/device.rs:320-373 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:474-527 \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":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfe98d537a57981b59658997ca872c83bae6a5b132179712a32509280726343"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruvector-cnn/src/kernels/int8_scalar.rs:148-200 | crates/ruvector-cnn/src/kernels/int8_scalar.rs:261-301 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_scalar.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"92deeb7169b3f1f25712750dadb8ceae28c13763fe566cfb511270b0281c6da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 58\u002B corresponding lines): crates/ruvllm/src/quantize/turbo_quant.rs:360-423 | crates/ruvllm/src/quantize/turbo_quant.rs:426-483 | crates/ruvllm/src/quantize/turbo_quant.rs:605-662 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 58 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5f77a7d5b5214ba0621c7c811754faa3b69f93c11aaa7c14a9f51d6a26bfb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/rvAgent/rvagent-wasm/src/gallery.rs:389-447 | crates/rvAgent/rvagent-wasm/src/gallery.rs:450-508 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/gallery.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5822fa35716a632c4b2d7c03ac84648af5f484d657ce7a3af9567c2cd8d83014"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 58\u002B corresponding lines): patches/candle-core-0.9.2/src/cuda_backend/device.rs:529-586 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:588-645 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:647-704 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 58 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":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7df340921a4b3d1794fdb312a0eff7004676c4a37c8e3f7a74d23bd95980a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): crates/ruvllm/src/sona/ruvltra_pretrain.rs:427-512 | crates/ruvllm/src/sona/ruvltra_pretrain.rs:520-590 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/sona/ruvltra_pretrain.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d99aaaab1ffa9969c5c52e3396147b1ea7bec62086ac5b3d5594e7b4077c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:1468-1516 | patches/candle-core-0.9.2/src/tensor.rs:1792-1840 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ed9b5263e57d48dcd99052c802ea2da14aa46c9faa56fe8c5eb0b40239bb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): patches/candle-core-0.8.4/src/sort.rs:143-196 | patches/candle-core-0.9.2/src/sort.rs:173-242 \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":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a8285985da0dd349e6363c37ed23301b674592545b021db60db3a2d0f45f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/ruvector-math/src/information_geometry/fisher.rs:158-213 | crates/ruvector-math/src/information_geometry/kfac.rs:200-250 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/fisher.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd308d274009fb318cada3fbb0eb8025586d88d5c50e36316113803b299de23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:2044-2084 | patches/candle-core-0.9.2/src/tensor.rs:2368-2407 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87fa7a9db0b2ab9b5762381408962a9bdf88f6aa00cd36bfb8e600fc2ce88b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): patches/candle-core-0.8.4/src/quantized/simd128.rs:9-52 | patches/candle-core-0.8.4/src/quantized/simd128.rs:55-92 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/simd128.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"889b64c57e886282b74b9f9cb0df306d72097b2002367fcb6a61cf38fe0e693a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/ruvector-postgres/src/graph/sparql/executor.rs:154-208 | crates/rvlite/src/sparql/executor.rs:129-182 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6b75907e0a1dcb1d0d98870a7ac76d27df2aff9a10a615321e9e2a3f4ded6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): patches/candle-core-0.9.2/src/cpu_backend/utils.rs:9-27 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:33-51 \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":"patches/candle-core-0.9.2/src/cpu_backend/utils.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83b97152431efdee1e57f4fc0690c64fc8d0a95d83277883e14afc3fafc4b8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/ruvector-solver-node/src/lib.rs:503-555 | crates/ruvector-solver-wasm/src/lib.rs:566-652 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9180a38da2174017b431f5a7afa74e7e7bea9dfd79fc8c4edb9aa7e593e80b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1577-1627 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1728-1777 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03c6b0b321d437c4e2c73b0f23ee16f8b963aa348215909fa2354afa6381469"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/utils.rs:80-92 | patches/candle-core-0.9.2/src/cuda_backend/utils.rs:48-63 | patches/candle-core-0.9.2/src/cuda_backend/utils.rs:89-104 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/utils.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e356459d4567e55c3d3ec5776dc6fd461b773878464abae6c93b0e96a07fe2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:148-207 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:222-271 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1911e407d8866fef984b5b047131a8224dfb244e41ac8d9048f65f52ce5cacb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruvector-core/src/advanced_features/diskann.rs:269-300 | crates/ruvector-core/src/advanced_features/diskann.rs:324-355 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/diskann.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bb75de38f8228ba976432a4245662e0a2cd171c957d3d3ba43bf0b83e0068e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): patches/candle-core-0.8.4/src/pickle.rs:53-89 | patches/candle-core-0.9.2/src/pickle.rs:54-91 \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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7414e7b01cf125606a0dd6efb8ffa3024e8d761534e60f7b75134e99cebab7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-postgres/src/index/ivfflat.rs:280-324 | crates/ruvector-postgres/src/index/ivfflat.rs:332-387 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e8831c91b8e963dea4d3fd65082b089c8b00a11a36a7f06e830e21b36e32f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1343-1383 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1461-1501 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f5c5fa37164342bf9dfc6f250ebdd468021f01f098e634d35c2b11870d4dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ruvector-delta-core/src/encoding.rs:204-247 | crates/ruvector-delta-core/src/encoding.rs:345-401 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/encoding.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"10450cbb2304fdde0ad1084518b9a7fc0e17aef76d7bc3158a8700d7be139d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): patches/candle-core-0.9.2/src/metal_backend/mod.rs:1983-2003 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2005-2030 \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":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"0117ce4cd9064dc9d1504b60df67f32b5e160d1fad827befb1bb074d14ab3de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/ruvector-cnn/src/layers/quantized_conv2d.rs:140-219 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:126-174 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcdd7aa45da7165b003536cb4620e1a51ffd58a744446056c6b89fcf79001bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/ruvector-core/src/agenticdb.rs:1140-1208 | crates/ruvector-core/src/agenticdb.rs:1342-1400 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e82085a298d2430accd720f278ee895b7122566b4aed7e99d490f996daffa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/ruvllm/src/quantize/hadamard.rs:410-462 | crates/ruvllm/src/quantize/hadamard.rs:467-519 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f73fa48f72ed9216776622ad69340c02320660fd8b3122c70b2cc18d43cb4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/rvf/rvf-ebpf/src/lib.rs:398-455 | crates/rvf/rvf-ebpf/src/lib.rs:462-524 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-ebpf/src/lib.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fac7f5770765496c162d865278f8bab6c7c0e23b7cfe964c8457a6218d6852"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/rvf/rvf-runtime/src/qr_seed.rs:298-356 | crates/rvf/rvf-runtime/src/qr_seed.rs:363-431 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_seed.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"116c9cb8c9a963e23085ccfb5be213eeefca35642cda2b1f1986c9771c62c6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 54\u002B corresponding lines): crates/ruvllm/src/reflection/perspectives.rs:359-412 | crates/ruvllm/src/reflection/perspectives.rs:558-622 | crates/ruvllm/src/reflection/perspectives.rs:772-829 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/perspectives.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"68092ef5abddef0313a7c6ded7776002da2521e4dfa1508a5cc9a35eb7839fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-rulake/src/cache.rs:728-773 | crates/ruvector-rulake/src/cache.rs:801-845 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/cache.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"020f09c99bce3d769dd2cc91a3daba105cdc21b725c89a056d145da18bdf3528"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/sona/src/export/dataset.rs:30-79 | crates/sona/src/export/dataset.rs:162-210 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/export/dataset.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b24e967a689ec45843a4f2ced545e774e08b3e78514391995755731c2b52a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/ruvector-graph-transformer/src/sublinear_attention.rs:114-159 | crates/ruvector-graph-transformer/src/sublinear_attention.rs:170-217 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/sublinear_attention.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"71af088e8f7394052ae5e8d797b3333ab2a1cfdf09b2beac851b2422a59837bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/rvm/crates/rvm-types/src/witness.rs:150-187 | crates/rvm/crates/rvm-types/src/witness.rs:367-407 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-types/src/witness.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e4d340ba49e9a4ca9872cc25aa814fce6058983e8a0914f958cbe94a970329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): patches/candle-core-0.8.4/src/quantized/cuda.rs:190-225 | patches/candle-core-0.9.2/src/quantized/cuda.rs:230-267 \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":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a2776aab720020ba0f3ebd476105fe72bf956c7cee01231117247dd7466d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ruvector-solver-node/src/lib.rs:335-381 | crates/ruvector-solver-node/src/lib.rs:395-438 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b56b96211b2fcac78c3ca4f9947f9d600f3da8fb0159ea6750d3247a9e1c7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruvllm/src/moe/router.rs:477-526 | crates/ruvllm/src/moe/router.rs:615-655 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/router.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3e80b6fbc55c9e33dbafdb9c2f91e3a43dacfe47f296d51a9d2a41bfb8b924"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/ruvector-filter/src/expression.rs:157-195 | crates/ruvector-filter/src/expression.rs:199-237 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-filter/src/expression.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5362809291c744a2b1299b43cc76153038c186e8e73609b29644bed77780434d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/ruvector-cnn/src/kernels/int8_wasm.rs:21-71 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:311-367 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_wasm.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b86a6834cb41cb9d41e6d7673d8229879eb3ae42e8b7ea9b98acc7021f22451"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/rvf/rvf-solver-wasm/src/policy.rs:185-235 | crates/rvf/rvf-solver-wasm/src/policy.rs:238-277 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/policy.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c968bcdb4b96dc0e5980e8bdffde39a8e73d6c766f1a23f20d570827d9045ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 53\u002B corresponding lines): crates/ruvector-cnn/src/layers/quantized_conv2d.rs:51-123 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:58-111 | crates/ruvector-cnn/src/layers/quantized_linear.rs:41-93 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 53 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc257980a220f097c91807f0722480750d635a14bff0e9290daf24f54afad43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/mcp-brain-server/src/notify.rs:277-325 | crates/mcp-brain-server/src/notify.rs:334-382 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9c56ad8d4c95f96dfbfa894b679720a31a692e2925b6b0b6fcc5f20ddecd70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/prime-radiant/src/coherence/engine.rs:628-674 | crates/prime-radiant/src/coherence/engine.rs:685-726 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba67b0e1ae278fb1df1461c9281e48fdb6cea02caad1c2d09135a316d8e84535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/ruvix/crates/vecgraph/src/simd_distance.rs:195-247 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:345-395 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aac0b997073bbf8b01170b4ab97068012547aa46d4125e351cddec845a981f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:42-58 | patches/candle-core-0.8.4/src/cpu_backend/utils.rs:65-81 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:58-77 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:84-104 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:111-130 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70697db41bf1ae00c4d29c2d72cc55ad0ff23688398b844795bc0d75aa051c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/ruvector-math/src/product_manifold/manifold.rs:261-295 | crates/ruvector-math/src/product_manifold/manifold.rs:370-404 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ed5e4dd87def3038dec93a8249001aca21a8a0541e56ac5bbd58ae185bde6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:665-691 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:712-741 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c342355f65857837cb2094084f12682ee9da9079b3a93ce5b8127a6caeee662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/ruvector-consciousness/src/bounds.rs:77-123 | crates/ruvector-consciousness/src/sparse_accel.rs:63-128 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/bounds.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aef0dda680688fa65f464d2cc547871466f21cf8c1dbc4ac53b3acf05a4434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvllm/src/kv_cache.rs:802-847 | crates/ruvllm/src/kv_cache.rs:1447-1491 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"514a065ec9f85da4b76b97c414076e29e6ca53c7d8910bcc42c8f1558c378ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/rvf/rvf-index/src/distance.rs:104-157 | crates/rvf/rvf-index/src/distance.rs:232-272 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/distance.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1629a66904a77f31cc03393b55e45241bc9ff3fef28db1ceb5bcb488bf9d7545"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 51\u002B corresponding lines): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:46-96 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:42-92 | crates/ruvector-bench/src/bin/latency_benchmark.rs:49-107 | crates/ruvector-bench/src/bin/memory_benchmark.rs:39-91 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 51 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfece32c9e29486812e15589daadef6c7bf345cc5c36ae5489779d59f62f9cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruvix/crates/dtb/src/parser.rs:156-205 | crates/ruvix/crates/dtb/src/parser.rs:241-281 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/dtb/src/parser.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe70b4e8657772b4890208483b11133d5f837e17cd994d2f996708429318729"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:834-871 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:942-978 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"42332947b8af5923964b942af266723a7e0a60955fa6f8a12e0bc9ff6acaacee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-cnn/src/layers/pooling.rs:118-162 | crates/ruvector-cnn/src/layers/pooling.rs:220-264 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/pooling.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"318c5b18ad25d1183ae67a93d442969a6ffa01152fce637d6d60b58f68285366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvector-edge-store/src/ops/dispatch.rs:98-130 | edge/gateway/src/ops.rs:74-112 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/dispatch.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c188d58f29adce5fc9833deb8b2a164a328cfbcd2cad8be46a5277c11d2fe6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-graph/src/cypher/parser.rs:1241-1295 | crates/rvlite/src/cypher/parser.rs:1112-1156 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91534dd3e86b6179e82c1013d3390bae5242f49147eb22a4c28aec958fcb1bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ruvector-recall-bounded/src/lib.rs:285-328 | crates/ruvector-recall-bounded/src/lib.rs:410-463 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f91b01d4a780ac6aec678d5a7cbf9e3a09a9338093ffe7d529b7fa4d70ddcd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:944-974 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1136-1169 \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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2153bc0267f64b1db84723d65bcfc4a73316e4929a782dd051c7738ca5a602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 48\u002B corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1984-2031 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:2039-2086 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2572-2623 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2631-2682 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 48 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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6509a6baf13381e1f3de73d5a785bfb8a6ccb487a3db7cd7ea370945a27aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:185-220 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:200-236 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a6479ea812d52659256f6fbe785ae36149b45a35600525d4c484efc1af392e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:1359-1395 | crates/ruvector-core/src/simd_intrinsics.rs:1400-1437 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42c2f9ca77b0d3a26185361b3a228c0c5d78837fac52fc75cc93885d46de910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-delta-index/src/lib.rs:431-497 | crates/ruvector-delta-index/src/lib.rs:729-773 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-index/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b545905f485cdac871fdbb99a52dba9151aeb006219748f3d97c7cf737f51a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvector-core/src/agenticdb.rs:1107-1137 | crates/ruvector-core/src/agenticdb.rs:1300-1339 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bd4a8b27f7ab6d16652d5a3ac65c300d600e0dac516af569902989f47697fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-mincut-gated-transformer/src/attention/window.rs:279-327 | crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:231-275 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/window.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfadfa731e7e4b6416cda627ad16f6af877ea710ec12b75eed80958f9f0c2fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/ruvector-sparsifier/src/audit.rs:106-152 | crates/ruvector-sparsifier/src/audit.rs:163-216 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparsifier/src/audit.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7626aa9f293bd5caa7c204faa616b612606a821f0bd67412c9ea0a44844eae55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs:206-263 | crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs:339-388 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bef445f5158804bce620b787ad473a08db3de637853a1f6a8a0cff9cc6c621"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ruvector-mincut-gated-transformer/src/rope.rs:205-248 | crates/ruvector-mincut-gated-transformer/src/rope.rs:258-307 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/rope.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"85582bb467dae176d02e8a0f8a7220e122aec321ea81ef696b97c49d02cc7dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/ruvector-tiny-dancer-core/src/model.rs:287-326 | crates/ruvector-tiny-dancer-core/src/model.rs:344-387 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/model.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b9f090ada06d346a15a97b6e841546874ffa7402e6519b79e7e47f4fdcad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1847-1883 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2322-2350 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa80568fd550c17efc8c77d959b36633b66e75f34eaa189c0e9e18796b44a836"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/ruvector-solver/src/simd.rs:68-113 | crates/ruvector-solver/src/simd.rs:177-212 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0834d5108f83303a4f652d14c88f2df0999136c2cd8dc2ed7d6c1256c5a8040b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:184-208 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:235-261 \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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e44a0b2895816ba4a967e5fe1a62ad0a3fc05d44def2a98a91dd63e3e9415d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruvector-math/src/product_manifold/manifold.rs:200-251 | crates/ruvllm/src/bitnet/rlm_embedder.rs:913-953 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"37621d9c7b2989afa3b824d818d282fa8430fca65c590a0f0616cf6d86f797d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-cnn/src/simd/neon.rs:388-432 | crates/ruvector-cnn/src/simd/wasm.rs:361-411 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9868f8d399b57e67b1f77f55fd6bece19938b03f7c04e8fe42243a170a82bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruvllm/src/gguf/mod.rs:652-683 | crates/ruvllm/src/gguf/mod.rs:688-722 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/mod.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63f8e084572ef7ce0a79685b3593353f4b171c960b058ee1cebc89c78d2738f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): patches/hnsw_rs/src/hnswio.rs:803-839 | scripts/patches/hnsw_rs/src/hnswio.rs:803-839 \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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"7333f74777b2b7519b1742b06f761e4b5f791207bb781787fdeed7fa12f99467"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvllm/src/kernels/attention.rs:1416-1446 | crates/ruvllm/src/kv_cache.rs:949-990 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"19010f1cb30baf64080c78f5a10e8c416a2d7278497a88a2e74a2d3ea5ce8b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/rvf/rvf-server/src/tcp.rs:196-247 | crates/rvf/rvf-server/src/tcp.rs:326-374 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/tcp.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c26bd8d1b5120d9797d848ac342448f1acc8e60bdc4e36c619c01a07b7c2bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): patches/candle-core-0.9.2/src/cuda_backend/utils.rs:18-35 | patches/candle-core-0.9.2/src/cuda_backend/utils.rs:150-167 \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":"patches/candle-core-0.9.2/src/cuda_backend/utils.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"719cd6b770c85adbcfaff3a27252daecdeea213b45aaf5b928f8e75bff0af960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): crates/ruvector-core/src/agenticdb.rs:357-398 | crates/ruvector-core/src/agenticdb.rs:452-494 | crates/ruvector-core/src/agenticdb.rs:566-607 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6fc27e2582e8ae5e35c4e4ec6bc5e2aff42ff08ca7c51b6dd596b13e63a736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): patches/hnsw_rs/src/hnsw.rs:1243-1300 | scripts/patches/hnsw_rs/src/hnsw.rs:1229-1277 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea83e68b9a6ea053c619deebd96b4e30acd06de882dac47ccabd76716b102a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/utils.rs:42-54 | patches/candle-core-0.8.4/src/cuda_backend/utils.rs:112-123 | patches/candle-core-0.8.4/src/cuda_backend/utils.rs:159-171 | patches/candle-core-0.9.2/src/cuda_backend/utils.rs:124-138 | patches/candle-core-0.9.2/src/cuda_backend/utils.rs:180-193 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/utils.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d097e1ceced276e6e928810e3f6806330855b5afb193e1689a3a6ff8f2a5d39c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/ruvector-mincut/src/fragment/mod.rs:186-231 | crates/ruvector-mincut/src/instance/bounded.rs:301-358 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/fragment/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fffd6d54cc22bc87a279d60621627a249ff8cafab53c57f51c0a58ce341de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/ruvllm/src/context/semantic_cache.rs:228-279 | crates/ruvllm/src/context/semantic_cache.rs:282-327 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/semantic_cache.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd46a25a5c30fd5e5ff39c9dced13be64d2f31d3bcd839d69cc362aa6832535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvllm/src/quantize/pi_quant.rs:1185-1241 | crates/ruvllm/src/quantize/pi_quant.rs:1246-1290 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb1204dce256091674e549393c0242a90031bc75048c34942d34e0588d7d996"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/ruvector-postgres/src/index/ivfflat_storage.rs:36-88 | crates/ruvector-postgres/src/index/ivfflat_storage.rs:148-187 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_storage.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac3204d77aa384e23c20ddc3eb529af937e6335a4516a9bc548cadb63add668"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): patches/candle-core-0.8.4/src/pickle.rs:606-629 | patches/candle-core-0.9.2/src/pickle.rs:626-653 \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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fabdfc043289ed0961a44f1ac205445edc5273c0090166cd5f820d42baab2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/mcp-gate/src/schema_cache.rs:133-177 | crates/rvf-forge-core/src/canonical.rs:93-136 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/schema_cache.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a5ec439681e487de4151a6e96d2722e758ca9aca2ad5a8f9d9150b90da60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruvector-core/src/advanced_features/compaction.rs:135-168 | crates/ruvector-core/src/advanced_features/compaction.rs:217-251 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/compaction.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b679dd4646b75b24dd39af9be1abdd751295194ae4a83c05dc30c338a416002c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/photonlayer-bench/src/baselines.rs:64-95 | crates/photonlayer-bench/src/baselines.rs:109-153 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/baselines.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a289d7bb448d4754a111f2f171aa2bd8ba9f4790b9ef0ae53f59d859fdcb18d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruvllm/src/gguf/quantization.rs:552-589 | crates/ruvllm/src/gguf/quantization.rs:598-637 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb748738b5555025e51c71733635a71a9b8db9af2de1be89513f3b529a61603"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 30\u002B corresponding lines): crates/rvf/rvf-types/src/dashboard.rs:71-102 | crates/rvf/rvf-types/src/delta.rs:88-119 | crates/rvf/rvf-types/src/ebpf.rs:147-176 | crates/rvf/rvf-types/src/wasm_bootstrap.rs:204-239 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/dashboard.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfdd0fc6a0d0cee260c1ff1a291ef331af7719c950e216b0050b6b35b27f800"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1938-1962 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1964-1987 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5fb92a0c8e1698b401441a1f6c0812d312a51fa6b73dd112030a51eb04b381"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2126-2157 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2159-2179 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aac06a1c19c425d1e380875c450b99ebac3fa504c5b97ac94f5f5a6dbe4e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ruvix/crates/queue/src/ring.rs:254-301 | crates/ruvix/crates/queue/src/ring.rs:320-363 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/queue/src/ring.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"08027f11c367fc32c14e5eb961c5159aeb5320a40b09cf5681c283685a94a153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1788-1825 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2214-2251 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"e679e40e46635b525256783dc5b3a7196ffcef3beb9122c59fe51dc999b19fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/ruvector-attention-node/src/async_ops.rs:49-66 | crates/ruvector-attention-node/src/async_ops.rs:76-93 | crates/ruvector-attention-node/src/async_ops.rs:103-125 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/async_ops.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4616d084a8f6d358adca5469e2a170e07bd33b9d76128c4550cf65b92cc02d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/ruvector-fpga-transformer/src/backend/native_sim.rs:366-419 | crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:206-257 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ec399743bcfa0c6d5ab0afce5c1fa7ef3aea9db3a93a6226a58f05b41a1765"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/ruvector-postgres/src/index/ivfflat.rs:186-235 | crates/ruvector-postgres/src/index/ivfflat_am.rs:487-544 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1872c730a11c42f3c7583523d4385153e56ff2268366486ab2f238f264bcf28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/ruvector-delta-core/src/compression.rs:365-413 | crates/ruvector-delta-core/src/compression.rs:415-463 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/compression.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae96b190aabba0d0cacdffb770ae4b1a03870828d53230050c62ef81861e38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/ruvix/crates/net/src/stack.rs:294-333 | crates/ruvix/crates/net/src/stack.rs:471-510 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/stack.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"59de7097d642e3b7e2ce7f3475cd2f8f8402dc8eea3cef818ba3b98bba96d467"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/rvf/rvf-federation/src/aggregate.rs:196-239 | crates/rvf/rvf-federation/src/aggregate.rs:252-290 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-federation/src/aggregate.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce1a7ee981c70e269d547c4416240e0a3b8edc052327cc178b51203e7fdc47a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): patches/candle-core-0.9.2/src/metal_backend/mod.rs:1310-1348 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1358-1403 \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":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2fcea1a87de386a8f718cd9e131fc254045f1aa53128e4ff28451e7ea5fc4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-bet4-ivf-bench/src/kernel.rs:144-180 | crates/ruvector-bet4-ivf-bench/src/kernel.rs:198-226 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/kernel.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd7ef211bc0e8dde733ed4cd725ff6e14ee53589ddcd8681dadce718cfbafe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-consciousness/src/rsvd_emergence.rs:156-199 | crates/ruvector-consciousness/src/rsvd_emergence.rs:202-230 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/rsvd_emergence.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87f9f134381ec8fece6f26f9fc4f52c7b5b8f9710602de28cfc6846996843ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-math/src/spectral/graph_filter.rs:140-196 | crates/ruvector-math/src/spectral/wavelets.rs:214-258 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/graph_filter.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61c9877b5bab04b3443bf0b6ecfab45ae4bf7697e5f91465a2f092f62d2a548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvector-sota-bench/src/bin/sift1m_bench.rs:34-66 | crates/ruvector-sota-bench/src/bin/sift1m_bench.rs:69-102 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sift1m_bench.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc1ba4a5220cef894fbd5009f94ebe4bb7315ae50c85cd24f860c961ba5547"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruvector-consciousness/src/iit4.rs:266-307 | crates/ruvector-consciousness/src/iit4.rs:316-356 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/iit4.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4eecda1a3c77f5b12fc4fa8680d1d1b4f84959793cf9ba35c78a1b73c0452e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvector-memory-admission/src/policy.rs:196-217 | crates/ruvector-memory-admission/src/policy.rs:343-368 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/policy.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e07b7b611fbd7d3aaa3a59c6c9f91013e64854b36864826621f8aace210309"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvector-recall-bounded/src/lib.rs:215-245 | crates/ruvector-recall-bounded/src/lib.rs:375-408 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"04adb56144b795cfd4ed9b5fd03d53b6b34cac81772eefc1967f9fc0f10e8b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): crates/ruvector-turboquant/src/simd.rs:160-190 | crates/ruvector-turboquant/src/simd.rs:213-243 | crates/ruvector-turboquant/src/simd.rs:246-274 \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":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46ec54feb7ddeee39237eecfa7d7a8383a56d06aefe16fcdcec7375c6ee4ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvector-consciousness/src/geomip.rs:344-374 | crates/ruvector-consciousness/src/phi.rs:95-146 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/geomip.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c510bcc860544ad45f758c119546a4e4e4647cd040d241fe8489d521bbb16f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): patches/candle-core-0.8.4/src/sort.rs:71-94 | patches/candle-core-0.9.2/src/sort.rs:71-102 \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":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7133468a55e25bef526a6251794eb9474d14a83ce41eb1dd1f44badc89b212fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruvector-core/src/index/hnsw.rs:136-169 | crates/ruvector-core/src/index/turbo4.rs:291-332 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/hnsw.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"655cbe7ca9a5d554b07f6b3e3fa5cc17505af571fd26ed7eb37e5d3c09148862"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/ruvllm/src/hub/download.rs:365-408 | crates/ruvllm/src/hub/download.rs:417-458 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/download.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"520ed1203e16edb1c8bd6fb17a65067da5bafcbc4b8d5474be776c3169b98325"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvllm/src/optimization/metrics.rs:638-666 | crates/ruvllm/src/optimization/metrics.rs:669-693 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/optimization/metrics.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dea16d7cc56bb7c7144543abee2e5c7acc3b01856940bf622309c5c05809bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/rvf/rvf-cli/src/cmd/embed_ebpf.rs:34-69 | crates/rvf/rvf-cli/src/cmd/embed_kernel.rs:37-78 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/embed_ebpf.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69f8539011201aa63dce26ea1aa125f001faf79197009b80d17c17a1fa45105"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvector-cluster-rag/src/search.rs:68-95 | crates/ruvector-cluster-rag/src/search.rs:135-171 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/search.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dce9b400542a4ef09ca71cf476d4e1958e8c2fd233a12ccb4023156348baf38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/rvlite/src/cypher/mod.rs:146-187 | edge/gateway/src/graph_persist.rs:125-162 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b686dea1421363eecf0630b06cc227016b5d6d3849114dee80cc06f65c3b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/device.rs:254-289 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:375-421 \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":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5900402e4f421d6fc08fcac6f9706f6a01a629be8ab33d56cce9751498682f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/rvAgent/rvagent-core/src/rvf_bridge.rs:342-360 | crates/rvf/rvf-types/src/qr_seed.rs:113-133 | crates/rvf/rvf-types/src/stream.rs:178-196 | crates/rvf/rvf-types/src/witness.rs:201-219 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/rvf_bridge.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba8f8355bd69efbb9a52a167fd42b07a611ada81eb7208dbb57bc7d0e97b308"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvllm/src/gguf/parser.rs:323-342 | crates/ruvllm/src/gguf/parser.rs:348-384 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/parser.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29814183b24e013f250e04f6fbc8073ae13868dc7ff47d02cb3937faa36196f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvector-attention/src/training/optimizer.rs:139-164 | crates/ruvector-attention/src/training/optimizer.rs:207-234 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/training/optimizer.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a3907b089a7e86f797ed403190f56ac1b334091913e31d7b8ef77f77eecec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/ruvector-consciousness/src/phi.rs:326-381 | crates/ruvector-consciousness/src/sparse_accel.rs:194-242 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfe2f04aa4f22e60d501ffc976fc00ef6e010c656ae8a16ecb622c1b2ee28a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:212-231 | patches/candle-core-0.9.2/src/quantized/mod.rs:359-378 \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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bb27741338232e6cb1ac528eff8c4f463ab462cbab4525dad5944d74d24645"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): crates/ruvector-cnn/src/kernels/int8_wasm.rs:259-297 | crates/ruvector-cnn/src/simd/scalar.rs:107-143 | crates/ruvector-cnn/src/simd/scalar.rs:156-190 \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":"crates/ruvector-cnn/src/kernels/int8_wasm.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3b3591b4acbfa07b79df0d74a1001c1cc4bcf843b5fbe86124234cbf6dfa91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:1013-1051 | crates/ruvector-postgres/src/distance/simd.rs:1531-1566 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c45b920f501b474d8810f490151c86554c7d7659fc832701abe1731a4a2156"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-coherence/src/spectral.rs:227-255 | crates/ruvector-consciousness/src/simd.rs:209-242 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence/src/spectral.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5516c5f5b1c42b53bc145147a02a7de73b84c00bfafb8c4556959c57ae6a8050"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruvector-consciousness/src/arena.rs:23-56 | crates/ruvector-solver/src/arena.rs:59-121 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/arena.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"151b6ffef09689079c5ff5623455573d4c66e521a9f108ea9f5a9a66ddf16bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): crates/ruvector-postgres/src/index/ivfflat_am.rs:690-728 | crates/ruvector-postgres/src/index/ivfflat_am.rs:736-782 | crates/ruvector-postgres/src/index/ivfflat_am.rs:790-830 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdc6842f3817c973df2896a9d6b1a3f43efe18dbd1ccc2274db6e4208151c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/ruvector-mincut/src/expander/mod.rs:379-431 | crates/ruvector-mincut/src/expander/mod.rs:593-640 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b608f1531af9faaa4816ebdea34476a3397dd64f922a504dd5160915e5c122"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruvector-core/src/agenticdb.rs:405-441 | crates/ruvector-core/src/agenticdb.rs:497-530 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa4140149a88643721d321482ff29eaf65b1f58ed14d3cd87f713147be41be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvector-graph-node/src/cypher_exec.rs:106-136 | crates/ruvector-py/src/graph/cypher_eval.rs:93-123 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b1a45c479ac34d30e824e3a800f802a242d638806f8372ea65189048b6dffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/ruvector-math/src/spectral/mod.rs:53-98 | crates/ruvector-math/src/spectral/mod.rs:101-146 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c1d3bc87e4d8420e4525712780bef31b3b5b1b6406b82c5b34e647b12c2074"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ruvector-mincut/src/cluster/hierarchy.rs:460-508 | crates/ruvector-mincut/src/cluster/hierarchy.rs:546-589 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"366e5dfedfa30b252cca273bc62134586c8288edc122aef532c1b748d7a3bb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): crates/rvAgent/rvagent-wasm/src/gallery.rs:151-233 | crates/rvAgent/rvagent-wasm/src/gallery.rs:316-386 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/gallery.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fa10521639735f59ebe7da85da47de4da75fb758c288e671d856663f2cca13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvector-robotics/src/perception/mod.rs:89-121 | crates/ruvector-robotics/src/perception/mod.rs:310-346 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/perception/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"107fdd15004f2f6502fb8505fcc73e4f876fc52297bc93020edbe30ced363f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-edge-index/src/crc.rs:44-63 | crates/ruvector-edge-quant/src/persist/format.rs:258-277 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/crc.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ca784969ed80ae8377b4f39b189c9835d7ffbb2e89adcb8c13b8f68e032d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-postgres/src/index/hnsw_am.rs:2103-2131 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1941-1971 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c81e449cb2fe47663ba2c8158aee78f386a932477157f71def8105a94b1ce6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-nervous-system-wasm/src/hdc.rs:89-113 | crates/ruvector-nervous-system/src/hdc/vector.rs:182-209 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/hdc.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4585e4c767ca4df1e71e556e79d1632be2243da9af3d506fcb1ef91873e45893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/ruvix/crates/nucleus/src/vector_store.rs:262-304 | crates/ruvix/crates/nucleus/src/vector_store.rs:308-351 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/vector_store.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d7a953452735b4ccd6ee8da6959ae9aa7b464d12192305bb7c784beb01a841"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:151-176 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:203-230 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa7a84d4aecfffe472e91ca187711b185efcf11f818e03fd40c8fde0747c738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1939-1976 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2522-2564 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d11197cd24ce6aae82081426a83ec85884dfde063568f580116843a929202b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): patches/candle-core-0.8.4/src/safetensors.rs:210-229 | patches/candle-core-0.9.2/src/safetensors.rs:286-310 \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":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edb356512303e81fb9a678931fc7ee94a0da5b70535eeee1e969c562972502c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): patches/candle-core-0.8.4/src/quantized/cuda.rs:448-472 | patches/candle-core-0.9.2/src/quantized/cuda.rs:609-630 | patches/candle-core-0.9.2/src/quantized/cuda.rs:637-658 \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":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"24441b55dc716ebfd9b475b903a2b09e509730ffe6ce1a176a96c1a1e9eea2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 36\u002B corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/device.rs:216-252 | patches/candle-core-0.8.4/src/cuda_backend/device.rs:335-371 | patches/candle-core-0.8.4/src/cuda_backend/device.rs:373-408 | patches/candle-core-0.8.4/src/cuda_backend/device.rs:410-445 | patches/candle-core-0.8.4/src/cuda_backend/device.rs:447-482 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3b34227b6d600b88ace7fcf4c7bf6b2fc0cab23b34c716f3cfac9eda3fb555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:586-615 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:617-646 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bf78478cb132fc72bd0d42c917f5af325133b4f59a66074ece517991748c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvix/crates/cli/src/commands/dtb.rs:793-818 | crates/ruvix/crates/cli/src/commands/dtb.rs:879-909 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fe77bb7a0148f139b43945e842ec38f2d9e80336ae77f7d944a24848007ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/rvf/rvf-runtime/src/witness.rs:342-376 | crates/rvf/rvf-runtime/src/witness.rs:382-426 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/witness.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce130726cada65f0ae33a5d73ecf8b22923efb91675cfa013858cf3ad69b181"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): crates/prime-radiant/src/simd/energy.rs:54-86 | crates/prime-radiant/src/simd/matrix.rs:197-228 | crates/prime-radiant/src/simd/vectors.rs:195-226 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca781fa759a4eda36eb58b047d77432560a16048c4774a8ddf1e8fbded8d215f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/ruvector-sparse-inference/src/backend/cpu.rs:238-280 | crates/ruvector-sparse-inference/src/backend/cpu.rs:286-321 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"645ca88b185a527003eeed1bff51e0bc3334c3bc68507d54b53896d3d05bd64d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): patches/candle-core-0.9.2/src/cuda_backend/device.rs:253-271 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:277-295 \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":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48a1d63b68f57f030d6594ee425e288e6259e5d8b78526d0f735b0a226c7668"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/ruvector-core/src/quantization.rs:522-570 | crates/ruvector-core/src/simd_intrinsics.rs:1262-1303 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d67c07709231fa89e2ca660ece6829bd1d6525d2c8f3a58c4e3d582fba5ccc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvector-mincut/src/linkcut/mod.rs:345-378 | crates/ruvector-mincut/src/linkcut/mod.rs:382-414 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/linkcut/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15ba57441536a41d6751687b88f23ebe2a4c049fb77fe18f90805014445203f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-attention/src/moe/expert.rs:160-188 | crates/ruvector-attention/src/sparse/linear.rs:49-79 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/moe/expert.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"260a6bccec537576e157affdc541476b23a6a5c93aef7d16aa925926b9275b8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvector-core/src/advanced_features/matryoshka.rs:434-455 | crates/ruvector-core/src/advanced_features/multi_vector.rs:322-344 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/matryoshka.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f779dd1b6e01898a7f90d068cb4042d093b6d1afc26727de6dd9cc9801eab6ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/ruvector-core/src/storage.rs:219-253 | crates/ruvector-core/src/storage.rs:256-295 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a503f5d3b4243ac1357fa160f11b10c4b6336f15addc129a7408178680b58b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/cognitum-gate-kernel/src/evidence.rs:106-134 | crates/cognitum-gate-tilezero/src/evidence.rs:150-194 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/evidence.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b09ec4cd4f120010740ab9e3ed86c6b87279ebfc044ec0e88c067c7a3999ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-agent-memory/src/ops.rs:308-323 | crates/rvm/crates/rvm-types/src/witness.rs:103-120 | crates/rvm/crates/rvm-types/src/witness.rs:343-361 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/ops.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cadb252fc8a685810e837406dc89ad1adb8bf0e1cfde2f76d34f54f7b9fc63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/ruvector-domain-expansion/src/rust_synthesis.rs:136-189 | crates/ruvector-domain-expansion/src/rust_synthesis.rs:192-235 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/rust_synthesis.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd12fc633547bdfbed5693b19071a297d55edca7c7b7d875afc2a60fc0d49d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-edge-index/src/metric.rs:60-75 | crates/ruvector-edge-index/src/quant.rs:319-334 | crates/ruvector-edge-store/src/distance.rs:51-66 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/metric.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"202f8b9abdfe8d2dacd880be753cfbf19f82e2e6511b2849ff73a00538c8290e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/prime-radiant/src/substrate/restriction.rs:62-97 | crates/ruvector-solver/src/types.rs:297-327 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/restriction.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f24b0ad07f483889eefc56a57f6738cf7346867aca14fc7b9f7297f6dec05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/ruvector-cnn/src/simd/winograd.rs:104-134 | crates/ruvector-cnn/src/simd/winograd.rs:145-176 | crates/ruvector-cnn/src/simd/winograd.rs:187-218 \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":"crates/ruvector-cnn/src/simd/winograd.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06363f271fd53e7f9d23f3ff06f7778f93b8f867a9c8db0a5a909c1f67550f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-typesafe-core/src/engine.rs:422-447 | crates/ruvector-typesafe-core/src/engine.rs:450-469 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b01e9ae0f494097f4d449f67951975962d447bb8dc6380a31703fadfa4a0f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rvf/rvf-index/src/hnsw.rs:442-462 | crates/rvf/rvf-index/src/hnsw.rs:658-682 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa34e17d6567e68756c48d1da5e51fee6f28b342281214ed1ab8d06f513bf5e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/device.rs:291-329 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:423-472 \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":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d851106e54e328d7922d6f50e8d6ccd19eb1cf3d4631ef1ccb0fc5c1ddc3c114"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/mcp-brain-server/src/gcs.rs:107-145 | crates/mcp-brain-server/src/store.rs:204-248 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c57eee76b99328bb6a968adacb43ffb49a0ba7a7691a8b5cfb2b406e7747b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-solver/src/cg.rs:76-102 | crates/ruvector-solver/src/cg.rs:108-134 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07405cd94600c127dc525a1cccc097c871c95fad2a2755385a69a7b27c5130e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-attention/src/curvature/tangent_space.rs:115-133 | crates/ruvector-math/src/product_manifold/manifold.rs:320-341 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/tangent_space.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f6b57f2025d925ab20ee1665eff839a0c1d3479b7eedff102ce3f9838793ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruvector-gnn/src/mmap.rs:150-190 | crates/ruvector-gnn/src/mmap.rs:411-456 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a563382bf9466ff7a283ef219604c0c6a0c4b3babaacb9c764c26be402b59682"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/prime-radiant/src/mincut/adapter.rs:71-104 | crates/ruvector-mincut/src/subpolynomial/mod.rs:263-299 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/adapter.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9232f638373878c795fde5c5555f51b36923f1a0f4d703c1542617939ba03be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvllm/src/models/openmythos/mod.rs:574-598 | crates/ruvllm/src/models/rdt.rs:1082-1104 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f610a3b3fb1f9672d69af034038077191ee5f2bde0a4c85927cc334ed83c145f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/rvforge-registry/src/registry/publish.rs:160-201 | crates/rvforge-registry/src/registry/publish.rs:213-260 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/registry/publish.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93b6d59e971b3347a1eac0bdf5d5b591998e39be471f9302e7ee439c39db771"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/ruvector-memory-admission/src/policy.rs:225-266 | crates/ruvector-memory-admission/src/policy.rs:376-417 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/policy.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d176431775a7e76a1b77345cf329a99e77901b75bc6225d8ba31e77830eb6e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): patches/candle-core-0.8.4/src/custom_op.rs:424-457 | patches/candle-core-0.9.2/src/custom_op.rs:430-459 \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":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cfbc7acf810aa590a58b7aa881ff9dfb741e34c3ad19b3227e6467da6a909b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-core/src/vector_db/metadata_index.rs:83-112 | crates/ruvector-edge-store/src/ops/types.rs:200-228 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db/metadata_index.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8310fad0632b02689e9f7591d734e236c6d5991aa3570eeff10582d5321a6a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-hybrid/src/fusion.rs:150-174 | crates/ruvector-hybrid/src/fusion.rs:215-243 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hybrid/src/fusion.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9205019a1d08fc66ef615c23028e057042267dd10c703f1fdc8bc91f9a9f782e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-postgres/src/graph/sparql/parser.rs:72-99 | crates/rvlite/src/sparql/parser.rs:96-122 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0848167f3d5bbe8fdffa98e49f1fcc25f8e83a22a2d5b498aac47fff4b4c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs:228-253 | crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs:258-281 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"066655a8aa051c532b0749945b2c29c934c39c6b41769efa50a18f2e874e5f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvector-mincut/src/jtree/hierarchy.rs:470-500 | crates/ruvector-mincut/src/jtree/hierarchy.rs:503-533 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/hierarchy.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc3629668e00b71dee92faa58713d6d9f9fa283690de2ee7dc5352bd69c39ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/rvf/rvf-runtime/src/adversarial.rs:19-49 | crates/rvf/rvf-runtime/src/adversarial.rs:54-78 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/adversarial.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af5f2e22cb800c9f910a501d96ca7da8c03de4a3b1619370b5036e4708ed315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): patches/candle-core-0.9.2/src/tensor.rs:1644-1664 | patches/candle-core-0.9.2/src/tensor.rs:1683-1703 \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":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2570062af732a8645e8578592262849a719444be83f11ab220319b380ac5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-cnn/src/simd/scalar.rs:343-369 | crates/ruvector-cnn/src/simd/scalar.rs:382-410 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e07defbb9506ac59bb3cf75a4c6fd0bdbc835e769d9e97b62cd4bc2daa75fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruvector-postgres/src/index/hnsw_am.rs:1624-1659 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1497-1530 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"24332fe12f01d5c073c5e40f05cec33c8020bc9b932b8435d07167415e88a232"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/rvAgent/rvagent-core/src/parallel.rs:28-52 | crates/rvAgent/rvagent-core/src/parallel.rs:72-101 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/parallel.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5056b7b0dd96964a1fda50e95ab61b76c317cb13839e6ff66dbb34291b8919db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/rvAgent/rvagent-middleware/src/hnsw.rs:522-550 | crates/rvAgent/rvagent-middleware/src/sona.rs:119-148 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"746c7576a9738162b1bd3531362a1e190c257413346a38d9b2ebbb7d4a17cea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 40\u002B corresponding lines): crates/rvm/crates/rvm-security/src/gate.rs:160-209 | crates/rvm/crates/rvm-security/src/gate.rs:273-317 | crates/rvm/crates/rvm-security/src/gate.rs:407-446 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 40 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-security/src/gate.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cdf04697bf273b5e265d0e4010a1599f19e501c76454ede28c17b4cd734b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:428-451 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:535-559 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:455-477 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:566-590 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"caee922bf40fff99656759f857c092b275c4b4565f6699e62c90f6b6adbb7977"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvector-acorn/src/search.rs:132-153 | crates/rvf/rvf-runtime/src/rabitq_path.rs:203-234 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/search.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1263916851888d8eb554d71355156a73b292daa3d4480193bcc660b32ab85cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/rvf/rvf-crypto/src/attestation.rs:24-40 | crates/rvf/rvf-crypto/src/sign.rs:44-61 | crates/rvf/rvf-runtime/src/write_path.rs:627-644 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-crypto/src/attestation.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cfeaa998eecb8bf0029f59bfb131e1c18a698a795a31c79b68bcf70a906633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/rvm/crates/rvm-cap/src/derivation.rs:227-269 | crates/rvm/crates/rvm-cap/src/derivation.rs:323-367 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/derivation.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd9fa54e944a0eb6b193b3c2bc5a7ade309e67acc93ee4c53f2e50fb7edec13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2002-2013 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:2015-2031 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"d886cca1065c6fac6ee3bf699f42405355435344e1f80c0895a71ff719f14b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/ruvector-cnn/src/kernels/int8_avx2.rs:23-66 | crates/ruvector-cnn/src/kernels/int8_neon.rs:22-61 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddce5a23d0e037203216e048e855c36eec6aec7f9137586dfccec123b825449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruvector-graph/src/codegen.rs:44-82 | crates/ruvector-graph/src/codegen.rs:109-146 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/codegen.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce748821a4c616a35d04ce0ac37437bdcf06842b38fd109ea492e5e81da0c845"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/mcp-brain/src/server.rs:27-55 | crates/mcp-gate/src/server.rs:97-125 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f8cc44073c6b217e0b37ba29bc65328e4b886427c1f5d82da5bbaf1d502f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs:177-207 | crates/ruvector-dag/src/qudag/crypto/ml_kem.rs:213-240 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b1cfa06334797d104b2e73810eb87e4a6971312a35fcdadb7c4d2c678713be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruvector-mincut-gated-transformer/src/ffn.rs:118-155 | crates/ruvector-mincut-gated-transformer/src/ffn.rs:237-279 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/ffn.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01b8064bf03d67ad6437fa53962b1e5f0a3334f47f8134d07263dd20c8bd109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvllm/src/memory_pool.rs:204-245 | crates/ruvllm/src/memory_pool.rs:253-280 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/memory_pool.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9949e4976fdfc76c19c077b02e8645464e9fb7c32054015963592ee87891d73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/ruvector-solver/src/bmssp.rs:364-400 | crates/ruvector-solver/src/types.rs:246-284 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf582299a40abbed10efe81b35031b4ea153531fa4c90ea745fba12f2112205a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/ruvector-math/src/tensor_networks/cp_decomposition.rs:256-290 | crates/ruvector-math/src/tensor_networks/tucker.rs:114-158 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/cp_decomposition.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b2a26449e0fd39e708dab1af3ecb4307eb8199dc257e2f8e9522929239c2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruvector-postgres/src/tenancy/validation.rs:153-190 | crates/ruvector-postgres/src/tenancy/validation.rs:199-236 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/validation.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba6a00fa19ee992e27e584023c2014151affd12cf699a4b27c5851a1cea9ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/rvAgent/rvagent-backends/src/filesystem.rs:775-815 | crates/rvAgent/rvagent-backends/src/filesystem.rs:817-856 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b82026f3595b5f110e95055d2b2355b6996c6e65b7921685c749801354983be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 33\u002B corresponding lines): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:506-538 | crates/ruvector-bench/src/bin/ann_benchmark.rs:375-407 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:347-386 | crates/ruvector-bench/src/bin/latency_benchmark.rs:379-411 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a146f4deb40dadd7f1b2b90667dda02d3edfe7d68e55621961f9c0def17fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruvector-router-core/src/storage.rs:106-137 | crates/ruvector-router-core/src/storage.rs:140-172 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/src/storage.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"139f62e4a7f7cf8f3524f91947cc4c0fadd528bc59bf11bcd78084cd5f8c75cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): patches/candle-core-0.8.4/src/quantized/neon.rs:24-64 | patches/candle-core-0.8.4/src/quantized/neon.rs:67-97 \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":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"467773e0a661cae14da0f605ee5a0c782a2162c2f856a44342162450dbe9ad7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/ruvector-agent-memory/src/ledger.rs:337-375 | crates/ruvector-agent-memory/src/ledger.rs:386-424 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/ledger.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3827e25b280feb1481708c7f99e63de42bc5f7f8783ec001466e0ea9d882d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/ruvector-postgres/src/graph/sparql/parser.rs:1487-1531 | crates/rvlite/src/sparql/parser.rs:1525-1570 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd685a7bb13b871c4ae0e79e4770ee4653ecd4d4c770e3c0213967037a8b0bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): patches/candle-core-0.8.4/src/custom_op.rs:460-484 | patches/candle-core-0.9.2/src/custom_op.rs:462-488 \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":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff04a85183a36f48436027d7b8b23d81920089a7a39e6cc38df1bcdcde837e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:774-791 | crates/ruvector-postgres/src/graph/operators.rs:842-858 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"890fbeb788204885fbb9587562e9d7e915a9d9e71252ac4a8d8d03414e3d9018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvector-typesafe-core/src/bank.rs:227-254 | crates/ruvector-typesafe-core/src/bank.rs:275-302 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/bank.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d637804c6469fef8227932dc0a6021623f357dded1848acd14602f9e846869"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvector-tiny-dancer-core/src/storage.rs:118-150 | crates/ruvector-tiny-dancer-core/src/storage.rs:153-189 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/storage.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"966daaa9137041dd6ede51a9e6c97b8f1b7aa80535d05cfd0c43cec48b1172ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvllm/src/bitnet/rlm_refiner.rs:402-424 | crates/ruvllm/src/bitnet/rlm_refiner.rs:431-458 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/rlm_refiner.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2cb994fc9528ab5446d57ccad4e8df7515210ad5548fae1655a2ca160354ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/rvm/crates/rvm-checkpoint/src/note.rs:97-124 | crates/rvm/crates/rvm-checkpoint/src/note.rs:177-199 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-checkpoint/src/note.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ca1914f7d211e099a182ed5797c5114e14a20f3535d057599add5ce2362a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:84-121 | crates/ruvector-core/src/simd_intrinsics.rs:971-995 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c4af335522a7e65236a918e7eef83fe278ad4a7e3365a77ab87bbbc27eaa08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvllm/src/models/openmythos/act_kernel.rs:372-396 | crates/ruvllm/src/models/openmythos/act_kernel.rs:399-422 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/act_kernel.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b939d844eaa534348328ca3d17df7e2e3976a8cdb1b3eaeca93b299a1f21e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvector-cnn/src/simd/scalar.rs:265-292 | crates/ruvector-cnn/src/simd/scalar.rs:303-330 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aa3c688e59de36322e3ccd2c5aea424a38dbbc913afdc1e9abb580792d3bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/mcp-brain-server/src/graph.rs:1045-1062 | crates/mcp-brain-server/src/graph/rebuild.rs:183-196 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"870c51829abd6fcccdd29fa47568525f8e96400354d1331c52bbcb566337fabd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/prime-radiant/src/storage/file.rs:627-656 | crates/prime-radiant/src/storage/file.rs:658-686 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"b428ec410022388b9a9c6a9b62a57d176ad5fe96d969426715be96f4618d94fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/ruvector-mincut/src/expander/mod.rs:310-345 | crates/ruvector-mincut/src/expander/mod.rs:494-529 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475077b8b057ca3593039f16e31c9c4cb1c1e64cf7b016c7eca718322faffde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvector-rairs/src/rairs.rs:159-186 | crates/ruvector-rairs/src/seil.rs:243-276 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/rairs.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd85e8795608738d7e34b902d2bcf966accb40640169179da1e5b067f5619bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ruvllm/src/gguf/quantization.rs:714-751 | crates/ruvllm/src/gguf/quantization.rs:852-881 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e4ce5c5834c0b66115d3c62f88e2c686665a78829c3c2d46705c3f0ed5023d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/ruvllm/src/quality/validators.rs:229-264 | crates/ruvllm/src/quality/validators.rs:387-426 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/validators.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eb9ee8c0b6978e1e24970f6b92f0c6cbdd4e2fa8430989ffb7f1c8cb10501c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:132-187 | crates/rvf/rvf-adapters/claude-flow/src/memory_store.rs:125-173 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fa8788fc7ad0eb399c567b10234735521e8549af8f4b648563c87cb6244c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): crates/rvf/rvf-index/src/distance.rs:63-101 | crates/rvf/rvf-index/src/distance.rs:160-193 | crates/rvf/rvf-index/src/distance.rs:201-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 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":"crates/rvf/rvf-index/src/distance.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc592e904870b1f4e56da9d23337abb3f3622ba18c5541f54331a24040e45c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruvector-learning-wasm/src/lora.rs:148-179 | crates/ruvector-learning-wasm/src/lora.rs:185-222 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-learning-wasm/src/lora.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83c3feafb08710833fea9779b41f02ce6e9b179df5a77d30a7ee3ecd049fe1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruvector-mincut/src/cluster/hierarchy.rs:426-457 | crates/ruvector-mincut/src/cluster/hierarchy.rs:822-861 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"85911d04ad63e0120d023199da1452b1fb674d3703c177fb6d171ce7d3d96f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/ruvector-solver/src/types.rs:89-127 | crates/ruvector-solver/src/types.rs:136-165 | crates/ruvector-solver/src/types.rs:173-211 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/types.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ecb483ee15d4287d833255ef58afacc3920cdf661b2db0fea8f71a70b4769a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvllm/src/quantize/hadamard.rs:274-306 | crates/ruvllm/src/quantize/hadamard.rs:311-346 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0526643c7ae3396815dbd6ba1ec55b0b0ed6f1194ecadf26f6c191cf512c76b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): patches/hnsw_rs/src/hnsw.rs:498-533 | scripts/patches/hnsw_rs/src/hnsw.rs:498-526 \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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"445479301df0ad05784e5649d318d092ac067238cf963150e6219f2733282e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/ruvector-attention-unified-wasm/src/dag.rs:207-243 | crates/ruvector-dag/src/attention/causal_cone.rs:39-80 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/dag.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7819490377cbb643aa8f5202deb785ce9360357de4f73a3d3316ad334de323b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/rvf/rvf-types/src/dashboard.rs:55-68 | crates/rvf/rvf-types/src/ebpf.rs:130-144 | crates/rvf/rvf-types/src/wasm_bootstrap.rs:182-201 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/dashboard.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"512c951374eaf31c81f9e2935ce0b16413d90dd8ce22e7bde8e8b3d26f6dc684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rvlite/src/cypher/mod.rs:190-222 | edge/gateway/src/graph_persist.rs:175-198 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7597a87138a17221a1f7bb94b95d8e1a84a321bdb79afae804aa33fc253055c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/ruvector-attention-unified-wasm/src/dag.rs:322-361 | crates/ruvector-dag/src/attention/critical_path.rs:91-133 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/dag.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"62471761ff5c97bfefcdac5671c4240cc079b10205df3235f22e0eb2b336718a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvllm/src/qat/ste.rs:174-206 | crates/ruvllm/src/qat/ste.rs:215-249 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/ste.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"76283f28d2dd73d48fe5944773e7aac371f3d0d6ac1df9b4a1a125cbfbf5d521"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/prime-radiant/src/simd/matrix.rs:156-193 | crates/prime-radiant/src/simd/matrix.rs:232-261 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/matrix.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"551687de4f64e1121b1cef00e80de2769029f81cbf80161beb42d323afd38770"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-graph-transformer-node/src/transformer.rs:311-340 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:331-355 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4d5aa07bdf94d375eed0508b0c885c9c5ee0b6659b1a6a07b1c8d62b7e84a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruvector-nervous-system-wasm/src/wta.rs:104-141 | crates/ruvector-nervous-system/src/compete/wta.rs:125-158 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/wta.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8373ce8635e7fdbf8f69f0ee05b38fcc36adc3d9b71723f158a860d91407266c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvllm/src/kernels/matmul.rs:1393-1412 | crates/ruvllm/src/kernels/matmul.rs:1416-1437 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaabf392aaa0f80e50a8d260f46e660a9dd43446a1b0b64cef33f2ff4a7f5766"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rvAgent/rvagent-tools/src/glob.rs:37-57 | crates/rvAgent/rvagent-tools/src/grep.rs:43-68 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-tools/src/glob.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ee9a3b9f3ebffcd732bdb006da611a613f4b5f69ffae981aa6a6a7a69631be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-attention/src/hyperbolic/poincare.rs:99-118 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:431-451 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6610c50fbb4b1e493009377be4751bfe1c08c5c21e37bf9a041afce0aecfde12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ruvector-cnn/src/layers/quantized_residual.rs:66-99 | crates/ruvector-cnn/src/layers/quantized_residual.rs:113-142 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_residual.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f95c76b06c552933233ee82f50f60d819028b4b4aea951ebab4f049f9d69de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/ruvector-postgres/src/solver/operators.rs:132-164 | crates/ruvector-postgres/src/solver/operators.rs:168-188 | crates/ruvector-postgres/src/solver/operators.rs:405-431 \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":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7530e8f1506bc2d883899b4eb7626a0d0f4b4aba7df20e5ecab62d939249b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): edge/gateway/src/backend.rs:98-115 | edge/gateway/src/quant_route.rs:33-54 \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":"edge/gateway/src/backend.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99e64b4ec9d72d938fc41b52cd43f23124593141d484ab7358cd5c0e429cd67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-cnn/src/simd/avx2.rs:43-70 | crates/ruvector-sparse-inference/src/backend/cpu.rs:188-212 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a416142d9bf5e508bc4bb2effe4ebd4cab3df631514ccd214d6a4cdf3ad8fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-maxsim/src/main.rs:90-117 | crates/ruvector-maxsim/src/main.rs:125-147 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-maxsim/src/main.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbaa59ea19a5b7039d2a219d6571edaf456496968e2394fad9d406e26f4cf22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-capgated/src/bin/benchmark.rs:242-260 | crates/ruvector-streaming-qng/src/bin/benchmark.rs:144-165 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-capgated/src/bin/benchmark.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b336c97b761590bf36e3527e9a44e00eb205036e4ef45a1968fef09a40477170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-delta-core/src/window.rs:322-352 | crates/ruvector-delta-core/src/window.rs:405-433 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/window.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9abc35c6389b0a74a58323d747d3c109cf381f0a07ec8cf20e21b56db03efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/ruvector-mincut/src/optimization/simd_distance.rs:95-135 | crates/ruvector-mincut/src/optimization/simd_distance.rs:139-184 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/simd_distance.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe2c2da36c7f9c1d9d7e81bd9398fc726b4fbd062fe388ff7205b348c5e210b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/ruvllm/src/bitnet/backend.rs:1259-1278 | crates/ruvllm/src/bitnet/backend.rs:1286-1305 | crates/ruvllm/src/bitnet/backend.rs:1432-1455 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10fb6a510f90149afcde0547cd2d83a3284cd1c03effa697f58fa7a6a8e9849"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:475-511 | crates/ruvector-core/src/simd_intrinsics.rs:519-549 | crates/ruvector-core/src/simd_intrinsics.rs:607-638 \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":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de9ada8824c5f8ef68655227a011eae6eb34c1b8c020f6b66d348be4f98a7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rvm/crates/rvm-boot/src/measured.rs:68-90 | crates/rvm/crates/rvm-security/src/attestation.rs:120-134 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-boot/src/measured.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ffe1af3fb3e6b70a24f3b49c78adc419fa7f4d09588bc396c97815cb51a917"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:17-37 | crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:43-62 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"56117b604e319f955388df9b81cd8862b2b0e165c6b9cd2042ea5c89711c481d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): patches/candle-core-0.9.2/src/cuda_backend/device.rs:207-225 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:227-245 \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":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"49edbcc256318cffc13275c3a4e18dc10bde30300c9ae2a92db45b7f6e950421"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ruvix/crates/net/src/arp.rs:322-360 | crates/ruvix/crates/net/src/arp.rs:363-400 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/arp.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d59b5a86c0867a0e4d87679b532326818376bbccc6fc53e48a3dd667e18a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvector-mincut-node/src/lib.rs:75-98 | crates/ruvector-mincut-node/src/lib.rs:102-131 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/lib.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"89be1d79995c2f8f80078f72f0e41bfe03eec72bbf257ba0e1531b6f24699c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): patches/candle-core-0.8.4/src/storage.rs:298-309 | patches/candle-core-0.9.2/src/storage.rs:307-318 | patches/candle-core-0.9.2/src/storage.rs:667-683 | patches/candle-core-0.9.2/src/storage.rs:693-709 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7d347dda8bf789c017b1217b91d35bd1e94f34b4e8813500ef13d71ee5aac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/prime-radiant/src/coherence/energy.rs:550-576 | crates/ruvector-mincut/src/optimization/simd_distance.rs:375-398 | crates/ruvector-solver/src/cg.rs:347-365 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/energy.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"2470a3f6090894c484e095b3f72fadb143eff0a9945f0ff6fc464f4db1cf1bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 75\u002B corresponding lines): crates/prime-radiant/src/gpu/kernels.rs:30-138 | crates/prime-radiant/src/gpu/kernels.rs:267-341 | crates/prime-radiant/src/gpu/kernels.rs:436-522 | crates/prime-radiant/src/gpu/kernels.rs:614-744 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 75 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/kernels.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"237145b2a0e3af760bb00b6ffcd3ba6072678e383a60b6091f26a2c6612f3fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/ruvector-attention/src/sheaf/attention.rs:232-261 | crates/ruvector-attention/src/sheaf/restriction.rs:302-329 | crates/ruvector-attention/src/sheaf/sparse.rs:264-293 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fde34c294a5fe72bf50f860064b84992c7913de57f9ca391ddf37a1116f2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-math/src/spherical/mod.rs:152-181 | crates/ruvector-math/src/spherical/mod.rs:278-304 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spherical/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"70883fc5e07ed7edb7bfca79c0f4c31b1d977e78087cff791e7d26b3bc21e3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:341-357 | crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:360-376 | crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:379-395 | crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:398-414 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a700a7b6a3c5a8ae06107220e679474c51d3b256b8b5b995e5a2d3b53e17d1c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruvector-delta-graph/src/traversal.rs:87-118 | crates/ruvector-delta-graph/src/traversal.rs:121-154 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-graph/src/traversal.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c847d932cab2db20796b68b690f33ee1f92e679e63f20a77864875c7c527a45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/prime-radiant/src/mincut/adapter.rs:107-132 | crates/ruvector-mincut/src/subpolynomial/mod.rs:302-331 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/adapter.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cfa90908d0b62bfb626138549856edf1933643146014ccfecb4bd7d206224b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-attention-unified-wasm/src/graph.rs:143-171 | crates/ruvector-gnn-wasm/src/lib.rs:194-223 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7f9b67ae0ca81026d8217d222d64e631365f07cee95f2d0cd317b2c86bb1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvector-postgres/src/quantization/scalar.rs:9-41 | crates/ruvector-postgres/src/types/scalarvec.rs:40-89 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/scalar.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef5f10e863cfb68a1044bc059fa113a21f99a8a0de1757424f596dd5bb8db9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-temporal-coherence/src/search.rs:54-72 | crates/ruvector-temporal-coherence/src/search.rs:100-122 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-coherence/src/search.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bfc8c351fbc43086b65aa52a501d36a2406bac569cb554774cb644ed9b78b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruvllm-wasm/src/pi_quant_wasm.rs:379-415 | crates/ruvllm-wasm/src/pi_quant_wasm.rs:530-563 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/pi_quant_wasm.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"76af8ffd5dcb30b98931700859722298336ef6b869b677c834f9c5398e2f93ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvllm/src/kv_cache.rs:850-878 | crates/ruvllm/src/kv_cache.rs:1494-1518 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"861b384910606368770ea5ca2fc54df2303af1e1d9fdde322df6633e19492b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-attention-unified-wasm/src/dag.rs:148-174 | crates/ruvector-dag/src/attention/topological.rs:37-64 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/dag.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0735af5a9bd20783d4cd66835226fe0b83aab9eeef144006ce9ad3974bfbfb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvector-edge-store/src/ledger/mod.rs:195-225 | crates/ruvector-edge-store/src/ledger/mod.rs:237-268 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ledger/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66b9043c8ad54097d5fd0856bf8ada1d6012324bf78350dcd149d36b39089c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-postgres/src/index/scan.rs:23-57 | crates/ruvector-postgres/src/index/scan.rs:60-88 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/scan.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0129374dbe6924d87efb59b749b4eecb3d948e1662ececf904b4b0a69cd8c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rvf/rvf-server/src/http.rs:333-359 | crates/rvf/rvf-server/src/http.rs:363-390 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/http.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4deeff9dbf87e0035ee1a0fd322218af8d0ee358bb83311767c030509990b4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/ruvector-cli/src/cli/graph.rs:305-350 | crates/ruvector-cli/src/cli/graph.rs:359-400 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f4a4fa04302d6fe060ebfde0e9d42166fa40ab174045f3959c9770508216cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs:371-389 | crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs:409-427 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd654f54c54d528ff151b03a5c5bcceedddbf63fe532266e41fe77d0b9a77dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/ruvector-postgres/src/types/binaryvec.rs:302-324 | crates/ruvector-postgres/src/types/halfvec.rs:579-608 | crates/ruvector-postgres/src/types/scalarvec.rs:344-368 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"77093a7c6f5b22ab68799619a426e7bf839892f34a9237724667daefd2ee5f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/ruvector-sparse-inference/src/precision/quantizers.rs:81-107 | crates/ruvector-sparse-inference/src/precision/quantizers.rs:210-228 | crates/ruvector-sparse-inference/src/precision/quantizers.rs:292-310 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/precision/quantizers.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dde427a3382190c5d555e5ef8cb86bf00565c7a2b515285ca7dab7eef9519e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/models/openmythos/rope.rs:37-51 | crates/ruvllm/src/models/rdt.rs:1120-1138 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/rope.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20f1ba4a7e1e658483409c95411bd372204a104f796e1b3f90b516dda71266c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rvforge-reader/src/receipts.rs:97-114 | crates/rvforge-reader/src/witness_receipt.rs:201-223 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/receipts.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d3f26fc23540d2fe08ba31008b7382c351235d0687ce3e45d7089e372185d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): patches/candle-core-0.8.4/src/quantized/metal.rs:212-229 | patches/candle-core-0.9.2/src/quantized/metal.rs:372-390 \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":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5715429a73bc00e369e3c975d94d58db9555b7d0382d8bdc2e6ce3ea8ef18617"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/emergent-time/src/agentic_time.rs:499-514 | crates/emergent-time/src/structural_clock.rs:203-219 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7063a483e1a54a5cb08a35a118a7271a43a79eb82519ddcf8d3edc33efb2f85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruvector-consciousness/src/iit4.rs:94-131 | crates/ruvector-consciousness/src/iit4.rs:142-173 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/iit4.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67b64c1ec99bee2d3af77df646deb542dab3834950c39d52b0f23f88bada583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-fpga-transformer/src/ffi/wasm_bindgen.rs:212-243 | crates/ruvector-fpga-transformer/src/ffi/wasm_bindgen.rs:254-265 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/ffi/wasm_bindgen.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9627bb96924cbd15748042a0998a252eb44ff45209e259354f3eac4f4298f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-hailo/src/host_embeddings.rs:240-261 | crates/ruvector-hailo/src/host_embeddings.rs:265-283 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo/src/host_embeddings.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e790b783765edeb38ff54a0831f273665ec7b5cca22efda82512b40d15756d6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-recall-bounded/src/lib.rs:195-211 | crates/ruvector-recall-bounded/src/lib.rs:357-371 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4140a54784e0780e6942d38116e699240fb02e600785bdb39e8a126c4af8dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvllm-cli/src/commands/download.rs:190-217 | crates/ruvllm-cli/src/commands/download.rs:235-251 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/download.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e27471cdaff215a42d1e766bfd9177e271afba659477d2a4bb01730fb951f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvector-hailo-cluster/deploy/export-minilm-encoder-onnx.py:73-98 | crates/ruvector-hailo-cluster/deploy/export-minilm-onnx.py:37-75 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/deploy/export-minilm-encoder-onnx.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4ceff510f0b4d03ec74ba923d95abb8da2255e0a05da88b6f3b8c6f72684a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-rairs/src/index.rs:54-71 | crates/ruvector-rairs/src/index.rs:75-90 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/index.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aafa41294f13aad22227be039cb1509c08e9bab811503ec33be0f0d397335a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-typesafe-train/src/export/transplant.rs:59-78 | crates/ruvector-typesafe-train/src/model.rs:272-291 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/export/transplant.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9086afea5e363fe59af07d2041ac1b84905d3f091a713bb5f5cc20db15c870"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvllm/src/claude_flow/hooks_integration.rs:938-960 | crates/ruvllm/src/claude_flow/hooks_integration.rs:1075-1097 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/hooks_integration.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"e593cf1893e519ec7410c113b9c8acdf38c62bf8b394c8338f9e8968014b44ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2622-2634 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2636-2648 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2622}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7f20bd7caefac022cc35f295640d7afc6608b871b06c7adf1ce124c61767cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvector-attention/src/hyperbolic/lorentz_cascade.rs:109-136 | crates/ruvector-dag/src/attention/hierarchical_lorentz.rs:141-169 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/lorentz_cascade.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0298e209c0db4ed532426b5bc9494bb723f217bbe22509b03acc30fb3d95c8b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-hailo-cluster/src/manifest_sig.rs:106-128 | crates/ruvector-hailo-cluster/src/tls.rs:31-62 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/manifest_sig.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf340d2d4f074164b4c2304707d869451d2b8a0ac8d51c533d302ef6ee5e798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvector-math/src/tropical/polynomial.rs:129-156 | crates/ruvector-math/src/tropical/polynomial.rs:159-182 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tropical/polynomial.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7e0d61ec2faa15bdc3180be80de918e4f49e4afbb24cb3f0223e4729b37ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-postgres/src/graph/mod.rs:257-284 | crates/ruvector-postgres/src/graph/sparql/mod.rs:187-213 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fada4232ecaf607cec9d1da1170d7f172f4170092f3d99af2afd4b77464a8219"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/ruvllm/src/serving/engine.rs:193-226 | crates/ruvllm/src/serving/engine.rs:233-266 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ce42ebad61426f8a25165b96df1ba4f610e874d35ae11d04d9ae471a5bd78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rvm/crates/rvm-kernel/src/lib.rs:576-616 | crates/rvm/crates/rvm-kernel/src/lib.rs:640-666 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b733bd6f478ef3d3da2b0c491c33271c44744d533cb6f71d17220b15a8e6cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:163-183 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:178-198 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8248dc9cba7e1b9149a5cde7f08164ccd08034e8af8c7c2a1a2a4a6e42086b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:329-349 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:351-371 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e88193e9874c69523e32444a1d543efcc5ff9d724784d43834f1a7ee882672"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/ruvector-cnn/src/simd/mod.rs:149-192 | crates/ruvector-cnn/src/simd/mod.rs:267-297 | crates/ruvector-cnn/src/simd/mod.rs:301-337 \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":"crates/ruvector-cnn/src/simd/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8357e5af92ac9cbcfcbd6d0991c5eb04b838f3da1a2740d87bb51de335eaec4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-math/src/tropical/neural_analysis.rs:89-111 | crates/ruvector-math/src/tropical/neural_analysis.rs:172-195 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tropical/neural_analysis.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7ca003261d6c1faf199544efa292e8ac43db5d8acc8d9621b7fb95f650cacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): edge/gateway/src/durable.rs:271-289 | edge/gateway/src/m3_transport.rs:26-45 | edge/gateway/src/registry_do.rs:221-239 \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":"edge/gateway/src/durable.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b922293d5e100a20288769cd1d5e082027daa47829474767409b0fa3f40b3bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/prime-radiant/src/gpu/buffer.rs:237-253 | crates/prime-radiant/src/gpu/buffer.rs:261-279 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/buffer.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43c9c0c880c6d453ee7cb4ecf233c885b57f57c56a177eaec4dc03d01fe729f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/prime-radiant/src/ruvllm_integration/gate.rs:274-305 | crates/ruvector-postgres/src/learning/patterns.rs:47-61 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/gate.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"848a9fe73c65edcf03728acfb38d9c709d8401a98be3448d6ab38f56cd1a58fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-postgres/src/math/operators.rs:208-228 | crates/ruvector-postgres/src/math/operators.rs:237-251 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/math/operators.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"217f0143adaa8ba2b4c52a409eb5e2706f74fcc856ee3e373f11f60b3561b592"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/rvAgent/rvagent-backends/src/sandbox.rs:140-172 | crates/rvAgent/rvagent-backends/src/sandbox.rs:391-423 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/sandbox.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec18cf2467c9124a883cc3e98b5eed0e49f1a875774a0e814548e118f9042b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): patches/candle-core-0.8.4/src/quantized/cuda.rs:594-612 | patches/candle-core-0.9.2/src/quantized/cuda.rs:845-861 \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":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"614392512b8dece538d627785e2c8f2020bfe78c8f346eb7b090c60d1f821f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): patches/candle-core-0.9.2/src/scalar.rs:28-44 | patches/candle-core-0.9.2/src/scalar.rs:46-62 \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":"patches/candle-core-0.9.2/src/scalar.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7bcf5303597e99e3848fe85bf6eed04856be60a646322c66389a9acbf912d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): crates/ruvix/crates/dma/src/controller.rs:221-246 | crates/ruvix/crates/dma/src/controller.rs:259-284 | crates/ruvix/crates/dma/src/controller.rs:297-322 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/dma/src/controller.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9885e61a66d9e36b6b23ad68e8b156cd04b05c15d3f360186f1b012dc76ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-graph-transformer/src/biological.rs:1067-1084 | crates/ruvector-graph-transformer/src/biological.rs:1098-1120 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/biological.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8394cdd6db0f83967561772a9f6a3571f2986abbd6ebe165439cb376e9b5d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/rvf/rvf-adapters/sona/src/experience.rs:243-270 | crates/rvf/rvf-adapters/sona/src/trajectory.rs:232-261 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/sona/src/experience.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cf06977d121d78c3344b02f3d5172957e4e676415f9a9a118dedd529625e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rvf/rvf-wasm/src/lib.rs:74-103 | crates/rvf/rvf-wasm/src/lib.rs:239-258 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wasm/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5183f33ed5ca51bba80657f13d1d3c2b9837c839cb8d4f56dbf89a3802cb7d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:620-636 | patches/candle-core-0.9.2/src/tensor.rs:688-704 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db251b272686f716c18e7d26d04bce08ed55749c587743535dbc9543824b5be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/prime-radiant/src/attention/adapter.rs:175-190 | crates/ruvector-attention/src/info_geometry/natural_gradient.rs:87-101 | crates/ruvector-attention/src/pde_attention/diffusion.rs:203-219 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93ebec0785a157f59c6c3959e0aa49777ed070aefb11af61a20d846906bcc4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-nervous-system/src/plasticity/consolidate.rs:181-213 | crates/ruvector-nervous-system/src/plasticity/consolidate.rs:231-255 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/plasticity/consolidate.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8323add7018f1c5d54b20a91688394efb01d9fb3cb25cdd71840987443d62e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-postgres/src/graph/sparql/parser.rs:546-572 | crates/rvlite/src/sparql/parser.rs:577-610 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc410cc29a8feb32a3b312e4747b6f6569f53bd8e4febf2becd65a387bf8d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-weaver/src/requeue.rs:56-73 | crates/ruvector-weaver/src/requeue.rs:93-114 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/requeue.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9905100e58f801e8436068e357324b1c2f5785569f1d3fc05e8f2dca77e6ef99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): patches/candle-core-0.8.4/src/quantized/avx.rs:51-69 | patches/candle-core-0.8.4/src/quantized/avx.rs:72-88 \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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2e7eadf572eb688fc31e32eaf920b1411799f4e2805a64d7c3d74d7406a4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-attention/src/hyperbolic/hyperbolic_attention.rs:59-76 | crates/ruvector-graph-transformer/src/manifold.rs:1243-1255 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/hyperbolic_attention.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b06d45164032459a308e20014a9755194d56b8adbc7e6e67ea4774b4e8a2de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 30\u002B corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:42-74 | crates/ruvector-core/src/simd_intrinsics.rs:932-961 | crates/ruvector-core/src/simd_intrinsics.rs:1000-1029 | crates/ruvector-core/src/simd_intrinsics.rs:1040-1069 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1566aba8de616350e4f04e84c44b3bea1302649a65e181e737f7ea11e3067c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-math/src/optimization/polynomial.rs:265-287 | crates/ruvector-math/src/optimization/polynomial.rs:321-346 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/polynomial.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3114b7daf77f44e98037be512d2f2ca8b7171f2d82bc51696228e1691e613301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:225-245 | crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:516-536 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/flash_attention.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f518cc30c6bc1c4a046cac5e45fe8ac645181fc7e14ffd30ec8716c552fa3696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-rairs/src/rairs.rs:108-124 | crates/ruvector-rairs/src/seil.rs:116-130 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/rairs.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd98087691f05f455256d9943fe195b7fd1219066c6954268d9dd5dbba7ada3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvllm/src/kernels/matmul.rs:101-139 | crates/ruvllm/src/kernels/matmul.rs:455-480 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7c36270a5eda7220eae1629b463272574452737353ef0815d9659197620a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rvAgent/rvagent-core/src/agi_container.rs:202-225 | crates/rvAgent/rvagent-wasm/src/rvf.rs:415-438 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b7db44897eb910594678f68e3d62f5d720d54cc26753f03a309fa071850d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/ruvector-delta-core/src/delta.rs:240-263 | crates/ruvector-delta-core/src/delta.rs:266-289 | crates/ruvector-delta-core/src/delta.rs:442-464 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/delta.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5330dcc47cd4fa114ff617e071c22776331f31a4cca5daf17d136080d7323e38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-graph-node/src/cypher_exec.rs:250-265 | crates/ruvector-py/src/graph/cypher_eval.rs:263-275 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1309c994995dbf350f230f923261296b80760122fc1a74c75540e66303dddd76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ruvector-graph/src/hybrid/vector_index.rs:142-163 | crates/ruvector-graph/src/hybrid/vector_index.rs:166-187 | crates/ruvector-graph/src/hybrid/vector_index.rs:190-211 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/hybrid/vector_index.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4c3eb4096bedf57178bc6af18564bdd778055f22095cb9189cf764dd98494c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvllm/src/kernels/quantized.rs:886-914 | crates/rvf/rvf-wasm/src/lib.rs:448-470 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/quantized.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc345f7307d72c5c7da2db861f5b2435dad09302885b936346c0583c3b8063ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1917-1935 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1927-1950 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be83e87b2bfa8f947774817bc93913b20a06422f338a2fa8fcfee382be2179f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/mcp-brain/src/server.rs:73-92 | crates/mcp-gate/src/server.rs:146-168 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7394f273f503da8ce24fa10ce138be3903320d455fcfc860c1053fa9a2ffffd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-attention/src/hyperbolic/poincare.rs:42-59 | crates/ruvector-graph-transformer/src/manifold.rs:1168-1185 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba467f179e70318f0a0e2f1e47d13a2f64884ed59e36316c84ffb4b8035d993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): crates/ruvector-domain-expansion/src/planning.rs:516-540 | crates/ruvector-domain-expansion/src/rust_synthesis.rs:460-484 | crates/ruvector-domain-expansion/src/tool_orchestration.rs:587-611 | crates/ruvector-robotics/src/domain_expansion.rs:639-667 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/planning.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b553ccff2397d3a6328866d985fdc24dfd7e0b5f9df3e95d077ebd9aabaae20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-mincut-gated-transformer/src/spectral.rs:453-488 | crates/ruvector-mincut-gated-transformer/src/spectral.rs:503-531 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/spectral.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"34774ff99614b8d5ddddd213e4ee453bdf1b22bb581c8ab0319f7fcff54c08ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-context/src/layout.rs:154-174 | crates/ruvector-context/src/shard.rs:195-221 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-context/src/layout.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e957ee5d183f5dec932b4b55078b9e6d2b726b9a042f2c3f5224bf683b32c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-learning-wasm/src/lora.rs:100-119 | crates/ruvector-learning-wasm/src/lora.rs:123-141 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-learning-wasm/src/lora.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"84967e39eb7ad0ddc3279ca2dc41d291e0686e2ae11f62ae6b9bc4a9a043355a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/ruvector-robotics/src/domain_expansion.rs:124-163 | crates/ruvector-robotics/src/domain_expansion.rs:165-195 | crates/ruvector-robotics/src/domain_expansion.rs:197-231 \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":"crates/ruvector-robotics/src/domain_expansion.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0863ba8c5282e13198908f563f7c33c84f9efba46d64a6c80af928176a354d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-speculative-ann/src/quantized_draft.rs:36-52 | crates/ruvector-speculative-ann/src/quantized_draft.rs:65-89 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-speculative-ann/src/quantized_draft.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3449ea5757fbe81df2d18daae749203355717b8e4faf8ba1e1fc3f7af5461687"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ruvllm/src/kernels/attention.rs:772-801 | crates/ruvllm/src/kernels/attention.rs:834-864 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"7672e7252f743fbe5a2a144f41e96df68e8845f4c6ab8e89e99423f2d39604ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvllm/src/training/contrastive.rs:189-205 | crates/ruvllm/src/training/real_trainer.rs:198-214 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bc50cdcdd4f97ff263c17a0f511de9b4e8b04ad1d3d05591313ca854fbd5bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-mincut-node/src/lib.rs:161-179 | crates/ruvector-mincut-node/src/lib.rs:183-200 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/lib.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da2aa078f61031cf39396cd5e67814dfef366b1cebba1f9acd631ff5d7f2f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-mincut/src/cluster/hierarchy.rs:930-958 | crates/ruvector-mincut/src/cluster/hierarchy.rs:961-985 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"4744e508268c0f63b639a1ebd41413e6506c888ffe578e4022cb55e7c491a773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-postgres/src/healing/functions.rs:125-151 | crates/ruvector-postgres/src/healing/functions.rs:164-195 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/functions.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7748e1c15c44883d8d0bb90db9a0df24738b8b1f9e18844c3a1019985be68d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvix/crates/bcm2711/src/interrupt.rs:297-321 | crates/ruvix/crates/bcm2711/src/interrupt.rs:332-356 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/interrupt.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd61c473d5733f5883e39623db79003b210965be15d6fb171d3ebd53964c9ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:237-254 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:266-293 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:282-310 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d05ffeeb7c37e072b50dc80a970f20baa2939e93ef15558e006da0286a04d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): patches/candle-core-0.8.4/src/strided_index.rs:38-66 | patches/candle-core-0.9.2/src/strided_index.rs:41-70 \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":"patches/candle-core-0.8.4/src/strided_index.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882031bde5148d074549695dbe5592d7476c7d186e688e7717a1c3c556d3b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/ruvector-fpga-transformer/src/backend/mod.rs:165-177 | crates/rvf/rvf-types/src/agi_container.rs:413-424 | crates/rvf/rvf-types/src/delta.rs:73-85 | crates/rvf/rvf-types/src/refcount.rs:44-56 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/mod.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb46bd5befa9396987199b86961a9d4014163aec4e5ca0be27dd13710538e9cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-kge/src/scorer/fft.rs:86-95 | crates/ruvector-kge/src/scorer/fft.rs:99-108 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/scorer/fft.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a16d4267f130efcb6a5c463c00c81010a516448f0fd948e1ffc64dbe9fd2bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-mincut-wasm/src/lib.rs:315-329 | crates/ruvector-mincut-wasm/src/lib.rs:345-359 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-wasm/src/lib.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8811cdc91a0f73f38c739c23830afa5ab1ce45b776126d1b5f9cc49a6eb3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-mincut/src/connectivity/cache_opt.rs:33-57 | crates/ruvector-mincut/src/optimization/pool.rs:165-183 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/connectivity/cache_opt.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f5460aac74b8f60e84f8bf1102a5ae76a1490f8b23bf2b8b440b5c8c27d620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-rulake/src/bin/rulake-demo.rs:48-63 | crates/ruvector-rulake/src/bin/rulake-demo.rs:73-88 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/bin/rulake-demo.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8c71361c2860a57d261e75c95d74d3d4fa6dc60068e7d5076de3c855538a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/ruvllm/src/autodetect.rs:708-739 | crates/ruvllm/src/backends/coreml_backend.rs:133-163 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa74c682d1e9a91901d8534d55a096488652052c710d305b51676458873f4a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvllm/src/models/ruvltra.rs:979-1002 | crates/ruvllm/src/models/ruvltra_medium.rs:888-918 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05b95e754b8bac1647aaeecdbae4a862d957be454559e9a5430e62a5763b722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-diskann/src/pq.rs:162-190 | crates/ruvector-diskann/src/pq.rs:194-216 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/pq.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"89df789d477659e83509fb5ca63b111e7fb3179728d4e4a7ccfe16d18acfe809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-graph-condense/src/cutloss.rs:95-112 | crates/ruvector-graph-condense/src/gnn_eval.rs:275-291 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/cutloss.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2e4f3f02ff83a07dbb8d928bd0f924993bf93556579fa43dc8826fc62a6696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): crates/ruvector-graph/src/graph.rs:107-135 | crates/ruvector-graph/src/graph.rs:316-351 | crates/ruvector-graph/src/graph.rs:467-503 \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":"crates/ruvector-graph/src/graph.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84b7acaee533c16dd64f68c54586305835459264f398ee37f5b3abc036146d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/prime-radiant/src/storage/file.rs:400-414 | crates/prime-radiant/src/storage/file.rs:455-469 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8219ab10d248488605e9ec28d2dd1467d40c3b28f158966b18f81ebe97c4c9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-attention/src/config.rs:32-67 | crates/ruvector-attention/src/sheaf/attention.rs:97-125 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/config.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd2a16fc89afa685a2e632b1ee2a02622f572bbab5cb4b4965293b1a029e482"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-consciousness-wasm/src/lib.rs:218-237 | crates/ruvector-consciousness-wasm/src/lib.rs:269-287 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness-wasm/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7e8ce5bc2cbc1ab3c8a0ea09cd335f0c7959f6c2ac1516da4084a24f7b0972"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ruvector-delta-core/src/delta.rs:338-369 | crates/ruvector-delta-wasm/src/apply.rs:112-143 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/delta.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad0110c6682da515a1d07764ec031e56e86eb41e8f955679e4edc5a54f84b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-gnn/src/mmap.rs:486-516 | crates/ruvector-gnn/src/mmap.rs:565-584 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfec3e35e53daa3a5e94f11f6a801f290bf75425395a987ec0d717bc9f30b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-typesafe-ffi/src/lib.rs:228-243 | crates/ruvector-typesafe-wasm/src/lib.rs:145-161 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-ffi/src/lib.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7697a05bc6a2e205a019cb157656ad48309ea11e4f2ef5defff2dd86e995d85b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): crates/ruvllm/src/backends/gemma2.rs:600-636 | crates/ruvllm/src/backends/phi3.rs:478-514 | crates/ruvllm/src/models/ruvltra.rs:778-812 \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":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"be878a3b7fead37a678e6e2df8bbfc43fbbed0eb29834036eb5a7a347f665ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/ruvector-cnn/src/simd/mod.rs:35-70 | crates/ruvector-cnn/src/simd/mod.rs:74-103 | crates/ruvector-cnn/src/simd/mod.rs:107-136 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"679be711b9d0c317bbf0e37a50e729f04ff81f10077be97756d9008b6868b2d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-core/src/pdx.rs:132-149 | crates/ruvector-core/src/pdx.rs:152-166 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/pdx.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0987fbabf025035a5669e778b4b68284ef53e997c610a5f28a7b04043aeb2950"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ruvector-delta-graph/src/traversal.rs:195-225 | crates/ruvector-mincut/src/expander/mod.rs:458-487 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-graph/src/traversal.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b039702fe8dc26fb467a3dbd861730f949beebf99a971912a4c45d007889f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-delta-index/src/lib.rs:233-257 | crates/ruvector-delta-index/src/lib.rs:260-288 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-index/src/lib.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"feeb2123535135a67f7248329b4239b8856047c2d4c381f25f158f3afcb1db4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:192-222 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:352-383 | crates/ruvector-mincut-gated-transformer/src/kv_cache/squat.rs:323-351 \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":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f0a10a9a3c0bf132f626752cfc8dc120482b5029cabe8438680bf43a245c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/ruvector-namespace-merge/src/router.rs:40-62 | crates/ruvector-namespace-merge/src/router.rs:88-116 | crates/ruvector-namespace-merge/src/router.rs:251-281 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-namespace-merge/src/router.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa977cce9f77ac57db043ee17db98c843439cd0d9a11535a894d3ec1c4fb421b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:129-153 | crates/ruvector-postgres/src/distance/simd.rs:212-233 | crates/ruvector-postgres/src/distance/simd.rs:243-266 | crates/ruvector-postgres/src/distance/simd.rs:276-297 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66bc267aa0fef2150a87f6965d53a4f26017c3b1545659a2a59a0fc94556164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-postgres/src/hybrid/fusion.rs:155-177 | crates/ruvector-postgres/src/hybrid/fusion.rs:180-200 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/fusion.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae5c84488b0753c4c509723e3cdb98ffbe5fae1de3d225fe1631b7dacafe772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rvf/rvf-adapters/agentdb/src/pattern_store.rs:151-177 | crates/rvf/rvf-adapters/agentdb/src/pattern_store.rs:184-207 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/agentdb/src/pattern_store.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dbba23e3e01674cfea10948e36f6ca01d4c2ec139a8e460f780ad81eca48a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:647-659 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:771-786 \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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc907301ac1f7eadb68048cca82cb073d28aeae2d8e281228d9efce9b6f356d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-crv/src/stage_v.rs:110-144 | crates/ruvector-crv/src/stage_vi.rs:289-315 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/stage_v.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2e653cda24fe23f58b7267921930ee4c5060868f414f226fac967fb0987806"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-fpga-transformer/src/quant/qformat.rs:20-39 | crates/ruvector-fpga-transformer/src/quant/qformat.rs:79-99 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/quant/qformat.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87f84cf20cbeb91c35335d85bc4fc8b514fdc3bcac09c69286662b1dd6f9ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvector-gnn/src/mmap.rs:225-257 | crates/ruvector-gnn/src/mmap.rs:268-302 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35062f1fb48205462fd69a05e030a806112856ef6eccbe36b2a05388f25081c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-postgres/src/integrity/contracted_graph.rs:483-511 | crates/ruvector-postgres/src/integrity/contracted_graph.rs:514-542 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/contracted_graph.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5a968f0b7139277569b8c9613c6afd8716c9d9f076fc98755165562430b486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/rvf/rvf-adapters/sona/src/pattern.rs:95-145 | crates/rvf/rvf-adapters/sona/src/trajectory.rs:88-137 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/sona/src/pattern.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa098696151cf6832154ade313e8ddc6127e1fbd4f9708ca72e18192b86fa3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): crates/prime-radiant/src/security/validation.rs:125-159 | crates/prime-radiant/src/security/validation.rs:334-365 | crates/prime-radiant/src/security/validation.rs:373-407 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/security/validation.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"adce5ae5a923686595eab525ab99e9c8dbfed65c38261a8cb654167c063b5831"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-capgated/src/cap_graph.rs:84-100 | crates/ruvector-maxsim/src/graph.rs:119-133 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-capgated/src/cap_graph.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c4bedd1c1bbe872c6da7aa89db5ff3dd3cd5e66468e99f36a651b7264e75ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-math/src/homology/distance.rs:17-31 | crates/ruvector-math/src/homology/distance.rs:143-157 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/distance.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5580fa62a406052b8e1d09f62f9c24b615640751d61a775f01ac8b51b0f093df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ruvector-mincut-gated-transformer/src/ffn.rs:84-113 | crates/ruvector-mincut-gated-transformer/src/ffn.rs:202-233 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/ffn.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"499f17532f3f4478022ccc0a287d25507dfde57cbd1cab7398aee265fde7ad60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvllm/src/claude_flow/reasoning_bank.rs:479-506 | crates/ruvllm/src/claude_flow/reasoning_bank.rs:878-905 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcf9ec0d4846a30e64b1c19d7d852ec22c9654df04e3f8863dd0dd836167576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): edge/gateway/src/blob_r2.rs:116-139 | edge/gateway/src/blob_r2.rs:146-169 \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":"edge/gateway/src/blob_r2.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"523481f9f90f7798d85e985c833b4398487da7c73413c48551b00cc2b803dfc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/emergent-time/src/entropic.rs:81-92 | crates/emergent-time/src/entropic.rs:95-105 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/entropic.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e036e1b2c3701d73071094e403fd0b57ebea00af4a558ebccd7f6600e2e14f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/ruvix/crates/nucleus/src/kernel.rs:666-693 | crates/ruvix/crates/nucleus/src/kernel.rs:747-774 | crates/ruvix/crates/nucleus/src/scheduler.rs:486-510 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/kernel.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d3d292eb0c72ffb09492b0004be23b909dd9d104619e404e04a05d2f0e2f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/ruvllm/src/kv_cache.rs:881-905 | crates/ruvllm/src/kv_cache.rs:911-934 | crates/ruvllm/src/kv_cache.rs:1521-1543 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f30eb2cad24bd97cee0813ea7f1dc1cbc89f09967b6b864255bad4e6e70a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/prime-radiant/src/attention/adapter.rs:139-161 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:112-131 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c10ed0c0760537586fb1b11a1b21a8e0d620939dc40bfab1d0b7f2816882fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-attention-node/src/training.rs:77-91 | crates/ruvector-attention-node/src/training.rs:152-166 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/training.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1408eed375ad14b116e6d9b84ab07f15df50a7cbef659d3c0312341f08d6d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvllm/src/kv_cache.rs:432-453 | crates/ruvllm/src/kv_cache.rs:570-587 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc7e3aee6bc826a9f68f3d15833dea2c7fe1b7c1e9109ef555dbff396ba2352"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/ruvllm/src/policy_store.rs:250-275 | crates/ruvllm/src/session_index.rs:201-226 | crates/ruvllm/src/witness_log.rs:528-552 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/policy_store.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a023c089864b05d690b1b64543c5a98df6d49e0f1097e40a4afe2479e170e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rvforge-reader/src/install/layout.rs:87-100 | crates/rvforge-reader/src/library/fsops.rs:12-25 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/install/layout.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44b52f5d5c66da53d526bc2a85c04e5f8a417a4d9c31a903d828c314536319c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-cnn/src/layers/linear.rs:120-140 | crates/ruvector-cnn/src/layers/linear.rs:143-170 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/linear.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b23eab96f3c03dc5e737aec819dc9feced8b22be10c12f0cfd8d4294a561dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/rvf/rvf-solver-wasm/src/types.rs:76-88 | crates/rvforge-reader/src/witness_receipt.rs:253-264 | edge/gateway/src/audit.rs:133-145 \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":"crates/rvf/rvf-solver-wasm/src/types.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c547ea2d6c274fea9584eeb4807b9ebeef7229b04acc2469eb0ac46eee3f74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/prime-radiant/src/storage/file.rs:384-398 | crates/prime-radiant/src/storage/file.rs:440-453 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8deda6ae71c54b2f824965fd8b7a508a9db4107d20f573ece82f03103f571f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvector-domain-expansion/src/planning.rs:559-582 | crates/ruvector-domain-expansion/src/tool_orchestration.rs:630-657 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/planning.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"22283331979e248dd0f2eb271739438960913c4023b1fc8a36baf014c72d26f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-math/src/information_geometry/fisher.rs:58-91 | crates/ruvector-math/src/information_geometry/fisher.rs:96-122 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/fisher.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"865593615484b74c348f9f5ce163070971d66077fa2a24fe764042730662c329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:1504-1527 | crates/ruvector-postgres/src/distance/simd.rs:1596-1619 | crates/ruvector-postgres/src/distance/simd.rs:1624-1648 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64efb3e467247cf839bed37123e387252b82a46e9bd0a246fd213aa96cae18d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-temporal-tensor/src/ffi.rs:47-69 | crates/ruvector-temporal-tensor/src/ffi.rs:82-108 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/ffi.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d86d01edd791c4fb5d5f0bb02c10213e97590e7d1c7cf3dd673ac3cf39f460"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): patches/hnsw_rs/src/hnsw.rs:536-559 | scripts/patches/hnsw_rs/src/hnsw.rs:529-552 \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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c586cf65bf04cd0ad5aecb9f27f0225f8e84dea236f95d296f1c3f19cc76244c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-cnn/src/simd/avx2.rs:100-116 | crates/ruvector-cnn/src/simd/avx2.rs:121-138 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2833c648101251cd93e872d4d8f8cc7addcc39175471a0b9a3d261fbdb16a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-core/src/storage.rs:161-185 | crates/ruvector-graph/src/storage.rs:168-193 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dffcc283ea855f5ad8589cd026467d73b6d078954d8ca64008290792569e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-math/src/utils/numerical.rs:36-50 | crates/ruvector-mincut-gated-transformer/src/speculative.rs:461-489 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/utils/numerical.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fd7d3eb5759dcbfca22e9ae23da2330224c34aca43a5ab552a445736f0c286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvllm/src/gguf/loader.rs:746-771 | crates/ruvllm/src/gguf/loader.rs:786-814 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/loader.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0481ef987d81230b6b93bae8c300ada469991e1405ae49668c88b99ba62a9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/rvAgent/rvagent-core/src/agi_container.rs:35-53 | crates/rvAgent/rvagent-wasm/src/rvf.rs:35-53 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00d293ac90f8c81816384827e550c187fdc443ff8f05354c6dd243f70ae1271"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:62-80 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:63-81 \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":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe301020f43bb9df93660165b509a5ec21103edcae9e8ed6b08068d61590919"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-core/src/advanced_features/sparse_vector.rs:404-425 | crates/ruvector-core/src/advanced_features/sparse_vector.rs:427-446 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/sparse_vector.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a414e22537d5708fd57053ac409856c1294e54e82fb60249390e1cdfe49c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvix/crates/boot/src/attestation.rs:104-116 | crates/rvf/rvf-types/src/security.rs:204-215 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/attestation.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9958586561672fc965a66f75a0ff854625a0aacb713cc2b8c73d34d3a9486a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/rvAgent/rvagent-backends/src/composite.rs:199-222 | crates/rvAgent/rvagent-backends/src/composite.rs:224-246 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/composite.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e52d7749e30690dc83e94d32d553779e3136298fde644c246d09a7e74fc440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rvm/crates/rvm-kernel/src/lib.rs:1000-1026 | crates/rvm/crates/rvm-kernel/src/lib.rs:1036-1062 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5eab8bbfbbdf80d16310f826731a0114a57c4e6491631f4131dc41e5031d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/prime-radiant/src/storage/postgres.rs:731-764 | crates/prime-radiant/src/storage/postgres.rs:767-802 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/postgres.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"57238c1349017baf105e9e2e6f191df16a0e3790e6a5159ca6b231488280c273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): crates/ruvector-graph-wasm/src/cypher_exec.rs:194-206 | crates/rvlite/src/cypher/mod.rs:232-246 | crates/rvlite/src/cypher/mod.rs:249-263 | edge/gateway/src/graph_persist.rs:80-92 | edge/gateway/src/graph_persist.rs:94-106 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/cypher_exec.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d427675cc9cab61dc836240cf46e20fef061be3810c71e015dbf49262f0c17f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-mincut/src/snn/attractor.rs:259-279 | crates/ruvector-mincut/src/snn/attractor.rs:584-601 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/attractor.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3acb2b4d35d088184a9f79b8f7922f3fdbd2b2e3a4170d17cbf5601869da868"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruvector-postgres/src/math/operators.rs:76-95 | crates/ruvector-postgres/src/math/operators.rs:261-274 | crates/ruvector-postgres/src/math/operators.rs:278-291 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/math/operators.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94706c67c6312861d03209c16a3e59f1242b93f7db89c74f96a84a45866f522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-query-cache/src/exact_cache.rs:94-108 | crates/ruvector-query-cache/src/semantic_cache.rs:109-122 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-query-cache/src/exact_cache.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd1841b06653d3f5a97cc67db85bddccf0d20766d269b38bbd33f55b823b3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/speculative.rs:965-980 | crates/ruvllm/src/speculative.rs:1145-1162 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/speculative.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a05026152572318f3098ff19685f2361aadd0834a12706058bc2ad28184aa45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/sona/src/export/huggingface_hub.rs:342-366 | crates/sona/src/export/mod.rs:175-199 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/export/huggingface_hub.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"21def39ce2eb9e1686f14968940e0920a7297423f162843d08adc70ee3865bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/mcp-brain/src/client.rs:165-185 | crates/mcp-brain/src/client.rs:291-314 | crates/mcp-brain/src/client.rs:317-338 \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":"crates/mcp-brain/src/client.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ef9346534ba998ad336a949ce05cc0b2c98c115b3df566482a399b4a6320a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/prime-radiant/src/governance/witness.rs:341-368 | crates/prime-radiant/src/ruvllm_integration/witness_log.rs:322-352 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/witness.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"78643a954682bba74f4286200575c0484b6ba5cafdd28296317ccc76b223d262"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-core/src/index/hnsw.rs:335-357 | crates/ruvector-core/src/index/turbo4.rs:545-563 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/hnsw.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"379acf2e131c10bb94b704c1360436d7f4d53d18a00ded1c29b780d440f17ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-py/src/sona.rs:109-127 | crates/ruvector-py/src/sona.rs:148-173 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/sona.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"809d898da8714fbd2897b9ccd87e2b32220e780881af9dce5bc290a39a22fa69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-weaver/src/prs.rs:355-370 | crates/ruvector-weaver/src/scan/mod.rs:412-428 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/prs.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"416bf6c879cde47f0316e0a5207c52b7056863662732517a369a6fb6056850ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/rvf/rvf-runtime/src/write_path.rs:356-382 | crates/rvf/rvf-runtime/src/write_path.rs:446-468 | crates/rvf/rvf-runtime/src/write_path.rs:486-508 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/write_path.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8552a25c8507d44e8051f8b0c94296330397659a512053da8407096bd0d2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-cnn/src/layers/conv.rs:148-174 | crates/ruvector-cnn/src/layers/conv.rs:475-503 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3edbf7dde826d9fa181645e4dca6913c474a51b8405d4fc61950880dd19d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/ruvector-graph-transformer-wasm/src/lib.rs:207-219 | crates/ruvector-graph-transformer-wasm/src/lib.rs:265-274 | crates/ruvector-graph-transformer-wasm/src/lib.rs:290-299 | crates/ruvector-graph-transformer-wasm/src/lib.rs:374-386 | crates/ruvector-graph-transformer-wasm/src/lib.rs:396-406 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/src/lib.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5910c5fafd5054cd1a71c0f83bea35f3967420eb87d56b74a8e57d57aa1497"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvix/crates/boot/src/witness_log.rs:391-402 | crates/ruvix/crates/proof/src/attestation.rs:271-293 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/witness_log.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae28d191cb2bd160f6e76572479ebaaf2aaeaf5e349c170b818196a6618fe1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/storage.rs:280-288 | patches/candle-core-0.9.2/src/storage.rs:289-297 \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":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9872bd820627ac5e8b3419e24b9e1bc5aa0550f563eb77236ed2807019a279f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-graph-transformer/src/biological.rs:289-304 | crates/ruvector-graph-transformer/src/biological.rs:309-334 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/biological.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cb20d8c63467ec92fe9f5d3265a337441e2543a1557df37804f118821ef470"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:562-587 | crates/ruvllm/src/kernels/ane_ops.rs:451-476 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/flash_attention.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b831555d67724d2737d7b13d0b562e81166e44d528f37d79d0f3732d3e2caeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvector-mincut/src/connectivity/cache_opt.rs:123-144 | crates/ruvector-mincut/src/connectivity/cache_opt.rs:147-172 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/connectivity/cache_opt.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26f44fb243e1d668ff67a4c52029761ff2e88c17deff325bc50e4ff4156260c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvector-postgres/src/hybrid/bm25.rs:174-199 | crates/ruvector-postgres/src/hybrid/registry.rs:256-279 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/bm25.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d02916bea0f7d275fc39c1620e0236ba4fbe9a118093bb599f2d9e3355e43b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvllm/src/quantize/pi_quant.rs:326-350 | crates/ruvllm/src/quantize/pi_quant.rs:366-389 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6164e4879a51301ac7d1e7f3907266e3f0c9370fa8ac18df0ddf5b5670469096"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvforge-reader/src/install/layout.rs:108-118 | crates/rvforge-reader/src/library/registry.rs:402-412 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/install/layout.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"070134f1a173f0f67cbb076151f079b31d9ca3c19c83c8519d593e3fa4bc5ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/ruvector-graph/src/hybrid/vector_index.rs:214-232 | crates/ruvector-graph/src/hybrid/vector_index.rs:235-252 | crates/ruvector-graph/src/hybrid/vector_index.rs:255-272 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/hybrid/vector_index.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9f3ee99d166d58e9b0aa3567a6a116763f869a18fa2b9220a310067eabe44a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:150-164 | crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:175-194 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8188fa44c3e3c9c6d771c1849807d6f5a46073307e64b010ccca22243907a8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-mincut/src/cluster/mod.rs:249-271 | crates/ruvector-mincut/src/tree/mod.rs:250-276 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/mod.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fd529b7c06fda3cb56ccedb53fa8ee4fd47977c45b743c027b28235afb28b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-mincut/src/euler/mod.rs:823-839 | crates/ruvector-mincut/src/linkcut/mod.rs:551-567 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/euler/mod.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4e0d09c10a1f6996c526ae6907a7680c4b939319db168e67ce3c49117f1899"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvector-mincut/src/jtree/coordinator.rs:472-505 | crates/ruvector-mincut/src/jtree/coordinator.rs:513-536 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/coordinator.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"020dcb417cd6b86dd570d4bd5bfce9e98f0392ed754082bbd46a486b3881de1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 27\u002B corresponding lines): crates/ruvix/crates/bcm2711/src/mailbox.rs:459-485 | crates/ruvix/crates/bcm2711/src/mailbox.rs:492-518 | crates/ruvix/crates/bcm2711/src/mailbox.rs:525-554 | crates/ruvix/crates/bcm2711/src/mailbox.rs:561-589 | crates/ruvix/crates/bcm2711/src/mailbox.rs:596-624 | crates/ruvix/crates/bcm2711/src/mailbox.rs:635-663 | crates/ruvix/crates/bcm2711/src/mailbox.rs:713-741 | crates/ruvix/crates/bcm2711/src/mailbox.rs:748-776 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mailbox.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a255b4a00d6cb11bd3ddccdca2647e34795a76266eeb5c0249648a28285dd0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvix/crates/boot/src/attestation.rs:86-100 | crates/ruvix/crates/boot/src/attestation.rs:321-335 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/attestation.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"866a4f967dbf355dad1a063ad5adcfef83fcc85f2bb709b89bc57d4a17cab46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvllm/src/backends/phi3.rs:237-261 | crates/ruvllm/src/models/ruvltra.rs:472-499 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1128f98f5f14114bd58ca23fa4ab258d8da1de60b7dde9d2ce26249ecbd99a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/training/claude_dataset.rs:310-329 | crates/ruvllm/src/training/tool_dataset.rs:417-431 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/claude_dataset.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9779da2e9ee4579f7041e6f41d48309cb6af1c9306bce0d1256644602bb6a7fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): patches/candle-core-0.8.4/src/custom_op.rs:394-411 | patches/candle-core-0.9.2/src/custom_op.rs:396-416 \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":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b108951f4464f4a7ba7000beed96a3c3bd9156431ebd8b4f21d65c33acb85e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:423-438 | patches/candle-core-0.9.2/src/quantized/mod.rs:723-738 \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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef8ff113468e93679a3ae4da9f2e0a91a4f401df7110bd8473cc2132fcc0609"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/prime-radiant/src/governance/mod.rs:279-300 | crates/prime-radiant/src/types.rs:574-591 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fbbedfe73fc9788f7952a03a93b77ce7b36238ff4656c06e7775d151bb50a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-diskann/src/distance.rs:194-214 | crates/ruvector-diskann/src/distance.rs:313-335 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/distance.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f389701bbac708d837d9e2805873b418365681b9b692c124c4a9243d15434f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-graph-node/src/cypher_exec.rs:267-287 | crates/ruvector-py/src/graph/cypher_eval.rs:308-323 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0fc26791cf5c9d16c0b6d91a3c7cff39f594422b0b42ed5389c9cefe910813"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 24\u002B corresponding lines): crates/ruvector-mincut/src/algorithm/approximate.rs:268-292 | crates/ruvector-mincut/src/algorithm/approximate.rs:405-433 | crates/ruvector-mincut/src/fragment/mod.rs:268-292 | crates/ruvector-mincut/src/instance/bounded.rs:176-199 | crates/ruvector-mincut/src/instance/bounded.rs:361-384 | crates/ruvector-mincut/src/instance/stub.rs:166-192 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/approximate.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ab143e966ef0dd264098dc4eea2a82bc7c65cf85b5bcaf0950e1ae10b580dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-postgres/src/graph/sparql/triple_store.rs:578-592 | crates/rvlite/src/sparql/triple_store.rs:499-513 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/triple_store.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bdff39f688356d6eb4bf4d67fcee871f1a21ed8ce57c0279a7ab10050e6dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvllm/src/context/episodic_memory.rs:312-332 | crates/ruvllm/src/context/semantic_cache.rs:134-152 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/episodic_memory.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"149d8ec0fc9d886eca1db8b0dd8f9af64573e9c700aa02a11eb1f4b519e21f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvllm/src/hub/upload.rs:284-307 | crates/ruvllm/src/hub/upload.rs:310-330 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/upload.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df2ee2421bb31d56bf5615ec36328db1f734a08d4a397c2af2f772b1d21826f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rvAgent/rvagent-mcp/src/transport.rs:126-140 | crates/rvAgent/rvagent-mcp/src/transport.rs:142-156 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/transport.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"555df3838acb091fcc1786fc78553efa3bf7c584f3ee6728a4b8288e6075d1d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rvm/crates/rvm-hal/src/aarch64/mmu.rs:337-352 | crates/rvm/crates/rvm-hal/src/aarch64/mmu.rs:354-372 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/mmu.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca722ed356717fc571e8a21d2771a46b3426ea500016044a2ffba3718123e4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-attention/src/moe/expert.rs:55-81 | crates/ruvector-attention/src/moe/expert.rs:124-141 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/moe/expert.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce285730b50414bab8044a854d741428699a6b2117b9a43249530043f4a29e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-cli/src/cli/hooks.rs:679-699 | crates/ruvector-cli/src/cli/hooks.rs:777-800 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ac2fc9dc368d0533633984e623d5a91f485ffc6aba84477134ed0de1628180"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/ruvector-cnn/src/simd/neon.rs:92-110 | crates/ruvector-cnn/src/simd/neon.rs:115-135 | crates/ruvector-cnn/src/simd/wasm.rs:54-74 | crates/ruvector-cnn/src/simd/wasm.rs:79-101 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d83e343ab3032b4d4a12e194dfc83fca126eb2e1e82bdfa94a5f2fbb24731d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvllm/src/quantize/incoherence.rs:425-451 | crates/ruvllm/src/quantize/incoherence.rs:454-479 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/incoherence.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e60f62cec6a09c99946339b20ddcc58ad9dca852dc48b5f27911eea7d4c8f5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rvforge-reader/src/receipts.rs:125-136 | crates/rvforge-reader/src/witness_receipt.rs:160-172 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/receipts.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9358ee3f30b8b723cbc468d651a9eacb2d97a54acae49f9d03a5f2feeeecbb32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/prime-radiant/src/governance/repository.rs:543-565 | crates/prime-radiant/src/governance/repository.rs:732-757 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/repository.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ce05555f1ca2806970bc86ec3b3f7b1557c22e9973bf82ec27d6099af4c0e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/prime-radiant/src/mincut/config.rs:57-80 | crates/ruvector-mincut/src/subpolynomial/mod.rs:96-118 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/config.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f262c1f058fea750a070e61a158d8ef08df2c14bcb81a710febcbf07fb05969b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-agent-memory/src/witness_signing.rs:106-120 | crates/ruvector-retrieval-receipt/src/signing.rs:69-85 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/witness_signing.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2195361385d6b7b388b1fe0aa1e5e0ec28e2b4f9635e31d206ff27ea9fe6f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvector-dag/src/mincut/local_kcut.rs:72-95 | crates/ruvector-mincut/src/localkcut/mod.rs:301-330 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/mincut/local_kcut.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b5b32903335f7f2caba30016225b4015ca7f329b8a04bf179d702cbac57630"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvector-hybrid/src/main.rs:167-179 | crates/ruvector-hybrid/src/main.rs:181-194 | crates/ruvector-hybrid/src/main.rs:199-212 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hybrid/src/main.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bc3d02071a65fc5674b2b19ec5fc060aade0c7ae2bb6097bab3706507326c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-postgres/src/hybrid/bm25.rs:224-244 | crates/ruvector-postgres/src/hybrid/bm25.rs:253-271 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/bm25.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb141abcfdf83b8ae5d2607fa3dfec9f53d52f1fc77a2ad239b27657b979f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-proof-gate/src/payload.rs:48-61 | crates/ruvector-proof-gate/src/payload.rs:67-82 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-proof-gate/src/payload.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1c88e4d4e7935d89e6e36b052a6dc1f92e2d4ad67fa51751599efa0321481f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-py/src/graph.rs:80-101 | crates/ruvector-py/src/graph.rs:135-153 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e95ba329ffbad09b1a472b2632e4cd47ad2a21ecd54f891c6ca14f9279e356"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-rairs/src/index.rs:117-129 | crates/ruvector-sparse-inference/src/predictor/lowrank.rs:175-193 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/index.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cadcdda0510724a9bdb89cc0d775dba8c2ed0ccd2b1c9f270525fb4dafa2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-sparse-inference/src/backend/cpu.rs:365-387 | crates/ruvector-sparse-inference/src/backend/cpu.rs:392-412 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"db851924e9a73144649200c9f499345c90b55f2528b73b4771101bab8fdf8264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvix/crates/vecgraph/src/graph_store.rs:367-396 | crates/ruvix/crates/vecgraph/src/vector_store.rs:269-297 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/graph_store.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90ebc23ad3fbb42899c7dd8be766a25165e5c560817c5250d4871b76bbdca67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvllm/src/kv_migration/quality.rs:261-275 | crates/ruvllm/src/kv_migration/quality.rs:283-296 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_migration/quality.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4034cbbab8e9db5335cefb3560fa7e0caf2d16a552f1c1f5a170cc5f5d5495a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvllm/src/quantize/pi_quant.rs:683-701 | crates/ruvllm/src/quantize/pi_quant.rs:730-748 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9aad2da22a9a87ecfc705a7e81795e582cbeaa3cee8c6ffbfe1a9bbcbf6c0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rvAgent/rvagent-mcp/src/resources.rs:145-158 | crates/rvAgent/rvagent-mcp/src/resources.rs:234-247 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/resources.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af7bb9d0c3c3f9fafcd56717c2186d59400adbf0b9d09b233b44e2267edb306"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/device.rs:280-295 | patches/candle-core-0.9.2/src/metal_backend/device.rs:228-244 \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":"patches/candle-core-0.8.4/src/metal_backend/device.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc88e6d0585df6a4460b2af1d24dc2487dcdcc638c05663f757ef829603caa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/mcp-brain-server/src/pipeline.rs:622-638 | crates/mcp-brain-server/src/pipeline.rs:1350-1366 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"04338fc8a567254bef599591e9bcef871edf8465744e6e6d59ba80f2178a14a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-core/src/quantization.rs:46-63 | crates/ruvector-router-core/src/quantization.rs:67-79 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a6f9b173fa2c45ab3b8ba826f8f6cbd5ff1be6e640dd9e191a50b375bf6a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-economy-wasm/src/stake.rs:258-290 | crates/ruvector-economy-wasm/src/stake.rs:299-327 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-economy-wasm/src/stake.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"160dfd4687d04532dd2db9985e42fee17058ddd37f2f19277fca54e939793d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/ruvector-graph/src/storage.rs:244-260 | crates/ruvector-graph/src/storage.rs:321-337 | crates/ruvector-graph/src/storage.rs:414-430 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/storage.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f01ff170ca2597c085b6356a6bb4a99e5ed4af9afba2f9e9b9ffb7dcd57fa49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-hyperbolic-hnsw/src/tangent.rs:47-73 | crates/ruvector-hyperbolic-hnsw/src/tangent.rs:134-151 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw/src/tangent.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c503f97dbdef507d467dc86184c6961503e1b027fb31b63cedb15e0b03970eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-mincut-node/src/routing.rs:67-85 | crates/ruvector-mincut-node/src/routing.rs:243-259 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/routing.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2d9aeec4b53449a685df9bcb4cf514f70e531ff19f5e92c05dab4214bd746e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ruvllm/src/kernels/activations.rs:176-197 | crates/ruvllm/src/kernels/activations.rs:408-429 | crates/ruvllm/src/kernels/activations.rs:470-493 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/activations.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc32a60b597772839c72267c5ad05f693b61a21a38eb971a27a3dd1993d0e9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvllm/src/kernels/rope.rs:231-252 | crates/ruvllm/src/kernels/rope.rs:487-505 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/rope.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc9b975be70b6c37aaa605e5e2e93e2aaa11c0ff0950f73ca087e0fa4583b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/device.rs:59-74 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:181-196 \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":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa95e25b464b9057ca3b206073e4abcada25a87116c24823555d17d11bba93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/prime-radiant/src/substrate/edge.rs:490-514 | crates/prime-radiant/src/substrate/edge.rs:517-543 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/edge.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7959e4e1913e1bd1a683be34726b5ae1a0c2ace785b3bbec031f03d0711165d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvix/crates/bcm2711/src/gpio.rs:262-282 | crates/ruvix/crates/bcm2711/src/gpio.rs:332-353 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/gpio.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41b5e545927bfada2b69347729bfb71c3e78f2c4c889c77ef3a22ab73c407f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvix/crates/cap/src/derivation.rs:153-176 | crates/rvm/crates/rvm-cap/src/derivation.rs:150-170 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/derivation.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c840b1dceb4056af19044f9ba814b04ec5bfa8fccb8cec2034ea7eafeb46c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvllm-wasm/src/micro_lora.rs:313-335 | crates/ruvllm/src/lora/micro_lora.rs:571-590 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/micro_lora.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5c56ca50663b6f0dfb234cfefc40919c87a0addc55c6e5c9fde4162708bfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvAgent/rvagent-mcp/src/server.rs:127-141 | crates/rvAgent/rvagent-mcp/src/server.rs:157-167 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/server.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03db9dbcc98b18cc15ce0e33a6a9a7a6d35dfc17e74a2b97da87a674eb716f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/rvlite/src/lib.rs:362-384 | crates/rvlite/src/lib.rs:392-414 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/lib.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae99ab924e763bb6253767fcb05b81fc0e3df365f4d91b08cd97001442e1892"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rvm/crates/rvm-kernel/src/lib.rs:438-468 | crates/rvm/crates/rvm-kernel/src/lib.rs:703-722 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bea88d53ffb8f482bb357ca5861150c7c8015205dd42ed21329602af46a9d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/device.rs:170-180 | patches/candle-core-0.8.4/src/cuda_backend/device.rs:186-196 \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":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc72a8a0348185073e624e994f4ab0bc38599eb7e0cad921f224406873178fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-filter/src/evaluator.rs:345-364 | crates/ruvector-filter/src/evaluator.rs:371-392 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-filter/src/evaluator.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d64828756f23d25b91bc6b02078c5633a0e6e3c932e76d0319d4b3f9206247"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-gnn/src/search.rs:29-44 | crates/ruvector-nervous-system/src/hopfield/retrieval.rs:37-60 | crates/ruvector-postgres/src/attention/mod.rs:174-194 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/search.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"57877c19932edeeacd609e20540e9e8bd8c518be8ec4f725cc92c3f371b0413f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-gnn/src/training.rs:284-304 | crates/ruvector-gnn/src/training.rs:331-351 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/training.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fee3c243f65bc22c3ac17d6e4231166dc1f0fdfdde793fde8813c1cacb92fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ruvector-kalshi/src/normalize.rs:180-201 | crates/ruvector-kalshi/src/normalize.rs:216-242 | crates/ruvector-kalshi/src/normalize.rs:244-265 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/normalize.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"707dec57c3aac59cfde0e2cad9870846e7e4816532a91dbc29f508c2199fc7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:679-695 | crates/ruvector-postgres/src/graph/sparql/results.rs:422-444 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bb6015fd9c355842cebe4754f2662dc739b5409d9d683e7c68ea9b47c1b0df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/ruvector-router-ffi/src/lib.rs:154-177 | crates/ruvector-router-ffi/src/lib.rs:184-211 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-ffi/src/lib.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"06051ac1a3fb896513d5b495c05275917a1f5f1f98174ac374d8669612a09e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvix/crates/bcm2711/src/mailbox.rs:343-364 | crates/ruvix/crates/bcm2711/src/mailbox.rs:380-408 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mailbox.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"468f54d8f23aa22652b6775cf77b585b0f925d73b29748616ab59cd37de1e4e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rvf/rvf-node/src/lib.rs:943-959 | crates/rvf/rvf-node/src/lib.rs:997-1013 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/src/lib.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddf3582173ae8017a64d258a97cb9991d0255f061a9f5a137d16a44bb8acdf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): edge/gateway/src/backend.rs:83-95 | edge/gateway/src/tenant_admin.rs:52-64 \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":"edge/gateway/src/backend.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"541c140fd7caafb0c5acb885b0f5a74b828a38c3e04514857b41298b105e4cf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/mcp-brain-server/src/graph.rs:737-758 | crates/mcp-brain-server/src/graph.rs:852-871 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa92d606bda1d048b967fdd5e835ac5c0b639425494a1c3318603ae618eb0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/mcp-brain-server/src/pubmed.rs:255-277 | crates/mcp-brain-server/src/pubmed.rs:280-300 | crates/mcp-brain-server/src/pubmed.rs:303-319 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pubmed.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc5672fd7768e5fec273d9fe2f7ca42773d5bdc1592ba4df206e23443052e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvector-graph-transformer-wasm/src/lib.rs:166-176 | crates/ruvector-graph-transformer-wasm/src/lib.rs:330-340 | crates/ruvector-graph-transformer-wasm/src/lib.rs:420-427 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/src/lib.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8531045431d64cefcbe241826b048cb452d287217c6577a6472bf4b6bc373ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 24\u002B corresponding lines): crates/ruvix/crates/vecgraph/src/simd_distance.rs:286-310 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:314-337 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:399-426 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:430-454 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:458-481 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5af8721b5fb74a9fabc3f1d195df2eb28419fead445baed7f2b5cc1566b0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvllm-wasm/src/bindings.rs:340-357 | crates/ruvllm/src/tokenizer.rs:129-159 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6e07823cbfab197bd59f910565a4a430bd5beeed1ff50c9754f78f6a766ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvllm/src/context/agentic_memory.rs:592-611 | crates/ruvllm/src/context/agentic_memory.rs:614-637 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/agentic_memory.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"1445784e63144a03fd400b987903cf6b2d7d448b4cea900f2a1adf221518a1b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/kernels/attention.rs:518-533 | crates/ruvllm/src/kernels/attention.rs:559-574 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f63e96c49e57267c72b93b6be1f0fcf8361edc46110e4d50ff3ad1d0f8d709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rvAgent/rvagent-backends/src/rvf_store.rs:279-301 | crates/rvAgent/rvagent-backends/src/rvf_store.rs:303-324 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/rvf_store.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"103938296ac72107c2dcbb8892ae7aa560035c3702e5cfd266bfda5ab5c02208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/rvf/rvf-index/src/hnsw.rs:472-497 | crates/rvf/rvf-index/src/progressive.rs:292-316 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"353b7939d3ef9cf0e0c2999600b0147c811ab153cb2d22aa199b59c2d00bf3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rvf/rvf-runtime/src/membership.rs:113-134 | crates/rvf/rvf-runtime/src/membership.rs:137-158 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/membership.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09757c82a29b279e5d10a46f2437d0f88d6472edfce29b80c99edd82e34b79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:152-171 | patches/candle-core-0.9.2/src/quantized/mod.rs:273-294 \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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"93314f6be91cb79988669d134e41629f1b26f9afcbee5d07e2b209a32c537ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/prime-radiant/src/governance/witness.rs:242-252 | crates/prime-radiant/src/ruvllm_integration/coherence_validator.rs:406-417 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/witness.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc16c82e4a52c99fb323f7064c674ead96807833474e3adc5fd008975372648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-graph-transformer/src/verified_training.rs:864-887 | crates/ruvector-graph-transformer/src/verified_training.rs:891-908 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/verified_training.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf75c44079c99cb34f65be8596939dbde1041459efff78c5731d1915e6ff5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ruvector-math/src/optimization/certificates.rs:123-151 | crates/ruvector-math/src/optimization/certificates.rs:153-181 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/certificates.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29741d83322a6edc8fb826cf4abf549602e1abb2582b29a2e477f8f8a490605"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:72-96 | crates/rvf/rvf-adapters/sona/src/experience.rs:55-76 | crates/rvf/rvf-adapters/sona/src/pattern.rs:63-84 | crates/rvf/rvf-adapters/sona/src/trajectory.rs:56-77 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e149ac4e6f55d7f47e053182db3184a16e4cde18457a10882047321f7b379bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:367-382 | patches/candle-core-0.9.2/src/quantized/mod.rs:630-645 \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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abd21261f2979aaf586a04996826284a5d72334f0497eeb7065eb430782668a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-attention/src/hyperbolic/poincare.rs:78-96 | crates/ruvector-graph-transformer/src/manifold.rs:1196-1211 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:407-426 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06f5dbb4333363c5b0a2098d22382bcaf96ca609fcbba8ca73191167b3bec62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/ruvector-consciousness/src/simd.rs:174-199 | crates/ruvector-solver/src/simd.rs:12-37 | crates/ruvector-solver/src/simd.rs:135-159 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/simd.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a109d81d75584c89fd05efd977b2d5594f6ea53ef11310c2cb568eb58c5490f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): crates/ruvector-delta-wasm/src/simd.rs:19-43 | crates/ruvector-delta-wasm/src/simd.rs:54-77 | crates/ruvector-delta-wasm/src/simd.rs:88-107 | crates/ruvector-delta-wasm/src/simd.rs:219-237 | crates/ruvector-delta-wasm/src/simd.rs:248-268 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-wasm/src/simd.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae58ec5a0a8bc6c00ac3a96dde0859631e16ff79b66bff345c8c8f97515a1701"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-exotic-wasm/src/nao.rs:203-215 | crates/ruvector-exotic-wasm/src/time_crystal.rs:268-278 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-exotic-wasm/src/nao.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab35bab5de32fe2255730ffe5b4a5f3d0a4239986a5e9474a4feefe84782982"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-nervous-system-wasm/src/workspace.rs:172-198 | crates/ruvector-nervous-system/src/routing/workspace.rs:307-333 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/workspace.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c296579d598eabc0e9f8902497b67e7f66d9368472022d52ac5d0b7880cae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:1056-1075 | crates/ruvector-postgres/src/distance/simd.rs:1080-1102 | crates/ruvector-postgres/src/distance/simd.rs:1761-1781 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c86de54bdcac04bbb1c36a662d019963d8cb1c123ece7aaa6c7b3d4f2855a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:60-79 | crates/ruvector-postgres/src/graph/operators.rs:93-111 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e3a6490aaa27976a59c0db1ae6a892dfc224336ec86f0dddf8739401cfda32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/ruvector-temporal-tensor/src/ffi.rs:144-169 | crates/ruvector-temporal-tensor/src/ffi.rs:173-193 | crates/ruvector-temporal-tensor/src/ffi.rs:203-225 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"crates/ruvector-temporal-tensor/src/ffi.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83e093f72a9fa691df374fb394fe8dde637f82b924237b0d705b85912164974"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-wasm/src/kernel/signature.rs:59-76 | crates/ruvector-wasm/src/kernel/signature.rs:79-97 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/kernel/signature.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7b10d958f7351a2faaf462cb804838412cc3a76164a23c11ff9cee305a304c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvix/crates/cap/src/derivation.rs:196-220 | crates/ruvix/crates/cap/src/derivation.rs:263-282 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/derivation.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"488459ef4d3889beab59ffda0e70b03d92da28a597a81a35c58bd0e026209c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvix/crates/rpi-boot/src/spin_table.rs:214-243 | crates/ruvix/crates/rpi-boot/src/spin_table.rs:280-302 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/rpi-boot/src/spin_table.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5399afb92cbf9ee516c47b7cf5aef5b6588bee04a8162cfcfd38821e47c4a08d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/ruvllm-wasm/src/bindings.rs:388-415 | crates/ruvllm/src/tokenizer.rs:192-222 | crates/ruvllm/src/tokenizer.rs:225-257 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"3371b9674ac6dacb130a2d320c51f3e024a26b8da7da993e3342ee3a28da57c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvllm/src/backends/candle_backend.rs:1665-1678 | crates/ruvllm/src/backends/lattice_backend.rs:853-863 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0cb1e3bd02a8c57564635d6f00df5b624b15f84ae60f4239ac1af36e5cb46b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvllm/src/gguf/loader.rs:496-508 | crates/ruvllm/src/gguf/mod.rs:774-786 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/loader.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9fcd6bdad71c14efaac8ce6d4133ba8c8c5aa8002b5934cb0dd8a85e4aaf2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvllm/src/kernels/rope.rs:427-444 | crates/ruvllm/src/kernels/rope.rs:453-472 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/rope.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d8c8bec9f473cca4cf953eadc7af4bedd16dd2fbe903b7afa36dbf1657377a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): patches/candle-core-0.9.2/src/quantized/metal.rs:153-167 | patches/candle-core-0.9.2/src/quantized/metal.rs:169-183 \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":"patches/candle-core-0.9.2/src/quantized/metal.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c49d2605e9cdb7f660d37bfed084145248d3cd735848db927175a9d12c94bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ruvector-mincut/src/jtree/coordinator.rs:312-347 | crates/ruvector-mincut/src/jtree/coordinator.rs:368-389 | crates/ruvector-mincut/src/jtree/coordinator.rs:392-413 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/coordinator.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f54382f21dfbfae7c46ee259628acda0c110ffc7ff6c160e62c00a175f5640"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-mincut/src/jtree/level.rs:632-650 | crates/ruvector-mincut/src/jtree/level.rs:652-670 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/level.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88f9dba804fb950845bcb3d34d08b762649ad44d36b9d33376b23c5225a9fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:1182-1205 | crates/ruvector-postgres/src/distance/simd.rs:1209-1231 | crates/ruvector-postgres/src/distance/simd.rs:1235-1257 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9fc31329cc66281b2f8ae49a0b03e0df8a3a82191e20146faf33b8769da866"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-sparse-inference/src/integration/ruvector.rs:48-79 | crates/ruvector-sparse-inference/src/lib.rs:94-118 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/integration/ruvector.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e51c4b428cafc9d3ecac0e791069c3fe9f94e112a07ea6b5f69aff15dbfc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rvAgent/rvagent-backends/src/store.rs:45-60 | crates/rvAgent/rvagent-backends/src/store.rs:63-77 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/store.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c161dae2eeeb12e469414178dbbc9439a44a2d79a5d708a9ecd4a7d5e18ffbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/device.rs:145-161 | patches/candle-core-0.9.2/src/metal_backend/device.rs:100-116 \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":"patches/candle-core-0.8.4/src/metal_backend/device.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc52e887b5e449963a667fb2b90afb61f422ff4e29236175e6e7da5b5999f57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-core/src/advanced_features/sparse_vector.rs:79-94 | crates/ruvector-nervous-system/src/separate/sparsification.rs:143-165 | crates/ruvector-nervous-system/src/separate/sparsification.rs:270-288 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/sparse_vector.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6644db0a558dbcc34399c785f9085af3cedeb819f19f8f8d433c6edd68aef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-kge/src/scorer/rotate.rs:85-98 | crates/ruvector-kge/src/scorer/rotate.rs:104-114 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/scorer/rotate.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0787736745616b66adbe18b3440b6b7f88305480204c13a6b84520e55046922c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/ruvector-replication/src/conflict.rs:232-248 | crates/ruvector-replication/src/conflict.rs:255-271 | crates/ruvector-replication/src/conflict.rs:278-300 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/conflict.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5205150999fcef01cf5670a946cc901d17e47387f15c488d0312b3c429f7b6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-temporal-tensor/src/tiering.rs:523-535 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:596-623 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/tiering.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc391325cd0bd7466e55321c8082d0df1d485f5504fa1d4c997d5bf7a5915dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvix/qemu-swarm/src/consensus.rs:725-755 | crates/ruvix/qemu-swarm/src/consensus.rs:757-782 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd67b4e3583c67ddfabde4b06f4402d22ef6224f704c34112e8b26ce9701ea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): crates/ruvllm/src/moe/affinity.rs:63-86 | crates/ruvllm/src/moe/affinity.rs:91-113 | crates/ruvllm/src/quantize/hadamard.rs:549-568 | crates/ruvllm/src/quantize/hadamard.rs:573-592 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/affinity.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2313af4ba3e346e599991f5ddf90f0867fdc9877a4c19eb6825ef7c7b1d60c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rvAgent/rvagent-backends/src/anthropic.rs:442-458 | crates/rvAgent/rvagent-backends/src/gemini.rs:665-679 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/anthropic.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc411e05c5f6e9d25c2f3ad9d3a2b0cc6137283eee4a62b4c7879aa3e237cf5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): edge/gateway/src/tenant_admin.rs:150-165 | edge/gateway/src/tenant_admin.rs:230-245 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/tenant_admin.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e752ab765b5e250a27aac34896b638a557884e92c3cd18572a150343c536fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/mcp-brain-server/src/bin/local.rs:559-573 | crates/mcp-brain-server/src/bin/ruvbrain_sse.rs:375-399 | crates/mcp-brain-server/src/main.rs:256-278 | crates/ruvllm-cli/src/commands/serve.rs:1025-1050 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"747c29f69e1549eeb473cf0f1eea5b973f6e65ef4b09597ec8d57f178ae8ff99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-fpga-transformer/src/quant/qformat.rs:102-118 | crates/ruvector-fpga-transformer/src/quant/qformat.rs:121-139 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/quant/qformat.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ada7f2969a1fbdd90305d61b20d79987aa328a56b519124ea5bb84fad24df84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:420-437 | crates/ruvllm/src/bitnet/trace.rs:123-139 | crates/rvf-forge-core/src/canonical.rs:139-157 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c4bf962b84bd55320015abcd6693ccf89103630fe2c1cd53561229efe5ef55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/ruvector-sparse-inference/src/backend/wasm.rs:122-136 | crates/ruvector-sparse-inference/src/backend/wasm.rs:139-154 | crates/ruvector-sparse-inference/src/backend/wasm.rs:157-173 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/wasm.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2893efd20e06fd17e86fccb02ca80649ae7800fec716667c67ec1e8229edf34e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-turboquant/src/codec.rs:87-98 | crates/ruvector-turboquant/src/codec.rs:103-116 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/codec.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"89df6ab2d9b7b67b2492deff63404adbeff09f634fe653b2541ea2d50c0e9a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-attention-unified-wasm/src/graph.rs:66-82 | crates/ruvector-gnn-wasm/src/lib.rs:105-127 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d51e972fdd3368a519a8c73d6c2a9d952fecf552d4eb0937fdcf296803a192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-edge-index/src/metric.rs:112-131 | crates/ruvector-edge-quant/src/shard.rs:303-324 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/metric.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f91108e09529114ec9d8e548dceccc8315aeb9cbcfb42890cdb935cf83fc81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-edge-snapshot/fuzz/fuzz_targets/m3_reader.rs:201-211 | crates/ruvector-edge-snapshot/src/rvf_format.rs:47-57 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/fuzz/fuzz_targets/m3_reader.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"514ecae9421543d7b717884470243a380b51ca8d1f1c72ec7a90bbf3bcc9cc70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-matryoshka/src/lib.rs:138-152 | crates/ruvector-matryoshka/src/lib.rs:192-209 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-matryoshka/src/lib.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a49af17d1c621ddc4409441f805648fba152db2463dedc1768417e778349dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-mincut/src/jtree/coordinator.rs:416-438 | crates/ruvector-mincut/src/jtree/coordinator.rs:446-469 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/coordinator.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4663afe936afca4222ece1f20ee71d23ee6eeef9fc5b83c3b1911d9779a27c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:148-165 | crates/ruvector-postgres/src/graph/operators.rs:180-203 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f497f3b45ec7769d0a4f503ac8242b359eb1ebcaaeb972ef482ded23aa3be182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvllm/src/claude_flow/pretrain_pipeline.rs:1111-1138 | crates/ruvllm/src/sona/ruvltra_pretrain.rs:714-735 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/pretrain_pipeline.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b20b2508aec0af33c6aa2ef5f5c8bb628298576acb938406c87574cf22f8c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rvAgent/rvagent-backends/src/composite.rs:119-135 | crates/rvAgent/rvagent-backends/src/composite.rs:143-162 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/composite.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf34489754c799b84c4b59f1360e96d26c293c6f29446ce63f32cea806a7e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): patches/candle-core-0.8.4/src/quantized/metal.rs:117-127 | patches/candle-core-0.9.2/src/quantized/metal.rs:119-129 | patches/candle-core-0.9.2/src/quantized/metal.rs:136-146 \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":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa37182aa0179c2193f1f464a1416f7f73ee7525023a9f25fb047db79c15246b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvector-delta-core/src/window.rs:178-203 | crates/ruvector-delta-core/src/window.rs:208-234 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/window.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c6f880494d7942fcb4daeeab45982518dc8630c0cddf1348da64456e7a6da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-kge/src/optimize/campaign.rs:403-414 | crates/ruvector-typesafe-core/src/loop_gate.rs:224-235 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/optimize/campaign.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67218b091125c086bc757a484d4eb9d86b3a516236c067e5bc671658b28f5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvix/crates/bcm2711/src/gpio.rs:293-318 | crates/ruvix/crates/bcm2711/src/gpio.rs:364-384 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/gpio.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8112d8897fc485b88955d661114989f3e4a0d974ed02fdf2321c504f749b6ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvix/crates/nucleus/src/kernel.rs:643-664 | crates/ruvix/crates/nucleus/src/kernel.rs:724-745 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/kernel.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b9c9d1e86b33579079b192be862e34e39ae01de988300f618b5314c230b7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvllm/src/models/openmythos/block.rs:42-49 | crates/ruvllm/src/models/rdt.rs:519-532 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/block.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4d04fab50c920147b6dc636168ea540fa599938ad0cac0498b33b5d6e8d850"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/device.rs:235-251 | patches/candle-core-0.9.2/src/metal_backend/device.rs:203-216 \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":"patches/candle-core-0.8.4/src/metal_backend/device.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"141ee7b80cff1ba2e96113bb045c151620d2fe085f3e82d2f1b9ab00b09da35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ruvector-gnn-rerank/src/main.rs:80-88 | crates/ruvector-rairs/src/main.rs:48-56 | crates/ruvector-spann/src/bin/benchmark.rs:54-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn-rerank/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2bd746c438afed6ed94e4a744dc7c7e010fba3b2c203f0ac052db345bcd74e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:71-84 | crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:87-99 | crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:103-114 \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":"crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df953f0b4b45d0308626dba66474edd539fc6e5e312b2a63388f444da19d82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvector-mincut/src/connectivity/mod.rs:341-362 | crates/ruvector-mincut/src/connectivity/polylog.rs:123-144 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/connectivity/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1129c8787307e8ab8dd75ba56d4fcf4883ecd20ba019b4b736076b20eac05804"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-postgres/src/attention/flash.rs:346-362 | crates/ruvector-postgres/src/attention/operators.rs:952-962 | crates/ruvector-postgres/src/attention/scaled_dot.rs:290-306 \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":"crates/ruvector-postgres/src/attention/flash.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"554063018b3b2790179de28a3a987d39cbf7c833b2e56ad4aa016a5dd0d0027a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/ruvector-postgres/src/workers/engine.rs:429-452 | crates/ruvector-postgres/src/workers/engine.rs:455-476 | crates/ruvector-postgres/src/workers/engine.rs:509-526 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/engine.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abe86b96ab7880b09a5003148a4256b5f87673fa8e94921fec02f014fc624f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvllm/src/kv_cache.rs:993-1010 | crates/ruvllm/src/kv_cache.rs:1546-1564 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f684cb34463d7692258df371df64e9defb7a9a5bc1e0e066c4e11724fabdbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rvlite/src/storage/indexeddb.rs:69-94 | crates/rvlite/src/storage/indexeddb.rs:123-140 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/storage/indexeddb.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a946f32a7dbbb3d00556dc88c2698d39dab5d2bc1095b1ece54cf4ce922062a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/prime-radiant/src/storage/file.rs:688-700 | crates/ruvllm/src/quantize/turbo_quant.rs:986-1005 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fd7d4f8b50e5415247d733135313ee7ece15ce32e478eda04069ea1f7a3bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-coherence-hnsw/src/coherence.rs:40-62 | crates/ruvector-recall-bounded/src/lib.rs:45-61 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/coherence.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"945b8cad4dc36d771c9a1440a143007f4b596801de0c545293a90153db47fff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-core/src/advanced_features/sparse_vector.rs:349-363 | crates/ruvector-core/src/advanced_features/sparse_vector.rs:368-382 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/sparse_vector.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4307a9e29a35d4cc18f2bc877ae696a12256ccf8866777fc6f6bd6646a5e8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs:47-68 | crates/ruvector-dag/src/qudag/crypto/ml_kem.rs:51-72 | crates/ruvector-dag/src/qudag/crypto/ml_kem.rs:75-101 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd1c07ab8b6473c2c93da7e30c3251ac26ca792eb7117b7491bdce4d83e8057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-graph/src/cypher/parser.rs:194-213 | crates/rvlite/src/cypher/parser.rs:190-205 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"200ef7af9197cf17cd7543e1fde2309ef0d7dffd469baeb2a73b7b56c1a4af58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvector-graph/src/cypher/parser.rs:1065-1089 | crates/rvlite/src/cypher/parser.rs:971-992 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"101f81f3464d6afae529b96d40c63eb8385e8e05b78dd225033488444007b825"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/ruvector-mincut-gated-transformer/src/attention/window.rs:168-190 | crates/ruvector-mincut-gated-transformer/src/attention/window.rs:332-351 | crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:426-445 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/window.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d087dd5a5478aed132f3f7d3815fe98fb70103ff1f7d9675a8be61d3b7840d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/ruvector-timesfm/src/forecaster.rs:61-85 | crates/ruvector-timesfm/src/forecaster.rs:90-113 | crates/ruvector-timesfm/src/forecaster.rs:118-141 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-timesfm/src/forecaster.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c591e8e837bef7fecda462b3e07b47bff1bafd6e55513b2dcdf83630ab6ba272"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/serving/request.rs:365-380 | crates/ruvllm/src/serving/request.rs:383-398 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/request.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"22343f64050a875f788400ebe02d8ecb3068d1c5ae6a860c0899d0c5c996f635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rvAgent/rvagent-middleware/src/hnsw.rs:553-570 | crates/rvAgent/rvagent-middleware/src/hnsw.rs:573-589 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca5602d9c4f45409ac0c01dd8eb3c80968da7884c9ba4814ef046acded46bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2383-2390 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2868-2875 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8631a62bcafc5676465cdf46c1d12229f3d3013f63eeef0ec864c1cb6fe6628b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:98-108 | patches/candle-core-0.9.2/src/quantized/mod.rs:156-166 | patches/candle-core-0.9.2/src/quantized/mod.rs:173-187 | patches/candle-core-0.9.2/src/quantized/mod.rs:189-199 | patches/candle-core-0.9.2/src/quantized/mod.rs:206-220 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db92fb6ea1b3574524324988d3bab23b358b03ab375a07d8835646be5d5ebff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ruvector-attention/src/curvature/component_quantizer.rs:69-90 | crates/ruvllm/src/bitnet/tl1_kernel.rs:61-85 | crates/ruvllm/src/kernels/quantized.rs:121-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/component_quantizer.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8fe0e27333169d1b57b2c5bad97d9771ce7bac2282a9af207e61b0a8e6e9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-attention/src/hyperbolic/poincare.rs:62-75 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:384-398 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ae1e3f73ba0ccc907c19b856cda70b1c6e24e33e4f38e2f1b7b67dc974a637"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): crates/ruvector-bench/src/bin/turbo4_ablation.rs:36-50 | crates/ruvector-diverse-beam/src/dataset.rs:21-35 | crates/ruvector-gnn-rerank/src/main.rs:45-58 | crates/ruvector-rairs/src/main.rs:32-45 \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":"crates/ruvector-bench/src/bin/turbo4_ablation.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0360e6db1ab0b84ffaa719004fdf3e988fb94565f8f092f0473185dec0bc69c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-core/src/distance.rs:9-23 | crates/ruvector-router-core/src/distance.rs:7-21 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/distance.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8934bc2db5aea64421749b1147589693e6a2f849f427e051fd6b4b5ad1869599"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-hyperbolic-hnsw/src/hnsw.rs:509-520 | crates/ruvector-hyperbolic-hnsw/src/shard.rs:204-228 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw/src/hnsw.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52d4cab6634837a109439b8bc69c7cdf6bc614db0726751f57ce095fd6e288c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-mincut-node/src/routing.rs:88-102 | crates/ruvector-mincut-wasm/src/routing.rs:79-91 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/routing.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b1b23e1ddbe1a08ad04be18fd3e7b0444545c24e9b651d80a68b12ed6b13b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-postgres/src/graph/sparql/parser.rs:2303-2318 | crates/rvlite/src/sparql/parser.rs:2345-2362 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b72b81d9caeffa909c3540926eb88ebf7302e82ea4d41887fdf911183a6e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm-wasm/src/workers/mod.rs:177-191 | crates/ruvllm-wasm/src/workers/mod.rs:216-233 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e6daddf92cffe43bb44f4f34e7342c27daa6bfd7804b3e7d7a38008b9b4207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvllm/src/backends/lattice_backend.rs:831-847 | crates/ruvllm/src/backends/lattice_backend.rs:865-883 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/lattice_backend.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"870a69a42f14415db74a33068c0520c48882c313bdb819b9a60b839c24a95288"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvllm/src/models/openmythos/rope.rs:54-60 | crates/ruvllm/src/models/rdt.rs:1141-1148 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/rope.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a6940f58d0432707994991c5d0e9cd5dd3336ba8e5e7e5a56bd5a76de60320"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rvAgent/rvagent-middleware/src/memory.rs:238-252 | crates/rvAgent/rvagent-middleware/src/skills.rs:374-393 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/memory.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbdd8773c474d1fc7d6de608be16a5471e70e150e709557e5f1efb5605dd24d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rvm/crates/rvm-witness/src/replay.rs:63-92 | crates/rvm/crates/rvm-witness/src/versioned.rs:336-351 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/replay.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"374ee58eaf5cb70d28f3d2fa5d6b299eeba7d83626e0763cf08f4a6ab5942e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): edge/auth-worker/src/config.rs:56-73 | edge/auth-worker/src/config.rs:108-119 \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":"edge/auth-worker/src/config.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3081cbc7563c1a0cce7363edd539e8987f11cf9f552d169b3380a91af36d5467"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/emergent-time/src/complex_matrix.rs:70-86 | crates/emergent-time/src/real_matrix.rs:65-81 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/complex_matrix.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b83101865846bf338b4c6360241293f1c1862866fc2ef248145dab32db04bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/mcp-brain/src/embed.rs:180-203 | crates/mcp-brain/src/embed.rs:211-227 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/embed.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77d30b05dda94256ef649cfdfe77de38b56480888885e4f25fd72e7b7e1af89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): crates/mcp-brain/src/tools.rs:501-520 | crates/mcp-brain/src/tools.rs:522-541 | crates/mcp-brain/src/tools.rs:543-556 | crates/mcp-brain/src/tools.rs:558-574 | crates/mcp-brain/src/tools.rs:576-592 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2331aedc48f8344ea1aa0a15ca201b1fd8f26b84c9cc01434b09ca5575b58d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-attention-unified-wasm/src/graph.rs:240-250 | crates/ruvector-gnn-wasm/src/lib.rs:286-298 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec06b69a1561f01f57b58f02c369642797da60901bb968f381c22f312ee835a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-attention/src/attention/mla.rs:192-205 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:423-437 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/mla.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"384e8436cce31e69c7259ed7ad9483aa9c42d14084ae37d6eb7138a28710aadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-bet4-ivf-bench/src/oracle.rs:24-32 | crates/ruvector-matryoshka/src/lib.rs:252-260 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/oracle.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f509fa536c136d16cad6325933dc467093c3dcecb4ebbed81abb3a6595c459"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-core/src/arena.rs:269-295 | crates/ruvector-core/src/arena.rs:471-501 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/arena.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a585758da7aebc0ef27702e4c0ff177ef4af57d7ce1922da1a90744f7b91ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-postgres/src/math/operators.rs:117-133 | crates/ruvector-postgres/src/math/operators.rs:168-184 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/math/operators.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ee1bee25d959ee9411dc0f3c07574738e8bc59061c360df0bf2a4618cfc080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-weaver/src/semver.rs:109-123 | crates/ruvector-weaver/src/semver.rs:132-147 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/semver.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"01af1bf60b3aef81f1b9ceacb8933ed827b5242e68bbc392fb93a85e067abae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvllm/src/autodetect.rs:955-971 | crates/ruvllm/src/autodetect.rs:974-990 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbfab8b2c4c70502a418b4a39b37e2627bbdecacb4acd441b3824e14ed661b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/ruvllm/src/quantize/ruvltra_quant.rs:577-596 | crates/ruvllm/src/quantize/ruvltra_quant.rs:599-618 | crates/ruvllm/src/quantize/ruvltra_quant.rs:621-640 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/ruvltra_quant.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75b701de725a22d1e2f1c81fc1674de2489bdc31844a44aa409d2088132fde7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rvf-forge-core/src/container.rs:98-117 | crates/rvf/rvf-wire/src/tail_scan.rs:45-61 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf-forge-core/src/container.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c137c8dd41ac84b979937d860cf390cd4a98c47aef3d8c369d88ca88b526cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/sona/src/training/templates.rs:409-421 | crates/sona/src/training/templates.rs:427-444 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/training/templates.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2148f7456489a30ee80a10f652b27fd18818c5291e531e162e0a87b13266c7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-nervous-system-wasm/src/btsp.rs:261-282 | crates/ruvector-nervous-system/src/plasticity/btsp.rs:371-390 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/btsp.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e5868260d12cb6d390572ba08f81755d41bb2fdaaa4d2ad54866326ea05c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-postgres/src/integrity/contracted_graph.rs:458-480 | crates/ruvector-postgres/src/integrity/contracted_graph.rs:545-569 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/contracted_graph.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a044271a92e434252e92e50aec7ea92fb1bc0800a6df2f09c2eed4bafaddbcba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/ruvix/crates/sched/src/scheduler.rs:329-352 | crates/ruvix/crates/sched/src/scheduler.rs:357-376 | crates/ruvix/crates/sched/src/scheduler.rs:413-433 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/sched/src/scheduler.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed2c054a5efabc66e47a35096020cb173c0d0ce2e8fcc2f7fe87de9230555a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/qat/differentiable_quant.rs:418-433 | crates/ruvllm/src/qat/ste.rs:126-149 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/differentiable_quant.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5aa9ab39458b99fec9304fdab0befe0a93c069655e520bec4af4eefc72ab96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:394-402 | patches/candle-core-0.8.4/src/accelerate.rs:405-413 | patches/candle-core-0.8.4/src/mkl.rs:347-355 | patches/candle-core-0.8.4/src/mkl.rs:358-366 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c96bbd61af45899b82e1a50264a15cf19e83f0f2e97c1427fdf5125d75a0379"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): patches/candle-core-0.8.4/src/safetensors.rs:429-439 | patches/candle-core-0.9.2/src/safetensors.rs:584-594 \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":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b76fb32ca001ea761ae061de737470052aab1701a3ab9bfc563b081be2c419d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/prime-radiant/src/substrate/restriction.rs:185-200 | crates/ruvector-solver/src/types.rs:45-69 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/restriction.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b4236ea631845e468dff0b90f9476d62e9069c7c5f5a693633512b431b8bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/ruvector-cnn/src/config.rs:413-445 | crates/ruvector-cnn/src/config.rs:534-560 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/config.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"63488dcbacdf9b626af0e67be8d2a4156241a0c646f388acae83113283e8cd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/ruvector-mincut/src/cluster/hierarchy.rs:511-530 | crates/ruvector-mincut/src/cluster/hierarchy.rs:592-610 | crates/ruvector-mincut/src/subpolynomial/mod.rs:1012-1037 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad3271fd7b3b9180682a0d9aac51c9d1f4ed115246293db5df18396bc988709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvix/crates/boot/src/boot_loader.rs:256-276 | crates/ruvix/crates/boot/src/boot_loader.rs:279-308 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/boot_loader.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d81e63ae9dca07462ec8bf32d31df10f77151e16aa2e6be34ecc045ec4bd27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ruvix/crates/nucleus/src/graph_store.rs:471-494 | crates/ruvix/crates/nucleus/src/kernel.rs:696-717 | crates/ruvix/crates/nucleus/src/kernel.rs:777-798 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/graph_store.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"079fbcac4899fcd4494f3cd6729aa116b3ebb3ca9157eba8ebe8e7faf69669e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/rvm/crates/rvm-kernel/src/lib.rs:408-433 | crates/rvm/crates/rvm-kernel/src/lib.rs:737-759 | crates/rvm/crates/rvm-kernel/src/lib.rs:894-911 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a952106f8f6c79900233a31cf226bb3801d4007f79d498aaa17a97b3422e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1897-1911 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1910-1921 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab13862a1f1030165e5121a35de38876f053b50e7ae2a6a4874e5fc949feeaab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): patches/candle-core-0.9.2/src/tensor.rs:1666-1681 | patches/candle-core-0.9.2/src/tensor.rs:1705-1720 \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":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c421d41138d1d8f44d6ada50473cf690d4e0f7973a41dc289e5a53f2d3b531"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-agent-memory/src/compaction.rs:45-57 | crates/ruvector-agent-memory/src/compaction.rs:77-89 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/compaction.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"591456292ef80b566653562c4806529a90bed83b8a8008e3f02b9e2d68a57c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs:259-271 | crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs:279-291 | crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs:407-419 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95b4e4a48866b793828aca01f6ee892aacc32a661a642029a2e5cda5b9ee2b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-postgres/src/integrity/contracted_graph.rs:397-408 | crates/ruvector-postgres/src/integrity/contracted_graph.rs:411-422 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/contracted_graph.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b085aaf82d5bf20ddce046776985b486646c552ed7e5866326df514ea1fc1c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-robotics/src/mcp/executor.rs:59-74 | crates/ruvector-robotics/src/mcp/executor.rs:98-118 | crates/ruvector-robotics/src/mcp/executor.rs:123-138 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/mcp/executor.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9faee9f7494872cc97d76f1294f424ae0966d23ebe7967d82187af548ff3c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/ruvector-solver/src/backward_push.rs:90-110 | crates/ruvector-solver/src/forward_push.rs:69-89 | crates/ruvector-solver/src/random_walk.rs:178-198 \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":"crates/ruvector-solver/src/backward_push.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"098760b876c9f261900f1c64cb66415b6b51ea1714db8e0a921fcca91c3cd8e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/ruvllm/src/kernels/matmul.rs:965-981 | crates/ruvllm/src/kernels/quantized.rs:370-384 | crates/ruvllm/src/kernels/quantized.rs:589-603 | crates/ruvllm/src/kernels/quantized.rs:760-776 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e3304d1d9dadce8e2965f991fea29c3e33861a498f7db8311d600fa526ca4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/mcp-brain-server/src/symbolic.rs:680-693 | crates/photonlayer-ruvector/src/memory.rs:97-117 | crates/sona/src/reasoning_bank.rs:349-360 \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":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"64282e5f7866b8c061d383b4fd998a6675df47355d35c87b1b8e994d76fcf8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-attention-unified-wasm/src/graph.rs:276-284 | crates/ruvector-gnn-wasm/src/lib.rs:314-326 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c726e52712f1fa4e41ee25595bfa8acfc1eb214fa587bcd97615d6d780b959e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:70-84 | crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:95-109 | crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:128-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f317142fee476446588c5d1b3f90ba7c131b1c2a0f78bb80380cc03644a6cc17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-mincut/src/optimization/parallel.rs:264-288 | crates/ruvector-mincut/src/optimization/parallel.rs:315-337 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/parallel.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8d1305323f5849ea80dae7a4d4cc5b49eca6b5985a8a837f85fd602e018b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-sparsifier-wasm/src/lib.rs:126-137 | crates/ruvector-sparsifier-wasm/src/lib.rs:162-171 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparsifier-wasm/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0882eb237272fd54ecca1b89c009b58c4daa74f126636aa9683139763ebf6d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-turboquant/src/codec.rs:185-192 | crates/ruvector-turboquant/src/codec.rs:196-202 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/codec.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7035cf9338f9cc39053d7a1afd95c919deeac3b3cab8e9d8f4142a0e2d345fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvllm-cli/src/commands/benchmark.rs:287-304 | crates/ruvllm-cli/src/commands/benchmark.rs:306-323 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/benchmark.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e4a6501e88b22c6db69440b988e350ba64f24ecd6534055e649fcf71f7ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvllm-wasm/src/pi_quant_wasm.rs:320-336 | crates/ruvllm/src/quantize/pi_quant.rs:1428-1440 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/pi_quant_wasm.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bc5041cfd321e425a2b97144c6a0ad995208caf7dd21387d76baf06923a75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): crates/ruvllm/src/backends/gemma2.rs:497-514 | crates/ruvllm/src/backends/phi3.rs:367-390 | crates/ruvllm/src/models/ruvltra.rs:619-634 | crates/ruvllm/src/models/ruvltra_medium.rs:623-640 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a745d15896a6969bdbf174dfe4e18bb27fc65f8c0515e6d5be202efa2b43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvllm/src/context/episodic_memory.rs:571-592 | crates/ruvllm/src/context/semantic_cache.rs:496-516 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/episodic_memory.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8f7ed266d180b268ae0b2dff06cb9f599d2ba729e9d1d7c3eafa8d183adb8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): edge/gateway/src/shard_core.rs:173-180 | edge/gateway/src/shard_wipe.rs:49-56 \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":"edge/gateway/src/shard_core.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"988cd1621ec8148dddbf5cdccab337c6559f713abf3254f95cff3c0b1440247b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2357-2364 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2366-2373 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2842-2849 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2851-2858 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fdec3e1133f56085b63a8a26b5e3a2ac8a604a8bff98e62520517e7f44f1e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/prime-radiant/src/coherence/history.rs:262-280 | crates/prime-radiant/src/coherence/history.rs:283-299 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/history.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d1bec33e5d219c8eea81d1178d34f2ddb899d5448a8cb0bf7a70ff8a976bdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/prime-radiant/src/ruvllm_integration/memory_layer.rs:1021-1036 | crates/ruvector-maxsim/src/score.rs:17-33 | crates/rvAgent/rvagent-middleware/src/hnsw.rs:167-184 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/memory_layer.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5377c1949a60264459d4e9d59ff30a62c6be1608cf94bd7523957372b61d5ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ruvector-agent-memory/src/memory.rs:97-113 | crates/ruvector-cluster-rag/src/search.rs:27-40 | crates/ruvector-pq-search/src/lib.rs:67-76 \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":"crates/ruvector-agent-memory/src/memory.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae58e4ad500c382da6b3bcf783a9aae566872843656659cb81f7cfe25b978314"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-attention/src/topology/coherence.rs:136-160 | crates/ruvector-attention/src/topology/coherence.rs:164-191 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/topology/coherence.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f67eeb44e6ec72838002c89382e36b48181fb4efd20c4cc90c3d73b06a2338"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-postgres/src/types/binaryvec.rs:126-144 | crates/ruvector-postgres/src/types/productvec.rs:152-178 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aaf29728c8c5b0b6cd87b80da1067e30388466897580cb884280b9709cbc0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rvf/rvf-quant/src/scalar.rs:66-76 | crates/rvf/rvf-quant/src/scalar.rs:81-90 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-quant/src/scalar.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86194c9fb6d36a02c925e82f33602f6e157a3ea7e69a636989753bb7c25b054"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/mcp-brain/src/main.rs:9-25 | crates/mcp-gate/src/main.rs:9-29 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/main.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4db4995e1a464e6f3fe97b460a565e853caf2f64593372a6cbdb1e574881ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/prime-radiant/src/hyperbolic/mod.rs:110-134 | crates/prime-radiant/src/hyperbolic/mod.rs:137-151 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/hyperbolic/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5b4508163bfad7ddc5ff6b541e6d34c4f1bbe9959a0545315014af157e429c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/ruvector-cli/src/cli/hooks.rs:1902-1926 | crates/ruvector-cli/src/cli/hooks.rs:2044-2069 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68dcebbaaf16fb912332a4bed6210679f1db03c3a333227187182af33c87f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-graph-transformer/src/self_organizing.rs:705-723 | crates/ruvector-mincut-gated-transformer/src/spectral.rs:222-249 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/self_organizing.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46cb9dc6ca524d7de6b2fe7812d9071e6c0f0069d9dbe270f3350bae0294d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-hnsw-repair/src/graph.rs:166-178 | crates/ruvector-matryoshka/src/hnsw.rs:201-215 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/graph.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"96daf08a7951f20b557e0d95abd291dce5b0a4dcd286f3930167cdcdd36994a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-kge-ffi/src/ops.rs:61-74 | crates/ruvector-kge-wasm/src/ops.rs:61-74 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2babbb2160d4a21d1d2e58db3ead44145007ab8d53940690f7f2d6558e12615"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-math/src/tensor_networks/tucker.rs:81-96 | crates/ruvector-math/src/tensor_networks/tucker.rs:232-246 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/tucker.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dd33a5b594e355e4d3db1a4643a19a94108c22273e190d3c96317bb95f6417"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-mincut/src/wasm/canonical.rs:173-188 | crates/ruvector-mincut/src/wasm/canonical.rs:199-215 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/wasm/canonical.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf12f95404d7aa1faa2d3fa2cc7b2b5ddc0a94148a40e5689156d6068506f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-nervous-system/src/integration/ruvector.rs:307-317 | crates/ruvector-robotics/src/cognitive/memory_system.rs:165-174 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/integration/ruvector.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fee3692514e73a124629dc01f7a53207bd9e35ab0b09cb097023c4aa0d3448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-typesafe-ffi/src/lib.rs:337-344 | crates/ruvector-typesafe-wasm/src/lib.rs:260-267 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-ffi/src/lib.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da3ee3c4904a858ae1c27562a47989db44a156d5ed0cfd3050db6a016caf203"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvllm-wasm/src/bindings.rs:453-472 | crates/ruvllm-wasm/src/bindings.rs:474-500 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a852fb0f722d42354d50ad0ebff7d980bb58ae34c5fe9a6384c2345561db6d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/ruvllm/src/backends/mod.rs:684-704 | crates/ruvllm/src/backends/mod.rs:707-727 | crates/ruvllm/src/backends/mod.rs:733-752 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mod.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e9c17af4936d6fbf1715e56319f8ac9f0ba9be97b33ab1479898f6d08ede7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvllm/src/context/semantic_cache.rs:389-405 | crates/ruvllm/src/context/semantic_cache.rs:408-426 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/semantic_cache.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0fea367b1c65387fdc91109491a5773f0044a0fb309142b5463a8dd6e2e5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvllm/src/gguf/quantization.rs:491-504 | crates/ruvllm/src/gguf/quantization.rs:531-543 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"501707fc00544d8453ada9a0fa3160e1f3c4ccdb97f9837ae16b86973103cfef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvllm/src/lora/micro_lora.rs:792-812 | crates/ruvllm/src/lora/micro_lora.rs:818-838 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad108856dbcb7f20ed36bb25bdc3aaf555235a80eb3c2946607e5fbe8261f8a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/training/real_trainer.rs:646-660 | crates/ruvllm/src/training/real_trainer.rs:663-677 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/real_trainer.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09e87461283eca4acf0dbe66bd5bfbd241a7dd671204ff5d69c31a1fe835fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/prime-radiant/src/neural_gate/encoding.rs:278-293 | crates/ruvector-nervous-system/src/hdc/memory.rs:115-127 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/neural_gate/encoding.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2695e4e07d084d4678c35ed40354ca5c4979944295f64930477ad0665197a861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): crates/ruvector-cli/src/cli/hooks.rs:640-654 | crates/ruvector-core/src/embeddings.rs:749-766 | crates/ruvllm/src/backends/candle_backend.rs:283-297 | crates/ruvllm/src/evaluation/real_harness.rs:298-316 | crates/ruvllm/src/optimization/sona_llm.rs:682-701 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b052f78429cfe490b0fcb6e94b9aeae0fb7aa3fb9c4411d35d17f465f5c8d6c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/ruvector-dag/src/dag/query_dag.rs:189-214 | crates/ruvector-dag/src/dag/query_dag.rs:254-276 | crates/ruvector-dag/src/dag/query_dag.rs:279-301 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/dag/query_dag.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a34671630349090a85a2b48290f8207717f71fcc1513875825fb9c2e219c907"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-graph/src/hybrid/vector_index.rs:98-119 | crates/ruvector-graph/src/hybrid/vector_index.rs:123-139 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/hybrid/vector_index.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d54543276f0b0f62415b58114398ecce7d618ffcf8924c2abc3c581a0d6be74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-maxsim/src/bucket.rs:48-62 | crates/ruvector-postgres/src/attention/multi_head.rs:183-206 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-maxsim/src/bucket.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d8ead8ae3f2edf496146ba633595464c54e7e515986143c333fcf72048debe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-mincut/src/optimization/cache.rs:141-154 | crates/ruvector-mincut/src/optimization/pool.rs:248-261 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/cache.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c556e56ad488ffd89ee8af210574e046e4996906b63a2c5003a21381bf3d625"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvllm/src/training/contrastive.rs:169-186 | crates/ruvllm/src/training/real_trainer.rs:178-195 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7cfb88bd62bea76ddc9b2702819ee379215d6480ba7e20811356839f4377f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvm/crates/rvm-kernel/src/lib.rs:834-846 | crates/rvm/crates/rvm-kernel/src/lib.rs:855-867 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffccada705d1c3b5ff9afa8a1997fcc80533f688c8f0e33477f636e6749123f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): edge/gateway/src/graph_store.rs:105-116 | edge/gateway/src/ledger_core.rs:52-65 | edge/gateway/src/shard_core.rs:163-170 \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":"edge/gateway/src/graph_store.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a49488972820c6e9ea7608cbd27883b5266d9489106e7f0ec91e501a060b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): edge/gateway/src/m3_ports.rs:98-106 | edge/gateway/src/m3_ports.rs:113-126 \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":"edge/gateway/src/m3_ports.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2624e866d539ab33badd224b18ecc8f3626eef1896363441559c7922f96c8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:106-117 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:106-117 \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":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"511608b1b481c1347593ae76f95893b1a0720571bffd28b901fc84436ad27e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-kge/src/scorer/hole.rs:110-117 | crates/ruvector-kge/src/scorer/rotate.rs:142-149 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/scorer/hole.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a1d7f0d61e81a8237b87fb11d2da8b5d44d194d242ff39f43ae43cbc82f8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-postgres/src/gated_transformer/mod.rs:147-168 | crates/ruvector-postgres/src/gated_transformer/mod.rs:180-196 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gated_transformer/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbce0e03d987c4d8bdd63af6517c4b617acdb941d8563d71b4d177aef76d7ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-postgres/src/gnn/operators.rs:333-344 | crates/ruvector-postgres/src/gnn/operators.rs:374-385 | crates/ruvector-postgres/src/index/ivfflat_am.rs:2120-2133 \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":"crates/ruvector-postgres/src/gnn/operators.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f2f9c6994544164289b810a851b37066feb40fc5d2dedcebadd3374f935513"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvix/crates/vecgraph/src/graph_store.rs:220-231 | crates/ruvix/crates/vecgraph/src/vector_store.rs:195-207 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/graph_store.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"142364f00de744b2a77e7cf41298ff440aa9ecc43139387bf04d71e31b971625"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rvf/rvf-node/src/lib.rs:917-938 | crates/rvf/rvf-node/src/lib.rs:971-992 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/src/lib.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e798a46d38bb36a4c94e9e1858e48bab38520e98b72d6283db5d6a2aa2d0971"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvf/rvf-quant/src/product.rs:73-83 | crates/rvf/rvf-quant/src/product.rs:99-112 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-quant/src/product.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"abffa7a1d63914eb0fd339080ed63f21bce6db05ec562af93b1d7228634d2bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/neural-trader-wasm/src/lib.rs:45-62 | crates/rvf-forge-core/src/bin/rvforge-rvf-check.rs:144-158 | edge/gateway/src/m3_wire.rs:82-92 \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":"crates/neural-trader-wasm/src/lib.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef0c32df3691bfab521b159a5a09961c0b495c3f960ef5570a0603e5b66e0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): crates/ruvector-attention/src/attention/scaled_dot_product.rs:39-44 | crates/ruvector-postgres/src/operators.rs:364-374 | crates/ruvector-typesafe-train/src/train/eval.rs:26-36 | crates/ruvllm/src/backends/mistral_backend.rs:1438-1448 \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":"crates/ruvector-attention/src/attention/scaled_dot_product.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"294ec14889ae2962f7e44ba20aa4550234f0bbc348fef2f6a71bb95f2311a070"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:1826-1836 | crates/ruvector-postgres/src/distance/simd.rs:1845-1855 | crates/ruvector-postgres/src/index/ivfflat_am.rs:568-578 \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":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"febba8abfcc79aade45322ff6bfdba5011d3e8e46cf906de381d8d5d1ee53600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvix/crates/nucleus/src/shell_backend.rs:213-228 | crates/ruvix/crates/nucleus/src/shell_backend.rs:231-246 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/shell_backend.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abbe64f6baf1e5ed6bb3da56e7dcd95eff151eddc32d0d79c3a7bf64685ea0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm-wasm/src/pi_quant_wasm.rs:288-305 | crates/ruvllm/src/quantize/pi_quant.rs:1408-1423 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/pi_quant_wasm.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a224f626f7aee545043d4db820bfc917503b2f52e88db8806d0716d5e380c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvllm/src/kernels/matmul.rs:1483-1501 | crates/ruvllm/src/kernels/matmul.rs:1522-1541 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93cef6542e306e31075438c283057d207f3d627b05c50ef45c5e09fe44737e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvllm/src/quantize/hadamard.rs:637-656 | crates/ruvllm/src/quantize/hadamard.rs:663-681 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c019bc21ab986e5205beb7dc9f8007b0a89c1914ff6813a4ae95d5f80eb3740"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvllm/src/serving/engine.rs:789-811 | crates/ruvllm/src/serving/engine.rs:1050-1069 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b3f2056c47047c8c6021896c6ffa4387d7a25a825f1cd734633a67af0de8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rvlite/src/storage/indexeddb.rs:97-120 | crates/rvlite/src/storage/indexeddb.rs:143-157 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/storage/indexeddb.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe72b4d17d4917c638ff895a4db08ba7992898734dfdb480fec5b41d60a3673"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1640-1646 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1655-1661 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2180-2186 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3af567f39cb8ecd3c35298a370d3fd32c47a469b864a68af4424266ae07011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/shape.rs:71-466 | patches/candle-core-0.9.2/src/shape.rs:71-466 \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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"932a32a1b053e5ffc5e341c85e32e64eb3e016d01f3e59a33941e2126e4cb564"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/mcp-brain-server/src/routes.rs:6590-6607 | crates/mcp-brain-server/src/routes.rs:6616-6633 | crates/mcp-brain-server/src/routes.rs:6641-6655 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6590}}}],"partialFingerprints":{"codehealthFindingId/v1":"b487d4d2fe444fc731879ad2f9d4ee664a1a55554f77bcf45faf1f1dcfef969b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-exotic-wasm/src/time_crystal.rs:134-149 | crates/ruvector-exotic-wasm/src/time_crystal.rs:373-390 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-exotic-wasm/src/time_crystal.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c202a3821db58df0b530c7fd8954d3cab9029a8a0ca4b86fdf3086b828672"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-fpga-transformer/src/quant/qformat.rs:61-76 | crates/ruvllm/src/metal/operations.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":"crates/ruvector-fpga-transformer/src/quant/qformat.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"085d109651f35f3e77058fdcab11ad19b24749b563a17d71aac59895f0a77473"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-postgres/src/healing/functions.rs:61-72 | crates/ruvector-postgres/src/healing/functions.rs:79-91 | crates/ruvector-postgres/src/healing/functions.rs:98-112 \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":"crates/ruvector-postgres/src/healing/functions.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f6f861e6c607689b373d9fc83a879863a4babb525f0280ffca586782554a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-postgres/src/sparse/operators.rs:268-274 | crates/ruvector-postgres/src/sparse/operators.rs:277-283 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/sparse/operators.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24fc3f2c8d34a293cf048fda989048558ed69a41c41e30ffd7255f6831ee143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-postgres/src/workers/engine.rs:835-852 | crates/ruvector-solver/src/audit.rs:82-102 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/engine.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"266fcde039870bff36bc750469167db195a9ec9d3b62c541b49d5aab580cbd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvix/crates/shell/src/commands/perf.rs:8-22 | crates/ruvllm/src/hub/model_card.rs:354-369 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/shell/src/commands/perf.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"24666c7c762b5905f04fe7f69136bec90cd0b50200cec1e35518fa224683e4de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/backends/gemma2.rs:830-844 | crates/ruvllm/src/backends/phi3.rs:693-707 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1616a4bcc4184af7a97d1fccd64f23485eea29971fd6df38138068378a560cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rvf/rvf-cli/src/cmd/filter.rs:140-148 | crates/rvf/rvf-runtime/src/store.rs:4746-4758 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/filter.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b2494be82ecfa776f54e93889ae3d50d95d6c0bd6df785a7f0ef4e4d3c1d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/cpu/neon.rs:65-73 | patches/candle-core-0.9.2/src/cpu/neon.rs:65-73 \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":"patches/candle-core-0.8.4/src/cpu/neon.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f27f73aa1913615968ef34f144094828def57f0eee51c59c04b8f0d71bdb5ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): patches/candle-core-0.8.4/src/quantized/cuda.rs:368-381 | patches/candle-core-0.9.2/src/quantized/cuda.rs:529-542 \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":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7389148a67c1657300f12e5afd992eaaa424495becbf960831fbde6ff268ca02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/mcp-brain-server/src/embeddings.rs:73-86 | crates/mcp-brain-server/src/embeddings.rs:90-103 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/embeddings.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4c85a16bc41e0f0640af76806c43ee0dc3bc0be4fed69a4af9bc2a916fd8f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-agent-memory/src/main.rs:35-39 | crates/ruvector-recall-bounded/src/lib.rs:78-86 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/main.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e230befe67d1db4fda8df968ed4afd62b8731135e0a7cc42b9d08ed6ce91efee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvector-delta-consensus/src/causal.rs:45-67 | crates/ruvector-replication/src/conflict.rs:48-73 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-consensus/src/causal.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a286f32fc9a7e1d086085bf6c58a32da5dcc2ab14854fc2a1c15a324869b571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-graph/src/cypher/lexer.rs:114-122 | crates/rvlite/src/cypher/lexer.rs:107-115 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/lexer.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d503cca927d629158b010573e737313e8a66542b4ff5d004cc66d1bf218f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-learning-wasm/src/lora.rs:380-395 | crates/ruvector-learning-wasm/src/operator_scope.rs:290-305 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-learning-wasm/src/lora.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"361d08a4ac14214eb7813d96c6c29e3d98a85619f380c4a688d519599de6e576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvector-lsm-ann/src/lib.rs:129-136 | crates/ruvector-sota-bench/src/bin/sift1m_bench.rs:108-114 | crates/ruvector-sota-bench/src/lib.rs:78-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-lsm-ann/src/lib.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2ac015bca0143be36002f25fb2fbafd6d4b022aec5a7d437b2cb0933681ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/ruvector-node/src/lib.rs:367-378 | crates/ruvector-node/src/lib.rs:419-431 | crates/ruvector-node/src/lib.rs:683-694 | crates/ruvector-tiny-dancer-node/src/lib.rs:230-242 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-node/src/lib.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dee1d4f4f7375c3fa2670c3325d23859846a043ebb3dfec8004b98da262912"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-postgres/src/operators.rs:352-360 | crates/ruvector-postgres/src/operators.rs:404-422 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/operators.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"248ec1ac4fbe7c3921560795732e5ff317ccbb150edb2319cf9a81c11d9fecfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/models/ruvltra.rs:1122-1136 | crates/ruvllm/src/models/ruvltra_medium.rs:993-1008 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a06f2459289c13eb45cf942a4d57513cb595da5e578cc8bd052c9e394ef871"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/rvm/crates/rvm-proof/src/engine.rs:101-122 | crates/rvm/crates/rvm-proof/src/engine.rs:139-164 | crates/rvm/crates/rvm-proof/src/engine.rs:181-199 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/engine.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d153d2e6083bc22154cf1a114bdc956e4c464a7e5e5b356509753547dd8ccce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/photonlayer-bench/src/decoder.rs:87-102 | crates/ruvector-postgres/src/quantization/product.rs:148-166 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/decoder.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4898b4f506b4c2d04f0318aa6f2e26befb581e475a380d20a28780127c492a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-attention/src/sparse/local_global.rs:36-53 | crates/ruvector-attention/src/sparse/local_global.rs:56-70 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sparse/local_global.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7908181322cd92767ed0268469cf06c4fd60d04f224a07104201f98f023797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-coherence/src/quality.rs:14-29 | crates/ruvector-temporal-coherence/src/lib.rs:98-112 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence/src/quality.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a1694ec6a16fc0e048d55610ec16d53b845a95c0c9a9175dfc732c16314cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-delta-consensus/src/crdt.rs:363-381 | crates/ruvector-delta-consensus/src/crdt.rs:383-404 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-consensus/src/crdt.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a7b432103920f9731867193dd3495122418d630dcc3454ba1a449868c43d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-domain-expansion/src/rvf_bridge.rs:146-157 | crates/ruvector-domain-expansion/src/rvf_bridge.rs:172-183 | crates/ruvector-domain-expansion/src/rvf_bridge.rs:197-207 \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":"crates/ruvector-domain-expansion/src/rvf_bridge.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4fd3a5360289e268e8677832a82d0f65fbf91e62039bce65468a3688728fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-graph/src/optimization/cache_hierarchy.rs:288-301 | crates/ruvector-graph/src/optimization/cache_hierarchy.rs:304-318 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/cache_hierarchy.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad9b7f8893263e625c6d37e8d7e09eb4fa5d8d9023614b7af0f01ebba5129cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-mincut/src/monitoring/mod.rs:237-253 | crates/ruvector-mincut/src/monitoring/mod.rs:264-280 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/monitoring/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4796f8159fb2359d1c07aecae91cf4da94fdd6cbf8eeb84f3ec5e0e428c20d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-nervous-system-wasm/src/hdc.rs:227-239 | crates/ruvector-nervous-system/src/hdc/memory.rs:149-160 | crates/ruvector-nervous-system/src/hdc/similarity.rs:127-138 \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":"crates/ruvector-nervous-system-wasm/src/hdc.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e052e35d60221656b896da48436441b809f30bb9cf2cc241730acb96b3cad800"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-rulake/src/lake.rs:451-469 | crates/ruvector-rulake/src/lake.rs:572-587 | crates/ruvector-rulake/src/lake.rs:606-625 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/lake.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f927aa574a190812be6dce43c5b0e62217d654b722f7b9ae143fc9d7f2323d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/ruvector-typesafe-ffi/src/lib.rs:267-279 | crates/ruvector-typesafe-ffi/src/lib.rs:326-335 | crates/ruvector-typesafe-wasm/src/lib.rs:130-141 | crates/ruvector-typesafe-wasm/src/lib.rs:181-192 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-ffi/src/lib.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edbea9c70bcdc6864e716cfb09db7f0b08e47637698b5d9fc04293d2d0e9b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvix/crates/vecgraph/src/graph_store.rs:202-218 | crates/ruvix/crates/vecgraph/src/vector_store.rs:176-193 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/graph_store.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dca51d1cca271fc1841c2b530615ef722eadeb1889e574c180969a8f45c4add"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ruvllm/src/quantize/pi_quant.rs:801-825 | crates/ruvllm/src/quantize/pi_quant.rs:884-906 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"643e2c2dd4feace2a9615040bdab836d5acc5317114b553e6aea1538201436db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/prime-radiant/src/substrate/graph.rs:637-653 | crates/prime-radiant/src/substrate/mod.rs:134-147 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/graph.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbda5ea8dd1c44246c25c2bfb2eea99690a17d1495e70665d37f725235f649e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-cli/src/cli/format.rs:100-113 | crates/ruvector-cli/src/cli/format.rs:122-140 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/format.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb437e1b11d5c91af1267ec652ae450e55c0a8d4e69d9d3ccd67dc8ae8fe9f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-cnn/src/contrastive/triplet.rs:368-381 | crates/ruvector-nervous-system/src/hdc/similarity.rs:156-171 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/triplet.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f5cc30175d83d1bb1eedca7fe24fa1d66afc051a76331a11b68d35e788b0ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/ruvector-cnn/src/tensor.rs:244-260 | crates/ruvector-cnn/src/tensor.rs:263-279 | crates/ruvector-gnn/src/tensor.rs:195-211 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/tensor.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4330d9b7e72bf9f223d9f289b981677260549dcb885e94afe65230d22f92b390"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:1468-1484 | crates/ruvector-core/src/simd_intrinsics.rs:1490-1505 | crates/ruvector-core/src/simd_intrinsics.rs:1509-1524 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cabdfa4aa654d12f30b54f7f3facc5de4b34a4bb1499b1938a9b97a65bb73ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-decompiler/src/model_decompiler.rs:38-59 | crates/ruvector-decompiler/src/model_decompiler.rs:62-79 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_decompiler.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"42947b6878041897f9fbf1df9bfac89e1cecd8ff3640eb62ad450490baf3f901"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-graph/src/distributed/federation.rs:413-431 | crates/ruvector-graph/src/distributed/rpc.rs:169-194 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e570417d2fca6e90446aec88390e49a95cb09e394a46bac31458650641ccb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): crates/ruvector-node/src/lib.rs:442-452 | crates/ruvector-node/src/lib.rs:722-732 | crates/ruvector-node/src/lib.rs:742-753 | crates/ruvector-node/src/lib.rs:762-772 | crates/ruvector-node/src/lib.rs:781-791 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-node/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"99826707e4fb281ea29e28c2dd6b917da5f69a79a0bd3f732f086831b7cf49a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/ruvector-sparse-inference/src/backend/cpu.rs:216-231 | crates/ruvector-sparse-inference/src/backend/cpu.rs:325-339 | crates/ruvector-sparse-inference/src/backend/cpu.rs:343-359 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a208935affa6be007463b45643f0d248707c827b4c7ca3e2c08dc769e41471"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ruvllm/src/autodetect.rs:561-588 | crates/ruvllm/src/autodetect.rs:884-915 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aede42f24dc2a35d798a2ce789d33ed5ce488a8eaabb0e5fe68e51af71493f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ruvllm/src/evaluation/economics.rs:91-99 | crates/ruvllm/src/optimization/metrics.rs:109-120 | crates/sona/src/training/metrics.rs:54-64 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/economics.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"158c3bb6bdbb4fcbd4c26c73177bf32c6f59269bd4d5bf70ecfb669ec697d2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/rvAgent/rvagent-middleware/src/todolist.rs:91-113 | crates/rvAgent/rvagent-tools/src/write_todos.rs:19-49 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/todolist.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab90b4bc87adf8eab4c11ef18c63cf8f9de899088c3eb9f776b59a4425d6ee01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/device.rs:326-340 | patches/candle-core-0.9.2/src/metal_backend/device.rs:273-287 \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":"patches/candle-core-0.8.4/src/metal_backend/device.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d12309e5844b9eb8ccca1b6608e7f84805ccb4736c319f25df8ca7683f58b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-consciousness/src/pid.rs:293-306 | crates/ruvector-consciousness/src/pid.rs:314-330 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/pid.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa35d2c1c661d67cf0c09a926ca725d9e809a694203f9eb06160a5c52683ad93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-diverse-beam/src/lib.rs:17-28 | crates/ruvector-entropy-ann/src/lib.rs:54-66 | crates/ruvector-pq-search/src/lib.rs:86-99 \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":"crates/ruvector-diverse-beam/src/lib.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9a681350652b15594790815c796c154f5f29aea9f8c2940a79ba7becfbb0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvector-graph/src/storage.rs:229-241 | crates/ruvector-graph/src/storage.rs:306-318 | crates/ruvector-graph/src/storage.rs:399-411 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/storage.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d196b4b4aef463ed66cf6084bfde44edd0b1cc006739400820b8318e8708eb04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-kge/src/train/loss.rs:34-45 | crates/ruvllm/src/kernels/activations.rs:602-615 | crates/ruvllm/src/kernels/ane_ops.rs:635-652 \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":"crates/ruvector-kge/src/train/loss.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c1e8c94837782ff671463204a3e706c0c5b52a9fb617d7a9c973b6c6cb5bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-mincut/src/connectivity/polylog.rs:173-190 | crates/ruvector-mincut/src/localkcut/deterministic.rs:318-333 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/connectivity/polylog.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f21dcc52a7e33a1484e1179c25325bc82fb0cac40923b88ac670917fc75b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-mincut/src/snn/time_crystal.rs:340-352 | crates/ruvector-mincut/src/snn/time_crystal.rs:441-455 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/time_crystal.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3a98a4a33fdb90b94a79198cae40f87939a5543c181aeae72a4dff78fe029e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-postgres/src/graph/sparql/functions.rs:140-153 | crates/ruvector-postgres/src/graph/sparql/functions.rs:155-168 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/functions.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f418f959c65a714c845e508928228391e0384aa604c4c95e05c806a38b757f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-postgres/src/tenancy/isolation.rs:489-505 | crates/ruvector-postgres/src/tenancy/isolation.rs:508-524 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/isolation.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa675ca8a4d6419f6a26783519289e2fea57fa6a80d7188f6e98673bc9380ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-turboquant/src/simd.rs:86-95 | crates/ruvector-turboquant/src/simd.rs:97-108 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f4ff3e9274fdd4cd31f00beff15d862240bba61cd7656ea0813c6b800f7551"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvllm/src/quantize/quip.rs:289-296 | crates/ruvllm/src/quantize/ruvltra_quant.rs:407-414 | crates/ruvllm/src/quantize/ruvltra_quant.rs:462-470 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/quip.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"88933006333ce60ffaccb9de9e01f938e59ea3032841eeec0b73b38a1a834470"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/rvf/rvf-adapters/sona/src/experience.rs:205-219 | crates/rvf/rvf-adapters/sona/src/pattern.rs:152-166 | crates/rvf/rvf-adapters/sona/src/trajectory.rs:165-179 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/sona/src/experience.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"91084b71abf2c84211ee013736d35824e83b69126e7dc7c26912d6758ee4689a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rvm/crates/rvm-partition/src/manager.rs:67-83 | crates/rvm/crates/rvm-partition/src/manager.rs:86-103 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-partition/src/manager.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f806e99ad7f3369e83ebf6544dc879b251dffe89e06c25333bcd0d64e673c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/shape.rs:71-460 | patches/candle-core-0.9.2/src/shape.rs:71-460 \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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d0c5ff309199d8001514d1e1c7a438ea90cde4a7fc21012cf2e67576957843"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-consciousness/src/phi.rs:849-867 | crates/ruvector-graph-condense/src/cutloss.rs:400-412 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"954dceab87a018c3256cc2f90e7a87942a59a46747fa1179a6482a343b0cc2ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:1210-1229 | crates/ruvector-core/src/simd_intrinsics.rs:1234-1253 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa366e31ef36bb4b429c9333b501550d341a63cf768e911edf75ae1be33f4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-core/src/storage.rs:194-202 | crates/ruvector-graph/src/storage.rs:202-210 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"682f69c22329f5a7e46ef3efc95a82e5504637b99f4105e20ec1e423c3630fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-decompiler/src/model_gguf.rs:280-291 | crates/ruvllm/src/gguf/parser.rs:453-467 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_gguf.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"81da899946971b165bb37d0ad2347ca54a4a7d3c7ddb211c32f5f881618adfd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvector-fpga-transformer/src/backend/native_sim.rs:463-475 | crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:293-308 | crates/ruvector-fpga-transformer/src/quant/lut.rs:147-168 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e801e331efe62fc07b9921024ceb25135e3dc65648d925a546630accf9afc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-graph/src/cypher/semantic.rs:199-217 | crates/ruvector-graph/src/cypher/semantic.rs:397-411 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/semantic.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d70e5e34df7d414a6d792d7d6153d20593a073b94228c90da39ea557a468fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-graph/src/optimization/cache_hierarchy.rs:93-106 | crates/ruvector-graph/src/optimization/cache_hierarchy.rs:109-126 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/cache_hierarchy.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae38a621bc155a5cd8c4a2f2e71471f84d03ee455ff74f51a7075d8bf0d859bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-postgres/src/workers/lifecycle.rs:249-270 | crates/ruvector-postgres/src/workers/lifecycle.rs:273-289 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/lifecycle.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"969bf4178ad6bc394947ba927ba6ff573fda623f74b4df1e7ed9588a83213a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvector-turboquant/src/simd.rs:22-36 | crates/ruvector-turboquant/src/simd.rs:40-53 | crates/ruvector-turboquant/src/simd.rs:61-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"077ed6eb6a2453a610c1275f42f174a8f2b46c51e3fd3a28cf3ef0e6208aa9c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvix/crates/fs/src/block.rs:370-383 | crates/ruvix/crates/fs/src/block.rs:385-401 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/fs/src/block.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d952b640375a49a2442604f6fb367a023f60049d9102baf561847b5f4c6857"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): crates/ruvix/crates/vecgraph/src/simd_distance.rs:87-107 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:117-137 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:145-165 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:169-187 | crates/ruvllm/src/moe/affinity.rs:32-50 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"282876e1ce55a24fd5038d9fcac5470e936ab2fd713c4f8351a92dd120489786"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvllm/src/lora/adapter.rs:503-515 | crates/ruvllm/src/lora/adapter.rs:517-530 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/adapter.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a3239192e5c826446de4433c6a971898878e9402965635126d27a613f3b6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvAgent/rvagent-backends/src/composite.rs:94-107 | crates/rvAgent/rvagent-backends/src/composite.rs:164-176 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/composite.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe1a5e0c513572a8ab8478c528f66db20af8566a744800a7c3882207b146e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/sona/src/training/templates.rs:286-298 | crates/sona/src/training/templates.rs:324-336 | crates/sona/src/training/templates.rs:390-403 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/training/templates.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"31deebc5f2ae28c4b34275ba733031f0f75ae88efa22be6fc37669033735dbc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/prime-radiant/src/cohomology/obstruction.rs:122-131 | crates/prime-radiant/src/substrate/graph.rs:119-124 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/obstruction.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"636e7a4d849e7b651b06d518b71b8693b77b999c1842b34fefcc846688c3d6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-attention-node/src/training.rs:560-571 | crates/ruvector-attention-wasm/src/training.rs:220-231 | crates/ruvector-attention/src/training/optimizer.rs:292-302 \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":"crates/ruvector-attention-node/src/training.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3779de8191349110a4d9ae449b159bbbe4ab9ce0a6c79055e3e3f2c881648cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-context/src/index.rs:290-306 | crates/ruvector-context/src/index.rs:353-369 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-context/src/index.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"246245ec16eb7d1923e3f0cf63bbe8562d26963bda9fce3fbd055b8b4141792c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/ruvector-core/src/storage.rs:359-371 | crates/ruvector-graph/src/storage.rs:289-301 | crates/ruvector-graph/src/storage.rs:382-394 | crates/ruvector-graph/src/storage.rs:459-471 \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":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e874835a1e1166b4664cb070d2f49ccb5d79522b9123a082c27ffd14e2948be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-dag/src/dag/traversal.rs:67-82 | crates/ruvector-dag/src/dag/traversal.rs:112-127 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/dag/traversal.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ef6b42c9a52cd2af3f6ca47fe02a4cae1f5fd7bf5d1dc1ab219ce76e6cf203"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-gnn-node/src/lib.rs:220-234 | crates/ruvector-gnn-node/src/lib.rs:256-271 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn-node/src/lib.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb390c0b66143796e6aa79ba8a89602290f870a80c58ad06d1cb46dc48d11439"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/ruvector-hyperbolic-hnsw/src/hnsw.rs:317-339 | crates/ruvector-matryoshka/src/hnsw.rs:230-248 | crates/ruvector-matryoshka/src/hnsw.rs:250-268 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw/src/hnsw.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8ec396d95b76b8770c6f2fa0606da8d950246e8838cfe93f1f68b28b7ede86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/ruvector-mincut-gated-transformer/src/arena.rs:120-137 | crates/ruvector-mincut-gated-transformer/src/arena.rs:148-165 | crates/ruvector-mincut-gated-transformer/src/arena.rs:176-193 | crates/ruvector-mincut-gated-transformer/src/arena.rs:205-223 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/arena.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e5e3fc6b35e2757c854d85a257cbb6e9ed73735b57500b226275c0c0aa39c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-mincut/src/snn/synapse.rs:244-260 | crates/ruvector-mincut/src/snn/synapse.rs:263-279 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/synapse.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4913067ef80dcf0c59412c869d6d25d91675e780b1ebb0f4d38c7bfcd1bd00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-robotics/src/mcp/executor.rs:199-210 | crates/ruvector-robotics/src/mcp/executor.rs:231-242 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/mcp/executor.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1dea4d8784ffbd1c2934bf5bc3b4298f276d397769bee5e666360fc8273e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvix/crates/shell/src/parser.rs:133-149 | crates/ruvix/crates/shell/src/parser.rs:171-188 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/shell/src/parser.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dce1f5d547737afb0268d5b6f0e641403efe933726efefef6bfeac14ff01e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvix/crates/smp/src/barriers.rs:345-357 | crates/ruvix/crates/smp/src/barriers.rs:388-400 | crates/ruvix/crates/smp/src/barriers.rs:412-423 \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":"crates/ruvix/crates/smp/src/barriers.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75f5ef17c780c11d91a64182cf98528db6f65d776624830cea9a63c4f184b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvllm/src/quantize/quip.rs:279-286 | crates/ruvllm/src/quantize/ruvltra_quant.rs:397-404 | crates/ruvllm/src/quantize/ruvltra_quant.rs:452-460 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/quip.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cefb3d0ab0aafc86a589391b03ef837bbdc5e43710ecd08debcd3eb7cbc3ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/ruvector_integration.rs:933-950 | crates/rvf/rvf-adapters/agentdb/src/index_adapter.rs:206-221 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/ruvector_integration.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0db4ac261c009d35d51606688f60eb42fcd3f54b301e29e4d82a0ae1294dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rvm/crates/rvm-hal/src/aarch64/boot.rs:90-114 | crates/rvm/crates/rvm-hal/src/aarch64/boot.rs:155-174 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/boot.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4401a6ed2096a1f84582d274bbc7e89ad1c3ea9497184c5dc1bcce11409164f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/sona/src/training/templates.rs:305-317 | crates/sona/src/training/templates.rs:450-462 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/training/templates.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cfc72365512624b8de1a30e88a26be13076075a94aab4aae7cb4b10a86cc51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 6\u002B corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:2456-2461 | patches/candle-core-0.8.4/src/tensor.rs:2464-2469 | patches/candle-core-0.8.4/src/tensor.rs:2472-2477 | patches/candle-core-0.9.2/src/tensor.rs:2779-2784 | patches/candle-core-0.9.2/src/tensor.rs:2787-2792 | patches/candle-core-0.9.2/src/tensor.rs:2795-2800 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c64e8ec74c808cfe557aa12c767627f966aeb401bfafa1ad10ad446103386a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-dag-wasm/src/lib.rs:213-226 | crates/ruvector-dag-wasm/src/lib.rs:245-258 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag-wasm/src/lib.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a0650ad7ae1ac0ee2d954e0788d6c00098ad3a2b3f768788dfed7ca547cf0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/ruvector-decompiler/src/model_decompiler.rs:210-225 | crates/ruvllm/src/gguf/loader.rs:333-346 | crates/ruvllm/src/gguf/tensors.rs:70-83 | crates/ruvllm/src/gguf/tensors.rs:267-279 \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":"crates/ruvector-decompiler/src/model_decompiler.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598ff7a68cdff3a455f82a0e38bcff9a4b35001e0a6f8fa6c4689a026cf36b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-diverse-beam/src/graph.rs:59-67 | crates/sonic-ct/src/memory.rs:167-179 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/graph.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1909e2ea8a9e9e4234fd76cc5012a52572e89abeeb17549417e0846c2e49c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-mincut/src/fragment/mod.rs:114-132 | crates/ruvector-mincut/src/snn/causal.rs:211-227 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/fragment/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac31838264566b535b3d625d044e6180eb2f248d829f97da3a42d27ba87e65a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-mincut/src/optimization/parallel.rs:212-235 | crates/ruvector-mincut/src/parallel/mod.rs:138-157 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/parallel.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"844074f9ee589df6b22f9d7d1d4cec2c26c95d3d3daf36d5598033d7539612cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-proof-gate/src/gate.rs:171-186 | crates/ruvector-proof-gate/src/gate.rs:307-322 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-proof-gate/src/gate.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b056b27c8421f02bb4712d7b1a60bf1af63c5412255b8efb50f35b906d6e57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-solver/src/simd.rs:118-130 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:485-500 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dc844e33901c9b967da6ffba7201fe8a2f2a083b74b3c8eac58cfce19e51cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-sparse-inference/src/model/runners.rs:473-490 | crates/ruvector-sparse-inference/src/model/runners.rs:492-507 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/runners.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e4b8f930028967bdf8c231792307da18de492e27849749f4953f3bd6b01248"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/context/working_memory.rs:202-219 | crates/ruvllm/src/context/working_memory.rs:222-236 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/working_memory.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"155e7bdb290915634ebcdbb31be55a7b876ebedf107c6937235e5f43a24087a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rvAgent/rvagent-backends/src/filesystem.rs:713-724 | crates/rvAgent/rvagent-backends/src/filesystem.rs:732-747 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"78041d4e2ad3e5d7f6381509bc4e59218ff7d4f97802198e9a11427941ad93d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvAgent/rvagent-core/src/bootstrap.rs:164-176 | crates/rvAgent/rvagent-core/src/bootstrap.rs:178-190 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/bootstrap.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb6439ed820664c3ffba1a7a1e64d85a65f78f1f0e74b5c7f391aa462bdcf5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/rvf/rvf-cli/src/cmd/filter.rs:150-164 | crates/rvf/rvf-cli/src/cmd/freeze.rs:78-86 | crates/rvf/rvf-cli/src/cmd/rebuild_refcounts.rs:154-162 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/filter.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faafe8d2504c9f101d2b0bf5ae2dc0e26c7c82d5642a5ae41f145eebd383a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): edge/gateway/src/graph_routes.rs:175-184 | edge/gateway/src/graph_routes.rs:192-203 \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":"edge/gateway/src/graph_routes.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f973a1757da40bb78f6424e3c72514f61976b19bb87f6ba19fcae6abc2718d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/npy.rs:246-254 | patches/candle-core-0.9.2/src/npy.rs:273-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":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcb24b8f23f95aa7cf2a12debfebb53dd13d153dc94ccb5d4abe86ce7f500ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:224-235 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:240-251 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fb9993d7d5e5ed949e2d83cb553af953a3dd933dff172fe595a6f06d99293a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:618-629 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:649-660 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"334bf2e98c1a602f852877d90a3865e05567c67b0ddae9b9d920b2b61e9dd6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:704-715 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:754-765 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f558be9a1b06cafc05c57a02889a32b115bb771ee4d3193398db58063ba027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1158-1169 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1359-1370 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bb20b4356a566008c1e6f5944031f71aa8f2eae0d0c344b0fd2bd531c01ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1572-1583 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1917-1928 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"608930216519bc853b1a1984821e6ccbdfa6efb89d6769de8eed4aa0e9941f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1755-1766 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2182-2193 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"89252e46d0c12d73ad52147fb1151ab12f140cb9cdabf0fcbb31ea9241f8e9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:1116-1123 | patches/candle-core-0.9.2/src/tensor.rs:1184-1191 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4151d984d86b4a896e40585caff7d9eb3cecf015b378c247986478fd47916e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:2168-2174 | patches/candle-core-0.9.2/src/tensor.rs:2491-2497 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"012d4b683bbd059ac82ef1a98f576f77948508c3092b8d6d4d3d0fd3e4eada25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/emergent-time/src/complex_matrix.rs:89-101 | crates/emergent-time/src/real_matrix.rs:84-96 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/complex_matrix.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4627aef491ccf9768e28cbfce1b6ff90c6abb33b36c43c114592e19b63507e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/prime-radiant/src/storage/file.rs:704-714 | crates/prime-radiant/src/storage/file.rs:724-734 | crates/prime-radiant/src/storage/file.rs:757-767 \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":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac6c072dbf57f8474931c758c04c5c2944a4913814684d58ad1bd2836283728"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-fpga-transformer/src/ffi/c_abi.rs:263-278 | crates/ruvector-fpga-transformer/src/ffi/c_abi.rs:282-294 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/ffi/c_abi.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d4dbd79ac88da01a8fac1471123d4ee2db6240f98219b9065665b7c185b989"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-gnn/src/ewc.rs:130-150 | crates/ruvector-gnn/src/ewc.rs:164-183 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/ewc.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"79477254e3f779b4f70db2cafe46d5d58e0859f98ac3768f413c1609e083bebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-graph-condense/src/gnn_eval.rs:121-135 | crates/ruvector-graph-condense/src/gnn_eval.rs:137-151 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/gnn_eval.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d951d3847d0631c68927ea7509d98671af777cebd6a0fdf7bb26923311fe13b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-graph/src/optimization/simd_traversal.rs:291-310 | crates/ruvector-graph/src/optimization/simd_traversal.rs:337-356 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/simd_traversal.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b77ac2c6924eb86050fde8d48fb2210bd55e0771dcafd7f6db61199f4fcbc18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-kge/src/optimize/receipt.rs:82-97 | crates/ruvector-typesafe-core/src/receipt.rs:208-218 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/optimize/receipt.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e91132ba37c72dcb11d6babbadeede34c64b543f132619afbfa5c8a9a75ac82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-kge/src/scorer/fft.rs:113-124 | crates/ruvector-kge/src/scorer/fft.rs:127-138 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/scorer/fft.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5e6838b4bf4c393204dfcbe2c25a4ade2b5cf43d3896164b17fa1005ad564c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/ruvector-sparse-inference/src/model/gguf.rs:134-150 | patches/candle-core-0.8.4/src/quantized/mod.rs:173-190 | patches/candle-core-0.9.2/src/quantized/mod.rs:296-315 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba18bf07be37643f9ffdf6fa916d2d4185b8865075d3b8dd3d9966ae0cb7c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 16\u002B corresponding lines): crates/ruvix/crates/cap/src/optimized.rs:264-285 | crates/ruvix/crates/cap/src/optimized.rs:289-307 | crates/ruvix/crates/cap/src/optimized.rs:345-367 | crates/ruvix/crates/cap/src/table.rs:210-225 | crates/ruvix/crates/cap/src/table.rs:228-243 | crates/ruvix/crates/cap/src/table.rs:248-271 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/optimized.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0931a440249945aaf683bcc8ba8aa3c81de5cfef86eccfe0eb6dc229ab1f9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvllm/src/backends/phi3.rs:216-228 | crates/ruvllm/src/models/ruvltra.rs:451-463 | crates/ruvllm/src/models/ruvltra_medium.rs:509-522 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce16efd5ca5b9c28e3d9bc9f89492cf367027ae558ec84f468fc11ac0c203264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/sona/src/engine.rs:207-225 | crates/sona/src/engine.rs:229-246 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/engine.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d74cf645ac0f9792cee2f1a6898210a3af884faeac2d68dfcb2911e149018b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): edge/gateway/src/durable.rs:252-261 | edge/gateway/src/durable_m4.rs:47-56 \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":"edge/gateway/src/durable.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"425a56c1ac264d7d35a5becc0c4951f0ead8c5a3211f990816ee701d897f1630"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2109-2122 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2110-2121 \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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04daa82bee0a376e1aecd2ffd8cc114427fb4ff88a076b75e14985d600c6ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/op.rs:911-919 | patches/candle-core-0.9.2/src/op.rs:1076-1084 \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":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"9104c88fb3c7d512694f83751eaf842475e94e65eeea9ecf7d7d8d3322a9a6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 14\u002B corresponding lines): crates/mcp-brain/src/tools.rs:484-499 | crates/mcp-brain/src/tools.rs:594-608 | crates/mcp-brain/src/tools.rs:756-769 | crates/mcp-brain/src/tools.rs:812-825 | crates/mcp-brain/src/tools.rs:854-867 | crates/mcp-brain/src/tools.rs:894-907 | crates/mcp-brain/src/tools.rs:935-949 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"374455d84317da7a089f407460a766435701cb9d077726c87cd43915ed46fdcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvector-attention/src/sheaf/restriction.rs:158-181 | crates/ruvector-cnn/src/layers/linear.rs:54-74 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/restriction.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d55aaf23b1f36b3aea40fc020f094456d41173315f66853c60e730a09b3d969"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-bench/src/lib.rs:248-262 | crates/ruvector-bench/src/lib.rs:264-276 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/lib.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1695470989c117ee2ed6772e326b0ee28ad3814be3e796f747647a33bbe3230"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-graph/src/hybrid/semantic_search.rs:50-72 | crates/ruvector-graph/src/hybrid/semantic_search.rs:134-151 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/hybrid/semantic_search.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa8223e4cf01634e71158d103111f0a5612666d5138b834a955dbe5f776c1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-postgres/src/healing/mod.rs:84-97 | crates/ruvector-postgres/src/healing/mod.rs:100-112 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5742bd5095bac17484b963edd5057ef4730d5741bbb7c63959832a6818a9230"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/ruvector-router-core/src/distance.rs:25-50 | crates/ruvector-router-core/src/distance.rs:98-119 | crates/ruvector-router-core/src/distance.rs:123-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/src/distance.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"80da2adac555a8dd4dd40cf0366a4ff5c322b556937d83a286908166e5d6af92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvix/crates/cap/src/table.rs:283-301 | crates/rvm/crates/rvm-cap/src/table.rs:332-346 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/table.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3e62fdc5805b3ec15d2ad642619eda168ec00661716e6bf90283d7d98faa2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvllm-cli/src/commands/benchmark.rs:444-457 | crates/ruvllm-cli/src/commands/chat.rs:658-671 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/benchmark.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2952b45e24657e3da10076305dcc88f8081f67fae2fe24f3a2faf044f166e2e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvllm/src/kernels/attention.rs:495-505 | crates/ruvllm/src/kernels/attention.rs:536-546 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b3a7dd8571adfbd6f1687a3e6aca244a186c0152b5a815040dd6a652c975bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvforge-registry/src/registry/mod.rs:490-497 | crates/rvforge-registry/src/store.rs:205-212 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/registry/mod.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69bcd356f0f84086ee64d584efc02689c56f2bfd4b2fbb87cd75662102079da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/shape.rs:71-454 | patches/candle-core-0.9.2/src/shape.rs:71-454 \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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"830730bc1b41272e06558658aec23bc3cdb2d023140f86fb6b2107d1531f6647"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:716-723 | patches/candle-core-0.8.4/src/tensor.rs:726-733 | patches/candle-core-0.8.4/src/tensor.rs:736-743 | patches/candle-core-0.9.2/src/tensor.rs:784-791 | patches/candle-core-0.9.2/src/tensor.rs:794-801 | patches/candle-core-0.9.2/src/tensor.rs:804-811 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"7286d9f47d765859813b16d10ceee4c6f9ecbdea06cebfdf1f9bf6e691304c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/prime-radiant/src/coherence/engine.rs:546-561 | crates/prime-radiant/src/coherence/engine.rs:564-577 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f174b259579560d8595d24b63bce8e956c75ae0fda7224a1309a56191f8448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-attention/src/attention/ssm.rs:104-113 | crates/ruvector-sparse-inference/src/ops.rs:174-183 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/ssm.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d7de6d7ba656d24eda1987429193fdef47ada6ed2a8b99b25aac30bc491d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruvector-bench/src/bin/ann_benchmark.rs:153-169 | crates/ruvector-bench/src/bin/ann_benchmark.rs:171-184 | crates/ruvector-bench/src/bin/ann_benchmark.rs:186-199 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/ann_benchmark.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"41399934625ce70d88e95dbcbe36ca8b0063b7f010770338db5daf14d8426d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-cnn/src/backbone/layer.rs:113-133 | crates/ruvector-cnn/src/int8/kernels/scalar.rs:20-36 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/layer.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9517b9586cef41af93ea12b4683b919bbaa52cddfd5ba64dc9425c2b793ccf77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-dag/src/healing/strategies.rs:38-54 | crates/ruvector-dag/src/healing/strategies.rs:79-94 | crates/ruvector-dag/src/healing/strategies.rs:111-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 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/healing/strategies.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c50d642cc32394c6b6c09ed230447635614c3187d47edb0b8f1ba54961f114"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-graph/src/transaction.rs:215-227 | crates/ruvector-graph/src/transaction.rs:230-242 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/transaction.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c88565724caad85203105cce852bea26d819f5fc0d65f0f2ca202e0ac7d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-hybrid/src/dense.rs:33-51 | crates/ruvector-kge/src/ann.rs:114-129 | crates/ruvector-kge/src/batch.rs:69-86 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hybrid/src/dense.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c0b50f51aebadfd788eb5671551ac0e8ce7561a598ba1b50b149966a030f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-mincut/src/optimization/parallel.rs:509-522 | crates/ruvector-mincut/src/optimization/parallel.rs:537-546 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/parallel.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bf388f1b352c183d51099917180079603d825ee2bb8ef6b32226ac6733ae37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-postgres/src/workers/lifecycle.rs:608-622 | crates/ruvector-postgres/src/workers/lifecycle.rs:625-639 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/lifecycle.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfd81d069346e2a3214ba51b57c7c5fec77bedde2c44ed77a83ef2ea34880e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-turboquant/src/score.rs:68-76 | crates/ruvector-turboquant/src/score.rs:80-86 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/score.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae2adc5bead841d93445e4f207857892bc9d2097e229b4b4c2987e446a1b1ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/claude_flow/pretrain_pipeline.rs:1286-1301 | crates/ruvllm/src/claude_flow/task_generator.rs:1044-1058 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/pretrain_pipeline.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c17f88a8e29da27401032e008b7ffca0b3103e58008b1249413859c63822b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvllm/src/kernels/norm.rs:44-61 | crates/ruvllm/src/kernels/norm.rs:204-222 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/norm.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2841b3ed0c263f76df09369968996145e6c0ba0d46b06c831005aa6a596477e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvllm_sparse_attention/src/attention.rs:1786-1797 | crates/ruvllm_sparse_attention/src/attention.rs:1809-1821 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"95157b885d9a068da95febfc4a7732cd9ae4c4b2a087237f0bffd8849ec178ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvforge-reader/src/install/layout.rs:72-79 | crates/rvforge-reader/src/library/registry.rs:389-396 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/install/layout.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77b04eb633bb453b91aad19c6dac125fed09fca46333d1d111556d0e42d6c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvm/crates/rvm-witness/src/seal.rs:134-141 | crates/rvm/crates/rvm-witness/src/seal.rs:158-166 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/seal.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4063018d3f52b658b496e03dd8044df89fb3bad017ed230b2d80f457fdca3636"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/mcp-brain-server/src/types.rs:1205-1217 | crates/mcp-brain/src/embed.rs:98-107 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04e36a01fa56854f83e3371967b6720852d7ff6df5db58bdb915f396d00d34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/mcp-brain/src/server.rs:57-71 | crates/mcp-gate/src/server.rs:128-143 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a96448517d22cb584cf50f30e2011b29b6d21dbff39043ed73da8d4f770ad31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/prime-radiant/src/mincut/mod.rs:122-142 | crates/prime-radiant/src/mincut/mod.rs:145-160 | crates/prime-radiant/src/mincut/mod.rs:163-180 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7abe9c3c9d88d58e0baa1f89037d8739b2ccd00f7ac42cc9861f5d5dd8a515e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-agent-memory/src/arbitration.rs:588-598 | crates/ruvector-graph-condense/src/regions.rs:173-185 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/arbitration.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"5367a2598a084da9b2ca26db1b47bcb2d496508b8a3caf3b2c7591ca92669c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-cnn/src/layers/batchnorm.rs:64-74 | crates/ruvector-cnn/src/layers/batchnorm.rs:77-87 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/batchnorm.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2769b8c1fdb5f935ce7bb573fb35c9da59da39e5f04b8ed4a6125c2f17aaa931"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-e-means/src/ivf.rs:144-154 | crates/ruvector-e-means/src/quantization.rs:163-180 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-e-means/src/ivf.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eefeed6119c2daf4349249c25af8b61215f003d495f0966c42582f14f5db7d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:876-894 | crates/ruvector-postgres/src/graph/operators.rs:993-1010 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"6498e59be555a4bffdea4f765d464fe996e79580de978cadf593a6595144c4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-postgres/src/graph/sparql/triple_store.rs:496-512 | crates/rvlite/src/sparql/triple_store.rs:367-384 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/triple_store.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b2289a836098affc903a6d17ddc14d22e52705a14e42349c2f341ae909135f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-postgres/src/tenancy/registry.rs:375-389 | crates/ruvector-postgres/src/tenancy/registry.rs:392-406 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/registry.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f81ae30f80371e1cd88f015478ea6bd4a403cf6ad95c68a9c1b685fb029a834"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/ruvix/crates/nucleus/src/graph_store.rs:222-238 | crates/ruvix/crates/nucleus/src/graph_store.rs:241-257 | crates/ruvix/crates/nucleus/src/vector_store.rs:354-370 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/graph_store.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2042f9a27b150a9fa268624e0183e0732a9eba9cba9c49b95215ff1d6e981d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/ruvllm/src/gguf/quantization.rs:473-489 | crates/ruvllm/src/gguf/quantization.rs:513-529 | crates/ruvllm/src/gguf/quantization.rs:646-662 | crates/ruvllm/src/gguf/quantization.rs:796-812 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dfbcdeb367c0285f776246dab0144bf37b3f190b38f9fe60bbe972405ddf3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/policy_store.rs:308-323 | crates/ruvllm/src/policy_store.rs:332-347 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/policy_store.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc982b55e9bd642bae1c1f38a5603bfbbb1c7ca905805a5f3437bad637c8f4a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): crates/rvAgent/rvagent-wasm/src/rvf.rs:245-255 | crates/rvAgent/rvagent-wasm/src/rvf.rs:268-278 | crates/rvAgent/rvagent-wasm/src/rvf.rs:291-301 | crates/rvAgent/rvagent-wasm/src/rvf.rs:305-315 | crates/rvAgent/rvagent-wasm/src/rvf.rs:319-329 | crates/rvAgent/rvagent-wasm/src/rvf.rs:333-343 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/rvf.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc79dc46fe69a06aaaa2d14f1d819625df693ba03cb7f7caaa784c152e23e9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/sona/src/wasm.rs:70-80 | crates/sona/src/wasm.rs:104-116 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/wasm.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8b0bb6aaea4712c0399dbc400063c14c6e1a18f9a346d1fab09175575e14d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:568-584 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:599-615 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"8192bb2e41beddb686425fd3668efcef0381b67b1145a469a710773f6af96045"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/cognitum-gate-kernel/src/shard.rs:447-470 | crates/cognitum-gate-kernel/src/shard.rs:480-494 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/shard.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"254e5f494fdd38986100e7c998d7f19b662fddc075d13a8c4975c795d9e88f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:90-101 | crates/ruvector-mincut/src/snn/synapse.rs:338-353 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b6e9f940f169dc7e5afa0b4be4c73f19d9279353e89a99d56e644d853c99f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-attention/src/utils.rs:188-197 | crates/ruvector-attention/src/utils.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":"crates/ruvector-attention/src/utils.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3977b3a993968e45c195a2668ad7da185ccf57145f4b4c5762288dc2402f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-delta-core/src/delta.rs:216-226 | crates/ruvector-delta-core/src/delta.rs:229-237 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/delta.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b54b430fa3476ad7b1009ec8c4fabf9e01d737ed50648c8592e1a14c644f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-kge/src/data.rs:411-421 | crates/ruvector-kge/src/data.rs:439-449 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/data.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"16698af1f058ae4252aba7ce4e3acd6b9589841d8fb291f49fd414529f33a5ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-lsm-ann/src/lib.rs:94-102 | crates/ruvector-lsm-ann/src/memtable.rs:55-64 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-lsm-ann/src/lib.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df46c4ea9f1e5cf7bb76d19cf32bd08c7346fdd1f8e775bffe0e97ee71619b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-verified/src/vector_types.rs:29-40 | crates/ruvector-verified/src/vector_types.rs:72-89 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-verified/src/vector_types.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2971988b1adaf9ca673576bda3847dd14613c5becdc58c1dba30faeb1c9e4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/models/ruvltra.rs:405-420 | crates/ruvllm/src/models/ruvltra_medium.rs:445-466 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fbdba3cccf2713cf486e1cfb475072985c430aea3684e9aa84ea0a02ccf0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rvm/crates/rvm-witness/src/seal.rs:593-606 | crates/rvm/crates/rvm-witness/src/seal.rs:622-635 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/seal.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"089a895aa67a1853b2fa6ad10ae0b29f7a9fe5534eda2ac91fa5ed19413e0f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-465 | patches/candle-core-0.8.4/src/mkl.rs:393-407 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8615614d7c38bb56f6ef5cdf8daa8a4dfa58c9fb8613d77599688c3e4c33ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-466 | patches/candle-core-0.8.4/src/mkl.rs:393-408 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ec3cf1af3f80ad074aa36e7c33fa437128777b681ae855037ba4b0cfd480e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-467 | patches/candle-core-0.8.4/src/mkl.rs:393-409 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b665e55ec41ea007962311d938932e45b6b50aa309975a93bfe311c5157fe3ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-468 | patches/candle-core-0.8.4/src/mkl.rs:393-410 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f905ad57615e8be973dc54385379100eea15e43cf608cd98a34d116e7e850a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-471 | patches/candle-core-0.8.4/src/mkl.rs:393-413 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bec5adada186e80b7fee5d3b61a4006e751cb39181d1ebadc09a26b3d180fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-472 | patches/candle-core-0.8.4/src/mkl.rs:393-414 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d68f2e182da61a58b0cfa672a17c4d3b484c3d20bc8ea2c80f619fed9adee2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-473 | patches/candle-core-0.8.4/src/mkl.rs:393-415 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fc135727e77f763ed544fe9ab4b1a4af349733123ceb8aec20c0810d992afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-474 | patches/candle-core-0.8.4/src/mkl.rs:393-416 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"4552a9c8eec4aac43ba816b37bedcd44550b1dfa3ff86accd50b80ce911eb6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-475 | patches/candle-core-0.8.4/src/mkl.rs:393-417 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c584cab1b51ec53d17513ddc74c436ded25a4de9926f1d175d3b590fe9c2084a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-476 | patches/candle-core-0.8.4/src/mkl.rs:393-418 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbeea9ce8179fea8956d71dede113968cbc1af33485eb22dadce199e4047473"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-469 | patches/candle-core-0.8.4/src/mkl.rs:393-411 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c94f72458152cfe38053f984be25fb973d604255446f29cc9f54dcf29542ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:440-470 | patches/candle-core-0.8.4/src/mkl.rs:393-412 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9774279e797b4218a377c8a9869619733842ba52a82b15a9059522ea41ff51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:110-116 | patches/candle-core-0.9.2/src/quantized/mod.rs:222-228 \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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9041d8b890c31ee62a6e44a722d72257805c1bda4fcdcd1068a4b0b4947141de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.9.2/src/tensor.rs:185-192 | patches/candle-core-0.9.2/src/tensor.rs:444-451 \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":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1add61e73f1075ea6e3d696fc5206869597435b88f17f828dbcab64e7cc2a9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/mcp-brain-server/src/voice.rs:224-232 | crates/ruvector-robotics/src/cognitive/memory_system.rs:42-54 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/voice.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"809bb127a480dc161090a39c11f48a729cd3e1abb3962ecf990b08249b6a1c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-cluster/src/shard.rs:290-303 | crates/ruvector-domain-expansion/src/meta_learning.rs:555-561 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/shard.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7ce12f2a2aebbba8f05e477683adbc5d70f6aa0f1fa077e39a6984d55731b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-dag/src/attention/cache.rs:155-167 | crates/sona/src/reasoning_bank.rs:388-403 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/attention/cache.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea31c8a588ab1adb24182a6986df50dfea01cb38cd2ad720dac6d5117ceead8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-graph-transformer-wasm/src/lib.rs:186-191 | crates/ruvector-graph-transformer-wasm/src/lib.rs:310-315 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/src/lib.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36041f01acc79e5e8f68311687860685184eb9b0882799e266f1c4cda97d316"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-kge-ffi/src/ops.rs:45-52 | crates/ruvector-kge-wasm/src/ops.rs:45-52 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f689ff1a3ee66b88b103803a3d330e90b52bd47e86fe9cd7de806be4c06ec38a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-math/src/spectral/graph_filter.rs:45-60 | crates/ruvector-math/src/spectral/graph_filter.rs:63-78 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/graph_filter.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13bd8edfe9b323946f31de7762bc69e7354f1ded3ccd9f923c0e4739c8aedfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-mincut/src/snn/neuron.rs:463-472 | crates/ruvector-mincut/src/snn/neuron.rs:475-486 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/neuron.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7b3e2626ec8a889166671be40da6d42452fa7271b1e3e14dc7b23ae9ec873c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-postgres/src/distance/scalar.rs:38-58 | crates/ruvector-postgres/src/distance/scalar.rs:198-214 | crates/rvf/rvf-index/src/distance.rs:30-45 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/scalar.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8958099c3ffae5c70c0bc93126570b1084ff76e896810b1eb695c5e144fbed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvllm/src/reasoning_bank/trajectory.rs:243-261 | crates/ruvllm/src/reasoning_bank/trajectory.rs:264-280 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reasoning_bank/trajectory.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc2de51e4b447699d7f9fb454d64c006f110867687fa07dfe30eb9d7948205e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/sona/src/napi.rs:79-87 | crates/sona/src/napi.rs:94-100 | crates/sona/src/napi_simple.rs:244-253 | crates/sona/src/napi_simple.rs:260-268 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/napi.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c8aaa062b21b86bab147c5a099940f6a141b6ac6f92c57902088eb5ec98a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): patches/candle-core-0.8.4/src/custom_op.rs:183-189 | patches/candle-core-0.9.2/src/custom_op.rs:183-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":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04becde2719868eaa5164397cad78ee2c9c26c024f020ad77cb238d42ae1cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:460-469 | patches/candle-core-0.8.4/src/tensor.rs:509-519 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a9b66f62ae107823b0d1638bd62d60f95c557b83556e1fd419cafb8ab7e3b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/prime-radiant/src/substrate/node.rs:143-157 | crates/prime-radiant/src/substrate/node.rs:161-175 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/node.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fd7740a992a976caaef316c8e6e73a4cc5a772d817f1755b2b721691faf717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-attention/src/info_bottleneck/kl_divergence.rs:115-129 | crates/ruvector-attention/src/info_geometry/fisher.rs:145-158 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/info_bottleneck/kl_divergence.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5555ac07b77c8f2ffa83bfaabde9d823c4fcc45748d4612d13bdeb8edabf1a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-core/src/advanced_features/compaction.rs:316-327 | crates/ruvector-core/src/advanced_features/compaction.rs:330-341 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/compaction.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a40760944633d0bab8347c2a3e0ae964a8563999cb92075acc8744d8f78d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-graph/src/cypher/parser.rs:887-900 | crates/ruvector-graph/src/cypher/parser.rs:1050-1063 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3909f81fc7342f6644602b911aaaec7c47771cfdda71aa9afdc85149df508a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-maxsim/src/bucket.rs:78-94 | crates/ruvector-maxsim/src/flat.rs:42-53 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-maxsim/src/bucket.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d954bf9f6900b8967450d7b427ca2eea2f7e2386d3ed04c5b2753d08029cb698"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-mincut/src/subpolynomial/mod.rs:642-659 | crates/ruvector-mincut/src/subpolynomial/mod.rs:662-679 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1ac9db06555ff8bbf4ac4ccfae30307a90324ac5211f2a1a43bace6905784a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-nervous-system-wasm/src/btsp.rs:29-52 | crates/ruvector-nervous-system/src/plasticity/btsp.rs:76-93 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/btsp.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c6d60435fa445a34e66876fb23b2a78814fa4d3b25e778e1a3b4df765ded2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-postgres/src/gnn/operators.rs:315-330 | crates/ruvector-postgres/src/math/operators.rs:13-25 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gnn/operators.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"db80b698265b01bfd37f17340ebfa1ad10d3b754defe48665898eb64704abd50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-postgres/src/types/mod.rs:351-364 | crates/ruvector-postgres/src/types/mod.rs:439-450 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/mod.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a792fe7597f6f40da65f623fd6816a5249c093d258f132b50e937981f12f86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-postgres/src/workers/engine.rs:795-812 | crates/ruvector-postgres/src/workers/maintenance.rs:601-618 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/engine.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"9999a9da0e9fea5614509504d389a9a99ad778a863e3ba335e56f9366684ddba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-replication/src/failover.rs:123-131 | crates/ruvector-replication/src/failover.rs:134-142 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/failover.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab56102edc5d7e2da82ce44efbff3bdcaac8275dab828f938815ea84de404b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-sparse-inference/src/backend/cpu.rs:120-131 | crates/ruvector-sparse-inference/src/backend/cpu.rs:133-144 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0551db6b62ba9702f9867dd17680fe145754dc4d18bdf994e83e89442f46df56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvix/crates/net/src/ethernet.rs:307-317 | crates/ruvix/crates/net/src/udp.rs:77-88 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/ethernet.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc3b416888ec59c050d117ded0ea4cb15eac5574207aea4e30d5b59b94a88a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvix/crates/smp/src/barriers.rs:281-292 | crates/ruvix/crates/smp/src/barriers.rs:303-314 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/smp/src/barriers.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a15aa941284684aca00fbfc5553cf30d69f7822831a99ce11c74320bcd8c55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rvAgent/rvagent-core/src/budget.rs:161-174 | crates/rvAgent/rvagent-core/src/budget.rs:177-190 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/budget.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9d34793fbc8d658e22fefaf302a4053058fabfcec091936349ed2e3702bb6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): edge/gateway/src/blob_r2.rs:54-58 | edge/gateway/src/m3_ports.rs:171-181 \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":"edge/gateway/src/blob_r2.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eb5bd30e721090e81fe839f8cfaeabf5f1aa611a0420b49fa1faa12f91cde5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): edge/gateway/src/ledger_admin.rs:373-380 | edge/gateway/src/shard_wipe.rs:98-105 \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":"edge/gateway/src/ledger_admin.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26e266bb76d5174903f3b59abf98de4557c77253940b9a5f9b5ced59c77c2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:867-871 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:190-194 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1063-1067 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:222-226 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"43106bbe71d83be9fdac710f18c9a91db4b439bde882e4061b0a1c950746baa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/shape.rs:71-450 | patches/candle-core-0.9.2/src/shape.rs:71-450 \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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"af214a972f4a8f6e08e0178de6598136ead5129ff177859a4e11cdb749b43178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/prime-radiant/src/storage/postgres.rs:513-539 | crates/prime-radiant/src/storage/postgres.rs:674-698 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/postgres.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3406a2c0a42894babed27b15fb5d9660edd47d163c2d6fde9272f5edf951c594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-attention/src/hyperbolic/poincare.rs:121-132 | crates/ruvector-graph-transformer/src/manifold.rs:1215-1225 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:173-185 \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":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db7a66de45f8dae3fd9f05fd7028b4b206d510caad8132c9682724eea016d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruvector-core/src/advanced/neural_hash.rs:213-228 | crates/ruvector-core/src/quantization.rs:386-400 | crates/ruvector-postgres/src/quantization/binary.rs:9-22 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced/neural_hash.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"39aa6892ed097c1dfed177051d33cb1fd7755ae0d2adcb81de77db0ef67017c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-core/src/distance.rs:108-122 | crates/ruvector-kge/src/train/par.rs:12-22 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/distance.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7ee5aacc9a48e97fae097b7b402c4176657eff7d95f2f9d8f264413c0d13e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-kge-ffi/src/model.rs:282-288 | crates/ruvector-kge-wasm/src/model.rs:282-288 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13dfab20e2f986457472ebb88e228f41eb002561118cce6a7d3c9946a566930"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-mincut-wasm/src/routing.rs:98-108 | crates/ruvector-mincut-wasm/src/routing.rs:169-185 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-wasm/src/routing.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fbd08518e300eda6dab09c72966ecffc399bdde6d9f6e4ce30153693e504d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-mincut/src/canonical/mod.rs:1162-1180 | crates/ruvector-mincut/src/canonical/mod.rs:1182-1196 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fc7d4260e92f8b52057079bd084c6b0c6f2ca62927444d932dcd4abd7bb993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-postgres/src/learning/patterns.rs:296-305 | crates/sonic-ct/src/bin/serve.rs:144-150 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/learning/patterns.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"638028b0a2dcc4c44330bfaddef347613e5f317c38446f04a1a58330d575eca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-py/src/graph/convert.rs:76-85 | crates/ruvector-py/src/hnsw.rs:118-127 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph/convert.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2a3f276c72fefc3ef864305a5f740e5be79d96c44470d36e6cf9c0812862e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-sparse-inference/src/model/runners.rs:117-129 | crates/ruvector-sparse-inference/src/model/runners.rs:132-146 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/runners.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bf28308bff918dcf49e5ab42c6167965288301f5f3ff4c169b97f0ed7e2b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvix/crates/cli/src/commands/keys.rs:864-875 | crates/ruvix/crates/cli/src/commands/keys.rs:877-888 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/keys.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d366189f2ba9a9f02229e431f191a071c3ccc6f100b048a652564224987a704e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvix/crates/fs/src/block.rs:75-86 | crates/ruvix/crates/fs/src/block.rs:97-108 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/fs/src/block.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1485d23cbffaa2caf8f69bea36660981c3490649f3168b0a6ea620fd72511ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvllm/src/evaluation/harness.rs:182-193 | crates/ruvllm/src/evaluation/real_harness.rs:332-348 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/harness.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8958835dcb1bc25d2a6da66672870baa6eef65bf02e302b34a8ab964e4e36562"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/rvf/rvf-solver-wasm/src/lib.rs:363-373 | crates/rvf/rvf-solver-wasm/src/lib.rs:389-399 | crates/rvf/rvf-solver-wasm/src/lib.rs:415-425 \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":"crates/rvf/rvf-solver-wasm/src/lib.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b0f36505c5e03c1f35a9f2ffcfcc1d5fe06174570b93448af529a9b2a5a617"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvm/crates/rvm-kernel/src/lib.rs:772-786 | crates/rvm/crates/rvm-kernel/src/lib.rs:919-929 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3545f93fb87c2365b11b5a5ac37f87518483e05086d3ed58eb2b23d570a1bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.8.4/src/device.rs:166-173 | patches/candle-core-0.9.2/src/device.rs:278-285 \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":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ff6f17e3f6eb44ccdb0285e26554156ceb139013db64ed2fd8caf66d86f6a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/pickle.rs:727-735 | patches/candle-core-0.9.2/src/pickle.rs:751-759 \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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb66817166ce9a9844857e4ccc4981848b371f147f2eeda5cbad2dd4a8daa955"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/cognitum-gate-kernel/src/lib.rs:585-599 | crates/cognitum-gate-kernel/src/lib.rs:610-625 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/lib.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f958c31c5e5ff5a9f5e71ccd36c1f0a1466587b4339143fd050162ec3d3967"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/emergent-time/src/agentic_time.rs:71-81 | crates/emergent-time/src/structural_clock.rs:90-100 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cda4c71487bccaad598e5bc2d198f3781ab5fcb228d0410240f046c29352929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/prime-radiant/src/storage/memory.rs:336-345 | crates/prime-radiant/src/storage/memory.rs:355-364 | crates/prime-radiant/src/storage/memory.rs:392-401 \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":"crates/prime-radiant/src/storage/memory.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e63c8ee9a3621d6bc5e8ca05c4a0caebec8ee65e169bfec6ad7db32c9f9f023"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-consciousness/src/simd.rs:396-407 | crates/ruvector-math/src/homology/mod.rs:143-156 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/simd.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a3695fcc73fd2a1a46531fbdde2d2abd84890602a922ddc06f0bdb49325545"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-postgres/src/gnn/aggregators.rs:35-50 | crates/ruvector-postgres/src/gnn/aggregators.rs:77-92 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gnn/aggregators.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b0a9a26e704385bae83733310c3e5ff5f842ffb0ac86817cee0b815f99437"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:897-929 | crates/ruvector-postgres/src/graph/operators.rs:957-990 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc86717d38797c1e8c165fbc9316db0ad06016982a6bc486e0dc5c81070992d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-rabitq/src/quantize.rs:43-53 | crates/ruvector-rabitq/src/quantize.rs:157-166 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/quantize.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b48d03453e563fe697383b8d8525fe7520bdb28923f637ba28134176fac9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvix/qemu-swarm/src/network.rs:226-236 | crates/ruvix/qemu-swarm/src/network.rs:251-262 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/network.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2a1dc1143b8a8071fe3e7ca5a0d474a3a2aa2fb114d7a5e5e99ab22ca1d54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm-cli/src/commands/serve.rs:543-557 | crates/ruvllm-cli/src/commands/serve.rs:578-595 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/serve.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e27f1511e70bf1ef640397f64022059a1db62d0bfa5aa7f98933180513a23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/memory_pool.rs:487-501 | crates/ruvllm/src/memory_pool.rs:505-519 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/memory_pool.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8bd463fb652e8085b09f2386352a51ad6c85b714665304cc3e205d2380a62b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvAgent/latentmesh-thoughtmap/src/thoughtmap.rs:176-186 | crates/rvAgent/latentmesh-thoughtmap/src/thoughtmap.rs:189-199 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/latentmesh-thoughtmap/src/thoughtmap.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c963573360dda2593d9157c37812ef2f88f4793a68889ab2c042e2e950590260"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/rvf/rvf-crypto/src/stream.rs:51-60 | crates/rvf/rvf-crypto/src/stream.rs:97-107 | crates/rvf/rvf-crypto/src/stream.rs:112-123 \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":"crates/rvf/rvf-crypto/src/stream.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"19781c5c40b34777ef432ac890be7e7f643c0bd094804b1684e7fad3ff86dfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:234-246 | patches/candle-core-0.9.2/src/quantized/mod.rs:381-393 \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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5feb9dc36e16cac5d73d846a77d8f15176b0b64d3cc80b1c434a35d2da426d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/mcp-brain/src/client.rs:121-130 | crates/mcp-brain/src/client.rs:137-146 | crates/mcp-brain/src/client.rs:153-162 \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":"crates/mcp-brain/src/client.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83c8a5dc8987e667faf472b841278c1a11198bc41cc506f53a6d607b128c0a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/prime-radiant/src/attention/moe.rs:256-274 | crates/ruvector-attention/src/moe/router.rs:111-126 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/moe.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08ffcce630e608c69a6a9f6ed09a84b35ce5070e73c284a4d1d8bd6a504ee8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/prime-radiant/src/coherence/engine.rs:268-290 | crates/prime-radiant/src/coherence/engine.rs:294-308 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcff700d00d1c71103de82312a9f990c27e7a53ab73d11975498b3fe8f60a783"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/prime-radiant/src/substrate/restriction.rs:254-263 | crates/prime-radiant/src/substrate/restriction.rs:266-275 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/restriction.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"118bf0020ed7e7921db0894822bd60e7d1fc2a7a3438785e440089c444a10b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/prime-radiant/src/tiles/fabric.rs:169-182 | crates/prime-radiant/src/tiles/fabric.rs:189-200 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/tiles/fabric.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"be14353958d71c957587f1fef9508ae83ffec82decfd6cbbff0a6710532cb918"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-attention-wasm/src/utils.rs:57-72 | crates/ruvector-attention/src/attention/mla.rs:418-428 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/src/utils.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e513246a266c2f8d25f06f67b3a9f8f2fbb2cefecd1b0abdd4c22a786b8721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-core/src/index/flat.rs:83-94 | crates/ruvector-core/src/index/hnsw.rs:474-487 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/flat.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6d6d743c044369638cf712355d32c40d503d7f2404d68f3d7e7ff50091da42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-core/src/integration.rs:47-63 | crates/ruvector-core/src/integration.rs:174-191 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/integration.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7511208b0ccae4c56b0f48d3f1b3e0b64cc0c6dbdd24a149db71583643e22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvector-dither/src/quantize.rs:23-31 | crates/ruvector-dither/src/quantize.rs:52-61 | crates/ruvector-dither/src/quantize.rs:67-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dither/src/quantize.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d42fc0e908cf4e38cf158d44b2fce280a4b067590fed5f0b942a8555779b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-edge-store/src/shard/mod.rs:146-149 | edge/gateway/src/quant_write.rs:19-22 \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":"crates/ruvector-edge-store/src/shard/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b470ef5a0eaebeb1895518924885fccc4c7cd9425e542de2f455e0eed309c075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-gnn/src/tensor.rs:342-355 | crates/ruvector-gnn/src/tensor.rs:369-377 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/tensor.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"610588ba90c4c233c3fdac531a696c09962477983f60fc4692dd84e5bfb53380"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-graph/src/graph.rs:157-173 | crates/ruvector-graph/src/graph.rs:520-533 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/graph.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e946414b5c384b5308dd6454bc16a6b8c94c00bf1fe3346228eea228658004e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-graph/src/storage.rs:263-273 | crates/ruvector-graph/src/storage.rs:340-350 | crates/ruvector-graph/src/storage.rs:433-443 \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":"crates/ruvector-graph/src/storage.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dc67387fbd44ef74890e65dc6382e8c6f486d3cc73c94e13ccfccda696e914"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-node/src/lib.rs:313-331 | crates/ruvector-node/src/lib.rs:340-353 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-node/src/lib.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4e27bd619e9730980478c50fad4f8084889081463737a08925a87d241fbc14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvix/crates/region/src/append_only.rs:112-126 | crates/ruvix/crates/region/src/immutable.rs:107-121 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/append_only.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffab4e688200ea8ad4653146e1ffb48967f302f1ded198ce0086a5d343c0fd5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvllm/src/gguf/mod.rs:315-326 | crates/ruvllm/src/gguf/mod.rs:340-354 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/mod.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ede342911c3cd44fa38210db8edefd214dc820f0ce77f049b0c524c268d265c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvf/rvf-node/src/lib.rs:888-902 | crates/rvf/rvf-node/src/lib.rs:1126-1138 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/src/lib.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46c9a8fd270fc9ef6eac0b2fd08750f2ad4864518dc1c2208518bd72e005167"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/rvm/crates/rvm-cap/src/table.rs:246-259 | crates/rvm/crates/rvm-cap/src/table.rs:267-280 | crates/rvm/crates/rvm-cap/src/table.rs:288-306 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/table.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d982c209ffd771ed7cd3fe859ad41a0bc9aa71f8d2d97c94383ebaa3630a83c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): edge/gateway/src/durable.rs:238-245 | edge/gateway/src/durable_m4.rs:96-103 \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":"edge/gateway/src/durable.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb52f6b5bb6bed6a01356f5b17deffa85f380d925dcc8f0946a4b24dbe83402e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:416-424 | patches/candle-core-0.8.4/src/accelerate.rs:427-435 | patches/candle-core-0.8.4/src/mkl.rs:369-377 | patches/candle-core-0.8.4/src/mkl.rs:380-388 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eee30d59dce77e41df4be9cf637b70c08bd8ae42d3f5e911f58257b4b26e80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1827-1838 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2253-2264 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f113050cc551ce1da8eff9920fb520ed5e56685b84b1c65d07b8933a8aa8ccdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:982-987 | patches/candle-core-0.8.4/src/tensor.rs:992-997 | patches/candle-core-0.9.2/src/tensor.rs:1050-1055 | patches/candle-core-0.9.2/src/tensor.rs:1060-1065 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb0021256c820b1aba98ab9ec82f0cb9267c86fd42e9fe4ccfd364e47f3ef10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:1000-1005 | patches/candle-core-0.9.2/src/tensor.rs:1068-1073 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"5309bc73f5994c185b00444e858ee5f204d24a4ac7a8d8c8f4861833c713b73a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/photonlayer-bench/src/mnist_bench.rs:124-133 | crates/photonlayer-bench/src/mnist_bench.rs:140-149 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/mnist_bench.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"544b4a93f42160f7237524db767fd930bffb71a8c9923589ce6812a6f33f4c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/prime-radiant/src/substrate/restriction.rs:407-426 | crates/prime-radiant/src/substrate/restriction.rs:445-460 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/restriction.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d63e9c91be01c77de9c945a5ea54bbec1fae54b73ad8c7659c3b1ecc45a87e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-cli/src/cli/hooks_postgres.rs:278-290 | crates/ruvector-cli/src/cli/hooks_postgres.rs:293-306 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks_postgres.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3062185596dd1612925b7859c7e74ff6a08115ff1bf0c3f136cd17379995ad70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-cnn/src/layers/quantized_conv2d.rs:302-312 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:235-245 | crates/ruvector-cnn/src/layers/quantized_linear.rs:152-162 \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":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd176ece1969c69937f8c61a09659a831952fafafe96ffc8a3ea683865a308b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-core/src/advanced_features/hybrid_search.rs:314-321 | crates/ruvector-postgres/src/hybrid/bm25.rs:303-310 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/hybrid_search.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c5ff809ea0ffaaa7a55b42ec5e4ce14c366568d2bb147eddfe1045fa6c7aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 14\u002B corresponding lines): crates/ruvector-graph/src/cypher/parser.rs:833-849 | crates/ruvector-graph/src/cypher/parser.rs:851-867 | crates/ruvector-graph/src/cypher/parser.rs:869-885 | crates/rvlite/src/cypher/parser.rs:819-832 | crates/rvlite/src/cypher/parser.rs:834-847 | crates/rvlite/src/cypher/parser.rs:849-862 \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":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"89338a7439f670af4a5a1a520ab506cac02803b096184ec0e158f3d6440ee04f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-graph/src/transaction.rs:337-351 | crates/ruvector-graph/src/transaction.rs:354-368 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/transaction.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fb467125cde3fced88aa204389a1ec1ec7d661eaf1765127378abcd85b95f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-kge-ffi/src/model.rs:255-263 | crates/ruvector-kge-wasm/src/model.rs:255-263 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"030b66af3f532640de460324abf28b922944424ee446fe0ec1ac41f03c4d69a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-math-wasm/src/lib.rs:483-492 | crates/ruvector-math-wasm/src/lib.rs:496-505 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math-wasm/src/lib.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"991937c4bbf73d91793302c05096e75661be098abcf6981519221e66a4074b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-mincut-gated-transformer/src/packets.rs:259-275 | crates/ruvector-mincut-gated-transformer/src/packets.rs:284-304 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/packets.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99b8d018f7e1d8dd5f39924c36fd56dd619a0b9c6f1add19fa8a81b8fbb7c7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:745-758 | crates/ruvector-postgres/src/distance/simd.rs:768-781 | crates/ruvector-postgres/src/distance/simd.rs:791-804 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"8579d8553c820119950701ea68b10b7aab70c6c1a03c6e55733011ef624655d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ruvector-postgres/src/graph/sparql/functions.rs:266-275 | crates/ruvector-postgres/src/graph/sparql/functions.rs:277-285 | crates/ruvector-postgres/src/graph/sparql/functions.rs:287-295 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/functions.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"433a24a5886ddd1eec960cf0a46f8444c7c2ddb04de1d915f9a88a68307c15fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/ruvector-rabitq/src/main.rs:123-130 | crates/ruvector-rabitq/src/main.rs:131-138 | crates/ruvector-rabitq/src/main.rs:139-146 | crates/ruvector-rabitq/src/main.rs:147-154 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/main.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cede9b008c65d6f1eb3be5bb517fc9d303038f776c37aa3c46f963970d544fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvllm/src/tokenizer.rs:277-292 | crates/ruvllm/src/tokenizer.rs:295-313 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/tokenizer.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a589fae9f251c7ad6b29c3e5272eb229ea4c104685a31bd4200199ff6c8d26fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvf/rvf-index/src/codec.rs:81-91 | crates/rvf/rvf-index/src/codec.rs:94-104 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/codec.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb67e3b61aa15cccd674abf8efb11a68bfc038fa5be6fb8f53123f901a3a64f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvm/crates/rvm-boot/src/lib.rs:148-158 | crates/rvm/crates/rvm-boot/src/sequence.rs:165-177 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-boot/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf67a7ca90a31a48b5e1fb4cc5eac50a129f918b2a71c7012466eddef83bc01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/rvm/crates/rvm-coherence/src/pressure.rs:65-85 | crates/rvm/crates/rvm-coherence/src/scoring.rs:38-57 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/pressure.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1eb2947d09d149500ed828c4720a7317891fc047eac2ff9b703225a38a9754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/mcp-brain-server/src/quantization.rs:188-206 | crates/rvf/rvf-quant/src/binary.rs:27-39 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/quantization.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"685046cdbc5e5f615854717df8e692f45456437c5397849acfa8637599f4f439"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-attention-node/src/attention.rs:306-319 | crates/ruvector-attention-node/src/attention.rs:334-351 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/attention.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de094aff58c6a9f8fc9ceee9daa7fff347e25b842fbb0ffb51a20878116db88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvector-cnn/src/simd/quantize.rs:303-314 | crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:127-134 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:518-526 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/quantize.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e43c1cff9c98e71884d7ef5ac33febc897cd98ccfa7eddaa2a706e4c8eb57f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-dag-wasm/src/lib.rs:197-210 | crates/ruvector-dag-wasm/src/lib.rs:229-242 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag-wasm/src/lib.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3d775f174c51b8d120c29ce72e59ceec16e14085b49b4a655e094272ef4f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ruvector-graph-node/src/lib.rs:730-739 | crates/ruvector-graph-node/src/lib.rs:748-759 | crates/ruvector-graph-node/src/lib.rs:768-779 \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":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"6967da965c7f6a35843047cabef33340fe263f680337c2fd82fd2374fe9426dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-mincut/src/instance/bounded.rs:86-92 | crates/ruvector-mincut/src/instance/stub.rs:222-236 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/instance/bounded.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"568b53976f7610e954cf03d59bac1c3ac528ef38db6c8ad0ba1486aadcafe366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-mincut/src/jtree/coordinator.rs:598-606 | crates/ruvector-mincut/src/jtree/coordinator.rs:609-617 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/coordinator.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"508aa0f7d4721c189da2a326dc238feb5bf6438dc2a066e327a0d4bf6aa95cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvector-mincut/src/pool/mod.rs:72-85 | crates/ruvector-mincut/src/pool/mod.rs:87-99 | crates/ruvector-mincut/src/pool/mod.rs:101-113 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/pool/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3014dae5d686f4cf0444bc50e2e1e49b43932ea69b2bc645002a4de3ba1f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-mincut/src/wasm/canonical.rs:273-285 | crates/ruvector-mincut/src/wasm/canonical.rs:291-302 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/wasm/canonical.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"469cd0e2dda15e9b3dbd94fa56cc0f1584aa4dad0b3c40efefcaf4d97860d1d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-postgres/src/healing/learning.rs:219-226 | crates/ruvector-postgres/src/healing/learning.rs:229-236 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/learning.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"19293743807919e805464d2f4970db46834f90aafcae6603a12f2e3ab21b5c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/ruvector-postgres/src/learning/operators.rs:435-454 | crates/ruvector-postgres/src/learning/operators.rs:457-478 | crates/ruvector-postgres/src/learning/operators.rs:481-501 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/learning/operators.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"631fc3ea1a3ec2f66d1b460dc66a221dc2f400a9db7fa200d239a168391ac39d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-sparse-inference/src/backend/cpu.rs:146-162 | crates/ruvector-sparse-inference/src/backend/cpu.rs:164-181 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac414f4b19ba792c34f73e5abd7f7220d3fa216e91e3fdc088f9331c54ec9ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvector-tiny-dancer-core/src/storage.rs:93-115 | crates/ruvector-tiny-dancer-core/src/storage.rs:215-236 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/storage.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"715dddb3f0dbda6114c0e2ddecaf430066f2f7f8e684425b3d21164ee6d67008"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvix/crates/nucleus/src/scheduler.rs:316-328 | crates/ruvix/crates/nucleus/src/scheduler.rs:343-356 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/scheduler.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafb134998b5e72d7e7d141d8fa7da9cb64c993ebcec4f42b250feb8b1c9f802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvix/crates/smp/src/topology.rs:255-271 | crates/ruvix/crates/smp/src/topology.rs:282-301 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/smp/src/topology.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f61114560b7238125c0b788f8d29fe3823f6f8e4ebb0014c4d364c76515a5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvllm/src/backends/candle_backend.rs:1707-1725 | crates/ruvllm/src/backends/recurrent_backend.rs:316-327 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"1054f099be5839f79b3ae4563ca4edff67251cda1908493456056577e2eca661"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/rvf/rvf-runtime/src/locking.rs:320-345 | crates/rvlite/src/storage/writer_lease.rs:301-319 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/locking.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0041cf3e7403ee34c6d09310288241426cc25b2f940bce0915982f976f1d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rvm/crates/rvm-types/src/witness.rs:124-141 | crates/rvm/crates/rvm-types/src/witness.rs:298-316 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-types/src/witness.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a50da126ac92c520ddc5ab0e2c62c722120405be10cca9e98ee30438019ff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): patches/hnsw_rs/src/libext.rs:28-33 | scripts/patches/hnsw_rs/src/libext.rs:28-33 \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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d025b81af7ffbf7ad8abfbe1f123bee128115e9b511986c53280595661c1aebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-py/python/ruvector/mcp_server.py:425-435 | crates/ruvector-py/python/ruvector/mcp_server.py:446-455 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/mcp_server.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7fc38745fc829837c193a0b2fc75d9ecfdd8b9ba021566430971e3c22062c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/mcp-brain-server/src/store.rs:1204-1217 | crates/mcp-brain-server/src/store.rs:1220-1232 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"774058d747543e7e481705f215a61f09bc84c6c325adbf510639588d0c8ce4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/mcp-brain/src/client.rs:342-353 | crates/mcp-brain/src/client.rs:359-371 | crates/mcp-brain/src/client.rs:377-389 \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":"crates/mcp-brain/src/client.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"459c60a27e07395c4e3b30b237a6dedc6b98cc0578fe6dcca990d84c76f2c787"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 13\u002B corresponding lines): crates/prime-radiant/src/governance/repository.rs:496-509 | crates/prime-radiant/src/governance/repository.rs:612-625 | crates/prime-radiant/src/governance/repository.rs:640-652 | crates/prime-radiant/src/governance/repository.rs:654-666 | crates/prime-radiant/src/governance/repository.rs:808-820 | crates/prime-radiant/src/governance/repository.rs:826-838 | crates/prime-radiant/src/governance/repository.rs:853-866 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/repository.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bfbdc6c55cac21f0116d4c031de68838b2bd8c0a2392edf05fe08c8f98bf43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-collections/src/primality.rs:210-226 | crates/ruvector-collections/src/primality_kernel.rs:29-45 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-collections/src/primality.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0233322d863c46b64d8769b8d2c8daac4166e1d81c8adb9015780424e251ea5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-core/src/index/hnsw.rs:489-504 | crates/ruvector-core/src/index/turbo4.rs:613-624 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/hnsw.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bead34abe5262e22c4a82febb231df177445bdae018fb811b1fd699e8ec2811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/ruvector-decompiler/src/witness.rs:162-170 | crates/ruvector-typesafe-train/src/norm.rs:39-47 | crates/rvf-forge-core/src/canonical.rs:51-59 | crates/rvf/rvf-node/src/metadata.rs:56-64 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/witness.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"71008932c3965d16cbd6b58e79d889440fd6b5fb2895292646125d04380d248c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-e-means/src/wasm.rs:6-11 | crates/ruvector-e-means/src/wasm.rs:75-81 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-e-means/src/wasm.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a50130b73cc2c65dd214b3555dee739e120054cbcf5d70a543b6ebff8e9723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-math/src/utils/numerical.rs:135-150 | crates/ruvllm/src/qat/distillation.rs:322-336 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/utils/numerical.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"473a1f8fac1c16a7889d4c0d9beb12984f6492fc48b3b8ab405a7847a0666c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/ruvector-mincut/src/instance/bounded.rs:124-138 | crates/ruvector-mincut/src/instance/bounded.rs:141-155 | crates/ruvector-mincut/src/instance/bounded.rs:158-173 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/instance/bounded.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c5adbd4975623b419e6f816fc4064a1ee1980530d88c63f47c2eb5606bb182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/ruvector-node/src/lib.rs:497-508 | crates/ruvector-node/src/lib.rs:519-529 | crates/ruvector-node/src/lib.rs:803-814 | crates/ruvector-tiny-dancer-node/src/lib.rs:251-261 \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":"crates/ruvector-node/src/lib.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c242d1325aca284e5b98cd34bc877d38a0ee573af8f1888bc2a2b3e1482170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-perception/src/hypothesis.rs:169-179 | crates/ruvector-perception/src/hypothesis.rs:187-196 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-perception/src/hypothesis.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b007d88a23868ac2527614d6d8bbf76fbca489e7ec099ade5ba3981ca3067fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:120-135 | crates/ruvector-postgres/src/graph/operators.rs:514-531 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"946095d11fa656e4bbbfe35cb11fa4cff15e2c346af48d296cf9e2416798dc66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvector-postgres/src/graph/sparql/executor.rs:857-876 | crates/rvlite/src/sparql/executor.rs:480-499 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e4b0b62f28a20ee9ca614ebbef71625fa41364a3a6e361653dedffc7d6b028"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-postgres/src/sparse/types.rs:239-248 | crates/ruvector-replication/src/conflict.rs:105-114 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/sparse/types.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4c0c2dc1e66516e2aaf425e8eca5477e2159aa0750aae330c782e69cb964ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvix/crates/bcm2711/src/gpio.rs:430-443 | crates/ruvix/crates/bcm2711/src/gpio.rs:506-519 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/gpio.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec44fd82502dfcce9143f2ccd0a9bb6632a7e45c5720bdeb29b90f3f6bd46b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvllm/src/qat/calibration.rs:231-237 | crates/ruvllm/src/qat/training_loop.rs:114-120 | crates/ruvllm/src/qat/training_loop.rs:315-321 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/calibration.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c65d5ee82c7d7a4442268ad3d7d7dc162470daa5e6708015388bfecaaf47b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvf/rvf-types/src/ebpf.rs:77-91 | crates/rvf/rvf-types/src/kernel.rs:136-148 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/ebpf.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b87080e02a47907991ae52b683a6fe5e981805556ae0d6f492293cbb768ca56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rvm/crates/rvm-sched/src/smp.rs:101-114 | crates/rvm/crates/rvm-sched/src/smp.rs:128-142 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-sched/src/smp.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d015fd4bf5679f4bce4afaba6a801d5a70c1ce03d01edceba5702a6eebb9c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rvm/crates/rvm-witness/src/v2.rs:161-170 | crates/rvm/crates/rvm-witness/src/versioned.rs:190-198 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/v2.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a96aab596d958ea4eed4433de30d0bf0619cc24507aec8d679df58de63c6363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/thermorust/src/energy.rs:27-35 | crates/thermorust/src/motifs.rs:22-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":"crates/thermorust/src/energy.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e1871ee777ffc3165c49e79c31fd3df6b33af94a0875a5925980d9c2392c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-attention/src/info_bottleneck/kl_divergence.rs:60-72 | crates/ruvector-attention/src/info_bottleneck/kl_divergence.rs:75-87 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/info_bottleneck/kl_divergence.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f97ff1f36b58e75214e74334b627e4805b7ac4650bd3a1265781fcc50c3e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-delta-core/src/delta.rs:531-541 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:507-514 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/delta.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d461a09333eeb83f2c560b3f9e292e5249e6388c4aa82420ddb55a0b62e31b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:212-223 | crates/ruvector-postgres/src/graph/operators.rs:232-243 | crates/ruvector-postgres/src/graph/operators.rs:252-261 \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":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c7f136918e68256a35a1790f501eec204832e8df152ffa8bb45e2399e91d06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ruvector-postgres/src/tenancy/rls.rs:118-149 | crates/ruvector-postgres/src/tenancy/rls.rs:152-177 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/rls.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d396028950fa84f3946a093cdd8bdbbbd1542714fc885d17b71cc35c7d59bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvix/crates/cap/src/manager.rs:183-194 | crates/ruvix/crates/cap/src/manager.rs:207-218 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/manager.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd72a0da4da15168a823e7bc99f39849c3cbbb493031f07bedddff7e31440b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvllm/src/lora/adapters/trainer.rs:140-146 | crates/ruvllm/src/lora/micro_lora.rs:954-960 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/adapters/trainer.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bd566a4716fd4757bc018b0efc36e141e6afd072d3a2e835e752281e313f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvllm/src/metal/mod.rs:347-360 | crates/ruvllm/src/metal/mod.rs:406-424 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa0d1f7df3b3ccf80ebcbbe7b3c49eabb0f8466eafb60c2bebcaa979d0c66b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvllm/src/qat/calibration.rs:222-228 | crates/ruvllm/src/qat/training_loop.rs:105-111 | crates/ruvllm/src/qat/training_loop.rs:306-312 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/calibration.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aecb1083b4378bb36cafb2c17b245f61f896602fd48b2b2737f90af85bd98b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvlite/src/sql/parser.rs:564-574 | crates/rvlite/src/sql/parser.rs:576-586 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/parser.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb76fcf0b42bb93e4a721d959844303c5662a1f162157b1c0daddeccc969e43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): patches/candle-core-0.8.4/src/quantized/utils.rs:13-26 | patches/candle-core-0.8.4/src/quantized/utils.rs:34-47 \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":"patches/candle-core-0.8.4/src/quantized/utils.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae6e90f7218ffd05dd64e69b9bba3a315d62769ed1a980de4ddbd6df776e55e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/shape.rs:71-449 | patches/candle-core-0.9.2/src/shape.rs:71-449 \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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea08984fd5877c9bb2b90014dbbf7e9e9675f85e3ff04398cfa6f181a5e8fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/mcp-brain/src/embed.rs:310-317 | crates/ruvector-attention/src/curvature/fused_attention.rs:267-274 | crates/ruvector-cnn-wasm/src/lib.rs:360-367 | crates/ruvector-cnn/src/embedding.rs:185-192 | crates/rvf/rvf-runtime/src/rabitq_path.rs:63-70 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/embed.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b478b729a3ef60e954787fbcf3b4fcf68477727de62225192bcd4f9831d526"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/ruvector-attention-node/src/attention.rs:779-784 | crates/ruvector-attention-node/src/attention.rs:788-793 | crates/ruvector-attention-node/src/attention.rs:797-802 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/attention.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"45547b02b657329985542df823d38e99d43b1270dedce8377fa016de149e7515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-cli/src/cli/hooks.rs:1532-1549 | crates/ruvector-cli/src/cli/hooks.rs:2090-2105 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2d411c604e743f9c1cf2b433edbcc8d1d04b452ead9c70ee9c22d545eef8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruvector-cnn/src/embedding.rs:349-364 | crates/ruvector-postgres/src/distance/scalar.rs:7-20 | crates/ruvllm/src/bitnet/rlm_refiner.rs:518-531 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/embedding.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"301149806401caffa99e25cae17f08a4b4b191d6463829eedcb5876d0a5a2332"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/ruvector-graph-node/src/cypher_exec.rs:326-334 | crates/ruvector-graph-node/src/cypher_exec.rs:340-348 | crates/ruvector-py/src/graph/cypher_exec.rs:40-48 | crates/ruvector-py/src/graph/cypher_exec.rs:54-62 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a221d0e545e2ab8fcd87c961dd02b6fb81dbdccbe67f00e164d858d43202116f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): crates/ruvector-graph/src/cypher/parser.rs:990-1006 | crates/ruvector-graph/src/cypher/parser.rs:1018-1034 | crates/rvlite/src/cypher/parser.rs:864-877 | crates/rvlite/src/cypher/parser.rs:897-910 | crates/rvlite/src/cypher/parser.rs:922-935 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d88c38c454cfe1f7be6090015c5468802e76ae5862792ef708f7c4c1f3d6388"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-kge-ffi/src/model.rs:59-67 | crates/ruvector-kge-wasm/src/model.rs:59-67 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3372d42e616c393ba6171d426e43521105c6c7d7b0f6e11f4529beee67d2ab19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): crates/ruvector-lsm-ann/src/segment.rs:105-109 | crates/ruvector-recall-bounded/src/lib.rs:277-281 | crates/ruvector-recall-bounded/src/lib.rs:465-469 | crates/ruvllm/src/bitnet/backend.rs:2934-2938 \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":"crates/ruvector-lsm-ann/src/segment.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dadd6b32b98a55f20b0300a05a1756e24fb65ca4567c0aa08b90919b5dbb38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-mincut/src/wrapper/mod.rs:602-620 | crates/ruvector-mincut/src/wrapper/mod.rs:639-657 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/wrapper/mod.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e8651c4798b6c2ac08aca2180769a589d325fab05d8c14c4f2e481ba8b9238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:855-862 | crates/ruvector-postgres/src/distance/simd.rs:877-884 | crates/ruvector-postgres/src/distance/simd.rs:899-906 | crates/ruvector-postgres/src/distance/simd.rs:921-928 | crates/ruvector-postgres/src/distance/simd.rs:943-951 | crates/ruvector-postgres/src/distance/simd.rs:963-971 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"6431c22a27c8e86b500984a2ea72b290113e1f0f3b77ecdda54f9cd586d2547a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-rabitq/src/index.rs:320-326 | crates/ruvector-rabitq/src/index.rs:378-383 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/index.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"8159fc9c044ff7ca3ea6ff0ec5627731520dfa7911912dddb2884aea1b739b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-typesafe-ffi/src/lib.rs:248-260 | crates/ruvector-typesafe-wasm/src/lib.rs:165-176 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-ffi/src/lib.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"207369842a252671b29f25e1be699a83923f3c15f34462b3f2444b925915d2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvix/crates/region/src/manager.rs:267-279 | crates/ruvix/crates/region/src/manager.rs:282-294 | crates/ruvix/crates/region/src/manager.rs:327-339 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/manager.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab80c35b334cf00f2be363049da4db151232516c6d59d139012066231592904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvix/crates/region/src/slab.rs:314-329 | crates/ruvix/crates/region/src/slab_optimized.rs:324-337 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/slab.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"22eb19539fea7e19d2806a3e92e66bbe8a954162186bc3e69b84b82dc086655e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvllm/src/policy_store.rs:188-200 | crates/ruvllm/src/session_index.rs:137-145 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/policy_store.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2e294548c59477f3012b3fe6a5f83834d1327599e7e642906bc486f4bcb1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rvAgent/rvagent-a2a/src/server/mod.rs:331-340 | crates/rvAgent/rvagent-a2a/src/server/mod.rs:419-428 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/server/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"34587f407dcf4c872a3cffc02eb867cb28bef076669a21da82d0f05e9a40b024"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rvf/rvf-wire/src/stream/frame.rs:30-38 | crates/rvf/rvf-wire/src/stream/frame.rs:41-50 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/frame.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e38cdd795cbd0c6ee6c93d2897ac690849525f4adb43ae575e6aa74b349b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvlite/src/lib.rs:417-434 | crates/rvlite/src/lib.rs:470-480 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/lib.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd8347dbec4d24d18d6e6bb42c3c362d9c6e73dd3152fddec183cb6b94809e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/agentic-robotics-node/src/lib.rs:43-57 | crates/agentic-robotics-node/src/lib.rs:61-71 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-node/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b392a171dd9be528ab1e67cd1e28c768cb790c6172c616eeea1827e145ba6a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/photonlayer-bench/src/bin/bench.rs:9-22 | crates/photonlayer-cli/src/main.rs:67-81 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/bin/bench.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e365d5d243a0cb71e741765ecc94b0dc275216f6455a9c45357eeb397a680b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/prime-radiant/src/governance/repository.rs:414-423 | crates/prime-radiant/src/governance/repository.rs:429-438 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/repository.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a48d6d1716d1d729b9939b5f63df9a8bdb218b427b7a190746d29d92659b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/prime-radiant/src/governance/repository.rs:571-581 | crates/prime-radiant/src/governance/repository.rs:593-606 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/repository.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"27324e9afcd4fb9ed9b60a7307f6191fde7f73b1308ee9478b64c217a61c7aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): crates/ruvector-attention/src/graph/dual_space.rs:133-143 | crates/ruvector-attention/src/graph/dual_space.rs:146-159 | crates/ruvector-attention/src/graph/dual_space.rs:172-182 | crates/ruvector-attention/src/graph/edge_featured.rs:166-178 | crates/ruvector-attention/src/graph/edge_featured.rs:181-193 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/dual_space.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6054436b8222dc4c6c3358c65144f09c0e0635a258f4c3e6f2ee66962eb1d133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-cli/src/cli/hooks_postgres.rs:131-141 | crates/ruvector-cli/src/cli/hooks_postgres.rs:214-224 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks_postgres.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4392401ed63ed293cb66482587dfebab03a74aa34ea6d9546e58f17bd67113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ruvector-cnn/src/lib.rs:249-266 | crates/ruvector-consciousness/src/simd.rs:308-320 | crates/ruvector-namespace-merge/src/dataset.rs:131-144 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/lib.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0e1daea2ad429c5ccc2d9047f7d3c677517acfc79ce2d37cb9e5086582440b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-collections/src/primality.rs:194-206 | crates/ruvector-collections/src/primality_kernel.rs:52-64 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-collections/src/primality.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2245b4a87be8571a3deca95860259ebd4bee68e1ddcfb401e0bc3ad8e169ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ruvector-mincut/src/optimization/wasm_batch.rs:206-216 | crates/ruvector-mincut/src/optimization/wasm_batch.rs:219-228 | crates/ruvector-mincut/src/optimization/wasm_batch.rs:231-240 \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":"crates/ruvector-mincut/src/optimization/wasm_batch.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac824a8d760b042bf562da16b58205613547df97cb3eb065f4d9d4a62c7785b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-mincut/src/snn/optimizer.rs:146-157 | crates/ruvllm/src/reflection/error_recovery.rs:514-523 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/optimizer.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"378c20a565fc79c1c4a4cccf5f37d5c126d79329d1f0b74e9ab57536a6882c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-postgres/src/dag/functions/healing.rs:141-152 | crates/ruvector-postgres/src/dag/functions/learning.rs:12-26 | crates/ruvector-postgres/src/dag/functions/patterns.rs:91-104 \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":"crates/ruvector-postgres/src/dag/functions/healing.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a50e2127fe8453cae0efd3689cc13e5a77a53266d1f1fcb4b0a10e8a7be9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/ruvector-postgres/src/routing/operators.rs:400-424 | crates/ruvector-postgres/src/routing/operators.rs:427-444 | crates/ruvector-postgres/src/routing/operators.rs:447-466 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/routing/operators.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c376cf858037ac19ec62d9d029975a58a700dbc87e030268368f4e165efd24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-solver-node/src/lib.rs:260-270 | crates/ruvector-solver-wasm/src/lib.rs:819-830 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee49a3e99c018a44e5ad0ac14f013af4fffa43996937facee950b6e4cf97efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-temporal-tensor/src/persistence.rs:271-277 | crates/ruvector-temporal-tensor/src/store.rs:1164-1170 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/persistence.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"66485f8297b3026b8bd6ecb185808f775da21825432ff3f38233a36fe190a23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvix/crates/net/src/icmp.rs:336-353 | crates/ruvix/crates/net/src/icmp.rs:428-442 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/icmp.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e235184733a27e910529a2bac305e0767c7fba3a2c7863335e6ae3673ab76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvix/crates/rpi-boot/src/config.rs:308-323 | crates/ruvix/crates/rpi-boot/src/config.rs:326-341 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/rpi-boot/src/config.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9efa262ef36c22862790654e5d4b88add4f2d3406b15b95a09d38869701c218"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvllm-wasm/src/workers/shared.rs:220-230 | crates/ruvllm-wasm/src/workers/shared.rs:233-244 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/shared.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc505b818db2f3a5ea43de64133a6743df509df226c4f43b86278e7e260c7582"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvllm/src/models/openmythos/mod.rs:560-567 | crates/ruvllm/src/models/openmythos/mod.rs:605-612 | crates/ruvllm/src/models/rdt.rs:1110-1117 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7bf0a6906470d33f155ef7f04f98380af63e7663567d0571972cbaee45b352"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvllm/src/quantize/turbo_quant.rs:665-676 | crates/ruvllm/src/quantize/turbo_quant.rs:679-690 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebfffe5eac0270fe38ee63482c1787173a25d3936dd32ac229294ccb055670d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rvf/rvf-runtime/src/qr_seed.rs:703-717 | crates/rvf/rvf-runtime/src/witness.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":"crates/rvf/rvf-runtime/src/qr_seed.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a22a70ed55886d81d79e303f6fa52254c540f3138d826c07cf165c3595490e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:354-361 | patches/candle-core-0.8.4/src/accelerate.rs:364-371 \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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dca9c0505945e3c438caf085034fe67b128183ac6ff56ea0b3333ec516e5c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): patches/candle-core-0.8.4/src/shape.rs:71-448 | patches/candle-core-0.9.2/src/shape.rs:71-448 \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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"891b8a6e621c169084dd0d762369b19793e011f85cfb266920879bc178cdbca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/prime-radiant/src/coherence/incremental.rs:353-368 | crates/prime-radiant/src/coherence/incremental.rs:384-396 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/incremental.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"6326774c72b999d9154b8f7a55d3afe24d4d8af1209b5194dae6118ebd7c4c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/prime-radiant/src/governance/repository.rs:791-802 | crates/rvlite/src/sparql/triple_store.rs:466-478 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/repository.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7e9e8a0bea38f60450c619e57a8f3548b9271c31ec18dea6ddde05d9369618"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/prime-radiant/src/storage/memory.rs:213-223 | crates/ruvector-delta-index/src/lib.rs:650-663 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/memory.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb11712508cbccb73f10770c237bca5b0edac0df769aced7610339be1c3623b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-bet4-ivf-bench/src/kernel.rs:77-84 | crates/ruvector-bet4-ivf-bench/src/pq.rs:88-95 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/kernel.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1110edf8f939f06679344232b9da433fed4844965d29aa22bd11583bd8ff41b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-cli/src/cli/hooks.rs:1885-1899 | crates/ruvector-cli/src/cli/hooks.rs:2072-2087 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e271d1eaf5389e6da26704bc87f09a09e7412f2330a3dfc1de50d6443a4a615"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-consciousness/src/simd.rs:287-295 | crates/ruvector-solver/src/simd.rs:216-224 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/simd.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5976eb3cf45f1c7c33d18b87d9a688935d0436feb9450064a624f1ca66d26cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:1528-1533 | crates/ruvector-core/src/simd_intrinsics.rs:1537-1542 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad45ce05ee080205059880d30c3f4c340d8f506aac2c28f3299236b3f65b460"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-economy-wasm/src/ledger.rs:191-207 | crates/ruvector-economy-wasm/src/ledger.rs:226-242 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-economy-wasm/src/ledger.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b80826d5ea00b0a743780cbcac206dac51698848b58eaf1d1d1acbcc8a02fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-edge-tenancy/src/uid.rs:43-53 | crates/rvm/crates/rvm-proof/src/signer.rs:418-427 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-tenancy/src/uid.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e51eb59ee03324d15333a5048d1b9e8fcc33de6f34f8a63569f363364e400"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-graph-condense/src/node.rs:29-42 | crates/ruvector-mincut-gated-transformer/src/early_exit.rs:406-422 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/node.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb786576eb5b93314637ccf06b04e6aee2a613af6802e38ba61a06c305a8e634"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-graph-condense/src/node.rs:138-148 | crates/ruvector-mincut/src/graph/mod.rs:458-473 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/node.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"158ee81c4ff32fadce4984bf712846ed8bcd2d1fa3194fe815188d25f5caa71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-graph-transformer/src/manifold.rs:1229-1239 | crates/ruvector-postgres/src/math/operators.rs:33-44 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/manifold.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d17a511e6e172ff0d364304cc1a7496ef9f4ad3f5dd01314364e0d7450f443"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-kge/src/scorer/rotate.rs:118-125 | crates/ruvector-kge/src/scorer/rotate.rs:128-135 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/scorer/rotate.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e8a14633447b4f3360ce53d451970b6e61910126fc77f8e1f3621407708f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-math/src/tropical/matrix.rs:39-48 | crates/ruvector-math/src/tropical/matrix.rs:261-266 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tropical/matrix.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"289aea04ac1521f0796d47454a5e7950b59c985022fb19998bc491bf98e2eecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-mincut-node/src/lib.rs:135-144 | crates/ruvector-mincut-node/src/lib.rs:148-157 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7690b91c98b6da5b1b5722e4fa3c142556a95b427c70ef8bb3087371674d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-mincut/src/snn/network.rs:444-456 | crates/ruvector-mincut/src/snn/optimizer.rs:747-763 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/network.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54b11d16fca0f3ae845e6f152402ede383215afca5cade50d8e813a66f2aa93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-postgres/src/gated_transformer/mod.rs:364-379 | crates/ruvector-postgres/src/gated_transformer/mod.rs:398-412 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gated_transformer/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd1b986534786c4bc4e76bd3648e1af86ea66491e8bd1c289245970fdfadbfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-postgres/src/graph/sparql/parser.rs:2228-2236 | crates/rvlite/src/sparql/parser.rs:2267-2275 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78910646582249e5000b271b22f3e19fe2d23bb8afb576efc78d8042cc22c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-postgres/src/hyperbolic/operators.rs:69-82 | crates/ruvector-postgres/src/hyperbolic/operators.rs:281-291 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hyperbolic/operators.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5337b72e8bb1d0862337832784b6863c0e957aae988907f7cb15172d9f9807"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-postgres/src/types/binaryvec.rs:253-267 | crates/ruvector-postgres/src/types/scalarvec.rs:299-310 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"05af0db9a32ffa381a98574fcfbdf4aff169dea065a4b0d295555d9eb095ea04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-postgres/src/types/scalarvec.rs:317-328 | crates/ruvector-postgres/src/types/vector.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":"crates/ruvector-postgres/src/types/scalarvec.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb58a2c4ef77d33fd1d245f7d9c9c44c254decba9314a640d590612c6ee948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-replication/src/replica.rs:172-185 | crates/ruvector-replication/src/replica.rs:263-279 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/replica.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"17aa1bf574fbb9f822bb5dafd704a1663cf9617ebf9acd3ce6e39221a086d118"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-typesafe-core/src/engine.rs:223-231 | crates/ruvector-typesafe-core/src/engine.rs:241-245 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4537686e946a37232e3f7cd6f2f14caea9b2496810908cc818bf3e9d0e43845"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvllm/src/gguf/quantization.rs:435-442 | crates/ruvllm/src/gguf/quantization.rs:444-452 | crates/ruvllm/src/gguf/quantization.rs:454-463 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70f8ba5694d6d9ba959374371309f59c5a8d62c4914c062ad52d2d659c01eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ruvllm/src/quantize/pi_quant.rs:1312-1333 | crates/ruvllm/src/quantize/pi_quant.rs:1336-1357 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"376c69652cc15dd9cb85ba787bffb68da615efd639973a3722c6441d16e8581b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvAgent/rvagent-middleware/src/witness.rs:92-104 | crates/rvAgent/rvagent-middleware/src/witness.rs:115-129 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/witness.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"533b98843adfa4e62acdea40ce032616e2d5f09b8da6d873199d3c6c6d22b18a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rvlite/src/storage/id_map.rs:71-80 | crates/rvlite/src/storage/id_map.rs:133-142 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/storage/id_map.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e0465974d8a7127b541d163ce2e346fb6ea1a1b0d14abc44bad39e85222ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rvm/crates/rvm-cap/src/table.rs:192-207 | crates/rvm/crates/rvm-cap/src/table.rs:222-237 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/table.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cf352668354be87e3813276dd9d0f7c4492fd8974df4c6599f73c92d723ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvm/crates/rvm-memory/src/lib.rs:142-152 | crates/rvm/crates/rvm-memory/src/lib.rs:160-167 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/lib.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"640cedbfaf31ab97020638b15eb29c6d218d9d187db857a35e2e9ed82c6461ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/rvm/crates/rvm-proof/src/engine.rs:208-216 | crates/rvm/crates/rvm-proof/src/engine.rs:223-231 | crates/rvm/crates/rvm-proof/src/engine.rs:243-251 | crates/rvm/crates/rvm-proof/src/engine.rs:259-267 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/engine.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7785f2e7fc1893e801c4632705f1e5e2f9df62fcdfb60cda30e31bd1b656825"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/rvm/crates/rvm-proof/src/signer.rs:99-107 | crates/rvm/crates/rvm-proof/src/signer.rs:268-276 | crates/rvm/crates/rvm-proof/src/tee_provider.rs:93-101 | crates/rvm/crates/rvm-proof/src/tee_verifier.rs:67-75 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/signer.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcab0426c8e0bf59e63fc6c7324bcae1add3a64a590283452c979b680840d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/thermorust/src/dynamics.rs:121-130 | crates/thermorust/src/dynamics.rs:140-149 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/thermorust/src/dynamics.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7609a3092f46fa745d769f7c5323a311cbd7f68a0795cb906e7467ae621d862"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/thermorust/src/noise.rs:11-19 | crates/thermorust/src/noise.rs:22-29 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/thermorust/src/noise.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f81eddd2bc9f31b43be3973d1d7ae2b87f67d4414af26d4d3c3b64d5c82af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/photonlayer-core/src/metrics.rs:9-15 | crates/photonlayer-core/src/metrics.rs:33-39 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-core/src/metrics.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"202d3a4dcbedee8bff7c44232a5fad918e5ceb407ca8e76ca5901d6cd2d0bef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/prime-radiant/src/storage/postgres.rs:387-401 | crates/prime-radiant/src/storage/postgres.rs:546-558 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/postgres.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"29532a78a4988de99336d2356bc3b1b664bee98d8db531a24a1f1630480f88ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/ruvector-consciousness-wasm/src/lib.rs:157-164 | crates/ruvector-consciousness-wasm/src/lib.rs:173-180 | crates/ruvector-consciousness-wasm/src/lib.rs:190-197 | crates/ruvector-consciousness-wasm/src/lib.rs:207-214 | crates/ruvector-consciousness-wasm/src/lib.rs:249-257 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness-wasm/src/lib.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6058938e4ef4942bc347a602f3de17ccb2b2224a399e0800bd2c9afcc0ff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-core/src/quantization.rs:357-368 | crates/ruvector-core/src/quantization.rs:407-418 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"471d1b069fbd3b8d4db16454b6c04d867e9e4bcd2162421399542c07d41e9eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-delta-consensus/src/conflict.rs:143-161 | crates/ruvector-delta-consensus/src/conflict.rs:168-186 | crates/ruvector-delta-consensus/src/conflict.rs:216-231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-consensus/src/conflict.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0952e5b29ead650fd9fc7b7bf3247ccc2a2c8a5d00c92ac8e9d8ee8c10e4099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-mincut-gated-transformer/src/mamba.rs:480-492 | crates/ruvllm/src/kernels/norm.rs:400-409 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/mamba.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cb8041d10fd25ca19b48ca96bfe8a58368bdafc2bf0b25491480d64e7471ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ruvector-postgres/src/graph/sparql/parser.rs:1468-1485 | crates/rvlite/src/sparql/parser.rs:1506-1523 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7278650efb813dedbf8918b93adbd189a3421b14ca7407eba3d600edec2a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvector-postgres/src/hyperbolic/operators.rs:335-342 | crates/ruvector-postgres/src/hyperbolic/operators.rs:345-355 | crates/ruvector-postgres/src/hyperbolic/operators.rs:358-366 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hyperbolic/operators.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"738fc1fab8942637ea6fb41cff49d5bd1c89994f62fbb2aeea4738bee0b164d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-postgres/src/integrity/events.rs:173-188 | crates/ruvector-postgres/src/integrity/events.rs:196-209 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/events.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a38c8771a27652a464941e62e35d6f51878d816bd99cb2a234eee05d9b09648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruvector-postgres/src/types/halfvec.rs:140-154 | crates/ruvector-postgres/src/types/halfvec.rs:157-170 | crates/ruvector-postgres/src/types/halfvec.rs:173-187 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3ae63c078bff88a885f6ae8bb80dc3769839a9b771289ba0f0f139be5b2028"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvllm/src/bitnet/backend.rs:2325-2341 | crates/ruvllm/src/bitnet/backend.rs:2354-2371 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7b47090ce263f1e98471e5b27bdbaf94104320423349f7b6a25c399c8c5889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/quality/metrics.rs:136-150 | crates/ruvllm/src/quality/metrics.rs:153-167 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/metrics.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f841955054b7b4cf050574cc32385338436048a9b707a044eb20c425a293dbe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvf/rvf-runtime/src/locking.rs:84-95 | crates/rvf/rvf-runtime/src/locking.rs:111-121 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/locking.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5737ce5dbfb5238203a2fec8d391a1765b9d894f0e67e102041c03e1d0771dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): patches/candle-core-0.8.4/src/accelerate.rs:183-199 | patches/candle-core-0.8.4/src/accelerate.rs:217-233 | patches/candle-core-0.8.4/src/mkl.rs:97-113 | patches/candle-core-0.8.4/src/mkl.rs:131-147 | patches/candle-core-0.8.4/src/mkl.rs:165-181 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"376de52da21021aff24cbf77d52f65bc2c185d09f37ca9e0bf69576fc70a8a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/mcp-brain-server/src/bin/local.rs:666-673 | edge/gateway/src/quant_store.rs:168-175 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8fc492cd49a4e9f503a3c86244c40a3456bb4275064432a3cff1d409f57f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/prime-radiant/src/mincut/isolation.rs:68-79 | crates/prime-radiant/src/mincut/isolation.rs:155-166 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/isolation.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"80549231c16c58cdc9bf316af504bd20beca49a13efc9d0dfba388d5dc1b93a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-attention-unified-wasm/src/graph.rs:123-131 | crates/ruvector-gnn-wasm/src/lib.rs:170-179 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5f3210a47dff969a0a8731321e6e062d9a27f10940dc7f69215eea1149b49a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvector-edge-registry/src/manifest.rs:69-76 | crates/ruvix/qemu-swarm/src/consensus.rs:48-57 | crates/ruvix/qemu-swarm/src/consensus.rs:84-93 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-registry/src/manifest.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b823c96d699cda752c37ed03ab7c06bfd809c7cc3caaeaf9ee441dc7511848a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-edge-registry/src/upload.rs:39-50 | crates/ruvector-edge-tenancy/src/names.rs:35-45 | crates/ruvector-edge-tenancy/src/validate.rs:75-87 \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":"crates/ruvector-edge-registry/src/upload.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1289a4682b05b614cd9e325c85bb6e3ba30832380bdeefe53982c18e0431b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-edge-snapshot/src/bytes.rs:63-71 | crates/rvf/rvf-runtime/src/progressive_stream/layers.rs:160-167 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/src/bytes.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"541fc45b9bb90cb5f547b46dd94137b2e8dcaa6357807c5d66d2611553483a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-hailo-cluster/src/lib.rs:681-691 | crates/ruvector-hailo-cluster/src/lib.rs:717-727 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/lib.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d48e2db3248fc0c92bfc6baae118d2084209eb2fc372b0262c0c320b8de180"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ruvector-math/src/spectral/chebyshev.rs:23-41 | crates/ruvector-math/src/spectral/chebyshev.rs:69-90 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/chebyshev.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3773d140bbb36658ea2931b01dcb8282df2b86ce07e7040b119cc711465c436"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/ruvector-mincut-gated-transformer/src/q15.rs:358-365 | crates/ruvector-mincut-gated-transformer/src/q15.rs:369-376 | crates/ruvector-mincut-gated-transformer/src/q15.rs:382-389 | crates/ruvllm/src/qat/ste.rs:92-100 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/q15.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1066b0cd0cd49144ba204aa457a979fd97af31e93939da3237961344540c78e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-mincut/src/canonical/dynamic/mod.rs:112-124 | crates/ruvector-mincut/src/canonical/dynamic/mod.rs:127-139 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/dynamic/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df92ff9a7cf30acad0876a2d63436b7641b580987c288ae1484ae4e11fc0f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvector-postgres/src/graph/sparql/executor.rs:421-427 | crates/ruvector-postgres/src/graph/sparql/executor.rs:1739-1745 | crates/rvlite/src/sparql/executor.rs:365-371 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd5a240c4b332aa506f3547950061bdc5ef958dc348161667e412bf237ad03c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ruvector-postgres/src/learning/patterns.rs:158-166 | crates/ruvector-rairs/src/kmeans.rs:75-83 | crates/ruvector-streaming-qng/src/lib.rs:76-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/learning/patterns.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d14007e691026053f90e830857df740595d681d21d312159d7de7ad1b90490"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/ruvix/crates/net/src/ipv4.rs:447-466 | crates/ruvix/crates/net/src/ipv4.rs:491-512 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/ipv4.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fd6804138f110655130f9ccc7234b8cf68929b1f1828892d9aef702211dd26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvix/qemu-swarm/src/node.rs:556-571 | crates/ruvix/qemu-swarm/src/node.rs:574-589 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/node.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ce964d86da4070deed0e61ad898d45ef7f2b77683a31ca8960169ffa016018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvllm/src/kernels/ane_ops.rs:788-799 | crates/ruvllm/src/kernels/ane_ops.rs:802-813 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/ane_ops.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d2157b282785fcddbc4893d2fd672168f6a1ca2bf07e2c1118f085a84ebbc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvf/rvf-runtime/src/qr_seed.rs:667-679 | crates/rvf/rvf-runtime/src/witness.rs:556-568 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_seed.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bbdef0489129caa46919c768cf09fae59d129c97345488d923e824c4c28a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/rvforge-reader/src/dock_roster.rs:268-278 | crates/rvforge-reader/src/dock_roster.rs:281-291 | crates/rvforge-reader/src/dock_roster.rs:294-304 \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":"crates/rvforge-reader/src/dock_roster.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"466b492339c02b1b93a51b65e5ad1f4e773a4e72bf6ffac95ec308c9c7e02bff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/rvm/crates/rvm-proof/src/signer.rs:128-140 | crates/rvm/crates/rvm-proof/src/signer.rs:299-311 | crates/rvm/crates/rvm-proof/src/tee_signer.rs:125-135 \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":"crates/rvm/crates/rvm-proof/src/signer.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aab948aef3eec1c378a36933a20211247fa2e97e673ec6c3fa2c47c8c28e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rvm/crates/rvm-wasm/src/agent.rs:169-178 | crates/rvm/crates/rvm-wasm/src/agent.rs:185-194 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/agent.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc265858e6d7e9d87fc767d99a5fdd006f1122f0f7d90e9d7e50f26c9733496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvm/crates/rvm-wasm/src/quota.rs:210-219 | crates/rvm/crates/rvm-wasm/src/quota.rs:231-238 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/quota.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"57396b298625ec38433234c50e2d7d7c8786d78d8bd27718790d1f3738e81b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/sona/src/training/factory.rs:138-148 | crates/sona/src/training/factory.rs:156-163 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/training/factory.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a560fbd1ba2ca94dd7564a268df58e81e8c8f60e4ca460cbf34cf9312d0225"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): edge/gateway/src/service.rs:184-194 | edge/gateway/src/service.rs:197-203 \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":"edge/gateway/src/service.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fc1793bf0f9c88a9b816af2c1c1d6901667875dfbdb39401fbe113788ede2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:689-697 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:885-893 \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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f887705e1e85405a213f2dffb17f98caf99333feee571ff61a2a8306788a312"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/prime-radiant/src/learned_rho/config.rs:35-50 | crates/prime-radiant/src/learned_rho/config.rs:55-70 | crates/prime-radiant/src/learned_rho/config.rs:73-88 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/learned_rho/config.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd2068ab36b03e4c86863fe7560c5ece2604a88194cd59443082fc011b7e841"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/prime-radiant/src/substrate/graph.rs:247-254 | crates/ruvector-graph/src/index.rs:270-277 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/graph.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70f7e64a53a6b6d6d8648abe9c5ea19d0fa5012babd1820513636bfe9f55a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-cnn/src/layers/conv.rs:202-212 | crates/ruvector-cnn/src/layers/conv.rs:506-516 | crates/ruvector-cnn/src/layers/conv.rs:519-529 \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":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13c467be32f0d612c486df3390afe54065b80441bee61c5e4a08adf18cb8a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/ruvector-core/src/storage.rs:330-344 | crates/ruvector-graph/src/storage.rs:276-286 | crates/ruvector-graph/src/storage.rs:353-363 | crates/ruvector-graph/src/storage.rs:446-456 \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":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"de38ab6c5940c3ba6c129f5336044b0610a94f8cc24a74dd0590d6cd9a4ef9e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-dag/src/qudag/crypto/differential_privacy.rs:68-75 | crates/ruvector-pq-search/src/main.rs:293-297 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/qudag/crypto/differential_privacy.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b306e2f38988c4b0a261085f5371b0e83567ec6f816fb20ae886359d73f197"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ruvector-decompiler/src/inferrer.rs:340-357 | crates/ruvector-decompiler/src/partitioner.rs:365-381 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/inferrer.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bf06d9b486a6b5f344ed52d2d8ebf508988b4522591b222b3772acf9215efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvector-domain-expansion/src/planning.rs:542-548 | crates/ruvector-domain-expansion/src/rust_synthesis.rs:486-492 | crates/ruvector-domain-expansion/src/tool_orchestration.rs:613-619 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/planning.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad334387446e3eb2f57cbd54a2bb37bf430f4968583df935ef555fddd6fb68e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-edge-store/src/mem_store/mod.rs:304-310 | crates/ruvector-edge-store/src/mem_store/mod.rs:312-318 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/mem_store/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0469f4f198c0c9d7010e12cb46550d42bc2f7f825dde5bec0191ff19b65669a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-edge-tenancy/src/shard.rs:92-100 | crates/ruvix/qemu-swarm/src/consensus.rs:1075-1084 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-tenancy/src/shard.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b8bdc3c52931180d930e9bb9a17a6ea5c5f599788d1618640b4eb87cdd5d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-hailo-cluster/src/lib.rs:945-956 | crates/ruvector-hailo/src/lib.rs:716-727 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/lib.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"a699af7991bade0996b35eb3dc2ff374ef1e2d938a8e13aaf0c362f643b13f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-postgres/src/graph/sparql/parser.rs:2324-2336 | crates/rvlite/src/sparql/parser.rs:2368-2380 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6b2e36504e9c0cba600af0ffb724b57b17d100dc1cf0d8c2d40daf9803ea81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-postgres/src/learning/trajectory.rs:53-65 | crates/ruvector-postgres/src/learning/trajectory.rs:68-80 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/learning/trajectory.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"421225e551be73bc9ab537df812fa33a37d7666cb9ce78ce78f75867090d5722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-postgres/src/types/vector.rs:135-149 | crates/ruvector-postgres/src/types/vector.rs:152-166 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/vector.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1cc2203de4bd5534466265effb9392a17292bfe649753b738ae04233ddad21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-rulake/src/backend.rs:287-298 | crates/ruvector-rulake/src/fs_backend.rs:204-213 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/backend.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb4de6edbab08259432a10586aa275847c889c4ce8c5d04884bdc965b42b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-turbovec/src/quantize.rs:81-92 | crates/ruvllm/src/quantize/quip.rs:552-566 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turbovec/src/quantize.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8849534136e05452d9e4b85e80e47bb5ed1242830e0467c07211f7f2322bd56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/ruvix/crates/cap/src/optimized.rs:314-324 | crates/ruvix/crates/cap/src/optimized.rs:332-342 | crates/ruvix/crates/cap/src/table.rs:176-185 | crates/ruvix/crates/cap/src/table.rs:196-205 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/optimized.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"058d60325bdddac47f3318962511ef68d54a759f70d7097854bd808fa7753f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rvf/rvf-adapters/agentdb/src/vector_store.rs:68-83 | crates/rvf/rvf-adapters/rvlite/src/collection.rs:41-54 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/agentdb/src/vector_store.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73114c2bd30ee5c9d94e729e62ccf06dd7474dab765e902777916ba8d2905f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/rvf/rvf-node/src/lib.rs:773-782 | crates/rvf/rvf-node/src/lib.rs:786-795 | crates/rvf/rvf-node/src/lib.rs:799-808 | crates/rvf/rvf-node/src/lib.rs:860-872 | crates/rvf/rvf-node/src/lib.rs:1042-1051 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/src/lib.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a811bfa8706a783703e55b6280ff55faf59d7c59d8568b29fb81775460e8cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvf/rvf-server/src/tcp.rs:170-178 | crates/rvf/rvf-server/src/tcp.rs:185-192 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/tcp.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b5849395aa542ef9ebf397fea0ded0e9eeffd9336cb7cba6259644a661845e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rvlite/src/sql/parser.rs:514-530 | crates/rvlite/src/sql/parser.rs:767-781 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/parser.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07803999f036b3f0a9fac996ca8722a4129c8d8589758e1664abf112a69a9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): edge/auth-worker/src/platform.rs:67-77 | edge/gateway/src/platform.rs:45-55 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/auth-worker/src/platform.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd460055b3d5ee2c46f84a49061475dfae1c2a0b069939bc41eafd20398cbbc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/pickle.rs:92-100 | patches/candle-core-0.9.2/src/pickle.rs:94-102 \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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ebead8adf0a3eb742a4924697fb28460ba4b23e311570141205ac2a05cd919"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.8.4/src/streaming.rs:168-175 | patches/candle-core-0.9.2/src/streaming.rs:168-175 \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":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3271fcbab2a90b4ded35b529b7b8966c5f5c12118733f268f2fee807f74eb5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/cognitum-gate-tilezero/src/decision.rs:127-140 | crates/cognitum-gate-tilezero/src/decision.rs:151-164 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-tilezero/src/decision.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8861708f035a19bae6b3d486130bbfc2a9544a21499b50d9cf9a30dfba9a760d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/mcp-brain-server/src/graph.rs:1032-1040 | crates/rvf/rvf-federation/src/diff_privacy.rs:91-99 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"39caa0ecf08513206c63cea55169fa9f220247eac7cc744f4f2c2f89518b7af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/photonlayer-bench/src/mnist_bench.rs:88-100 | crates/photonlayer-bench/src/pipeline.rs:38-45 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/mnist_bench.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ebb462ea0f4231ee248ce28505619c100c34d2ef189ba8012fd8bbca5cd257"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/prime-radiant/src/types.rs:601-608 | crates/rvf/rvf-node/src/lib.rs:1162-1169 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/types.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f620893d7bcfbb55f21bc6f486683412992de001780fcf51b93ec4fa3866fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): crates/ruvector-adaptive-ann/src/metrics.rs:9-16 | crates/ruvector-cluster-rag/src/lib.rs:72-76 | crates/ruvector-hybrid/src/lib.rs:70-77 | crates/ruvector-temporal-coherence/src/lib.rs:88-95 \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":"crates/ruvector-adaptive-ann/src/metrics.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8d55d4f62dcdce27a512865bd538bfd5db9b853520cd2233a2da7fd23919cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-attention/src/sparse/mask.rs:45-58 | crates/ruvector-attention/src/sparse/mask.rs:116-126 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sparse/mask.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"57571746f5cabee2904ff63badad4cdbbf69701cf6d0e0073bb015d07df10774"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-cli/src/cli/progress.rs:20-31 | crates/ruvector-cli/src/cli/progress.rs:34-44 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/progress.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c69cb036d3e3548a04116db96262b71eaa49bc74aa88a4ed2e86d9870777c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-fpga-transformer/src/quant/lut.rs:84-99 | crates/ruvector-wasm/kernels/rope.rs:282-292 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/quant/lut.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7061e3c84dd3abe3f148e03c3c078e52568c60a64d211b58477bff8587fb9d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): crates/ruvector-mincut-gated-transformer/src/state.rs:228-241 | crates/ruvector-mincut-gated-transformer/src/state.rs:245-258 | crates/ruvector-mincut-gated-transformer/src/state.rs:262-275 | crates/ruvector-mincut-gated-transformer/src/state.rs:311-323 | crates/ruvector-mincut-gated-transformer/src/state.rs:340-356 | crates/ruvector-mincut-gated-transformer/src/state.rs:360-376 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/state.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"132b3764113eb91a1a69934d36b093472052d0379637845f03d4ef549f5cb490"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-mincut/src/optimization/cache.rs:188-201 | crates/ruvector-mincut/src/optimization/cache.rs:204-217 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/cache.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd58994d76a34c452db75f71737374bba8f30b214ab82f72a98042e602e2fab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-mincut/src/parallel/mod.rs:172-177 | crates/ruvector-mincut/src/wrapper/mod.rs:517-521 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/parallel/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a42bd6ff4179aa29c3a52d2808a307bb5616c93c462953760b955aac0d615e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/ruvector-postgres/src/integrity/gating.rs:214-231 | crates/ruvector-postgres/src/integrity/gating.rs:234-251 | crates/ruvector-postgres/src/integrity/gating.rs:254-271 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/gating.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"37216dc73df31cd9d9207b5a4e72387312d77b55e50e53b61248e5bf4340ee66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-postgres/src/types/productvec.rs:95-106 | crates/ruvector-postgres/src/types/productvec.rs:112-124 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/productvec.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a563ee9979345f2d6fec8086871aa9d78271e09096773e3161901d06e1373d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ruvector-sparse-inference/src/backend/wasm.rs:189-197 | crates/ruvllm/src/kernels/activations.rs:321-329 | crates/ruvllm/src/kernels/ane_ops.rs:617-625 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/wasm.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9b26412f6cff3ac3c337f91f9a6e87098ccc5f0238190f8149598ca3bd81d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-weaver/src/graph.rs:44-50 | crates/ruvector-weaver/src/seo/facts.rs:16-22 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/graph.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a184b25b94ae21aa31d83429c967effc34baf9f01e630021c085f07ae687774"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/ruvix/crates/dma/src/config.rs:195-212 | crates/ruvix/crates/dma/src/config.rs:216-233 | crates/ruvix/crates/dma/src/config.rs:237-254 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/dma/src/config.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fa951520259de01a4b7f1e6e15563821eb369f172d143119687931d1848d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvllm/src/claude_flow/pretrain_pipeline.rs:1177-1187 | crates/ruvllm/src/sona/ruvltra_pretrain.rs:647-659 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/pretrain_pipeline.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac58ac649e34a63386b876c03b0d32fbaa839f9d51abe5e7d8a3367abb519505"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rvAgent/rvagent-middleware/src/hnsw.rs:592-601 | crates/rvAgent/rvagent-middleware/src/hnsw.rs:604-613 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fcc5276cc1512a21b4cb09cc1651609f8f018f627fb64b61a50237b0fe8edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rvAgent/rvagent-wasm/src/gallery.rs:767-776 | crates/rvAgent/rvagent-wasm/src/gallery.rs:780-790 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/gallery.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"263e0c21a6f315a9eb74f5e1048874420907b80ba0f5d3562638ac72cb00608f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): crates/rvm/crates/rvm-security/src/gate.rs:212-221 | crates/rvm/crates/rvm-security/src/gate.rs:224-232 | crates/rvm/crates/rvm-security/src/gate.rs:353-362 | crates/rvm/crates/rvm-security/src/gate.rs:365-373 | crates/rvm/crates/rvm-security/src/gate.rs:455-466 | crates/rvm/crates/rvm-security/src/gate.rs:473-481 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-security/src/gate.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a5a81d26fb2b56dca9145035de3ff519177b00a7aa5abddd9cb21472e2eac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/rvm/crates/rvm-witness/src/emit.rs:22-31 | crates/rvm/crates/rvm-witness/src/emit.rs:37-46 | crates/rvm/crates/rvm-witness/src/emit.rs:52-62 | crates/rvm/crates/rvm-witness/src/emit.rs:68-77 | crates/rvm/crates/rvm-witness/src/emit.rs:83-93 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/emit.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9f891c8f25ac16b8089f52ea30ba29eb0396143b7f2084c9296a6204dbc6e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): edge/gateway/src/graph_routes.rs:161-167 | edge/gateway/src/m3_transport.rs:62-68 \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":"edge/gateway/src/graph_routes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b7bb17ef8bd57717928c07c2a80ac17415f1a85541d451ceaef17862694dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.8.4/src/mkl.rs:284-291 | patches/candle-core-0.8.4/src/mkl.rs:294-301 \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":"patches/candle-core-0.8.4/src/mkl.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfdee017da66729a63ddb5a764c9381bf7abfc7032b9879f131c6a49c81d370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/mcp-brain-server/src/store.rs:1168-1173 | crates/rvAgent/rvagent-mcp/src/registry.rs:118-122 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98a00fc724973e6f17d08f81cf116437c4dbef097be4d9c1f782dd9124ab7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/prime-radiant/src/substrate/edge.rs:125-140 | crates/prime-radiant/src/substrate/edge.rs:148-169 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/edge.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"195066b92639c03367e9732519e6ca665a1ab1b9c49379cdac7ea987a4b0bf9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-attention/src/sheaf/attention.rs:212-223 | crates/ruvector-hyperbolic-hnsw/src/tangent.rs:105-116 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4343c86d1794a4f2a371c72bb22065ac6b0717b155af63831ca8a8b183d4171f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-cnn/src/quantize/tensor.rs:280-291 | crates/ruvector-cnn/src/tensor.rs:180-190 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/tensor.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3789495bc03ed32dd3de39eec4f331721e88b1d3eee61e901ab3ad682a9a527"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-core/src/index/flat_graph.rs:62-71 | crates/ruvector-wasm/src/portable.rs:65-74 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/flat_graph.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc1ede0c0fe42301599a6076a70f0fe9fb283fbfeda7239f0706ea9b327aff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-fpga-transformer/src/quant/lut.rs:68-81 | crates/ruvector-fpga-transformer/src/quant/lut.rs:228-240 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/quant/lut.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d161124a1a78f5b4adfdb8f01629e0c1dbecfb9802b7e44e53af507bc1db2d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-kge/src/train/mod.rs:352-358 | crates/ruvector-kge/src/data.rs:392-398 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/train/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbff30c5b7e2c4cb641a2ab85681e17b50445a61400d038824166e17453f1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-mincut-wasm/src/lib.rs:218-231 | crates/ruvector-mincut-wasm/src/lib.rs:567-577 | crates/ruvector-mincut-wasm/src/lib.rs:681-691 \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":"crates/ruvector-mincut-wasm/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7582ee069e91559e2d9c20477913ac98beb6c0dca9a3e9851e27c1867ee1c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-mincut/src/cluster/mod.rs:174-186 | crates/ruvector-mincut/src/cluster/mod.rs:189-205 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b4bece77eea3fec6e7ca744ec69825122e8941e5f3599a46d5a49294c047da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-mincut/src/optimization/pool.rs:305-312 | crates/ruvector-mincut/src/optimization/pool.rs:315-322 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/pool.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc804fd6da88879d95c1c0d0fedc3aabd26a90eb49a0933e1f65a272d1ec78ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-node/src/lib.rs:168-185 | crates/ruvector-node/src/lib.rs:592-603 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-node/src/lib.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7573907682d6f025603cff93b10f3fbd2c162edd74cca63fd4ec43ef8f4f240c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-node/src/lib.rs:662-671 | crates/ruvector-tiny-dancer-node/src/lib.rs:203-211 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-node/src/lib.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd144bcc1d8be539d515624c64075395a601b559c73cdb752acfbf05ebad824"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-postgres/src/graph/operators.rs:416-426 | crates/ruvector-postgres/src/graph/operators.rs:447-457 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78d5da0171d229b94335cccc3266010fc9e424908c21ea10c3bd5834b2da379"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvector-postgres/src/graph/sparql/executor.rs:130-149 | crates/rvlite/src/sparql/executor.rs:110-124 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c890e3d6b3c4bfdb5a8e569f31aa41e74ef1dacb38aeb32febb3dbf3a86126cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ruvector-postgres/src/operators.rs:301-314 | crates/ruvector-postgres/src/operators.rs:331-343 | crates/ruvector-postgres/src/operators.rs:474-483 \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":"crates/ruvector-postgres/src/operators.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ffa349504e80983d9b79b7b8e5ed13102273d11a58c67f302bb2128781d465"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/ruvector-robotics/src/domain_expansion.rs:800-802 | crates/ruvector-robotics/src/perception/mod.rs:516-518 | crates/ruvector-robotics/src/perception/scene_graph.rs:167-169 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/domain_expansion.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee958491b10ff7678d72b3648b73f3ebe9d77aa182a720e28c21be5c08865e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvix/crates/fs/src/ramfs.rs:87-102 | crates/ruvix/crates/fs/src/ramfs.rs:133-148 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/fs/src/ramfs.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7577887ffc5ee8f282f7227de3e50c1fc7745edfa200a6f7a9bb1e83f1d35d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvix/crates/rpi-boot/src/lib.rs:163-177 | crates/ruvix/crates/rpi-boot/src/spin_table.rs:154-169 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/rpi-boot/src/lib.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9e96acb54a2eb563eadbdeb31ea8e7e213c0d192c75a897d9347ba44a872f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvllm/src/kernels/activations.rs:125-137 | crates/ruvllm/src/kernels/activations.rs:257-273 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/activations.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5c8371497355ae3773729544791d508b34f70535adb22d9c4e85fafcd92d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvAgent/rvagent-a2a/src/identity.rs:59-66 | scripts/seed-brain.rs:263-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":"crates/rvAgent/rvagent-a2a/src/identity.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b637d1a12081c99d3ecac2ba655dc5596a6d9d70320425c1e2cd17db37c65e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): patches/candle-core-0.9.2/src/strided_index.rs:15-30 | patches/candle-core-0.8.4/src/strided_index.rs:14-28 \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":"patches/candle-core-0.9.2/src/strided_index.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0124781dee20fcd75fa99ea16367a806cc214c38f6a90cfdb69e691aae6fb1f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/mcp-brain-server/src/web_store.rs:139-148 | crates/ruvector-postgres/src/graph/sparql/triple_store.rs:534-543 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/web_store.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"db685de7929859cf1e21b7f35b81fff0e338421a40eb66a1a3b0da8d8cc5aaa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/prime-radiant/src/coherence/engine.rs:155-165 | crates/prime-radiant/src/substrate/edge.rs:383-391 | crates/prime-radiant/src/substrate/node.rs:339-346 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2576fdc3c10896dafb0ed99dd58143c3d9e1e7d4e31018f6c927b17ee7042c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvector-cli/src/cli/hooks.rs:1447-1454 | crates/ruvector-cli/src/cli/hooks.rs:1484-1501 | crates/ruvector-cli/src/cli/hooks.rs:1997-2013 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"09535ebbf3e11e68cbb6c829902bcdc6842806d5e9f27af070045bde54b2efa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-delta-wasm/src/lib.rs:299-307 | crates/ruvector-delta-wasm/src/lib.rs:427-435 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-wasm/src/lib.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c5542cdfbae8b205c764a79e83c7f7d43fa5a707e03cb2040174d7fab51d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-edge-snapshot/src/types.rs:180-186 | crates/ruvector-edge-snapshot/src/types.rs:189-195 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/src/types.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a24d2e8d90a62886b6305d2d5050e837ba43f9f63e3d2dcacf65a2957c08b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-edge-tenancy/src/validate.rs:25-36 | crates/ruvector-edge-tenancy/src/validate.rs:42-53 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-tenancy/src/validate.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bd0c46252b926cf91f63f7c1f224d86479171a78b748c3f50da94bba0ed11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruvector-graph-node/src/transactions.rs:48-62 | crates/ruvector-graph-node/src/transactions.rs:65-79 | crates/ruvector-graph-node/src/transactions.rs:82-95 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/transactions.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd265c809a41da72baae8a2c97910b0e2aa1c0a1caef433397c776c177a9bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-hnsw-repair/src/graph.rs:306-314 | crates/ruvector-matryoshka/src/hnsw.rs:341-348 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/graph.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"305ac5bdcf0013ecd9104a30a344ed4693729f233449838c14fb1154b2c60e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/ruvector-mincut/src/tree/mod.rs:373-388 | crates/ruvector-mincut/src/witness/mod.rs:389-404 | crates/ruvector-mincut/src/witness/mod.rs:407-422 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/tree/mod.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5afae9dcf80a243edf4302488e8f266bc1fa2e0562aee58c3e973b719f5796c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-postgres/src/index/ivfflat.rs:238-251 | crates/ruvector-postgres/src/index/ivfflat_am.rs:547-560 | crates/rvf/rvf-quant/src/product.rs:168-179 \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":"crates/ruvector-postgres/src/index/ivfflat.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1e79b62788956f1f499559a6c01f8f6f4f14fcc12a3c5e56e891f39cb3ceb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-pq-search/src/encoder.rs:18-25 | crates/rvf/rvf-quant/src/product.rs:86-93 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-pq-search/src/encoder.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d16033d458fd73993d9f352aa86098ce173b1feafe9cf5b454cccc7aaa05962"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/ruvector-profiler/src/csv_emitter.rs:16-33 | crates/ruvector-profiler/src/csv_emitter.rs:35-46 | crates/ruvector-profiler/src/csv_emitter.rs:48-66 \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":"crates/ruvector-profiler/src/csv_emitter.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26de78895b80c6e38771aac2ebf15c87c3a1973a4705267d3379c5ea29cfd75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-sparse-inference/src/pi/angular.rs:53-66 | crates/ruvector-agent-memory/src/main.rs:49-52 \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":"crates/ruvector-sparse-inference/src/pi/angular.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"417c6f2b70dc68129070b9ddd1eb5e56329f68a855f9799c9198a80745816cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/ruvix/crates/net/src/icmp.rs:291-309 | crates/ruvix/crates/net/src/icmp.rs:314-332 | crates/ruvix/crates/net/src/icmp.rs:411-424 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/icmp.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d54f728f37e3cf51a744fa8d05146186a7a9de8a558c7eb294cb0468f3ad3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ruvllm/src/backends/phi3.rs:616-625 | crates/ruvllm/src/models/ruvltra.rs:895-905 | crates/ruvllm/src/models/ruvltra_medium.rs:783-794 \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":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed318a8d12ade7db224d40fc807a3f955c8cf48f3fc18d97c30e86838164f313"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rvAgent/rvagent-a2a/src/routing.rs:266-277 | crates/rvAgent/rvagent-a2a/src/routing.rs:309-315 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/routing.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecdc3db6c9c63e2e68ae7e6b30b801f54bed280f86df7ed9af0cc3251a0fbcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rvAgent/rvagent-tools/src/edit_file.rs:22-46 | crates/rvAgent/rvagent-tools/src/read_file.rs:22-43 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-tools/src/edit_file.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7137739864ba9e129926616bcd09fdc063d2cf233056f583e9b800e7211a22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:880-888 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:987-995 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ad2a61be3d67099f5742e1e2c9f81f788370de9ea4dd441e58bd6399142fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1351-1359 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1616-1624 \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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4b1a008dc539f62fe9c3301782ac95c15aef1d5ce21b9d981807967e63510a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/photonlayer-ruvector/src/embedding.rs:21-28 | crates/ruvector-maxsim/src/score.rs:145-152 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-ruvector/src/embedding.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b6b8f854e5e9500e0cd7076329747c55c67683c8f955f13d4b1fb77b78517b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ruvector-delta-wasm/src/memory.rs:137-148 | crates/ruvector-delta-wasm/src/memory.rs:152-163 | crates/ruvector-delta-wasm/src/memory.rs:172-181 \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":"crates/ruvector-delta-wasm/src/memory.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5840651e476ca3edab297f89682adc49b1c5e448566a5a79b6683afed782f1a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-edge-snapshot/src/rvf_format.rs:37-44 | crates/rvf/rvf-runtime/src/hashing.rs:44-52 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/src/rvf_format.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a79896e55defcaa0f0e260dc624199037dbfc971d38f4d238258a5eaff5b87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-mincut/src/instance/stub.rs:198-214 | crates/ruvector-mincut/src/instance/bounded.rs:387-399 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/instance/stub.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d968f2be0ddc94d5359b9c4568bee501fbb5e56c075a0521b9e9370c4fdd86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-mincut/src/optimization/parallel.rs:365-371 | crates/ruvector-mincut/src/optimization/parallel.rs:395-407 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/parallel.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8879687ec6fd106d2f0da469e505c325244d0801bdebd805cfbe9fa73de237c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:657-666 | crates/ruvector-postgres/src/distance/simd.rs:719-727 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"32603d0d0c1e261595868a393754c3b1f070c3e67fff462a0b5c9c82067af8fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-postgres/src/tenancy/quotas.rs:295-306 | crates/ruvector-postgres/src/tenancy/quotas.rs:309-319 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/quotas.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc319a5c2bf27a09ffa077658f25d53b42c4915fecd14decbc52e7f539c7526"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-typesafe-train/src/leakage.rs:85-95 | crates/ruvector-weaver/src/ledger.rs:158-166 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/leakage.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5e00b7d113f412851ba53e70c45d1f1798a9d8b60ae0ed635baa7b47afe2cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvllm/src/lora/micro_lora.rs:945-951 | crates/ruvllm/src/lora/adapters/trainer.rs:132-137 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"12334fa6668184ba7de60cb0ba551bddbd02519963801dca9b36a8d05165581d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ruvllm/src/quantize/hadamard.rs:241-261 | crates/ruvllm/src/quantize/hadamard.rs:523-544 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b75b8de9501dc8c202237244ef4b466aa23e4e231d812b3e7e8cc895436b6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ruvllm/src/reflection/reflective_agent.rs:311-325 | crates/ruvllm/src/reflection/reflective_agent.rs:354-369 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/reflective_agent.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9a0d274b5e73a25d181172b2ba9c0999245c4a3191a20c3e31bace598c1d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rvf/rvf-runtime/src/index_path.rs:172-183 | crates/rvf/rvf-runtime/src/index_path.rs:187-195 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/index_path.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"888d42dfc75afa0b86107a603e4aa06dba06582117d154e4600a070a21c780d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/photonlayer-core/src/field.rs:18-30 | crates/photonlayer-core/src/mask.rs:28-41 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-core/src/field.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7400481b052359c16c97039bb71a47f8fbc4296c4ed9dd36b37061ed7c02a919"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-edge-registry/src/registry/mod.rs:172-179 | crates/ruvector-edge-registry/src/scopes.rs:80-87 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-registry/src/registry/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffd603da9b6d061ec77edb592842abd3eba88d90a475147102d4358fcbc9076"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs:246-251 | crates/ruvector-sparse-inference-wasm/src/lib.rs:68-73 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"80642987530b3876bb2363906c6d14d78626a5f6041e7de2ed5a28291b8909bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-math/src/utils/sorting.rs:4-12 | crates/ruvector-sparse-inference/src/model/runners.rs:44-50 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/utils/sorting.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"02893d0f788bcd8e6a787ef28849a6ae2e715c65e6e830800f58ed3eb9d86def"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-mincut-node/src/lib.rs:476-485 | crates/ruvector-mincut-node/src/lib.rs:569-578 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/lib.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e909048f51d8ae84352332ee544c1f38a375d0aae56d434f375f2a189548d960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-postgres/src/hybrid/registry.rs:207-217 | crates/ruvector-postgres/src/hybrid/registry.rs:224-235 | crates/ruvector-postgres/src/hybrid/registry.rs:243-253 \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":"crates/ruvector-postgres/src/hybrid/registry.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc80643a7f6fef2f29f22da3effc2d3ffd3ac5a4d03ff32381e9551cd898e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-postgres/src/learning/trajectory.rs:172-180 | crates/ruvllm/src/claude_flow/claude_integration.rs:1154-1162 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/learning/trajectory.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f5d68b327475361f6d5639da47fa602f7ef39e901f1f8e36c50359c2a6dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-postgres/src/types/mod.rs:208-219 | crates/ruvector-postgres/src/types/mod.rs:254-263 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8549ea1258b3723527a93ada9ac6731c5d9ebdb0d8b574cff516259831c1d954"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvllm/src/hub/progress.rs:175-184 | crates/ruvllm/src/hub/download.rs:518-526 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/progress.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4094b05c39672b0515ed6978a6e2bff50c4d2062c15b769792fa429f4209da40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/rvAgent/rvagent-mcp/src/resources.rs:105-115 | crates/rvAgent/rvagent-mcp/src/resources.rs:210-220 | crates/rvAgent/rvagent-mcp/src/resources.rs:328-335 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/resources.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0062cac32683cf424d5de7bf9cac73f17721595310de5216e2f1558030ebf79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/mcp-gate/src/schema_cache.rs:417-427 | crates/rvf/rvf-runtime/src/dos.rs:193-202 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/schema_cache.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b134674d125656ad4e6cd966227fddc97ead8fd086dbd580820ac169cd6fa8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/prime-radiant/src/governance/policy.rs:544-554 | crates/prime-radiant/src/governance/policy.rs:584-594 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/policy.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c0a8ff2b68c2b1cf10065ec707650de83614a18dc3ac4d51d3615212c3a513"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvector-attention-unified-wasm/src/mamba.rs:300-310 | crates/ruvector-attention-unified-wasm/src/mamba.rs:313-323 | crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:70-76 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/mamba.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2692f488426b530305bcc4a3a6f43136c139e7feadcd44870efffd170bf8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-attention/src/pde_attention/laplacian.rs:177-185 | crates/ruvector-matryoshka/src/hnsw.rs:38-46 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/pde_attention/laplacian.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f32c91893f413e9d55e1cfad14060986ab269f3e9e9c8a8650279df78f32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-cnn/src/simd/quantize.rs:317-325 | crates/ruvllm/src/bitnet/dequantize.rs:81-97 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/quantize.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"829ee9a924e21eb7a12d41d5f0da49e64d05cfd321b2344164bb1504b8801ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-embed-core/src/manifest.rs:115-124 | crates/rvAgent/rvagent-middleware/src/memory.rs:81-91 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-embed-core/src/manifest.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99c37811c071efdb4c97ba64b8a3e4fa37e42ad5cfed9e2a305d90ef5a02231"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-gnn/src/tensor.rs:34-45 | crates/ruvllm-wasm/src/workers/shared.rs:60-74 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/tensor.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30ec52e018e3b01e007972f4a3ccddb42c588db70f9478e201d0df027c66bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-rabitq/src/main.rs:55-58 | crates/ruvector-spann/src/bin/benchmark.rs:64-67 \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":"crates/ruvector-rabitq/src/main.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"762b243c72b069ae603304bba1c16f5c42c0471ba63585324498a634a5c3aaf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): edge/auth-worker/src/sql_ports.rs:258-268 | edge/auth-worker/src/sql_ports.rs:323-333 \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":"edge/auth-worker/src/sql_ports.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fbc24d241bfbe39cba18a69db154c64957a001211ccdba207c609f9c70ee0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:304-316 | patches/candle-core-0.9.2/src/quantized/mod.rs:461-473 \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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e507608e7fa40a8a820ba396bcba62d48bcd861d3f372e44bce1d3e7caabd149"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvector-graph/src/optimization/adaptive_radix.rs:302-315 | crates/ruvector-graph/src/optimization/adaptive_radix.rs:318-331 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/adaptive_radix.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc303b6d4249f3923755aebde4f11d00ff6dc2885827ff250d9987755870757"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-graph/src/optimization/index_compression.rs:331-343 | crates/ruvector-mincut/src/optimization/pool.rs:485-495 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/index_compression.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4498c8929e037685617fedd49341af5ac62c0c4cafc228b231528ddd307e31af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvix/crates/fs/src/vfs.rs:716-725 | crates/rvm/crates/rvm-partition/src/cap_table.rs:30-39 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/fs/src/vfs.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"18eb4b35df8d72b5f53ad388b157cd77890e3e99d68d79256a0f6bbebb269f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvllm/src/backends/gemma2.rs:203-216 | crates/ruvllm/src/kernels/activations.rs:454-466 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8f8bc66cec2e251bb6d2e9d4cd920531cfd0a9fce2a2293ff0b20f3557988c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ruvllm/src/lora/training.rs:623-639 | crates/ruvllm/src/quality/diversity.rs:680-693 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/training.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfdf8c138c7227e7259f37fa30d2a13f515d139a7fffb606b03b8b7df5e08d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvf-forge-core/src/manifest.rs:274-284 | crates/rvf-forge-core/src/provenance.rs:196-203 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf-forge-core/src/manifest.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd339fa30cb06206243e6455158c5a1e97d0029ec25ab7c852743bece51e53b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): patches/candle-core-0.8.4/src/quantized/mod.rs:82-88 | patches/candle-core-0.8.4/src/storage.rs:30-36 | patches/candle-core-0.9.2/src/quantized/mod.rs:140-146 | patches/candle-core-0.9.2/src/storage.rs:31-37 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ee7259179c55e46718e06f23b3cc3dc107cee5f4913c9a6e09cebfbbb1fea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/ruvector-adaptive-ann/src/graph.rs:50-53 | crates/ruvector-bounded-rag/src/lib.rs:197-204 | crates/ruvector-diverse-beam/src/lib.rs:53-56 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/graph.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe270abc6bcad0ba77c1cf070c02e147ebe9a8373b962aab280c6186a0b9f721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-cnn/src/embedding.rs:175-182 | crates/ruvector-rabitq/src/rotation.rs:206-211 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/embedding.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7507556c8657f7aefa59318291dc28612aec800f651f2d4c9f736464a742eba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/ruvector-cnn/src/simd/scalar.rs:33-39 | crates/ruvector-cnn/src/simd/scalar.rs:43-48 | crates/ruvector-cnn/src/simd/scalar.rs:52-57 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1992b262b042023a2841d0ef69ed1bbb39265e14986c98c9791f2ce758c541b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-proof-gate/src/gate.rs:128-135 | crates/ruvector-retrieval-receipt/src/receipt.rs:74-81 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-proof-gate/src/gate.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd5f6d24007cc20b627c4aa89acaa173218cc93940603749075d71793a710d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvlite/src/cypher/graph_store.rs:230-243 | crates/ruvector-postgres/src/graph/storage.rs:109-121 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/graph_store.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc76da1723f3e11b363a8bd94e4977e9d354fda5ef55dcf74fc38e2605bb46cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvm/crates/rvm-proof/src/lib.rs:100-112 | crates/ruvix/crates/boot/src/witness_log.rs:146-156 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/lib.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b6264be2b24a53d2b506df37dcc2aa543c4bb96ac7531120ca4cd45716b2d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/emergent-time/src/agentic_time.rs:539-547 | crates/emergent-time/src/structural_clock.rs:385-393 | crates/emergent-time/src/weight_learning.rs:96-104 | crates/sonic-ct/src/acquisition.rs:135-143 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5080e9b49a001a0f0cb2675374ddf99239d3ba068eca465c1e690920a8b43969"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/prime-radiant/src/coherence/engine.rs:216-227 | crates/ruvector-attention/src/sheaf/restriction.rs:138-150 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e2719f45c1d2960be70682d4297779d4026e946e7e802c5a6828028b6d7e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/prime-radiant/src/storage/file.rs:498-506 | crates/prime-radiant/src/storage/file.rs:508-515 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cadbe775184bc3f5259f0ddef645d40d801c31c43ed3af1ef560bcdb7dd2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-attention/src/graph/rope.rs:158-167 | crates/ruvector-diskann/src/index.rs:260-272 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/rope.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"39237c955bb9cf259ffd95b5d059d3e23d4330fe9a6aa318e9ab4bbe12fa1890"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-e-means/src/lib.rs:71-81 | crates/rvf/rvf-runtime/src/store.rs:820-828 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-e-means/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9f99329082f23e9e1b7f40ab35738ba75476e0c1012a1da427c738da795650"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/ruvector-memory-admission/src/dataset.rs:167-173 | crates/ruvector-namespace-merge/src/dataset.rs:194-200 | crates/ruvector-spann/src/bin/benchmark.rs:32-38 | crates/ruvllm_retrieval_diffusion/src/lib.rs:156-166 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/dataset.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"55664f1dd65d262d49b921dcd1bb752710dd9c3fde037753588272c00d8e5b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:284-300 | crates/ruvllm/src/bitnet/tl1_avx2.rs:207-218 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb843173af1fd7aad4847df832dbb8d9ea6669903a82ff4ca9dbe0ad4fee6c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvllm/src/metal/buffers.rs:79-86 | crates/ruvllm/src/metal/context.rs:1006-1013 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/buffers.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e00405ca47da82cade1ab7b107b7c388ac821a85884599c66a485e1247b7604"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rvAgent/rvagent-middleware/src/mcp_bridge.rs:86-97 | crates/rvAgent/rvagent-middleware/src/subagents.rs:67-78 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/mcp_bridge.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"52513734305d88c47a1f708239980a32875170b2f87262791b3096ec4f6f1fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvforge-reader/src/receipts.rs:52-65 | crates/rvforge-reader/src/library/mod.rs:111-121 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/receipts.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bcd4c8b918a2d58a88f27c83080c6545730c61a37a98b2ddda05a50b092002"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): edge/auth-worker/src/platform.rs:24-34 | edge/gateway/src/durable.rs:96-106 \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":"edge/auth-worker/src/platform.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3795b9bca85d14d3934a8e35fa644e6c16ea3041a1554c3e364c9e158315126"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:38-45 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:56-63 \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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9e3a080ba8000e42d158813d374835005967796da5a29e86f71272f9a0b927"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/photonlayer-bench/src/diffdetect.rs:147-157 | crates/ruvllm/src/bitnet/backend.rs:2667-2677 | crates/ruvllm/src/models/sampling.rs:254-264 \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":"crates/photonlayer-bench/src/diffdetect.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daa517bf3d350703e1c693e9ed90f4db195660084f5f30435e72991f6335255"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-coherence-hnsw/src/metrics.rs:6-16 | crates/ruvector-matryoshka/src/lib.rs:263-272 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/metrics.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fc64b6b331c63fc02826ac272c8105b525db54b58ce8e9bf6523e01993b873"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-core/src/advanced_features/hybrid_search.rs:131-142 | crates/ruvector-core/src/advanced/hypergraph.rs:305-313 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/hybrid_search.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"34052f45f7a59115aaa3faee4730ab8204b8453142b1665610cc7f47e70ee4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-edge-authz/src/resource.rs:228-236 | crates/ruvector-mincut/src/localkcut/deterministic.rs:92-100 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-authz/src/resource.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"379b50743d48e2550df090e7368d6c4eeda5e620df200e0e89a536805540fd21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-perception/src/custody.rs:100-108 | crates/ruvector-perception/src/custody.rs:152-159 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-perception/src/custody.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0b669e436156f1e7352aebd3f15ad0d3902162cf362a9b7f8d7b2077b9d413"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-postgres/src/graph/mod.rs:244-254 | crates/ruvector-postgres/src/graph/sparql/mod.rs:174-184 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8757b1a2add839f43f5972f1ccdca8a219a6b7c2b7ae016f5657eeb92c558c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-sparse-inference/src/model/gguf.rs:232-242 | crates/ruvllm/src/gguf/parser.rs:270-280 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"077de0fd56d8b7a635a4dc1485faa97a608d2c1965459195db2b39e988595d6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-streaming-qng/src/bin/benchmark.rs:89-99 | crates/ruvector-streaming-qng/src/dataset.rs:102-115 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/bin/benchmark.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80724e84a4f47264bfa3b968ddd79ae8aabc14bdbabe515fbf70102e93ecc5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvix/crates/cap/src/derivation.rs:181-193 | crates/rvm/crates/rvm-cap/src/derivation.rs:178-187 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/derivation.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb06ed3ad913c54e8a200e2363be47c0d73e96ba10d94bcd4cd9e3c21e4dbb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): edge/gateway/src/m3_ledger.rs:90-95 | edge/gateway/src/m3_shard.rs:82-87 \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":"edge/gateway/src/m3_ledger.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5884d6c0755da1c18ac4fc5f7299b2a8a92e74bb5752ef1441859e911ea4f41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): patches/candle-core-0.9.2/src/cuda_backend/device.rs:297-304 | patches/candle-core-0.8.4/src/cuda_backend/device.rs:198-204 \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":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c3b79ca68884a1e83ad9b44572f780bc659147a779143a9db5dfbd498b2642"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/mcp-brain-server/src/pipeline.rs:239-245 | crates/mcp-brain-server/src/web_ingest.rs:288-294 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89b7dab59bc488d0b8d2fd371bbba1e32f40dff79bbe11d7b5ece9c00081c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/mcp-brain/src/client.rs:416-427 | crates/rvf/rvf-crypto/src/hash.rs:22-29 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/client.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6e20f308b66686cc6c3a2466cf37607173f9d06002ad8fac738a3f816b66c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): crates/photonlayer-core/src/rng.rs:24-30 | crates/ruvector-bench/src/bin/turbo4_ablation.rs:22-28 | crates/ruvector-edge-index/src/rng.rs:28-33 | crates/ruvector-turboquant/src/rotation.rs:33-39 | crates/sonic-ct/src/phantom.rs:52-58 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-core/src/rng.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"941b811704b55018bcf908ca358fac9e1a3a3c4999c7c5ca36f8d71a87b270d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/prime-radiant/src/cohomology/cocycle.rs:92-98 | crates/prime-radiant/src/cohomology/simplex.rs:476-485 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/cocycle.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3145f153783be7762dd4cb24f77f4191cf2d94a8ff2e443e0229919f29cf8098"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-mincut-gated-transformer/src/ffn.rs:30-37 | crates/ruvector-wasm/kernels/swiglu.rs:275-283 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/ffn.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1210f495111e0d9f648247b1bfc8ef66d1d19200c47810d904cb6e035eb18c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-mincut/src/connectivity/mod.rs:121-131 | crates/ruvector-mincut/src/connectivity/polylog.rs:85-93 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/connectivity/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff55316db24b29bfdea77ce1f1d89ae4451413d4f032487a278751c27ecf60eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-postgres/src/routing/agents.rs:209-216 | crates/rvAgent/rvagent-mcp/src/registry.rs:93-102 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/routing/agents.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9038118e9df4c6a38b34296b938ff593f00a40659d6ccd6c3430d5dbbc9b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ruvector-temporal-tensor/src/tiering.rs:125-142 | crates/ruvector-temporal-tensor/src/store_ffi.rs:105-120 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/tiering.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1823c685a47a79768dbd731d5c013571bc10dc8e7018db03488cbd960c119200"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvix/crates/region/src/slab.rs:294-306 | crates/ruvix/crates/region/src/slab_optimized.rs:310-320 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/slab.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0b196bfb1ee0cbd105155d03dac4dccc5103d3d9b2155eb2fc8dc4c8dcca6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-py/python/ruvector/collection.py:68-72 | scripts/research-gate/research_gate.py:144-148 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a438115ca3d4cc0ea9b5dd6e4537619b661954cd4b808da27f915a663a79296"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/mcp-brain-server/src/cognitive.rs:175-181 | crates/ruvector-math/src/homology/mod.rs:82-89 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/cognitive.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f60c734f2bb71411f4b7e7e49e4b7337abbf4b1541e83cf516c40b2284e4a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-core/src/arena.rs:412-424 | crates/ruvector-core/src/arena.rs:573-585 | crates/ruvector-core/src/cache_optimized.rs:365-375 \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":"crates/ruvector-core/src/arena.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f366905d62b1ef5731fa038c73e034051b0a043a302a84ef05ebb480fce0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-fpga-transformer/src/gating/policy_gate.rs:117-130 | crates/ruvector-fpga-transformer/src/gating/policy_gate.rs:160-168 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/gating/policy_gate.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a154873bba6c06f72acabf9aa87bc83357713a090c9f7eafce85f3591c165a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-math/src/spectral/mod.rs:180-188 | crates/ruvector-solver/src/true_solver.rs:136-144 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01ce3bcba0ae0556da4a82a6deb29d6abae6ff35cb859954ebf4315016b2e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ruvector-mincut/src/snn/morphogenetic.rs:419-430 | crates/ruvector-mincut/src/snn/optimizer.rs:731-741 | crates/ruvector-mincut/src/snn/time_crystal.rs:325-337 \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":"crates/ruvector-mincut/src/snn/morphogenetic.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dd697f94b2cc931955f760e391c5b53308b97c712ae13e053947ad2aa30fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-query-cache/src/exact_cache.rs:58-71 | crates/ruvector-query-cache/src/semantic_cache.rs:63-71 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-query-cache/src/exact_cache.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48ad6d5a6ef8fb74f87597c087e3a1d5aa71c9e4a5f02de1c0cf961824cf99a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rvAgent/rvagent-a2a/src/routing.rs:30-41 | crates/ruvector-weaver/src/registry.rs:89-97 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/routing.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"794aa2bcf081fc70b788e8d9f495004c0cca788f95b82c52aa38f8437ce5291b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rvforge-registry/src/log.rs:103-107 | crates/rvforge-registry/src/store.rs:32-36 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/log.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e1d117a9df26a26c5e05f4dff479d6baa789a7157204500060131eaa2e62fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rvm/crates/rvm-kernel/src/lib.rs:138-148 | crates/rvm/crates/rvm-witness/src/signer.rs:192-203 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58ee987631b2690dd26165a6d82dcf6f727ea33f51838fbf272819fdfef3102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): patches/candle-core-0.8.4/src/metal_backend/device.rs:184-191 | patches/candle-core-0.9.2/src/metal_backend/device.rs:139-146 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/device.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d93fc5dbf416456c64cf59858392c2f5fcdd0aa0edf56f16a0a8bf78342afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/ruvector-bounded-rag/src/lib.rs:593-602 | crates/ruvector-perception/src/hypothesis.rs:95-101 | crates/ruvector-postgres/src/hybrid/executor.rs:371-378 | crates/ruvector-temporal-coherence/src/benchmark.rs:60-66 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bounded-rag/src/lib.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a455a8a9c689ee076151dd34b097374eb086614528c3eb050c0f1039da2264f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-cnn/src/tensor.rs:224-231 | crates/ruvector-gnn/src/tensor.rs:267-273 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/tensor.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"94516998c8297a25df6460cb2e829f074d89d2c219e55c1db87d891c3f3ffd31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-core/src/vector_db.rs:22-30 | crates/ruvector-rabitq-wasm/src/lib.rs:158-165 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ecd7221cf2aacd4e991695c168249f68fc588a7a3b880560351e84d636183a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/ruvector-kge-ffi/src/model.rs:399-401 | crates/ruvector-kge-wasm/src/model.rs:399-401 | edge/auth-worker/src/upstream.rs:188-194 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7857c7979e2c551a10c08988ec8bb66f4700fb3e9b888f3e04a3489f88945c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-memory-admission/src/dataset.rs:140-146 | crates/mcp-gate/src/bin/schema_cache_bench.rs:31-36 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/dataset.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e693abab0c20d54f5b62e5e64f9a6443a2a26009e61ede0559b5a6abfcf818f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-postgres/src/distance/mod.rs:251-262 | crates/ruvector-core/src/advanced_features/mmr.rs:179-186 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/mod.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9a399c95ba3c3d6bdb4dd3983430e2e1373e5914744951f055e2224b4dc7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-postgres/src/graph/sparql/results.rs:394-400 | crates/ruvector-profiler/src/csv_emitter.rs:68-74 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/results.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"404d7b1cc0d97a3e561e997f110e5cb1be40faea18f18b165560ab205e608856"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvix/crates/cap/src/derivation.rs:134-143 | crates/rvm/crates/rvm-cap/src/derivation.rs:128-136 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/derivation.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e741c4135d1beb95ff6a715fe961084525f195d1f1ae1554300ecc386418c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvix/crates/vecgraph/src/graph_store.rs:709-713 | crates/ruvix/crates/vecgraph/src/hnsw.rs:259-265 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/graph_store.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0472b167aa0ff88b3676eb0df6c029c438fa61c4657c44d5e12c2f6cb1d9d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/rvAgent/rvagent-middleware/src/filesystem.rs:88-195 | crates/rvAgent/rvagent-tools/src/execute.rs:19-35 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/filesystem.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"519780a6ca3a0b60307b42b5028a0444afc304f9f5e33737cd75b90c5edb96df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/rvAgent/rvagent-middleware/src/filesystem.rs:88-181 | crates/rvAgent/rvagent-tools/src/glob.rs:19-35 | crates/rvAgent/rvagent-tools/src/grep.rs:22-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 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/filesystem.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dbbaea033bfd01e7fef09dd1eaeaf9f7b6383f8ec351570e6c83e9b577b8c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rvAgent/rvagent-middleware/src/subagents.rs:112-131 | crates/rvAgent/rvagent-tools/src/task.rs:19-34 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/subagents.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"424ff7bc9882359bb4976b8942ba51addd1e5505180ee92c26ef22a326379b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): crates/ruvector-cluster-rag/src/dataset.rs:33-38 | crates/ruvector-diverse-beam/src/dataset.rs:6-11 | crates/ruvector-retrieval-receipt/src/index.rs:149-154 | crates/ruvector-spann/src/bin/benchmark.rs:41-46 | crates/ruvector-turbovec/src/main.rs:12-17 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/dataset.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"560799482ec5216967d4c672c4bedfdac5106006375f9638d81e38dcedae268a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ruvector-consciousness/src/bounds.rs:244-254 | crates/ruvector-graph-transformer/src/physics.rs:451-461 | crates/ruvllm/src/kernels/matmul.rs:422-430 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/bounds.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca24edd85796cd72c00fafa0cccacfb0b4ffd958b45d2a802ecf4b17a38e250"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-maxsim/src/bucket.rs:69-74 | crates/ruvector-maxsim/src/flat.rs:33-38 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-maxsim/src/bucket.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"46828ff87a3703bb0abebbe9006374efb1f1c29aa2974bb3dfbe495195a45499"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-py/src/llm.rs:11-21 | crates/ruvector-py/src/rvf.rs:19-26 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/llm.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91d8589f60cfc370d0884e0449e111c989ca7310b1bcd39cd71d5c5fe0043f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-replication/src/sync.rs:59-65 | crates/ruvllm/src/quality/scoring_engine.rs:850-857 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/sync.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec811e606ddfc7abac2041686c09e2a45f7424893d91feddb22e44b9e7055c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-sparse-inference/src/pi/drift.rs:284-295 | crates/ruvector-sparse-inference/src/precision/policy.rs:204-211 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/pi/drift.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"274e9488143007c22cf4160e05e7d6b5fd33ea1a945977733c203dbb10ee2f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvix/crates/bcm2711/src/mini_uart.rs:411-421 | crates/ruvix/crates/drivers/src/pl011.rs:242-252 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mini_uart.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfa16a408e6a4468d6fc3126bc8f8cdb28ec9604947e241aca083b50879d244"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:185-190 | patches/candle-core-0.9.2/src/tensor.rs:280-285 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7d323ce400dace2961ec321cbfed05c66aa19044fea3abd4c9f03202cd17bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/photonlayer-ruvector/src/boundary.rs:42-48 | crates/ruvector-hnsw-repair/src/benchmark.rs:292-297 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-ruvector/src/boundary.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8e392a78ffc4276a31c9aaf62890d2718675693a4e64d8fdec19b71c1dfdac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvector-attention/src/unified_report/report.rs:333-340 | crates/ruvector-nervous-system/src/routing/predictive.rs:127-134 | crates/ruvllm/src/training/mcp_tools.rs:471-478 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/unified_report/report.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fa5d8b9f8090bfa18b764c33346b3f11f7cd7f8bf6e3fffebb13b626c2f768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-fpga-transformer/src/quant/lut.rs:43-51 | crates/ruvector-wasm/kernels/rope.rs:294-303 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/quant/lut.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3c9cd72814fc3a38ad9b58fbe7e0f94aef3e6f283d047e84c71ab3ce0274b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-mincut-node/src/lib.rs:461-465 | crates/ruvector-mincut-wasm/src/lib.rs:549-554 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/lib.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"da28b0d4831300b9e7fc9121ade72d4e3d1ea2046bd8c94353aa771162d03a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-mincut/src/canonical/mod.rs:1126-1137 | crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:706-718 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"619a0e09cba98e593b173d4a0cab889a47923383aee17b1ca96fe30323489368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-postgres/src/hyperbolic/operators.rs:326-332 | crates/ruvector-postgres/src/operators.rs:513-518 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hyperbolic/operators.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"647159852331a2aefb76d21ee647ad1479b9e92e40ef4bb5138195aab96a370b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvix/crates/bcm2711/src/mmio.rs:72-83 | crates/ruvix/crates/drivers/src/mmio.rs:65-75 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mmio.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddbf0f6aaf1af140f9fca15eb28a66de3dc00ccf9ede7def21b4539dc5453a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvllm/src/bitnet/trace.rs:148-151 | edge/gateway/src/mincut_core.rs:220-226 \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":"crates/ruvllm/src/bitnet/trace.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"391246fcc61c86abc03b3023e749ebddf70607ca3de1bd964319dd72882a5006"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/prime-radiant/src/substrate/edge.rs:182-192 | crates/ruvector-attention/src/curvature/tangent_space.rs:139-146 | crates/ruvector-math/src/spectral/graph_filter.rs:208-215 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/edge.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aee1b725217c11ab8e62c0216b48eb5a24984d064da9c6cff1e39548523bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-delta-consensus/src/crdt.rs:84-89 | crates/rvAgent/rvagent-subagents/src/crdt_merge.rs:107-112 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-consensus/src/crdt.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91519a446d675209c4ac1fc29496b952632e2387477a22cf2ba96daac9f65b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-edge-store/src/ops/dispatch.rs:52-63 | edge/gateway/src/ops.rs:37-49 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/dispatch.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"358aebc48bf89406a1d97ffb95c98519aab5f81a87976d7cb65038f11cdde4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-memory-admission/src/policy.rs:334-341 | crates/ruvector-solver/src/random_walk.rs:57-63 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/policy.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3ade798737ae745a0ba170bcfe23074d26fce6fc0ba66baca6bdb1020d4eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/ruvector-postgres/src/attention/operators.rs:912-920 | crates/ruvector-postgres/src/hyperbolic/operators.rs:369-375 | crates/ruvector-postgres/src/operators.rs:505-510 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"1555c96d944606ee670978611d04e66d8bd02814e13137c0e248a030bc514751"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvix/crates/cap/src/optimized.rs:407-413 | crates/ruvix/crates/cap/src/table.rs:274-280 | crates/rvm/crates/rvm-cap/src/table.rs:322-329 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/optimized.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c41ab9e417c5186b933d136807a95fd3092f1bf2450b82d8a6ebee08d84dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvix/crates/types/src/queue.rs:74-82 | crates/ruvix/crates/types/src/task.rs:95-104 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/types/src/queue.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"30748077f84939320c85ac52808173b6cef9f6b5f894514f5ebed7a52e464f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvix/crates/vecgraph/src/graph_store.rs:716-721 | crates/ruvix/crates/vecgraph/src/hnsw.rs:268-277 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/graph_store.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a2fe53e7361bead30918a006639c3c2717525dfa5f0016ccb3b9615a71d12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvllm/src/backends/gemma2.rs:932-944 | crates/ruvllm/src/backends/phi3.rs:796-805 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37b83ec6c002ff8b2061787259d168d75fb01e2a147925458bd4b0f65066234"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rvf-forge-core/src/inspect.rs:123-127 | crates/rvf-forge-core/src/verify/mod.rs:186-190 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf-forge-core/src/inspect.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb3ee229bfe45760618b42a143553451ab9993e297552d16a8efe0f3a3599be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/custom_op.rs:156-159 | patches/candle-core-0.9.2/src/custom_op.rs:156-159 \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":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"537cdff372ad190fa063d7c211fbbb98a96086fc9af708122e1ed870cd99bb02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/emergent-time/src/witness.rs:38-44 | crates/ruvllm/src/quantize/ruvltra_quant.rs:1092-1098 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/witness.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6f7758f87fa332ee745186471fc8b369d62b41d065ff8275c18ec682abf359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-attention-unified-wasm/src/graph.rs:45-50 | crates/ruvector-gnn-wasm/src/lib.rs:83-88 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f3701c5dcc4147a2ff22a411aef950423e2a8b54557662f85c500de728c863"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-cnn/src/backbone/mobilenet.rs:95-102 | crates/ruvector-cnn/src/layers/batchnorm.rs:44-54 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/mobilenet.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b591c11f8f97ac7bb0dcd94ef0019f00972cd8b9cbc1c9b104f323eb4f8d30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ruvector-delta-core/src/compression.rs:518-528 | crates/rvm/crates/rvm-memory/src/reconstruction.rs:453-463 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/compression.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"663d4941554b26ffd90dbc37becca97fadf89cd3f180cbf987e5eef7f76b6ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-edge-snapshot/src/rowcodec.rs:41-51 | crates/ruvector-edge-snapshot/src/rvf_format.rs:71-80 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/src/rowcodec.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"58461225c5cc82337aa8285b41712bec310352d594c601af2468ab1b78c66242"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/ruvector-graph-transformer/src/manifold.rs:1037-1043 | crates/ruvector-math/src/utils/numerical.rs:88-90 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/manifold.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ab4b7fbef38d5971a9ceb9952ee3922d3a44f453c3769f93a7c6e9f0dc88c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-hnsw-repair/src/benchmark.rs:299-306 | crates/rvf/rvf-runtime/src/witness.rs:707-713 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/benchmark.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"88118230d15ee9d979ed730857145525d840c07f2f09c361a923c0a9cb7ba044"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-mincut/src/optimization/cache.rs:289-294 | crates/ruvector-mincut/src/optimization/pool.rs:438-446 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/cache.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d226384157635e832e4198b7b2fbd0f9fa935d0a3f3f695d47bbff2741505a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rvAgent/rvagent-core/src/graph.rs:141-147 | crates/ruvector-postgres/src/tenancy/registry.rs:589-594 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/graph.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad82713647fe4af7eec1e3d7de8daa01a029320dddaa9a2fd3c9dec95eee0fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-dag/src/healing/drift_detector.rs:42-51 | crates/ruvllm/src/claude_flow/claude_integration.rs:1143-1151 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/healing/drift_detector.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2101f185d6c34fe66ada0d156ab3ad7429170cf7ebcdbdb589e8c43ecc84b7d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-gnn/src/tensor.rs:279-283 | crates/ruvector-solver/src/neumann.rs:485-488 \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":"crates/ruvector-gnn/src/tensor.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bef273a264e6b3278e74b2e54012c35afe9e0309b66e6d77feb55867dd0efee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-hnsw-repair/src/graph.rs:57-67 | crates/ruvector-matryoshka/src/hnsw.rs:114-123 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/graph.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"743a5f3b695867b83b599ed9b056afcebf2df003dbf7c7adad760433d6cddf23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-kge/src/optimize/receipt.rs:115-121 | crates/ruvector-typesafe-core/src/receipt.rs:236-242 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/optimize/receipt.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5138b97f681144f16803f0bd24984e8e7226842d119f87f89c5904114d2ea56d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvector-math/src/spectral/clustering.rs:48-55 | crates/ruvector-mincut-gated-transformer/src/speculative.rs:112-119 | crates/ruvllm/src/moe/sram_mapper.rs:710-717 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/clustering.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8225ebfa1effc25646ea8e8155277e30977cf1fe85fd22df0fdce728a9dbe963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-mincut/src/cluster/hierarchy.rs:269-272 | crates/ruvector-mincut/src/fragmentation/mod.rs:148-151 \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":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a2a39f31c3684edd59cfd310660d7f3b5ac2882c383689a6cf3c8b86399f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-nervous-system-wasm/src/workspace.rs:262-271 | crates/ruvector-nervous-system/src/routing/workspace.rs:400-406 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/workspace.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82d5872c80585635b7cae116dcf982209a5ac521f0be07e10a3ceeb8c033c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-nervous-system/src/routing/predictive.rs:115-122 | crates/ruvllm/src/kernels/norm.rs:458-461 \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":"crates/ruvector-nervous-system/src/routing/predictive.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baf3a529ff7a39fa4bf164d74a59fed02e5daf85a601491ea4d121dc44735c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/photonlayer-ruvector/src/boundary.rs:34-39 | crates/sonic-ct/src/bin/serve.rs:152-157 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-ruvector/src/boundary.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b88bf99c4646a2369fe4eafb2e0374bbbf74000de2fa4d497ed503ac7097e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/prime-radiant/src/substrate/node.rs:179-185 | crates/ruvector-gnn/src/tensor.rs:220-226 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/node.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b7c461071a2eba4eee769bea6a5d3471801474fb2e5f7b3bfe4e0f96fb8891"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-gnn/src/mmap.rs:38-43 | crates/ruvector-gnn/src/mmap_fixed.rs:30-34 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaa699f39eee7d4615c16e17c0a2ab8da55ede973ad27b7aa364e2f1e4ef475"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-kge-ffi/src/optimize.rs:214-221 | crates/ruvector-kge-wasm/src/optimize.rs:210-217 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/optimize.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e8a3555642de29ee92e2306d13339636e8e886bbabad50481c5d128af0f186"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/ruvector-proof-gate/src/gate.rs:245-251 | crates/ruvector-retrieval-receipt/src/receipt.rs:83-89 | crates/ruvector-retrieval-receipt/src/signing.rs:232-238 | crates/rvforge-registry/src/merkle.rs:34-40 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-proof-gate/src/gate.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b8176014a0536f0783b7842ace04db0a247a54b33ac76f1883b2ea3b5a1e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-py/src/graph/convert.rs:124-130 | crates/ruvector-py/src/hnsw.rs:162-168 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph/convert.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d892187a0eb0069293625a96874984cc8d88c63043fb5418f4f149e1b92623"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvix/crates/shell/src/commands/tasks.rs:19-22 | crates/rvf/rvf-runtime/src/locking.rs:240-243 \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":"crates/ruvix/crates/shell/src/commands/tasks.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d80199b9f96c481c02cb6b30c9b24028358fbdb3b29358981aa8df8db3418c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rvAgent/rvagent-core/src/agi_container.rs:148-156 | crates/rvAgent/rvagent-wasm/src/rvf.rs:386-394 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04960432cd62958d42c56ff7f88f3a9222e2457fe849abf7d7c4d73c2645fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvAgent/rvagent-core/src/agi_container.rs:159-167 | crates/rvAgent/rvagent-wasm/src/rvf.rs:396-403 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2891b87848763abcc9ba631097e05512e318140d67f424b681129b670249a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvAgent/rvagent-core/src/agi_container.rs:170-178 | crates/rvAgent/rvagent-wasm/src/rvf.rs:405-412 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5b35e718f86e04b73b774ea59d48b19e3adb92f20acba2318a9a3ff9a38cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/prime-radiant/src/coherence/engine.rs:965-970 | crates/ruvector-collections/src/manager.rs:327-332 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a3c0aca43c272897116075fd5cb309c85e15495c034f5fe561e008f5a3d5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/prime-radiant/src/cohomology/cocycle.rs:81-89 | crates/prime-radiant/src/cohomology/laplacian.rs:103-111 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/cocycle.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e78a77338c73334a1fbd4b00a7e7b59050f427c2e3de22c3603cf6a6039435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/prime-radiant/src/cohomology/cocycle.rs:313-318 | crates/ruvector-math/src/spectral/wavelets.rs:181-188 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/cocycle.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b7d9638e32d9049e95ac35f0e1fe4be15f9ee38e3f0bd65781ca807356cd82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-core/src/advanced/neural_hash.rs:172-178 | crates/ruvector-postgres/src/distance/scalar.rs:113-120 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced/neural_hash.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5c0b375dc234bca88daa5f953848133c9b9dc1cb3bbc492b3aba34a9eae176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvector-core/src/advanced_features/filtered_search.rs:184-190 | crates/ruvector-graph/src/optimization/query_jit.rs:247-253 | crates/ruvllm/src/claude_flow/task_classifier.rs:300-306 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/filtered_search.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"249d038e46e6ac82c0555eb5c9026935576f52b9739ab15f838f8ddffc80f435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-core/src/arena.rs:527-531 | crates/ruvector-core/src/cache_optimized.rs:112-116 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/arena.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f588483fb616299caaf4c66a2052af11f6d64bedd7ee05c79a1c489102ea5afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-core/src/arena.rs:534-538 | crates/ruvector-core/src/cache_optimized.rs:119-123 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/arena.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be9ba0f80d5c2f90094ec3a61e811fae841b5923de0ac689e4255d7051db0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/ruvector-core/src/simd_intrinsics.rs:1199-1201 | crates/ruvector-postgres/src/distance/scalar.rs:87-91 | crates/ruvector-robotics/src/bridge/indexing.rs:98-100 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"add7a0f206523f623790b3b112fa02f5fcdea9812e3183baa0f00e0b1d941998"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/ruvector-gnn-rerank/src/main.rs:74-76 | crates/ruvector-math/src/homology/mod.rs:92-98 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn-rerank/src/main.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae8219ae1602303608ae79bf1dd62be6516505e63a9bd3d9bdadd6b3a7faf2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-kge/src/train/loss.rs:17-24 | crates/ruvector-tiny-dancer-core/src/training.rs:732-741 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/train/loss.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ee055b3b980fc1672b58d9adf8ef6fb800620db1b50e7f1d10072aa88a130d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-nervous-system-wasm/src/workspace.rs:202-211 | crates/ruvector-nervous-system/src/routing/workspace.rs:337-349 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/workspace.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"565514216d27455cb52fad46212283245f25e8b95c922c0c509347b09eca961c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-postgres/src/quantization/binary.rs:215-220 | crates/ruvector-postgres/src/types/binaryvec.rs:71-76 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/binary.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6121c4075d88f4d34f67bd8f0c4b1d9eff717dc08dc09348d9dc1b8212cd80a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): python/portfolio/ruvector-attention/src/ruvector_attention/__init__.py:7-9 | python/portfolio/ruvector-core/src/ruvector_core/__init__.py:7-9 | python/portfolio/ruvector-gnn/src/ruvector_gnn/__init__.py:7-9 | python/portfolio/ruvector-sona/src/ruvector_sona/__init__.py:7-9 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/portfolio/ruvector-attention/src/ruvector_attention/__init__.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d60e651b2e94c0e821829a54e33dde62faeb6148c1ffb82ef60cbad7b363a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/cognitum-gate-kernel/src/canonical_witness.rs:572-579 | crates/ruvector-mincut/src/pool/mod.rs:357-364 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/canonical_witness.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9df76fe46d68fee0a00ed686da6b650f510c0e062a2f031b76531db70fdc0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/neural-trader-wasm/src/lib.rs:362-366 | crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs:221-227 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/neural-trader-wasm/src/lib.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fde87b1dbb80709c341939922e4dcef1bfea8d91333c56d7ff671be342a180"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-adaptive-ann/src/metrics.rs:29-34 | crates/ruvllm/src/evaluation/economics.rs:117-122 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/metrics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"25490f9aa1f1a8e78fc5f6c98fbb5dcad584c07809e9c1b1220a716444c23108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ruvector-cluster-rag/src/bench.rs:83-94 | crates/ruvector-cluster-rag/src/bin/benchmark.rs:35-46 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/bench.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc346b5c20e1a312ed4a093442f651ff743f45924d67a3a6293e1750933cce06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rvAgent/rvagent-middleware/src/hnsw.rs:649-655 | crates/rvAgent/rvagent-middleware/src/sona.rs:582-588 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fa943e59e76238a0b43b4a3b4ebe7f12e2e06285df8c8a20a3e4066b45e5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-attention/src/attention/mla.rs:379-383 | crates/ruvector-attention/src/graph/rope.rs:277-282 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/mla.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f22fbe87bbb025f63efdbaf8c1c39c4ab95343912d8a2ba990dfcdf1f99aecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-kge-ffi/src/lib.rs:51-56 | crates/ruvector-typesafe-ffi/src/lib.rs:199-204 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/lib.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ecf761de23ac5e1949793434a6e4acf51542ef57efb035ff8e3382fc5e3de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ruvector-mincut/src/certificate/audit.rs:240-247 | crates/ruvector-postgres/src/integrity/events.rs:380-387 | crates/ruvector-postgres/src/learning/trajectory.rs:162-169 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/certificate/audit.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"148a86fbf569c9738d40e00ed27857dd710d75a6e93e160ca9a79511a596742c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-postgres/src/distance/simd.rs:1798-1807 | crates/ruvector-postgres/src/types/halfvec.rs:275-289 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0ac11afa4e4d7311aeadf6f614dd5f387b5fc4715fbf3bbad76b371a7b83ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvllm/src/hub/download.rs:341-347 | crates/ruvllm/src/hub/upload.rs:275-281 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/download.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60e1ddcad2adb37818df17cf9d557dc40d6ef7ed13fbcbf723d643e98db386c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rvf/rvf-crypto/src/hash.rs:32-39 | crates/rvf/rvf-wire/src/hash.rs:37-43 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-crypto/src/hash.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4076f2b3245ab8f7b52918728e3924cbf2c912af0c00fdaf2d0191d018bdf934"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvm/crates/rvm-hal/src/aarch64/boot.rs:60-73 | crates/rvm/crates/rvm-hal/src/aarch64/timer.rs:12-24 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/boot.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b679a35e720aa1ff15a5f1b28a5b02551d2edd6e4895db420dadd7baad43841a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/sonic-ct-wasm/src/lib.rs:206-209 | crates/sonic-ct/src/volume3d.rs:186-189 \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":"crates/sonic-ct-wasm/src/lib.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a578e8d96ffa8738490f3f39e59bff73f64b6e2f16803509c16196a01991823a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-edge-snapshot/src/rvf_witness.rs:52-60 | crates/ruvector-edge-snapshot/src/types.rs:166-176 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/src/rvf_witness.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"330bd789f5a364d014424554393463e48a08cc5d38229b93a085f4d255bb3b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-graph/src/cypher/semantic.rs:149-156 | crates/ruvector-postgres/src/graph/cypher/executor.rs:54-61 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/semantic.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4635babb8f53f42ef77fc9467c280d827e659043d8b168734b33923b8acc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-mincut/src/algorithm/approximate.rs:57-60 | crates/ruvector-mincut/src/connectivity/polylog.rs:42-45 \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":"crates/ruvector-mincut/src/algorithm/approximate.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d840ba3f0bfd95811d077c69262526afbfebaa28298a5a6e5bb63851eb027301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-robotics/src/bridge/mod.rs:40-45 | crates/sonic-ct/src/types.rs:119-123 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/bridge/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff69840c323efadeab4ae5f2e0ec9dceb0685feb4fe59586d9591f594e8a7f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvix/crates/region/src/slab.rs:280-286 | crates/ruvix/crates/region/src/slab_optimized.rs:300-306 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/slab.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6455b707b934795d9342d35f5d0245c4e1264cd0bb48d53893766995c8ee5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/conv.rs:115-118 | patches/candle-core-0.9.2/src/conv.rs:116-119 \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":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea63650bf9366187644095891b6736aa77902c85e12595d6b57a5853fbd442c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/conv.rs:120-123 | patches/candle-core-0.9.2/src/conv.rs:121-124 \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":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d83c6f10acbd0c7f031bcb94df76a35a5056bc495b08aac7a4c3f61ca1d96e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/prime-radiant/src/cohomology/cocycle.rs:61-68 | crates/prime-radiant/src/cohomology/simplex.rs:452-458 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/cocycle.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6229727d41c3cb9a9f4a953ad76938bd8a10e41673a8be72d8a67781ae2193b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/prime-radiant/src/simd/energy.rs:487-493 | crates/ruvector-core/src/advanced/learned_index.rs:50-56 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"213e3864aa43b367612875cca3c5f85f5bc17a9fc4f910166f273bd710667d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/prime-radiant/src/simd/matrix.rs:340-346 | crates/ruvector-typesafe-train/src/export/transplant.rs:115-123 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/matrix.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2cca807516049695c4b94f68d4db3fc82d4a11eaf4eb1a5534397449566410"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/prime-radiant/src/storage/memory.rs:158-164 | crates/ruvector-graph/src/optimization/index_compression.rs:42-48 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/memory.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d5f510673ee5b7f8f7c9c1653bd5173de9eca8595d18f604318f10e1de373"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-edge-index/src/flat.rs:133-138 | crates/ruvector-edge-index/src/hnsw/mod.rs:262-267 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/flat.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c890484670c1aa43296fc248ad99a8888915a794cc19f3380c5716a0b1a5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-hnsw-repair/src/lib.rs:52-59 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:533-540 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6459d6963874a3e3069b79c8128e613d823617f72955850ff4f38b78ba66cedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-postgres/src/workers/mod.rs:139-144 | crates/ruvllm/src/reasoning_bank/pattern_store.rs:763-768 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fad47a6d35c9f9230b15464bc557eaa762270286d0038b6279688cefe471526"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvllm/src/backends/gemma2.rs:163-172 | crates/ruvllm/src/backends/phi3.rs:168-177 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4dac7894476f63964552367491f22852764201d88aeb25ad74dc895009e1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvllm/src/optimization/realtime.rs:565-571 | crates/ruvllm/src/training/grpo.rs:474-480 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/optimization/realtime.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3a38167752d9335ae4e79db1fcd88b870947ba1554ac4d4d03259f822120ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rvlite/src/cypher/mod.rs:106-110 | crates/rvlite/src/lib.rs:345-349 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa21b2e9f182df81b5c400b49289d896e2b6c9bf974fb9699203f434425fb223"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): edge/gateway/src/graph_persist.rs:68-70 | edge/gateway/src/mincut_job.rs:105-110 \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":"edge/gateway/src/graph_persist.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7de90d9356f56349fef54a8c54e1533b6351dcced082b0d23ffbcd19b44475"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/prime-radiant/src/cohomology/simplex.rs:22-29 | crates/ruvector-cluster/src/shard.rs:106-111 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/simplex.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1085f68b6b31e1a59402e8cae8f15b2fdbfe4501d072e124dba192736cce7dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-capgated/src/bin/benchmark.rs:47-52 | crates/ruvllm-wasm/src/bindings.rs:934-940 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-capgated/src/bin/benchmark.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"16611130dc8e4eecdd86aac2b87418d243a5c91a345cbe9d9bac33a40fd9defe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-collections/src/collection.rs:153-158 | crates/ruvector-postgres/src/hybrid/registry.rs:105-111 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-collections/src/collection.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cfa81cece164cd3c3ce40b309c57fd52a22dac81e53b3a52300dd33527ddb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvector-core/src/advanced/hypergraph.rs:59-68 | crates/ruvector-graph/src/edge.rs:37-45 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced/hypergraph.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b06f1ff5c962b45ab913ef11176c9ecad4f9abc8748da5b795939c53e058a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ruvector-core/src/advanced/hypergraph.rs:83-95 | crates/ruvector-postgres/src/workers/lifecycle.rs:87-101 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced/hypergraph.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d275918ce47b6c751d58ed2554dbbfd0bb7fa1775676e873058370d4cc038f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/ruvector-core/src/advanced_features/mmr.rs:211-213 | crates/ruvector-postgres/src/learning/patterns.rs:308-314 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/mmr.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec634f22d175dfe922b0951edd0df5f4b16f8c1448c2814523c4c5d9b8a6de55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-graph/src/edge.rs:99-107 | crates/ruvector-graph/src/node.rs:100-106 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/edge.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1911439612a9f6a2a26ca1d7162f80be9c50a0a5b221c055b080e48eb474156f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-graph/src/optimization/bloom_filter.rs:81-86 | crates/ruvector-mincut/src/instance/witness.rs:126-136 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/bloom_filter.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e35d680537b13774cf925e5ecaca10d2c75d69819760a32a20b918f2737896"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-mincut/src/algorithm/approximate.rs:84-88 | crates/ruvector-mincut/src/instance/stub.rs:238-244 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/approximate.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d4dcab8d8f457dc3269702b043d7e9e0f8316dc0e31a0de302f0e99d2239ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/ruvix/crates/boot/src/capability_distribution.rs:92-101 | crates/ruvix/crates/nucleus/src/graph_store.rs:182-191 | crates/ruvix/crates/nucleus/src/scheduler.rs:247-256 | crates/ruvix/crates/nucleus/src/vector_store.rs:69-78 | crates/ruvix/crates/nucleus/src/witness_log.rs:318-327 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/capability_distribution.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"404ff5e4f1d30539e8822a541fecbf19859eecde64cb1499626040b51b5f3328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvix/crates/nucleus/src/graph_store.rs:196-205 | crates/ruvix/crates/nucleus/src/vector_store.rs:184-193 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/graph_store.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7392dbbf1c025b222d433f679276c44e3556162404ded242fc794dbae62308"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvix/crates/sched/src/partition.rs:87-91 | crates/ruvix/crates/sched/src/task.rs:240-244 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/sched/src/partition.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aecd1737f873cb0315265c7c473df7eeb2062e63a4180a95737c7090aa86400"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ruvllm/src/adapter_manager.rs:68-76 | crates/ruvllm/src/qat/lora_qat.rs:243-252 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/adapter_manager.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c2bf9aca7f908bb98e27a2eb3026583f18119a0c97b6a5d0e369d47bad03c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/rvAgent/rvagent-middleware/src/filesystem.rs:88-137 | crates/rvAgent/rvagent-tools/src/ls.rs:19-31 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/filesystem.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"db010dcbc97015492a7ba777f18d00396aa73212c63bc986c7d1db9ac50a9407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rvAgent/rvagent-middleware/src/hnsw.rs:821-826 | crates/rvAgent/rvagent-middleware/src/sona.rs:701-706 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d801130e29ef7dd0d6bb119ad0ec6c22e4e2c1e6df6b4798d66435a1d029cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/safetensors.rs:92-95 | patches/candle-core-0.9.2/src/safetensors.rs:109-112 \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":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f129e68e3f8cc07f0df95541c7a7f936ce46a6be9244199088c14664a5b752"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:1911-1914 | patches/candle-core-0.9.2/src/tensor.rs:2235-2238 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cbf5b1b12dcb2b0dd207a87a8fdaf4f1ba07311304f5de05930b9a467cb893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/mcp-gate/src/schema_cache.rs:231-236 | crates/ruvector-hailo-cluster/src/cache.rs:171-177 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/schema_cache.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cb96b814986666244ee6866d9b32e1587abbacd498d7cc29c9af9e81e82e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/prime-radiant/src/substrate/graph.rs:256-261 | crates/ruvector-mincut/src/graph/mod.rs:235-240 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/graph.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a610ee9bdf79ffb1fe3fbb470f24059aa4a9a2a6054cd4ccb3b0d746782f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-domain-expansion/src/meta_learning.rs:258-261 | crates/ruvector-domain-expansion/src/transfer.rs:64-67 \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":"crates/ruvector-domain-expansion/src/meta_learning.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"86061686c2b6bb091840643d27038fbf7a8ab4518b1ac26fe2a185a5cd992d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 3\u002B corresponding lines): crates/ruvector-edge-index/src/persist/mod.rs:117-119 | crates/ruvector-edge-registry/src/validate/layout.rs:47-49 | crates/rvf/rvf-manifest/src/directory.rs:54-56 | crates/rvf/rvf-manifest/src/level0.rs:17-19 | crates/rvf/rvf-manifest/src/level1.rs:94-96 | crates/rvf/rvf-types/src/stream.rs:107-109 | crates/rvf/rvf-wire/src/stream/verifier.rs:158-160 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/persist/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d0166930f96257b67069b4284a0b12ee852f22c57da59a48f99e2fd5c0b29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-perception/src/predict.rs:169-174 | crates/ruvllm/src/optimization/realtime.rs:583-589 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-perception/src/predict.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0b1f1e1f3e558cc1a110ec95fd023ad064c486c99602d766f38bcbbbdecab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-typesafe-core/src/bank.rs:452-459 | crates/ruvector-typesafe-core/src/engine/optimize.rs:299-307 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/bank.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfbfd29996d05b2f36e341aa9e5bd9e8943702fa2dc832d5cccd186f6abc22f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-wasm/src/kernel/hash.rs:24-29 | crates/ruvix/crates/cli/src/commands/keys.rs:942-947 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/kernel/hash.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48a06bab056511b75ca5f0becf921dd89d814771a7efb9932edfc9a37694a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-weaver/src/scan/imports.rs:70-76 | crates/ruvector-weaver/src/scan/markers.rs:27-33 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/scan/imports.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d95507f2e3264ce9c6b8b6a765c4a805e2dc97a5ec86df2d5554a16173f7a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rvf/rvf-solver-wasm/src/policy.rs:369-376 | crates/rvf/rvf-solver-wasm/src/types.rs:225-232 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/policy.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"df50de93afcd6291b911509d43d5a197819392dff8b8995a28dc660e884086e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): edge/gateway/src/idem.rs:22-24 | edge/gateway/src/m3_ledger.rs:78-80 \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":"edge/gateway/src/idem.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce0fa41cebf3127999a2c19aa54f7a529476696b090e3b552dc53f078b6e2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/emergent-time/src/real_matrix.rs:26-32 | crates/ruvector-math/src/tropical/matrix.rs:30-36 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/real_matrix.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"100c5cdc80036fb8c47b4f2416f85a09a7f25a2ccc610166c05b863111c08923"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): crates/mcp-brain-server/src/notify.rs:74-77 | crates/prime-radiant/src/execution/executor.rs:526-529 | crates/ruvector-postgres/src/healing/learning.rs:265-268 | crates/ruvector-postgres/src/healing/worker.rs:149-152 | crates/ruvector-postgres/src/integrity/events.rs:358-361 | crates/ruvllm/src/context/working_memory.rs:342-345 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ca5762ef9f28aad094512d09052a3facc62b7deb62849418a0c7907259bb92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/prime-radiant/src/mincut/config.rs:40-52 | crates/ruvector-mincut/src/subpolynomial/mod.rs:75-85 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/config.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b2b84e9be3234e0a6598977b4b137e4719df7527aa4ae4d9610543b7c90aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/ruvector-acorn/src/index.rs:67-69 | crates/ruvector-query-cache/src/no_cache.rs:37-41 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/index.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ea5a01ddda005a32271bfffd8fba74dc21e0fa9e08da1f0b83a5603b08c3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-mincut/src/time_compat.rs:96-102 | crates/ruvllm/src/lora/adapter.rs:90-96 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/time_compat.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"eade7b59e0bddc08f29ccd351fc93607d30f9bce75dbbfa30535d781da99fabf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-postgres/src/sparse/types.rs:94-99 | crates/ruvector-postgres/src/types/sparsevec.rs:159-164 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/sparse/types.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fe82d13efcdef600997bb647cfb0b141036e0efe5293874e7be2c083b2649b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvector-tiny-dancer-core/src/types.rs:168-179 | crates/ruvector-tiny-dancer-wasm/src/lib.rs:35-44 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/types.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ce51a22f5d0b5c1427e4bf56ec4243156233116a1012e4a34581161483823"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvllm-wasm/src/bindings.rs:74-81 | crates/ruvllm/src/types.rs:74-82 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"631a15b458b9b91ee2ddf961ec624a05deb2dfcd229ad4077fce122200107d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): patches/candle-core-0.8.4/src/conv.rs:20-22 | patches/candle-core-0.9.2/src/conv.rs:21-23 \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":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa4d2b84dd54cd735b0f22020e20610f5d58f526ae4d4eea9572a3266b8bb2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): patches/candle-core-0.8.4/src/conv.rs:86-88 | patches/candle-core-0.9.2/src/conv.rs:87-89 \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":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ffafed9dbaefa76bb05eab825b6941b040ac1ac4fa7b75a1fdaa7fcce00f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): patches/candle-core-0.8.4/src/conv.rs:90-92 | patches/candle-core-0.9.2/src/conv.rs:91-93 \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":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf1ffe76395765e403d68a0877ebb28e50fa467665c839cc5349019be691583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/prime-radiant/src/coherence/engine.rs:424-435 | crates/ruvector-graph/src/schema.rs:296-304 | crates/rvforge-reader/src/dock.rs:357-365 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"062c009cedeb26102c62242c43fcf667070dba50546ca1bd57531888e664a82f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-entropy-ann/src/dataset.rs:4-9 | crates/ruvector-matryoshka/src/dataset.rs:18-23 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/dataset.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae0974c26dbd528a3654d5c7195b8ea420cb6d26c0dcb700e73f02113920cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ruvector-kalshi/src/auth.rs:101-107 | crates/ruvector-nervous-system/src/integration/versioning.rs:336-343 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/auth.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de73a0afb00469f5ada498c781350822eb416766d1cf2ca693359fec064f7d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/ruvector-mincut/src/jtree/level.rs:233-235 | crates/ruvector-mincut/src/jtree/sparsifier.rs:582-584 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/level.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8475a74748cd087ee93af6b6b85afdd8af52f6c94c5ed341afb50965c540d22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ruvector-temporal-tensor/src/delta.rs:392-399 | crates/ruvllm/src/quantize/turbo_quant.rs:1027-1034 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/delta.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"38386f55a9c8867738f0d705a3e4d623d20059d244585c36a02630db6506ad12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): crates/ruvector-typesafe-train/src/norm.rs:15-18 | crates/ruvector-weaver/src/graph.rs:23-30 | crates/ruvector-weaver/src/readme.rs:17-23 | crates/ruvector-weaver/src/scan/imports.rs:63-68 | crates/ruvector-weaver/src/scan/markers.rs:16-24 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/norm.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbb79d27159893b014a01235a7effc00a54dca5847ef7f7b569488d25be7361"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ruvllm-wasm/src/bindings.rs:119-128 | crates/ruvllm/src/backends/mod.rs:477-489 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c644e5f622c501ad7a551ba4697879d7795fe9b44f9fd6f6a59ae58c4b239ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rvm/crates/rvm-partition/src/device.rs:301-306 | crates/rvm/crates/rvm-wasm/src/agent.rs:232-237 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-partition/src/device.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f69517dc5e465fb2983bb689174aade98e968c63b6bb0ee4ff50431180d03c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/prime-radiant/src/cohomology/cocycle.rs:71-73 | crates/prime-radiant/src/cohomology/simplex.rs:495-497 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/cocycle.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"34310cf6c5eca3c99cefc7ee4ddd8c8ce1749b926afc22012819e4f4ee13c44e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/prime-radiant/src/storage/file.rs:416-422 | crates/rvAgent/rvagent-cli/src/session.rs:265-271 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4875c7f35e34ba58a5801f0e885624fff111d9099581af5367febf02ca42d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvector-math-wasm/src/lib.rs:385-389 | crates/ruvector-mincut-wasm/src/lib.rs:295-299 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math-wasm/src/lib.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d057e1824bde44dbe698ba3aed2c18d20035d8757b1305a6a86ad8dcfb41d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-matryoshka/src/bin/benchmark.rs:317-322 | crates/ruvector-speculative-ann/src/bin/benchmark.rs:113-126 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-matryoshka/src/bin/benchmark.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0db7f6017cd94424c866dd1a136761582c76902553d3198b303a59b9027c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-postgres/src/graph/sparql/results.rs:291-297 | crates/ruvector-weaver/src/svg.rs:7-12 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/results.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"624cf2e03b96ade107c099c44b5e26e592178a151c53d38327aeed36586c122e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/ruvllm-cli/src/commands/chat.rs:649-655 | crates/rvAgent/rvagent-middleware/src/skills.rs:93-99 | scripts/seed-brain.rs:310-316 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/chat.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"72192af7af984c683f97ea3bde2341abd5cf3a8ecd56619cea4e8f952657bc4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rvf/rvf-types/src/sha256.rs:234-240 | crates/rvm/crates/rvm-witness/src/seal.rs:99-107 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/sha256.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa661eeeedd981c0d604d497faf50e1825e4729a92a4cafbbc670049e419995b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:807-809 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:140-142 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1003-1005 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:173-175 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a22856038c2d2310b5d814c2b15ffa68ba0291341f820657dfdf27d0afb59f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/custom_op.rs:361-364 | patches/candle-core-0.9.2/src/custom_op.rs:361-364 \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":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb62f5e7d57a087c5084640dc238230fbe8e09b543f06b022552b61693f6930"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): patches/candle-core-0.8.4/src/op.rs:938-940 | patches/candle-core-0.9.2/src/op.rs:1103-1105 \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":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"687fd359e39b53a942dd91702ad2f82de5f27b14bb45fe97a09f1e50f37b6611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): patches/candle-core-0.8.4/src/op.rs:942-944 | patches/candle-core-0.9.2/src/op.rs:1107-1109 \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":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"648ee772d60908b6b3774f8cf832c7222cfba5bc5a60d15f80beec02565ece33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:1008-1011 | patches/candle-core-0.9.2/src/tensor.rs:1076-1079 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f71496b990b648fc72a8496194dae92588a53341b82bc2f1faee49c1db85ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/emergent-time/src/complex.rs:143-145 | crates/emergent-time/src/complex_matrix.rs:128-130 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/complex.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d665668870c6943bbf406be1ad4530d46e3b2c71c8f695e17c6c09da5623c230"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 3\u002B corresponding lines): crates/prime-radiant/src/neural_gate/encoding.rs:104-106 | crates/ruvector-core/src/advanced_features/sparse_vector.rs:97-99 | crates/ruvector-nervous-system-wasm/src/workspace.rs:97-99 | crates/ruvector-nervous-system/src/routing/workspace.rs:82-84 | crates/ruvector-postgres/src/types/sparsevec.rs:176-178 | crates/ruvector-postgres/src/types/vector.rs:118-120 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/neural_gate/encoding.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41dc40553cd2418e2e5cac2efcb4d9b1ea4d9677f3ad1e33cf9086e91d3699c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/prime-radiant/src/ruvllm_integration/witness_log.rs:886-891 | crates/ruvector-delta-core/src/stream.rs:212-218 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/witness_log.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"46903d68597d1a81210e8e9c83870ba3adee0ac5f5d0ba6d17b8d3adceb7a757"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ruvector-graph/src/optimization/index_compression.rs:60-66 | crates/ruvector-postgres/src/workers/mod.rs:162-165 \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":"crates/ruvector-graph/src/optimization/index_compression.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"05feffbdc96a7e4af4b433741fa181f7065642f36ecbeb3ab74d9bd2bbd8700d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ruvllm/src/training/claude_dataset.rs:293-297 | crates/ruvllm/src/training/tool_dataset.rs:377-381 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/claude_dataset.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6217688cf91dfae969f97b30b78b898e5ce661119668fbb338d1a84c2214d89c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/rvm/crates/rvm-witness/src/log.rs:194-198 | crates/rvm/crates/rvm-witness/src/v2.rs:505-508 \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":"crates/rvm/crates/rvm-witness/src/log.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dca9f13d01f61c5b7c5a5802853891ba94c147278d6764611bd91ed60505650"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:296-298 | patches/candle-core-0.9.2/src/tensor.rs:355-357 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"220ca0127b2059ddbaf09e87853ea3bd0a0383c316281f7a1fd122b9a47c43cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:1723-1726 | patches/candle-core-0.9.2/src/tensor.rs:2047-2050 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af77c2b8dff68674136669ea4a4c59a59fa9b84fb8a2352ca0be670c4026473"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/tensor.rs:1809-1812 | patches/candle-core-0.9.2/src/tensor.rs:2133-2136 \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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c73c5a12d79d250eb6c6638d013ea10ccf145774344ba8fd0601c2543bc9c03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/variable.rs:53-56 | patches/candle-core-0.9.2/src/variable.rs:53-56 \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":"patches/candle-core-0.8.4/src/variable.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1d15c772c13a1f120ffef07fc15bd61d92383b3f4845c560114920dd2cae48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/variable.rs:64-67 | patches/candle-core-0.9.2/src/variable.rs:64-67 \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":"patches/candle-core-0.8.4/src/variable.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd53cd59f032dfd4f39fca4aa9031ea4c204c91cd8447a981817513d33c3fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): patches/candle-core-0.8.4/src/variable.rs:110-113 | patches/candle-core-0.9.2/src/variable.rs:110-113 \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":"patches/candle-core-0.8.4/src/variable.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e7de2001930dbc39bede866991a4b28264b9e91271d0099a449f5a268bfa78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/prime-radiant/src/cohomology/simplex.rs:417-423 | crates/ruvector-math/src/spectral/wavelets.rs:95-97 | crates/ruvector-math/src/tensor_networks/mod.rs:112-114 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/simplex.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"676fe90c809337a6caf41caff0d09ad62001046fb6071c2a517cbc9b65dca4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/ruvector-dag/src/dag/query_dag.rs:136-138 | crates/ruvector-mincut/src/snn/causal.rs:131-136 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/dag/query_dag.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"673d7ffa16feb537acfe6cbccd0304ec2cc8d811774b51764aa30e3a0e3e7c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): crates/ruvector-diskann/src/graph.rs:15-19 | crates/ruvector-diskann/src/index.rs:311-315 | crates/ruvector-edge-index/src/flat.rs:33-37 | crates/ruvector-edge-index/src/hnsw/mod.rs:308-312 \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":"crates/ruvector-diskann/src/graph.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"795099fe3a9a31ada69921853e4af9024b7fa1fc77b43e0b1a07655f0cb1b990"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): edge/gateway/src/graph_persist.rs:48-53 | edge/gateway/src/mincut_job.rs:254-259 \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":"edge/gateway/src/graph_persist.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfee67649d0d564a2fba19b3f14f63bc988db66b3546c8fe46a0a82ad5aca3f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/ruvector-edge-snapshot/fuzz/fuzz_targets/m3_reader.rs:48-51 | crates/ruvector-edge-snapshot/src/bytes.rs:34-36 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/fuzz/fuzz_targets/m3_reader.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"30844b65ffcb5278b7689e5d7a39f2f02f0fd0c87bf130f031284e8e6cd7b5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/ruvector-lsm-ann/src/segment.rs:112-114 | crates/ruvector-math/src/tensor_networks/cp_decomposition.rs:155-157 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-lsm-ann/src/segment.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8cb252a15a97324457c8cd3e21e4092a328da31062c351dde3c94606ca3f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ruvector-weaver/src/registry.rs:122-127 | crates/ruvllm/src/backends/mistral_backend.rs:145-151 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/registry.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2402ebb6b661c58c43745a7bec5bb502c0045fa3183d6d7261871dd0470545e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (197 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1648-1844 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1849-2045 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1648\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7eb6fe37a1520d69c382f3ca44f2b2affba6e67ef03c7ad3af76da1814cd87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (185 lines \u00D7 2): patches/hnsw_rs/src/datamap.rs:49-233 | scripts/patches/hnsw_rs/src/datamap.rs:49-233 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/datamap.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/datamap.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 231 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"37832e0bd426cedf86d58509c625574a6e8bbfdb9030005cf3508e57eca8f1fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (166 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:427-592 | patches/candle-core-0.9.2/src/pickle.rs:438-603 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/pickle.rs:427\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"86149dda7c71ddf10b017dcdd3da5bc011cacc61b26ed9a201d79e47da14d402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (159 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:626-784 | scripts/patches/hnsw_rs/src/hnswio.rs:626-784 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ff79ad0e90868189e159c497dbb837ad14085ad16d1ee14b1b625125d39012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (137 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1084-1220 | scripts/patches/hnsw_rs/src/hnsw.rs:1070-1206 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"f941320e35a0056c0606483c1b53da82a84bb559ac0062c3083486b958e89720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (118 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:952-1069 | scripts/patches/hnsw_rs/src/hnsw.rs:938-1055 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:952\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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"95768fd95ea9ad3d8ca708b976859885c4537d9c376add6dc85d8f3bf75f3907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (112 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1412-1523 | scripts/patches/hnsw_rs/src/hnsw.rs:1298-1409 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f795b40530dda2c5d922a20a13d49b90813837ad5d5f9fa63dae547ed46fe354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (104 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:939-1042 | scripts/patches/hnsw_rs/src/hnswio.rs:939-1042 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"481ab150f0eb8c2c1b036464ed81d850c67d02bae7e8fa1a35fc946075be7d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (102 lines \u00D7 2): crates/ruvector-kge-ffi/src/pipeline.rs:151-252 | crates/ruvector-kge-wasm/src/pipeline.rs:151-252 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/pipeline.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/pipeline.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3ab7ea4e4299a3adfd283a1df2941a6975875ca9078d470da1bfd6e20d4ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (116 lines \u00D7 2): crates/ruvector-kge-ffi/src/optimize.rs:63-178 | crates/ruvector-kge-wasm/src/optimize.rs:63-178 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/optimize.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/optimize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 149 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/optimize.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c160b57daddbc17eadeae45fc6cf4419be1b91b5bcaf2e137af264fc6c5eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (96 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1258-1353 | crates/rvlite/src/sparql/parser.rs:1296-1391 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"67028c84b8018bed7464164d0b1578d15e3ec3035e036a93b60f92a55c186e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (92 lines \u00D7 2): crates/ruvector-kge-ffi/src/pipeline.rs:51-142 | crates/ruvector-kge-wasm/src/pipeline.rs:51-142 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/pipeline.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/pipeline.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aef07410582ff9a4ed2d43b120c31c8448b7889e435e9f889029d7dd2e7d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (91 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1034-1124 | crates/rvlite/src/sparql/parser.rs:1072-1162 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"be104b0f6457374545b0a46ebf3735ae1419a5099af87a5559257092cbc14451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (90 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2036-2125 | crates/rvlite/src/sparql/parser.rs:2075-2164 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44471c7941bef5d5eb754f98703f90a733af8af9589ac412c14ae05a7feb614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (88 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1597-1684 | scripts/patches/hnsw_rs/src/hnsw.rs:1483-1570 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b639da565a188ed368ea464bb6f2921d7a593176e6d717dfeebbde0a030b911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (245 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:164-408 | patches/candle-core-0.9.2/src/backprop.rs:166-410 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/backprop.rs:164\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"545068d6a574d0ed7c4b60a38068048a48bc209fa98f40f665c522ac3542d36b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (81 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:156-236 | scripts/patches/hnsw_rs/src/hnswio.rs:156-236 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd8b8a9e03358efe7d386a5993b715949cb5eb794773f095254f510744d47a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (996 lines \u00D7 2): patches/hnsw_rs/src/libext.rs:115-1110 | scripts/patches/hnsw_rs/src/libext.rs:115-1110 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/libext.rs:115\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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb3036ea4fd753fc155737f8d286fb81a1ec5bfe10c28c232a0767869f402ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (77 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:1163-1239 | crates/rvlite/src/cypher/parser.rs:1034-1110 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:1163\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b2e288317d1f6248d6fa8aba18bc4c9e58ac9764e5a48dc56bd71ef2de5594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (197 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:517-713 | patches/candle-core-0.9.2/src/backprop.rs:532-728 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/backprop.rs:517\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":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b5685c7360bc9ab09da95ef4c5eba40095d2f14f268d3be186aa84fbeed3b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64\u201373 lines \u00D7 4): crates/ruvector-graph/src/cypher/parser.rs:219-291 | crates/ruvector-graph/src/cypher/parser.rs:358-421 | crates/rvlite/src/cypher/parser.rs:211-283 | crates/rvlite/src/cypher/parser.rs:351-414 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:219\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvlite/src/cypher/parser.rs:346\u0060 calls \u0060nested\u0060, \u0060parse_chained_pattern_unguarded\u0060 and \u0060crates/ruvector-graph/src/cypher/parser.rs:356\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc825b0333dbab5beea78e2d19efa9ed587a3b9a08a3d5545f90317690d587a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (60\u201373 lines \u00D7 2): crates/ruvector-solver/src/backward_push.rs:197-269 | crates/ruvector-solver/src/backward_push.rs:418-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/backward_push.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de1b1932aeb21fd86d01ecd92a43cdb9f6f5dc453f2bf956fe4033c1fee1314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (71 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:368-438 | crates/rvlite/src/sparql/parser.rs:395-465 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a2cd2b7cd9bd860cadc04945b6cc5de90b418f69c533694bee7afedfbe8d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201371 lines \u00D7 4): patches/candle-core-0.8.4/src/backprop.rs:426-496 | patches/candle-core-0.8.4/src/backprop.rs:500-538 | patches/candle-core-0.9.2/src/backprop.rs:441-511 | patches/candle-core-0.9.2/src/backprop.rs:515-553 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/backprop.rs:426\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":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"087268160efd51a1234a72e3f77209fe8cc87147caab5b9ce937028f35039209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (71 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:91-161 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:140-210 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc6ac6b7a1b66d5c250ae1cf6f16a37b136ed8176e55e62e445cb2d09b77055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:138-205 | crates/rvlite/src/sparql/parser.rs:161-228 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4067a5715d02801f74035d6a9167362cad29916b8d0e787faf091ddb5d8befc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (117 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:249-365 | crates/rvlite/src/sparql/parser.rs:276-392 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0f7182d5d19bc026bc95db0537e6425733b93c09d5e9b104424aefd37d412b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:651-716 | patches/candle-core-0.9.2/src/pickle.rs:675-740 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6922e362ea418912dd76006d1e6ce316c398adac0aad5348f91c1f131383d6a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:442-506 | crates/ruvector-py/src/graph/cypher_exec.rs:156-220 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/cypher_exec.rs:442\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"014793f8bd95284a2061868d898ec743d5397b13849c7f1065f45a959bc388a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:56-119 | patches/candle-core-0.9.2/src/backprop.rs:57-120 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7c644f9838d45d03bf635a28ca3f02ba158785c536b70f17a10a5576e883c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59\u201363 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:954-1012 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:1017-1079 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3198149cf9ca224138594b3b670e7b090592e9ee6ebef933cc612661107286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72\u201385 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:1022-1093 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:1092-1176 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d653b46ba54d70b5ac29b845ecc0bc4df1ddcef85872f48920268adc62d282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (136 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:792-927 | crates/rvlite/src/sparql/parser.rs:830-965 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca135d62ef37ef3068105284570aace9912ad16454466fcf0437077952d3871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1365-1424 | crates/rvlite/src/sparql/parser.rs:1403-1462 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"643cc280e6d649e83ec9a149f2aea599d1c463dc748c84fb48cb1fa80cb37147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:201-263 | patches/candle-core-0.9.2/src/display.rs:212-274 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/display.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9687f68f79d8207e69e440d95962960da4f100a171e3fa73bd36f196d100563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56\u201359 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:714-769 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:760-818 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"77535661546c7ed9094c29ca85ef6fe593f500864498e6ccedac02000d4d205c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:120-185 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:138-203 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa04ae1c110360c6a2c585a1b6f2c9ac0fc7db94414a01657ebc1520e9a31350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:470-528 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:585-643 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:470\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"776b42db5e5a2953a6e6c905de361940e4ba97d2edfb4e6b65f8361b945b1459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54\u201358 lines \u00D7 2): crates/ruvector-cnn/src/backbone/mobilenet.rs:145-198 | crates/ruvector-cnn/src/backbone/mobilenet.rs:253-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":"crates/ruvector-cnn/src/backbone/mobilenet.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05919e66b88c5b3eeb76b1f5857f3b91feb01d1e3a9b4fb9c2148a850171236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:644-701 | crates/rvlite/src/cypher/parser.rs:634-691 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa8ea9ce1d9f1c2618dbb9b33370f2c8b6ee223cc8a315f77f345d5e746bbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:396-467 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:397-468 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46c3e603f563336011585f5ebad017a473b5a0ce005867dd9503e226cebc89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): crates/ruvllm/src/evaluation/harness.rs:347-403 | crates/ruvllm/src/evaluation/real_harness.rs:739-795 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/evaluation/harness.rs\u0060 and \u0060crates/ruvllm/src/evaluation/real_harness.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/harness.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f9938339268df24adb5ab0a134b2258687c5a2e5fe0c856024fe79dc88edfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:225-281 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:243-299 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcac784caf950a60dc337db4a64a6a590c0a2a2d962cc15d06deca8580ecdae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:742-797 | patches/candle-core-0.9.2/src/pickle.rs:766-821 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92ad6168187893b1c65c5ba29a1d452d88740c16a703b41d5fbd4ead7cdb3b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): patches/hnsw_rs/src/libext.rs:1177-1232 | scripts/patches/hnsw_rs/src/libext.rs:1177-1232 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/libext.rs:1177\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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b55f358990c656b2a17d32b396cabb104bdc099aa8fbbe4dfaa0af35bfb750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1571-1625 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1710-1764 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1176e61818e8daf40cfbad889371b357bb8246278ee5ae54a9a82297ea538e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:369-423 | scripts/patches/hnsw_rs/src/hnswio.rs:369-423 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd71365ae5632b7371f6888ca15c31647915e6ce65f26f9c20883b941a33e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:559-613 | scripts/patches/hnsw_rs/src/hnswio.rs:559-613 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnswio.rs:559\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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc3b6e78da37fe72ae58e6859089f880f8dfb266dbbf5f86db773ca8d585095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1849-1902 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2270-2323 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a0ace829afcb8e4ab80984ed1b43cf6c45bbbd8a617c7ce821e7ee59700526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (80 lines \u00D7 2): crates/ruvector-kge-ffi/src/ops.rs:186-265 | crates/ruvector-kge-wasm/src/ops.rs:186-265 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/ops.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/ops.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 247 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0238582baec9c1bb692bf11a52bb104c64d87e50da62a4f82e0a692191e5a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (83\u201384 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1055-1138 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1351-1433 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f338996513e0a2e1b9050a006ebeb1f700f7d3c026c5ea1cbd5a39cdced50a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1627-1678 | crates/rvlite/src/sparql/parser.rs:1666-1717 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85e0c9722ebb1840f7a49b0b142d84a441e3c9052953af49709ef91874ca6c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48\u201352 lines \u00D7 2): crates/ruvector-postgres/src/quantization/scalar.rs:117-164 | crates/ruvector-postgres/src/types/scalarvec.rs:245-296 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/scalar.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/quantization/scalar.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/scalar.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"60125d3efe47265772fef0156432652999c894fce0c8789bff94afef8741523d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201352 lines \u00D7 2): crates/ruvector-wasm/kernels/rope.rs:88-139 | crates/ruvector-wasm/kernels/rope.rs:165-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-wasm/kernels/rope.rs:88\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rope.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e92aca5190ca6bf89a93385ca9eb1bbf07af8010374e96172533b5845708c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:300-351 | patches/candle-core-0.9.2/src/display.rs:311-362 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"255a43db701e4aa2504b2dd97150bfbf54246af2b69123752d1c4fc856335834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1534-1584 | crates/rvlite/src/sparql/parser.rs:1573-1623 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"927a5ad3139dc5d23c221acfec555a7b568762a9458b70a9c392526a53d943db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1155-1205 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1263-1313 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1155\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef650c40752840f8674b2cd9170100407d0ecfb31e1262d5a0bc77e1c34c134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): crates/ruvector-kge-ffi/src/ops.rs:130-179 | crates/ruvector-kge-wasm/src/ops.rs:130-179 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/ops.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/ops.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 247 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-kge-ffi/src/ops.rs:130\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3317110a607b90f9c9f7c28a188b43ba0415fc6dd5230bf40f5eefb2a8d51949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1715-1764 | crates/rvlite/src/sparql/parser.rs:1754-1803 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b99c274a2d7cbcd6b39c2b00d137627573d2cebba51fabab0eb49b7e387d032"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:133-180 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:194-241 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:109-156 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:133\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4321cd915e34a7afbccea6dd8fa84045f8857833a2a2309f05966578e6a951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201355 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:589-639 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:629-683 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f43a24bb4c8fead980a6045ca9d4edd309ba36ee8e007b1b62d4878c88073f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:422-469 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:536-583 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:422\u0060 it does not close everything it opens, so those exact 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, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:584\u0060 calls \u0060size_in_bytes\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:470\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd3f6437a3b1ddfa6a2acf7e924f91ce49f19c833ebb927d5dde6ffecec2338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1413-1465 | patches/candle-core-0.9.2/src/tensor.rs:1737-1789 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"015f58c964cc6b33d7c7f343bb9e0833c03939838a3e14a940262f86980ddc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (70\u201376 lines \u00D7 2): crates/ruvector-cnn/src/simd/avx2.rs:212-287 | crates/ruvector-cnn/src/simd/avx2.rs:371-440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:212\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6f7799cbcbeb7e84a5bba517a4ff1d1353316461ffe316b66288dedfad9aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (87 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:438-524 | scripts/patches/hnsw_rs/src/hnswio.rs:438-524 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1042cac57c2ef7e7e5f9ede70e70ff43581f8c33df6c3299d195fbf91243d8f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:1070-1115 | scripts/patches/hnsw_rs/src/hnswio.rs:1070-1115 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e604c6c235e0cbdab1e00a8b8c426364aac0f7bee5ceed1c35faca57715b0c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:906-950 | crates/ruvllm/src/kernels/attention.rs:991-1035 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.rs:906\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"b255a73921e8669dd1ed60e8deff2a82b0f374efb329c384a0baa05309eff22e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1990-2034 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2450-2494 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1990\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7415b6ff0161d5da6bcca642a69cd06c328df1460ac2e687bd4af6998a9e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:316-360 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:365-409 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36f114533243cbe55a8755291b4730ba3deb2756c8b518b1d23e32cde555c0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): patches/candle-core-0.8.4/src/layout.rs:225-269 | patches/candle-core-0.9.2/src/layout.rs:225-269 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/layout.rs\u0060 and \u0060patches/candle-core-0.9.2/src/layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 182 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/layout.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4464ec93afbd7bf435cebfa6e6a7a548e9922f39b704424a81eb8e5e67d291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201344 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/dag.rs:279-319 | crates/ruvector-dag/src/attention/critical_path.rs:44-87 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-unified-wasm/src/dag.rs:279\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/dag.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0ad2bf12e27605441f51795cb06a980eda19380b41d38ca44f499f703710d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:1252-1295 | crates/rvlite/src/cypher/parser.rs:1113-1156 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:1252\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d658d68435333f00c269d81e9b80d7d40436ea8d05516055a99f9f849ea9fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201344 lines \u00D7 2): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:307-350 | crates/ruvector-mincut/src/canonical/tree_packing/mod.rs:148-190 \u2014 \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-mincut/src/canonical/tree_packing/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c062b89f0d1724982b120729ad72a5435537e7f98295719337c8386d397e9e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201344 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw_am.rs:1811-1854 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1664-1702 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw_am.rs:1811\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa87854c7e6171ba341bc26265b9d559498a9999b2469b7cd9bcd18a0593c19a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:876-930 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1072-1126 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec217de5b2f03ca5b7cab88ba19188c8538be599e6747d9f5f1f53b01f961e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201343 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:905-945 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:963-1005 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"3852afa0e3c069d074a4cfa2fa3642cc507b23aa1ae310b3d32e27b42a53b4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:465-507 | crates/rvlite/src/cypher/parser.rs:455-497 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cc07a2899fe7060e635be10cb306ffe560626035f936e68acfb100eb090414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1448-1490 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1565-1607 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcc6585b3d96f97879aa5e468d0e400d119bb763b957d0774923018e06329ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:202-244 | patches/candle-core-0.9.2/src/pickle.rs:213-255 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7d1ffd83e83994277ed1b8b545b71a55f84856c11a8405e59e93c09c341f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54\u201356 lines \u00D7 3): crates/ruvector-cnn/src/kernels/int8_avx2.rs:97-152 | crates/ruvector-cnn/src/kernels/int8_neon.rs:86-139 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:93-146 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00f1eb403213a8c07a633299cfe121f894904ee4320774fed4310e9c508a3e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201342 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:816-854 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:868-909 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32fef7ce9d80d83a96918bd5ce49d2cb778994d9b2b7c52823231bf5cda97e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:120-161 | patches/candle-core-0.9.2/src/backprop.rs:122-163 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/backprop.rs:120\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":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c918292de950f02e0fc16a95ff7402013bdda96153380b3fbbad32b35738af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1798-1857 | scripts/patches/hnsw_rs/src/hnsw.rs:1684-1743 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"71db517540d1e3d1028b51e416465101322e0fa80017e530b5dc3d081204010b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2048-2088 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2524-2564 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2048\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc53673513ff4ff8c969df7e77c81d8fceb2261bbbfb26949cdda842d046f7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:879-919 | scripts/patches/hnsw_rs/src/hnswio.rs:879-919 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4f3bf47dfe32667c3d602ce4711927e3d0628692bf4e3d74af673a44efbe82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201340 lines \u00D7 3): crates/ruvllm/src/quantize/turbo_quant.rs:373-412 | crates/ruvllm/src/quantize/turbo_quant.rs:443-478 | crates/ruvllm/src/quantize/turbo_quant.rs:615-652 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b81dff06ae72a70d30d52454ca7270065795e2ec07732beef0ecb4ebf2811d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1432-1488 | crates/rvlite/src/sparql/executor.rs:722-778 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:1432\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3564d1160a9c779b8ee9f894d179b71e2870adf7afc570e82601782ee38fdb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:600-639 | crates/rvlite/src/sparql/parser.rs:638-677 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5148066cfa6712ff81145fe234ec034a0204b7cf0a943f9cefdd757a27773930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1128-1167 | crates/rvlite/src/sparql/parser.rs:1166-1205 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34ae984b97d9c6b1f8e75fee33c5581dd5541ccff6bccb76896bfe8c7171708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1427-1466 | crates/rvlite/src/sparql/parser.rs:1465-1504 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaea6a88272119006bf7a7bcbd09804b3fe2232ca18da3fe9d3a94869b25699b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201340 lines \u00D7 2): crates/ruvllm/src/lora/micro_lora.rs:382-403 | crates/ruvllm/src/lora/micro_lora.rs:504-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/lora/micro_lora.rs:544\u0060 calls \u0060vfmaq_f32\u0060 and \u0060crates/ruvllm/src/lora/micro_lora.rs:405\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f60f0e7ff7fb6c77e598868cebe132d29c0a0daf9f6d584780ba91b5b78121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201340 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/k_quants.rs:724-763 | patches/candle-core-0.8.4/src/quantized/simd128.rs:101-104 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:775-814 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/simd128.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 83 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 \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:724\u0060 it begins part-way through the construct above it, so those exact 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd95ab57206cda177ab13e6584c3e9dc4e57a6f1711931b4435d536d77aaafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1014-1053 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1122-1161 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1014\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3fb2175845e59b6f70f267f5856e9e9641f35e09cfb55645287706db8f1161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1477-1516 | patches/candle-core-0.9.2/src/tensor.rs:1801-1840 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1477\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a9d1ae4ced6a8ae63e2d2ed094e84349d36f864496b9cf94ddcad1396f5695"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:1092-1130 | crates/rvlite/src/cypher/parser.rs:995-1033 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:1092\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a60122af6e5021b8e63a16b7337baa5c8108f2856aee0d01d59bd3a7eb9e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201339 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:326-359 | crates/ruvector-hailo-cluster/src/bin/embed.rs:317-355 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:326\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e713ff112cc13fcbdcb31560632d95c0024484deacb93aa6a5e3a2ae487f433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/ruvector-kge-ffi/src/ops.rs:310-355 | crates/ruvector-kge-wasm/src/ops.rs:310-355 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/ops.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/ops.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 247 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb87c492f2031fb9894d2567e30f57eccfd32b77e530bd4051981cee34a10f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1107-1146 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1310-1349 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1107\u0060 it begins part-way through the construct above it, so those exact 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, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1148\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:1350\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37e3d76385005bb42fb99d26aca8fd66786b3c4adb138e9a319a991b1898849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2254-2291 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1406-1442 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2778-2815 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1898-1934 \u2014 \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 90 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2254\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"154461af4955d4372846943e33e2551a91387b52aed4e78849ebd4258c459fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:515-551 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:531-568 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33dbaf45196f73681f6ef1c3ab3ee6c371bf8e22bf002a2764d95780556377f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/ruvector-math/src/tensor_networks/tucker.rs:257-294 | crates/ruvector-math/src/tensor_networks/tucker.rs:305-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/tucker.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c2c3d58fec50362feb12260363e71ba30eca9a6d6b3a981cc575266cd0f89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:678-734 | crates/rvlite/src/sparql/parser.rs:716-772 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da65d54b04baf0138bf5bae6bdfc7df895ba0c04b904be981f19a41c8bd7ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/ruvector-streaming-qng/src/bin/benchmark.rs:372-409 | crates/ruvector-streaming-qng/src/bin/benchmark.rs:421-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/bin/benchmark.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2deca25e9aa94a59f23c161c047fcd995a52e734556162c86bf73441e730ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201345 lines \u00D7 2): crates/ruvllm/src/backends/coreml_backend.rs:723-764 | crates/ruvllm/src/backends/coreml_backend.rs:1143-1187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/coreml_backend.rs:723\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b173139634cc7dc4ee1c7835989ffa2f147b6b79b648717d1e920a410c7a783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:463-500 | patches/candle-core-0.9.2/src/display.rs:486-523 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/display.rs:463\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":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deb6356e21dc75beafe8c47175f22a18c058a882c3a1a3ccacb355fb8d87341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201337 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:56-92 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:146-169 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:57-91 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6492efe14fc1489434db3d07f2c46833468cd28ac273545c8c173a1cbbc55b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201337 lines \u00D7 2): crates/mcp-brain/src/server.rs:118-151 | crates/mcp-gate/src/server.rs:200-236 \u2014 before extracting anything, compare \u0060crates/mcp-brain/src/server.rs\u0060 and \u0060crates/mcp-gate/src/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"336fadf065040b066ea3ccf23efeb4c8e28bb3ebbeb7c3bbbd68d7cfc67f35eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): crates/rvf/rvf-index/src/progressive.rs:191-227 | crates/rvf/rvf-index/src/progressive.rs:358-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/progressive.rs:191\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/progressive.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78bdcb6faed940efe43412176737a336b1ebea9f819ee874b58e157e63e1aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:155-190 | patches/candle-core-0.9.2/src/conv.rs:169-205 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f36f0a9674d10a186f4dbc04dcb0cfed9a2a324a01d6423ce42e0dc5308d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:518-552 | crates/ruvector-py/src/graph/cypher_exec.rs:232-267 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/cypher_exec.rs:518\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"228788fa23e0c7da94b7b48a116196f633692528babcf66d7f614333285503ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:606-641 | crates/rvlite/src/cypher/parser.rs:596-631 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b4a76cc40a3f5eef812e4f5012849267149f2d0af69b4545d4146eb34f97c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:732-767 | crates/rvlite/src/cypher/parser.rs:722-757 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df8ecd2ba144f1d3cfe26db804eb26c133bcd488134d68d681cff6f21bc11bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1923-1970 | crates/rvlite/src/sparql/parser.rs:1962-2009 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b2480b6f6c26c9fd50c0bf694e2eb24af7d75e885c5e107427ea727687e1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:700-735 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:896-931 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4a7630759d534ab61bae05d1f365893b82118b5fb682e4afc1069208d483fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (284 lines \u00D7 2): patches/candle-core-0.8.4/src/shape.rs:74-357 | patches/candle-core-0.9.2/src/shape.rs:74-357 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/shape.rs\u0060 and \u0060patches/candle-core-0.9.2/src/shape.rs\u0060 as WHOLE FILES: 99% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/shape.rs:74\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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd91fd111715944234352be53c6cad18079d81d1cd958e6b1f9a26b5e51dd49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201341 lines \u00D7 2): patches/candle-core-0.9.2/src/safetensors.rs:228-268 | patches/candle-core-0.9.2/src/safetensors.rs:328-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/safetensors.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dd89e55e128f8e226a16b713da2459b8000e2b47fa7c84399693c3db5d80b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:1223-1289 | scripts/patches/hnsw_rs/src/hnswio.rs:1223-1289 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3f9651150f0383b95124c5470ae577fe9efd0b6924d36f4aa7a60af77fd117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1214-1248 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1411-1445 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1416-1450 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1677-1711 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1214\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57516508db957120beda1c4263f728085fd1479a82be13d9f917b51e190dec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/ruvector-kge-ffi/src/ops.rs:270-304 | crates/ruvector-kge-wasm/src/ops.rs:270-304 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/ops.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/ops.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 247 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbadc602780f1df1dca02bca372b51d03950061817463663047bdd77df84e0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201335 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:315-349 | crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:433-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:315\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/flash_attention.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"49808f2b09bd77ed8a140679bfe234b3d40fc3400abcb7100b74f0a8bf95d832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/ruvllm/src/training/contrastive.rs:437-471 | crates/ruvllm/src/training/contrastive.rs:499-533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/training/contrastive.rs:437\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a208288721f16e706ef42be2c4c43ff6c36f19b68a74d6a65b51b4b2f9c612"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:325-359 | patches/candle-core-0.9.2/src/conv.rs:352-386 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbacea1b6135605fd73b8801f2efceb2072f114a4f355475c1d4bb735fd29f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1257-1291 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1365-1399 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb39335f594c57bf1c89c40a19f8eb600a5a2aa6c2c0036034269a375d63f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 3): crates/ruvector-temporal-tensor/src/quantizer.rs:387-420 | crates/ruvector-temporal-tensor/src/quantizer.rs:483-516 | crates/ruvector-temporal-tensor/src/quantizer.rs:575-608 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/quantizer.rs:387\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3515c7300597afd6c2253a6b631b8e8782631e97a39a67d44e0f2d568b5f242f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1048-1089 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1156-1197 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1253-1294 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1048\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"222d655485e95aac5b1da9cfbe4f73f0eec26bed7d591d3bb8aee6adc35d284a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201334 lines \u00D7 2): crates/prime-radiant/src/cohomology/diffusion.rs:205-238 | crates/prime-radiant/src/cohomology/diffusion.rs:293-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/cohomology/diffusion.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":"crates/prime-radiant/src/cohomology/diffusion.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e57936a30abd32e86807551e3dd326d53fd3585c905de07328c4204e1a0ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201347 lines \u00D7 2): crates/ruvector-consciousness/src/pid.rs:148-187 | crates/ruvector-consciousness/src/pid.rs:201-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/pid.rs:201\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-consciousness/src/pid.rs:200\u0060 calls \u0060compute_source_marginal\u0060 and \u0060crates/ruvector-consciousness/src/pid.rs:147\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/pid.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85967c6c3881c71566cbb6a6805c8f7efe1044fac84533f848dbfdac3b3cf80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201334 lines \u00D7 2): crates/ruvector-diverse-beam/src/bin/benchmark.rs:185-216 | crates/ruvector-diverse-beam/src/bin/benchmark.rs:231-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diverse-beam/src/bin/benchmark.rs:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/bin/benchmark.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8778286bfbc3949cd5a29f03763b990a1ccb3b0c9eb5339a4c180f91b4eec83d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:774-807 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:823-856 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ed13756abb2a7e75d058051e9bb232104693e67e89eea7bb6986e1c55ad88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:102-135 | crates/rvlite/src/sparql/parser.rs:125-158 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb86b647ee81cc9e103f1ca49ac55f97f3859f2e93c53cadde5a1a2c56a1192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (74 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2132-2205 | crates/rvlite/src/sparql/parser.rs:2171-2244 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:2132\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1703698f57b6a75cadb230a7ea86aa80d52ef40b0d6263def4833774ce5ffb54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201334 lines \u00D7 2): crates/ruvector-wasm/kernels/swiglu.rs:107-138 | crates/ruvector-wasm/kernels/swiglu.rs:161-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-wasm/kernels/swiglu.rs:107\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/swiglu.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb623f9d57016903536fb7624287c664b62969f94ce2350bd95e0bc0b103485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): patches/candle-core-0.8.4/src/indexer.rs:28-61 | patches/candle-core-0.9.2/src/indexer.rs:28-61 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/indexer.rs\u0060 and \u0060patches/candle-core-0.9.2/src/indexer.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/indexer.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d38d967f0ba6a51549817c91de6617cf4d19feaa0547aeaa0807f269d517f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:836-869 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:944-977 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:836\u0060 it begins part-way through the construct above it, so those exact 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, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:870\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:978\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"9896ff28e30e96539932565e11329766e21396699396031074a5a18e8cad9b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:410-443 | scripts/patches/hnsw_rs/src/hnsw.rs:410-443 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f5352ae7c785cc7eb7d795876eca30546ef3541d471b58fb68d3692aafb4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50\u201351 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1662-1711 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2009-2058 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2088-2138 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1662\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0f7b41cc9490a8f438fb53e8c63084569b4b16736d69b98e0d8c48869e2b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): crates/ruvllm/src/kernels/matmul.rs:897-927 | crates/ruvllm/src/kernels/matmul.rs:1661-1693 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc40d37a5e4db2960019ee7aae9123d0b52b0612b0e708816271e4ea4e49232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201333 lines \u00D7 2): crates/ruvllm/src/quantize/quip.rs:693-718 | crates/ruvllm/src/quantize/ruvltra_quant.rs:856-888 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/quantize/quip.rs\u0060 and \u0060crates/ruvllm/src/quantize/ruvltra_quant.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/quip.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd77cee9cf722e01465aac420fa2a3b3a764db908eb77561fa0292a1d6265e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:814-855 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1010-1051 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6183c2fb5727588fc24aeb613bdba19b334e2d14533bfa8320c5a65ece3d5af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:54-86 | patches/candle-core-0.9.2/src/pickle.rs:55-87 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/pickle.rs:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.9.2/src/pickle.rs:88\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.8.4/src/pickle.rs:87\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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1a22dd33a83838e303bacec2ad7a75f3d9564613ebfec17fb73b7ec6dd2027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:156-188 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:157-189 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a75bbafebb217b94df7b4aa87b9a2eac2f024cdd51205e6d489707428bfe4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): crates/ruvllm/src/backends/gemma2.rs:880-912 | crates/ruvllm/src/backends/phi3.rs:749-781 | crates/ruvllm/src/models/ruvltra.rs:1059-1091 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:880\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026Gemma2Config\u0060 in one and \u0060\u0026Phi3Config\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c86e231cb7164a4e0d1a5ad94e5e689213c96e1a195fe1f1d19934ec9ae9b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:349-380 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:364-395 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aec1d3a472acee519db493141c658d625c9aadd6af728183becc21253fdf09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1588-1619 | crates/rvlite/src/sparql/executor.rs:865-896 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026mut SparqlContext\u0060 in one and \u0060\u0026SparqlContext\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b18a937c20b2b7d1d2f2682e4043a7a9647f7014cd374c1d5a69ed1c113368a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1500-1531 | crates/rvlite/src/sparql/parser.rs:1539-1570 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:1500\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"db860aeff62cf77a49c6ac2d15a029b0fc00b26cdf3ec3ea8a6721a16e208cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201332 lines \u00D7 2): crates/ruvector-wasm/kernels/rmsnorm.rs:83-108 | crates/ruvector-wasm/kernels/rmsnorm.rs:169-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rmsnorm.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e80c9851daefb63e4926c289b28274af8f9d662c0ad1f716c2717732f1ea46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/ruvllm/src/backends/phi3.rs:640-671 | crates/ruvllm/src/models/ruvltra.rs:920-951 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/phi3.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/phi3.rs:640\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c946cb61bd669443f462e00ae9104472fb7db8e3aa77104716511e0cc60f644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201338 lines \u00D7 3): crates/ruvllm_sparse_attention/src/attention.rs:225-262 | crates/ruvllm_sparse_attention/src/attention.rs:416-423 | crates/ruvllm_sparse_attention/src/attention.rs:1397-1433 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:225\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1042dd10b0f87880f24afc965b4001fc2e8e2c5ad129d577109d05c71f886f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:225-256 | patches/candle-core-0.9.2/src/conv.rs:240-271 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a3112be751679419e1b7fadee0c4f8ab2d8302916521a6806fda8f935ceac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:205-236 | patches/candle-core-0.9.2/src/npy.rs:212-243 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/npy.rs:205\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe1340291fa49a7ee1074930e6ac02b8d73ae719ee75dc5bdc43943f67b1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1663-1694 | patches/candle-core-0.9.2/src/tensor.rs:1987-2018 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7bd5c87596b4b24fc8bad1bc91b0e6ca5e666aaaeb4f17b09bf90f3f548f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1269-1300 | scripts/patches/hnsw_rs/src/hnsw.rs:1246-1277 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:1269\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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a140e40ef1c7315704ee4f9fbe51a431c000ccd6d09d3290bf53548a245680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201331 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/bench.rs:216-243 | crates/ruvector-hailo-cluster/src/bin/embed.rs:217-247 | crates/ruvector-hailo-cluster/src/bin/stats.rs:167-194 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:216\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec11a5935a361d306ee23d1a79ab2ed7e74d602e489e3ae7670eccb617ba146b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): crates/ruvector-cnn/src/kernels/int8_avx2.rs:252-282 | crates/ruvector-cnn/src/kernels/int8_neon.rs:247-276 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"37389f2b96b115cf7882c70d9e625a37df5c6d8c5409700d35976f606c55418e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:291-322 | crates/ruvector-py/src/graph/cypher_eval.rs:327-358 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3674d72066b4cabd37cecaa7a1af39478b8082c279a2ed139f3507efb60f9b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1001-1031 | crates/rvlite/src/sparql/parser.rs:1039-1069 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c9a431dfc0f6a96dff90e1771c4f31b42980411bd1b16be2aecb47cfdcb2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201349 lines \u00D7 3): crates/ruvector-solver-node/src/lib.rs:688-736 | crates/ruvector-solver-node/src/lib.rs:848-849 | crates/ruvector-solver-node/src/lib.rs:1028-1076 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver-node/src/lib.rs:688\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060SolveConfig\u0060 in one and \u0060PageRankConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"760d54ed9de6302a3ad6aa9fd725cfcaf7084843db0ff98be33a6caca409d37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1291-1321 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1408-1438 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1291\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5b5f7e4ec239848c3aa2a2a3c5e93e426c5ab08f5c9036830798daec88055b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:266-296 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:303-332 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"348e70488314ec4e803a4f03fa97506774797a50a00c57505df11b6795465a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:21-51 | patches/candle-core-0.9.2/src/display.rs:21-51 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/display.rs:21\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"060684649b7f7b2a0564c62ca68b4f500c1373129fb899d98add09ba0719997d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1386-1421 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1554-1589 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eddd2a55fba722a054ae6762f1aa1df52047d7ea6b783270b0273602e5aadf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:110-161 | patches/candle-core-0.9.2/src/npy.rs:117-168 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/npy.rs:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374014950ba0e3d566357ee42fcc40e7f30f6bce45252a4c0247d0b4f874a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1793-1823 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2220-2250 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf7068cb830312c260a5017b8a94af11b70f7bd31496473a09d6ad513b50055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:655-685 | scripts/patches/hnsw_rs/src/hnsw.rs:648-678 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a017d921e4314afb6d5d90899e2ef76201cecd6abc1e64397f152a0172e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:1357-1387 | scripts/patches/hnsw_rs/src/hnswio.rs:1357-1387 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1703706c8e17738612f24e1b3a82be02a9e000e4148388158bc2bda758bb9db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201330 lines \u00D7 4): crates/ruvllm/src/backends/gemma2.rs:675-701 | crates/ruvllm/src/backends/phi3.rs:553-582 | crates/ruvllm/src/models/ruvltra.rs:680-709 | crates/ruvllm/src/models/ruvltra.rs:821-846 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/ruvltra.rs:821\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/backends/gemma2.rs:707\u0060 calls \u0060gelu\u0060, \u0060gelu_vec\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs:710\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb6504096e69cf0b68974d9613b614731c94674328c6dd6e4eab7412bcf9878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/bench.rs:86-115 | crates/ruvector-hailo-cluster/src/bin/embed.rs:85-114 | crates/ruvector-hailo-cluster/src/bin/stats.rs:62-91 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a66d688f992a3dd026a61f38d58d683fbcec318b4122e2615db4e4ec0a82a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201330 lines \u00D7 3): crates/ruvector-temporal-tensor/src/quantizer.rs:340-364 | crates/ruvector-temporal-tensor/src/quantizer.rs:412-441 | crates/ruvector-temporal-tensor/src/quantizer.rs:508-537 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/quantizer.rs:340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dd6a78564384d41e84c259217921edda81d09c31b320411eecff5e63640eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:1555-1584 | crates/mcp-brain-server/src/routes.rs:3663-3692 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4445a2356cb1658217bd47bcdea1251fb21815b6c37cae642aafb57673f910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/ruvllm/src/kv_cache.rs:803-832 | crates/ruvllm/src/kv_cache.rs:1448-1477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kv_cache.rs:803\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c03d7889d7b40651407cb8e14c2ac6b031f4f770b8e5b260d6a9176be721446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:263-292 | crates/ruvllm_sparse_attention/src/attention.rs:1435-1464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:263\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"47971a3a25ec75129b38f276bc86a4b72bd393f106ac01af808a7ce71dba6251"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:971-1027 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1167-1223 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:971\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"669accb63435b4538333b896cd065f6114b51d0ddedb383e7498017461fc5885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1454-1485 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1622-1653 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3f103a8691ffca13c05015db450064f6eba4a99641e4288bd65b8358381154"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1377-1406 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1643-1672 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1377\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaad6f1a151dff2b7a565d007a545adfc389d1862715d42dc454596cd3d42663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): patches/candle-core-0.8.4/src/sort.rs:21-50 | patches/candle-core-0.9.2/src/sort.rs:21-50 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/sort.rs\u0060 and \u0060patches/candle-core-0.9.2/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/sort.rs:21\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0af2e64f3fb83ba3c86430bdd2cc967230b3dc0c258361b01b1ea1332db373f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:780-809 | scripts/patches/hnsw_rs/src/hnsw.rs:773-802 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f13b6fc21466cc14f63450cfd50c17ff8d1589291f6b0cf5e07c5f3c22599d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1537-1579 | scripts/patches/hnsw_rs/src/hnsw.rs:1423-1465 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:1537\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe67dac706bb796135ff8643b8f8a989b54171cb8aa8d3844c43d46aac65def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): crates/ruvector-diverse-beam/src/bin/benchmark.rs:188-216 | crates/ruvector-diverse-beam/src/bin/benchmark.rs:234-262 | crates/ruvector-diverse-beam/src/bin/benchmark.rs:284-312 \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, \u0060crates/ruvector-diverse-beam/src/bin/benchmark.rs:186\u0060 calls \u0060memory_estimate_mb\u0060 and \u0060crates/ruvector-diverse-beam/src/bin/benchmark.rs:282\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/bin/benchmark.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5264c59c3a50d64108e47413c516f59a60b20212b90cd3ca0f5048f83b5fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 2): crates/ruvector-attention/src/moe/expert.rs:219-243 | crates/ruvector-attention/src/sparse/linear.rs:145-173 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/moe/expert.rs:219\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/moe/expert.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c442a950da349960b0a53197c8be3fc635aa403f70e62f18702889914ea5590e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:63-91 | crates/rvlite/src/sparql/executor.rs:50-78 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"755c87307ccb4da429c230668f0a55b5dc4a345ef79c4f3afbca44be83b4c594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:950-978 | crates/rvlite/src/sparql/parser.rs:988-1016 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc71a87ab9e37347a388ccde42ed8f5874fd269c48c41a9f068e29a062b2aa45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/ruvector-solver-node/src/lib.rs:337-365 | crates/ruvector-solver-node/src/lib.rs:396-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver-node/src/lib.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-solver-node/src/lib.rs:367\u0060 calls \u0060swap\u0060 and \u0060crates/ruvector-solver-node/src/lib.rs:426\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f81ad1a649f866432459ece2a74326f6f8172da0455ab436b5c680f6340488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:280-308 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:329-357 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c572756239bee1b4cc9164b7c03e2ddfa0ce4e31719755a2d8cf2edab5f8d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:167-195 | patches/candle-core-0.9.2/src/npy.rs:174-202 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/npy.rs:167\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":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c57d09991e43c7fc8587e75a009929ae54ead5ffcf505b313361036ceb0bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:774-812 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:825-863 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:774\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f08f6386532e0b171011fe70e4dbdca1a58c48a05e1547ba1ceed4cf9c0280e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (112 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:895-1006 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1003-1114 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c37cc68e69cd379455f2c856709766aad60bdd3a24ffc8743586ebebb5dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1591-1639 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1937-1985 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d41b962764378fac93142d8af9c30b77d9e2b443307fd68bb1c061f6cf96bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2508-2555 | patches/candle-core-0.9.2/src/tensor.rs:2831-2878 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"5115bb58715690d6b56d28ca50f13a2e45c2086ab5aaa8c13b4950cf9c1a42f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201348 lines \u00D7 3): crates/ruvector-cnn/src/kernels/int8_avx2.rs:183-230 | crates/ruvector-cnn/src/kernels/int8_neon.rs:179-226 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:195-241 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:183\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3693b05720fcb0730330cae896a5100b3ebc202b8a59902ad1b5b6031c327a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201328 lines \u00D7 3): crates/rvm/crates/rvm-security/src/gate.rs:162-189 | crates/rvm/crates/rvm-security/src/gate.rs:275-299 | crates/rvm/crates/rvm-security/src/gate.rs:408-429 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvm/crates/rvm-security/src/gate.rs:162\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-security/src/gate.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"464e34da582315145aa807e95338b917d1d1e084d764254bd3e82c38c5b6c11a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:6265-6291 | crates/mcp-brain-server/src/routes.rs:6315-6342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/mcp-brain-server/src/routes.rs:6293\u0060 calls \u0060get\u0060, \u0060and_then\u0060, \u0060as_str\u0060 and \u0060crates/mcp-brain-server/src/routes.rs:6344\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4293b1be197ab94f630a154647a9b3668c883fff653d30fdb9b5699836df7e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:435-462 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:450-477 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4495b0918dc99d8852bdaf1009562a0815b0b101128f27f30bd9112d691217bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:225-252 | crates/rvlite/src/sparql/executor.rs:196-223 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:225\u0060 it does not close everything it opens, so those exact 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 \u0060ctx\u0060 to \u0060\u0026mut SparqlContext\u0060 in one and \u0060\u0026SparqlContext\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcee1bf95888f8948f01bb042255940699f407408794241c455d8757adbcd211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:828-855 | crates/rvlite/src/sparql/executor.rs:451-478 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c32d339744e2e728eba72a1db7c04c95847f01b84ecaa7404bcb8ba490d612c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1684-1711 | crates/rvlite/src/sparql/parser.rs:1723-1750 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:1684\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da64e26ae345f35f33e0488c9818dba6de92a32445ccf3972b0c8a842e4f2bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvix/crates/dtb/src/parser.rs:157-184 | crates/ruvix/crates/dtb/src/parser.rs:242-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/dtb/src/parser.rs:157\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/dtb/src/parser.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ff2cdd253a8722592eddd5ca3fc03abcab569493c4cc2a65804312ce478d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvllm/src/backends/phi3.rs:337-364 | crates/ruvllm/src/models/ruvltra.rs:589-616 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/phi3.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/phi3.rs:337\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d27a82c684a3b7a4c2ebd9d502ba6951f10a8a1afa85ca3082f90495fae78d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvllm/src/quantize/hadamard.rs:435-462 | crates/ruvllm/src/quantize/hadamard.rs:492-519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/hadamard.rs:435\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd247f41fe269362c26e4b2a8473dab2f648026e1c82adac58f586ca6034724f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): crates/ruvllm/src/speculative.rs:990-1017 | crates/ruvllm/src/speculative.rs:1167-1192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/speculative.rs:990\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/speculative.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df8195d43b2efbc06de8d33160bf6481cba3ca2c6e62005e978f6b0239d2f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): crates/rvf/rvf-federation/src/aggregate.rs:212-239 | crates/rvf/rvf-federation/src/aggregate.rs:264-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-federation/src/aggregate.rs:212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-federation/src/aggregate.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a425be0b5e62653663d48fda7f325c46d14e77e33d6abca1e37cd6dc3eaf908f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/metal.rs:139-166 | patches/candle-core-0.9.2/src/quantized/metal.rs:195-222 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cb5a540c214992a9a028fd8caebf6ea03e54aa281318f7a842a713c1091a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2201-2228 | patches/candle-core-0.9.2/src/tensor.rs:2524-2551 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ffa161483d44ac1dcb25c2c0ee406d82ca5ec5f2c741e3eedd478a924d2443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:876-903 | scripts/patches/hnsw_rs/src/hnsw.rs:869-896 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"807d43abfe6b7859395ae0c8f4bc17ddfbd0223f0a279a6b1f4f457ecaaaa0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 3): crates/ruvector-entropy-ann/src/search.rs:251-277 | crates/ruvector-entropy-ann/src/search.rs:368-392 | crates/ruvector-entropy-ann/src/search.rs:417-441 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6157de6850b4b2277e1b74fa30a3deebcc2a81bdd7082f706f53ac2ac7275d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201338 lines \u00D7 2): crates/mcp-brain-server/src/gcs.rs:109-141 | crates/mcp-brain-server/src/store.rs:206-243 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/store.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f43ab5022e714a19721f05af81c234b1e95fcaa8d240379a22008cf61dd527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ruvector-bench/src/bin/memory_benchmark.rs:168-194 | crates/ruvector-bench/src/bin/memory_benchmark.rs:372-398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs:168\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/memory_benchmark.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a0d99f2fb9c430edb4ddfc1d5aa302edbc095632586be52c562425c89c9b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:510-536 | crates/rvlite/src/cypher/parser.rs:500-526 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58b29d4d1385555ff34f4f03d374a22e901e567a43492b61b6cbee02eaa580d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:797-823 | crates/rvlite/src/cypher/parser.rs:787-813 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c18b3237dab3967fc193b6b3c968594149945f88a42ff992916ee6b3c949e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ruvector-math/src/information_geometry/fisher.rs:180-206 | crates/ruvector-math/src/information_geometry/kfac.rs:217-243 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/information_geometry/fisher.rs\u0060 and \u0060crates/ruvector-math/src/information_geometry/kfac.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/information_geometry/fisher.rs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/fisher.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3cc046fdb21a70d0b8a4c4edd0c84b747fb558a2e461956de759811f461ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1183-1218 | crates/rvlite/src/sparql/executor.rs:549-584 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:1221\u0060 calls \u0060Some\u0060, \u0060filter_solutions\u0060 and \u0060crates/rvlite/src/sparql/executor.rs:586\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6e3efdee8aa4211542c7654043fb047a3f1a712d7b95500bb9560820b8cf69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): crates/ruvix/crates/nucleus/src/checkpoint.rs:192-218 | crates/ruvix/crates/nucleus/src/checkpoint.rs:238-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/checkpoint.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e62e025c87777cf73d8661ca018069cb3ac28bc83844de8631526ce902bb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ruvllm/src/models/openmythos/config.rs:64-90 | crates/ruvllm/src/models/openmythos/config.rs:96-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/config.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dbe564670fd5e275437a44721c5d2699f9b43cbfbf8e08e81ea48f4ed7ceaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ruvllm/src/models/sampling.rs:131-157 | crates/ruvllm/src/models/sampling.rs:217-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/sampling.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5fff68aea5837d6b2cbbfe6f70ad37ec9d58613df737cb66dea239a41d2bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:168-197 | crates/ruvllm_sparse_attention/src/attention.rs:1340-1369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbf9af776324b6a1243ceda6481763cbf0be7d941d54a1f3dffa137271fa4b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/rvf/rvf-runtime/src/store/filtered_query.rs:287-313 | crates/rvf/rvf-runtime/src/store/filtered_query.rs:404-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store/filtered_query.rs:287\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/filtered_query.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"109ba7cd79de4cba82b6835cd5b1f9497cc339ed312c28a09b5f244c045da2bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): patches/candle-core-0.8.4/src/layout.rs:81-107 | patches/candle-core-0.9.2/src/layout.rs:81-107 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/layout.rs\u0060 and \u0060patches/candle-core-0.9.2/src/layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 182 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/layout.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"735c058fac5d16181e82e429ac448f3b431d5086846304094a8d608facfdba98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): patches/candle-core-0.8.4/src/layout.rs:195-221 | patches/candle-core-0.9.2/src/layout.rs:195-221 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/layout.rs\u0060 and \u0060patches/candle-core-0.9.2/src/layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 182 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/layout.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ad951af82aab0d3455f5232760a48672827f62e0038cdd6adc0fe6a3aa408e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201327 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/avx.rs:184-203 | patches/candle-core-0.8.4/src/quantized/avx.rs:393-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a3d7d2efa2744e34f4a7f3d5b6bcd6404b3f71e7d38ee7e5ad8c8630611d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1530-1559 | patches/candle-core-0.9.2/src/tensor.rs:1854-1883 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f1447d367ab5be3ba6860c8b5d18b279d22cbc193dcc51c4d6a141e5621bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruvector-cnn/src/quantize/graph_rewrite.rs:326-351 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:370-395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/quantize/graph_rewrite.rs:326\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dae9641618876614a9cf50c5fb922809cbca7f87f442b20dfb873c77feb233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): crates/ruvector-consciousness/src/iit4.rs:267-292 | crates/ruvector-consciousness/src/iit4.rs:317-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/iit4.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/iit4.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcc3bb556a6bc6721eac22dbcb3650550d23cb162f1e07bfc7c581be51e64a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): crates/ruvector-delta-index/src/lib.rs:432-457 | crates/ruvector-delta-index/src/lib.rs:731-753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-index/src/lib.rs:432\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-delta-index/src/lib.rs:754\u0060 calls \u0060filter\u0060 and \u0060crates/ruvector-delta-index/src/lib.rs:458\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-index/src/lib.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"2261707daa8306a61fd121e51a9be0376fe320779ed3256bc1ce6a8a1d793328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:704-729 | crates/rvlite/src/cypher/parser.rs:694-719 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95d4a3a8d5c25bc8d55ddb0d54955fa18fd6d2d88e215ce3606949bfb56eb6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:269-294 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:309-334 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:269\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a102e622f3eb530aeaa74123dc305830f3f7f5d55e3bb1ff93170629f9c689b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:296-320 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:336-361 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:296\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f21cee893a8ce9f515d1b897c32f2251e6ba80f475b33c4b14d32330262b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:114-139 | crates/ruvector-mincut/src/canonical/tree_packing/mod.rs:101-126 \u2014 \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-mincut/src/canonical/tree_packing/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5b24cc501c76d14a3bab769bbc3e361d71460237179594af4fc4eb25ac466f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1336-1361 | crates/rvlite/src/sparql/executor.rs:666-691 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fec01f4d9ae4c15ed7667473104e3c25e506a9d12f395f4320188688bb1faa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/ruvix/crates/nucleus/src/kernel.rs:532-557 | crates/ruvix/crates/nucleus/src/kernel.rs:569-594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/nucleus/src/kernel.rs:532\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/kernel.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"1464dbf86a9d9991ce523147c7a1fb20c53f57aac9f85577c752465f8abab24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): crates/ruvllm/src/models/ruvltra.rs:241-266 | crates/ruvllm/src/models/ruvltra.rs:285-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/ruvltra.rs:241\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8d9d26e2a13cb892deb028e29fefc4f07f11850cb8ce802a67ea7c56feb9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): crates/rvAgent/rvagent-middleware/src/hnsw.rs:527-550 | crates/rvAgent/rvagent-middleware/src/sona.rs:123-148 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-middleware/src/hnsw.rs:527\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"36711e1d7b3b347f567df51f2e791bf650761f90c14c8cc901b798abada2065e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/rvf/rvf-runtime/src/qr_seed.rs:315-340 | crates/rvf/rvf-runtime/src/qr_seed.rs:382-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/qr_seed.rs:315\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/qr_seed.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4d98c1c66cf80dbedd6311b9a3d85f7ebcb05806230052ba1add28ebe0e67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:352-381 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:370-399 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:352\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"161db062361e8f4a6f93bf15c5c37e036cff8602eb478dd22dcdd00d9c145d71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:186-211 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:203-228 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:186\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, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:202\u0060 calls \u0060size_in_bytes\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:185\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c822a865a79c845b02236ce64a8b834901f251b3f90fdf27969c7fda928f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:237-262 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:256-281 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:237\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, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:255\u0060 calls \u0060size_in_bytes\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:236\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8140bb8ff40b859549e243d4d2151ed92bd604b3829b2699132d8dcf09de192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:345-370 | patches/candle-core-0.9.2/src/pickle.rs:356-381 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0368614ceed04968c2e3745b1bd3cfa334f7f27e40da07181bd39d2aee657827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:393-418 | patches/candle-core-0.9.2/src/quantized/cuda.rs:554-579 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs:393\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":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ca275d9dbea1f5ff83e5ecb621f9596668cc55021257b469d6533b815b11b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:509-541 | patches/candle-core-0.9.2/src/quantized/cuda.rs:760-792 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9530e6042e7e055b4c5b2aa3b1834fb5db1e2db3fc8909d06b7e74682e626257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:134-160 | patches/candle-core-0.9.2/src/storage.rs:143-169 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"850b553dbae32acb20c8f8a840caaeeceb4d31456354505f32f3c1b06360528e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): patches/hnsw_rs/src/datamap.rs:244-269 | scripts/patches/hnsw_rs/src/datamap.rs:244-269 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/datamap.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/datamap.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 231 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc03e6e531b3af26012d61a2fe9128f57d6a739b7e6d725527147ac7621c1c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1498-1522 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1764-1788 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1846-1870 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1498\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5773838086c8b47081c6c8172757453f4dd4056e5dcf74c0b42c9424e9e600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201338 lines \u00D7 2): crates/ruvector-bench/src/bin/comparison_benchmark.rs:310-345 | crates/ruvector-bench/src/bin/latency_benchmark.rs:340-377 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:310\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf62e58d39d810391bf73aa20c4f0c575e8edcd7b8146f7be5446e647385944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/ruvector-cnn/src/kernels/int8_avx2.rs:408-432 | crates/ruvector-cnn/src/kernels/int8_neon.rs:389-412 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:408\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19017176ac9edca15357f061d24c30bd8b4bde574cb3560c617fa02bd355dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruvector-core/src/advanced_features/matryoshka.rs:237-261 | crates/ruvector-core/src/advanced_features/matryoshka.rs:399-423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/matryoshka.rs:237\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/matryoshka.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c168af3b587f08b839ae9700cd883369129099f69640dc5f2ce980c16e6e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201334 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:472-505 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:488-518 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9019b8161745bd97829a158d3e2d2900659e0860860e3ec0261886a61b082560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:1135-1159 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:1218-1242 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9abe24386074a7522d3d682355995a0ceaaedf65d286d67409c63b125d96a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:770-794 | crates/rvlite/src/cypher/parser.rs:760-784 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8062028a24e47b70f12a676590e4bb398a008928ffcb3c4fa8cbdff6f1b0fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/ruvector-memory-admission/src/policy.rs:226-250 | crates/ruvector-memory-admission/src/policy.rs:377-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/policy.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f97e478bf8a6e67dff33f8469448ad0fcbdb15f2a66d0e219a23bca8c514a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/workspace.rs:175-198 | crates/ruvector-nervous-system/src/routing/workspace.rs:309-333 \u2014 before extracting anything, compare \u0060crates/ruvector-nervous-system-wasm/src/workspace.rs\u0060 and \u0060crates/ruvector-nervous-system/src/routing/workspace.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system-wasm/src/workspace.rs:175\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/workspace.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c19065586c2e0a48f83b50965a6f64fd900f59d85255131b2c0fb240961e147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1825-1849 | crates/rvlite/src/sparql/parser.rs:1864-1888 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"728196c20b9a3276191fadf2e83877072a795ea95b7ed1da2a6a888b825c1e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): crates/ruvector-postgres/src/solver/operators.rs:239-270 | crates/ruvector-postgres/src/solver/operators.rs:440-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4323701dd43cf58c87c5b2f999506d913b370853634786b689e8ea3fe6445dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruvector-solver/src/types.rs:103-127 | crates/ruvector-solver/src/types.rs:187-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 \u0060crates/ruvector-solver/src/types.rs:103\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \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":"crates/ruvector-solver/src/types.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"77218d76c229f4c8c2340c33f6b66c88ed3e791de75b12f9ec6270db21f05eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:311-339 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:329-357 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:311\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"776795d60c5fd0df3211df1b215f40f57133f00433d9439a5d53b84c7b6416d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2593-2617 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:3214-3238 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"d571fe1b3b220d6ddfe82a393fbfd25efc78442824e2c167544d9c676c07c716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:267-329 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:286-348 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e6082ef56b3579d3d369b44e5094734278890c93c4ea2162b2134064446e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:917-941 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:963-987 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:917\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"367f444482ad3a6afcacc430348b795679b5d224be51901adafebeabf9bd277e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:549-588 | patches/candle-core-0.9.2/src/quantized/cuda.rs:800-839 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10135ea4a164d072a84d682f8bfec11abed19232b2faabc3dd45a077ef75a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:279-313 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:280-314 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"249609dba560f9bf4f90266cd5720fdcbdc129eb706ccfa90bbd8a4e83cf3be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:316-351 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:317-352 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f920baca4137cd1894623cc203ebb8270fed521c341601478e56e7d569d7d2c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:495-538 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:496-539 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d10885e13c72b9f81264db43e7d1c89356563b844237137bd8c1af69b72d752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:334-360 | patches/candle-core-0.9.2/src/storage.rs:343-369 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"18361cd3badcc2a3589b3c127b03bba16144d2513ecb5d8b5d6eb3dee6f7dc2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201325 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1128-1131 | patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:140-164 | patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:294-318 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1236-1239 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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, \u0060patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:294\u0060 calls \u0060zero\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1128\u0060 does not \u2014 after which the two agree again for 5 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1973725c70d1a30083496d85c55011a7c58c8a7bd6920c8b1bf91506c3e83c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 5): crates/ruvllm_sparse_attention/src/attention.rs:190-213 | crates/ruvllm_sparse_attention/src/attention.rs:286-309 | crates/ruvllm_sparse_attention/src/attention.rs:448-471 | crates/ruvllm_sparse_attention/src/attention.rs:1362-1385 | crates/ruvllm_sparse_attention/src/attention.rs:1458-1481 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:190\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"587d8eb57c39f430de9023d11355ea470683b481e0ef53dd347ac4dbc22e272b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): crates/ruvector-graph/src/cypher/parser.rs:330-353 | crates/ruvector-graph/src/cypher/parser.rs:432-455 | crates/rvlite/src/cypher/parser.rs:319-342 | crates/rvlite/src/cypher/parser.rs:422-445 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:330\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe34658534bd30d6e11677b3769d616821f52a823da1e714ecec9661c13ccae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): crates/ruvllm/src/backends/gemma2.rs:613-636 | crates/ruvllm/src/backends/phi3.rs:491-514 | crates/ruvllm/src/models/ruvltra.rs:789-812 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:613\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35dd69cb83bac69d67de784532200a4d36dd65a74a852c577e9eb1f21977c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): crates/mcp-brain/src/tools.rs:364-387 | crates/mcp-brain/src/tools.rs:693-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93fa9e2345a1111534f56189c6b42eaff5d55cf75c5ec17b5c63954cc5eb7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:137-160 | crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:187-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"06293c81626c2f801613d770db493c8812f194d2543b890b6fc22f9b34a89088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:864-896 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:920-952 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf9ee41550305ac5ecc50d35a1bc69a6e2a0712ae3e8670582a6171a675de8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:154-177 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:225-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"359c61085849692815e255ca0cce95ef928dc0e60fff7e5ef7d3bcfe245ffa6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/ruvector-postgres/src/quantization/scalar.rs:15-38 | crates/ruvector-postgres/src/types/scalarvec.rs:59-81 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/scalar.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060vector\u0060 to \u0060\u0026[f32]) -\u003E (Vec\u003Ci8\u003E\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/scalar.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c1754948333e9376279038cec7a72f8d0f9f025aedb411d0a7c8c286a66112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruvllm/src/autodetect.rs:716-739 | crates/ruvllm/src/backends/coreml_backend.rs:140-163 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/autodetect.rs:716\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f48d96960b9e6c5c6e36f1d21776c3a16a414fe641fea3ded3317158195f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): crates/ruvllm/src/backends/coreml_backend.rs:411-434 | crates/ruvllm/src/backends/coreml_backend.rs:492-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2d0eebadbc207cc3d869ec30083fe0f35264ca7fa2ccd380d2fb399f5ea0d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruvllm/src/hub/download.rs:58-81 | crates/ruvllm/src/hub/upload.rs:17-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from 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":"crates/ruvllm/src/hub/download.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ede0457a79882f412fab8f5a82a5ce38da2ac705205e83f07969f2173295b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:571-594 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:757-780 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:571\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"e048f48ea2ea2e4fe1b7ce879980563e1538ebbd725b7d1b0a92a903636fc7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1547-1570 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1664-1687 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1547\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7dbb20fbf8f4aa759d6113d5f6c32ccad0d63e0100c475d232b80bc0a80757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:361-384 | patches/candle-core-0.9.2/src/display.rs:372-395 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b1e6ab530829811e788de2650c07019273ad6e8b7ca8287e288e6f5d39e473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:811-847 | patches/candle-core-0.9.2/src/tensor.rs:879-915 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"353916bb1c38a61dfaa065febf5bafbe8c74be4b4c8b37d61d5ef330179c2a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1823-1846 | patches/candle-core-0.9.2/src/tensor.rs:2147-2170 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa0d9010dcf14834141906115bf9a6e14729d79dbd8c21fa12580026224f361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/cuda.rs:138-161 | patches/candle-core-0.9.2/src/quantized/cuda.rs:198-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs:138\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/cuda.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1692fccc1a4d378a483dcfaaf00f4f5b2c1bc762fac401bd08a603e7c64e3d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:1304-1340 | scripts/patches/hnsw_rs/src/hnswio.rs:1304-1340 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab89dd0669cf7282a4c1d92ceb29b1f1c2bd987c124f73be9854a28f9604c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:263-281 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:303-321 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:212-234 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:263\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"396fba44b79aa73ee7a7458c46c1c7e985243ee2a7ac7257c38500b486a6c5a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): crates/ruvector-postgres/src/graph/sparql/executor.rs:438-460 | crates/ruvector-postgres/src/graph/sparql/executor.rs:490-512 | crates/rvlite/src/sparql/executor.rs:382-404 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:438\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6bee79ef21bc7a09f20dfac88017a5c010238828be4f037d1c81972c239454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): crates/ruvllm-wasm/src/workers/pool.rs:774-795 | crates/ruvllm-wasm/src/workers/pool.rs:944-966 | crates/ruvllm-wasm/src/workers/pool.rs:1056-1077 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm-wasm/src/workers/pool.rs:774\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/pool.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dccf96a9e1951fdcba154b08fd5e6f592f4d8d086ea4d0623efb0627e220f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/k_quants.rs:808-830 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:859-881 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:917-939 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:808\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cea9cc020a70f7f68e3513e1c204d311c98a744a954e7c0c68ea7c7283d4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/mcp-brain-server/src/notify.rs:292-314 | crates/mcp-brain-server/src/notify.rs:349-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/notify.rs:292\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"852a0ff2d2688d4f754f9d2017b7958d9ccd19d21d686951f45e8aad63824e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201323 lines \u00D7 2): crates/prime-radiant/src/simd/energy.rs:182-192 | crates/prime-radiant/src/simd/vectors.rs:310-332 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/energy.rs:182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bbdda3ae93d7450ba4af86270d75e11a5f08b72f5bdaa4b4803369ce770a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:161-183 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:264-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58202efa239715a4c08f3171995b14582522df29c8487e398a1a230ced2c768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruvector-cnn/src/backbone/mobilenet.rs:204-226 | crates/ruvector-cnn/src/backbone/mobilenet.rs:316-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/mobilenet.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d003fd23bad09a6a9279ec0b197507fe288bb8b1046630ee471fee6147677c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/ruvector-coherence-hnsw/src/search.rs:238-260 | crates/ruvector-coherence-hnsw/src/search.rs:348-368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-coherence-hnsw/src/search.rs:238\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/search.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c11994a53082c7e3e0eec217fe8a052032df924d32dcd82658c5295bfe3ac73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:141-167 | crates/ruvector-py/src/graph/cypher_eval.rs:128-154 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/cypher_exec.rs:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d51730e446c676641a704ded0a187dc7b92389205d91eed574dc6aceccda417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:391-415 | crates/ruvector-py/src/graph/cypher_exec.rs:105-129 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3590340d0d74edf504619a401f9921a73421b4d4827552868d5e8f8b49b268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/ruvector-graph-transformer/src/temporal.rs:862-884 | crates/ruvector-graph-transformer/src/temporal.rs:901-922 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"8073c8c83e29cf54fa6be6e6a4486305964dbd871b26bf482feae4742a7be361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:171-193 | crates/ruvector-kge-wasm/src/model.rs:171-193 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d698f6f1b4b249cdf24bc6856334ee13f4efd575dbf2d2c30bfee4766862d7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:575-597 | crates/rvlite/src/sparql/parser.rs:613-635 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"584f61ecb8670eaf1d0975d2b1140a01aa5141c88e4fe3e4b042c9570d2a1c0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruvector-postgres/src/index/ivfflat_am.rs:754-776 | crates/ruvector-postgres/src/index/ivfflat_am.rs:804-826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs:752\u0060 calls \u0060PageInit\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs:803\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"110bdaac8f400677de14a1b973ce240a3d84fe86f2658ac9d87f2dd7c8ada9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruvix/crates/vecgraph/src/simd_distance.rs:225-247 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:373-395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:225\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cd3e5379bae5df0e6b653d09f5813448529fa66994b1082135c518f12295ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): crates/ruvllm/src/memory_pool.rs:206-228 | crates/ruvllm/src/memory_pool.rs:255-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/memory_pool.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/memory_pool.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"39860a63f5cb2e8a2e84ed760d9ba4c3c57387e49de9a2ab2f915c624f74c262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201323 lines \u00D7 4): crates/ruvllm/src/quantize/pi_quant.rs:844-866 | crates/ruvllm/src/quantize/pi_quant.rs:1031-1033 | crates/ruvllm/src/quantize/pi_quant.rs:1041-1054 | crates/ruvllm/src/quantize/pi_quant.rs:1235-1237 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/quantize/pi_quant.rs:1055\u0060 calls \u0060add\u0060 and \u0060crates/ruvllm/src/quantize/pi_quant.rs:1238\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdd5114b2f240989c84f13348e2919e8b89c0f55624836751fdbbae945e922b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruvllm/src/quantize/pi_quant_simd.rs:549-571 | crates/ruvllm/src/quantize/pi_quant_simd.rs:801-823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/pi_quant_simd.rs:549\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant_simd.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"32505cc707a4bdbca4188e013ec2593ce0c3630ff95ba02e910e8d8d23ab3a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/rvm/crates/rvm-witness/src/log.rs:219-241 | crates/rvm/crates/rvm-witness/src/v2.rs:529-550 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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 \u0060buf\u0060 to \u0060\u0026mut [WitnessRecord]\u0060 in one and \u0060\u0026mut [WitnessRecordV2]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/log.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bc47bd102901eb06b70177cd3401eceb0d4d5d07a48d6d40610b495bf37be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1458-1480 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1950-1972 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d5ba59560395a0967f556c6b89eeb94e2edfaa531a701aee1372fec150f203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:444-466 | patches/candle-core-0.9.2/src/display.rs:455-477 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/display.rs:444\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a5d4f99c2f00a5e8113ac49b4ca8cbfa43eb55dd683af66bc54026ad06f5d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/layout.rs:131-153 | patches/candle-core-0.9.2/src/layout.rs:131-153 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/layout.rs\u0060 and \u0060patches/candle-core-0.9.2/src/layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 182 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/layout.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cc8e096e5a837fdecb12e487239256b2b1ae3309a0e05980eeca53c9593001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): patches/candle-core-0.8.4/src/layout.rs:156-188 | patches/candle-core-0.9.2/src/layout.rs:156-188 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/layout.rs\u0060 and \u0060patches/candle-core-0.9.2/src/layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 182 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/layout.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67e57a50a644656c677276d90d55b815262be9fac2f7d7c0783af16cb8e74c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1187-1209 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1389-1411 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1187\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"37792ac3d1fd08d9d1bb60700b1a15751e0d1464ba387167eb88fb9eee5f56f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1972-1994 | patches/candle-core-0.9.2/src/tensor.rs:2296-2318 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b98a27a6db45176e82b79b5a14c3999d33964bbd577877774dcee40bb219d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 5): crates/ruvllm/src/bitnet/backend.rs:3502-3521 | crates/ruvllm/src/gguf/quantization.rs:1039-1060 | crates/ruvllm/src/kernels/quantized.rs:923-944 | crates/ruvllm/src/quantize/quip.rs:727-745 | crates/ruvllm/src/quantize/ruvltra_quant.rs:897-917 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/quantize/quip.rs\u0060 and \u0060crates/ruvllm/src/quantize/ruvltra_quant.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:3502\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":3502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66b1f0dfc4513f3cdae5744fbcb4b286c5778faf10fbbeef93a4c27acc316bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 4): patches/hnsw_rs/src/hnswio.rs:1132-1151 | patches/hnsw_rs/src/hnswio.rs:1183-1204 | scripts/patches/hnsw_rs/src/hnswio.rs:1132-1151 | scripts/patches/hnsw_rs/src/hnswio.rs:1183-1204 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnswio.rs:1183\u0060 it does not close everything it opens, so those exact 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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39d49f3e4b204d7b371e90cc9d35717bb3b37d65d2d6085774ed2f31f66df85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/mcp-brain-server/src/gcs.rs:83-104 | crates/mcp-brain-server/src/store.rs:180-201 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"094e571bf4ac1e319930ed64636808050de31ddb653f34b83f5f45e0dc26b80a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/prime-radiant/src/simd/matrix.rs:241-261 | crates/prime-radiant/src/simd/vectors.rs:248-269 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/matrix.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/matrix.rs:241\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/matrix.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd1f6264b51446e30c02f42e36b99358e6b948c1530a5e6b6a95e5a64da232f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): crates/ruvector-cnn/src/kernels/int8_avx2.rs:358-379 | crates/ruvector-cnn/src/kernels/int8_neon.rs:341-360 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:358\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed3a828ce954f3ac1047c91766b310a6656aec17f56798407a9baf818417cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): crates/ruvector-cnn/src/kernels/int8_neon.rs:158-179 | crates/ruvector-cnn/src/kernels/int8_neon.rs:372-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_neon.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4699129f7e6c14f973109b06fdaac17139e6e2519192565f011800a15070d98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:62-83 | crates/ruvector-core/src/simd_intrinsics.rs:773-793 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:62\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"257d9aac18cfb1975a5f95ef7fdbbebfff9e19e78029d53c494cb18f376b1710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): crates/ruvector-core/src/storage.rs:134-155 | crates/ruvector-graph/src/storage.rs:147-163 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/storage.rs\u0060 and \u0060crates/ruvector-graph/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/storage.rs:134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"504e61fbd3e4a44f55d1446d39d0f12dbd72cd77716d059af53476ff46b44987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): crates/ruvector-core/src/storage.rs:442-461 | crates/ruvector-graph/src/storage.rs:522-543 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/storage.rs\u0060 and \u0060crates/ruvector-graph/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0f7e96d9e0b6a3de476c1db16e75547ced01d61befbf44ecfd0a45e3afe363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:134-155 | crates/ruvector-hailo-cluster/src/bin/embed.rs:182-203 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:134\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0e2b4af57d8d5b4850a29fbb9f2a2b58410ac75cac1befa72108af0efcde93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvector-kge-ffi/src/pipeline.rs:259-280 | crates/ruvector-kge-wasm/src/pipeline.rs:259-280 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/pipeline.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 216 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/pipeline.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"520ca0c913c4f7c938f16ada78d3b098b4a333f04a3c5ae7d5310f2d6bf5b619"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:421-442 | crates/ruvector-profiler/src/config_hash.rs:22-38 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-profiler/src/config_hash.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c6dbdefeb816f9eb40be9989b8c97d62f1d61ea9b50b8ea33545cf0cd8aab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/ruvector-mincut/src/jtree/coordinator.rs:417-438 | crates/ruvector-mincut/src/jtree/coordinator.rs:449-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/coordinator.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6171eebef7c5cf28fdead22b3557c98a22cb002913eab9dd187307633f38c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): crates/ruvector-mincut/src/wrapper/mod.rs:426-447 | crates/ruvector-mincut/src/wrapper/mod.rs:710-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":"crates/ruvector-mincut/src/wrapper/mod.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe94ab680db84679f5159f73ce2f78a6ca81d64497f3e4bbb9e54c2551ed132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvector-namespace-merge/src/router.rs:95-116 | crates/ruvector-namespace-merge/src/router.rs:260-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-namespace-merge/src/router.rs:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-namespace-merge/src/router.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"804cccba860d35f7e458b407eff0983c12d6dbb113a4b2daddad6448360b938d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/wta.rs:117-138 | crates/ruvector-nervous-system/src/compete/wta.rs:134-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/wta.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acbd891e88f6a16d5c531ce9e73987f0da150f606133c664f886c72e5b10ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:155-176 | crates/rvlite/src/sparql/executor.rs:130-151 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4d21d180a8cb31aeb65d9e3def38734f2e6085c42e47f1aa177c00f9ff487b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvllm/src/quality/coherence.rs:717-738 | crates/ruvllm/src/quality/scoring_engine.rs:827-848 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/quality/coherence.rs\u0060 and \u0060crates/ruvllm/src/quality/scoring_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d21176ab7d97b7b7d1bc4ecad56861b8eddfaf9393f1d7aaaec3436243c762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/rvAgent/rvagent-cli/src/tui.rs:136-157 | crates/rvAgent/rvagent-cli/src/tui.rs:174-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/tui.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"112aa997fba2daf9fba78fc5d09e2990353b81b5bc185aef10e0adaa8322e36a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/rvf/rvf-runtime/src/witness.rs:347-368 | crates/rvf/rvf-runtime/src/witness.rs:389-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/witness.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"788c659e7625a164b79669fd3ca8da38691a8a804446fea10e342563c1dff5ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (102 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:172-273 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:221-322 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fdd57bec977090df63c4e5b5d436a56cd04df2dccbc0ca47ab678470253430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:40-61 | patches/candle-core-0.9.2/src/npy.rs:40-61 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9e378b0806041adfee3631d5a68382f27020f9e0f5423189243119ecce576b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/neon.rs:456-471 | patches/candle-core-0.8.4/src/quantized/neon.rs:482-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4770928f0954aa98238edff297e6fddcaec6ea9a4fb7a759491ce73bdcbe0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/sort.rs:173-196 | patches/candle-core-0.9.2/src/sort.rs:219-242 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/sort.rs\u0060 and \u0060patches/candle-core-0.9.2/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/sort.rs:173\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":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"585882662589c400d06eaca354ae5345ec02bc84c3508db30206a31856e632f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:685-706 | patches/candle-core-0.9.2/src/storage.rs:746-767 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf336e664fd6742619bc39fdfdac9ba1c0fbb0b38fe231ce4905cc14125b6e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:715-737 | patches/candle-core-0.9.2/src/storage.rs:776-798 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdef023e796308a7162d020b94e2164e67df60cf94d059eff70460347168642c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1632-1653 | patches/candle-core-0.9.2/src/tensor.rs:1956-1977 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e15f30045014ed0e1556e08b1ca1103c44b11e513aea60c83e24b2b39931911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2063-2084 | patches/candle-core-0.9.2/src/tensor.rs:2386-2407 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:2063\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdbb695fd2d1a9bf733a46a227bc4aeafda01dc0b5df0f1e2ac387f10984600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:1149-1178 | scripts/patches/hnsw_rs/src/hnswio.rs:1149-1178 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnswio.rs:1149\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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c819e7e11b157ace6db7a63470db20865da10958c3458200a2c0e70e08c5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1331-1364 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1422-1455 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1448-1481 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1539-1572 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1331\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc470b5e4096c70023c8b490e2528dc4262d3007f7f0fee8a01cdc75db3480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/ruvector-bench/src/bin/comparison_benchmark.rs:98-118 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:145-165 | crates/ruvector-bench/src/bin/latency_benchmark.rs:113-133 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0820d8ecc81e08b96d2a15f4f2aebc6a5ea86985963a115f943423b95c85577d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/mcp-brain/src/server.rs:31-51 | crates/mcp-gate/src/server.rs:101-121 \u2014 before extracting anything, compare \u0060crates/mcp-brain/src/server.rs\u0060 and \u0060crates/mcp-gate/src/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9711e007d59eb22724389d63c8121b06f2ef3545483a41b9afbb1a6135d941a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/prime-radiant/src/coherence/energy.rs:458-478 | crates/prime-radiant/src/simd/vectors.rs:444-464 \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":"crates/prime-radiant/src/coherence/energy.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b58f91b4ebafc70addf4c5210a5b282262d790fc7b364613f6396d2ffc09f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/prime-radiant/src/coherence/engine.rs:655-674 | crates/prime-radiant/src/coherence/engine.rs:706-726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/coherence/engine.rs:655\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab3f784b0039a4b93b30ff668637b7525ae564c2f8c329771707f7799e35988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-attention/src/sheaf/attention.rs:336-356 | crates/ruvector-attention/src/sheaf/attention.rs:458-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/sheaf/attention.rs:336\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9934ba2b645fe3fc3154620509b66e25f59b66204766507d39409b826f248d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-cnn/src/backbone/layer.rs:171-191 | crates/ruvector-cnn/src/backbone/layer.rs:195-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/layer.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"762338367e497b979100a9c2adf231f9c81f06547747c52b21d9020ed981cc00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-cnn/src/layers/conv.rs:288-308 | crates/ruvector-cnn/src/layers/conv.rs:534-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a818b5c1f784b71ce57b9342c1b0065ed5c2da7a48d6b9f3f81b80090e88e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201321 lines \u00D7 5): crates/ruvector-cnn/src/layers/conv.rs:318-320 | crates/ruvector-cnn/src/layers/conv.rs:564-567 | crates/ruvector-cnn/src/layers/pooling.rs:50-53 | crates/ruvector-cnn/src/layers/pooling.rs:122-142 | crates/ruvector-cnn/src/layers/pooling.rs:224-244 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/conv.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/pooling.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/conv.rs:318\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-cnn/src/layers/pooling.rs:142\u0060 calls \u0060data\u0060 and \u0060crates/ruvector-cnn/src/layers/conv.rs:320\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ae19b28d6e84ded0f7dcba8dc8fcde19b922cd30d510b5f080c8dae6b8daa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/ruvector-core/src/quantization.rs:549-567 | crates/ruvector-core/src/simd_intrinsics.rs:1333-1353 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/quantization.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/quantization.rs:549\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060\u0026[u8]\u0060 in one and \u0060\u0026[i8]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4c82ba7e32b499aa8d89df9b5f505dc67bf694b0a2e1610a04e531090a0936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201329 lines \u00D7 3): crates/ruvector-graph-transformer-node/src/transformer.rs:676-704 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:720-748 | crates/ruvector-postgres/src/graph/sparql/functions.rs:495-496 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"901e71d2a93248bb80835f876869848492486518a4f48ab10ce51670e751674a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:162-182 | crates/rvlite/src/cypher/parser.rs:158-178 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0150ddb00a2564fbf7c2045bf9d437ed84f2ec26d03ea7ccef31ea611ec78227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/ruvector-math/src/spectral/mod.rs:78-98 | crates/ruvector-math/src/spectral/mod.rs:127-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/spectral/mod.rs:78\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/mod.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4aaf7edc69086b7f296554d7743211678585bed03be0198a6319a28f2f7627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-postgres/src/attention/operators.rs:481-501 | crates/ruvector-postgres/src/attention/operators.rs:816-836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/attention/operators.rs:481\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6e21cb2684900392a25470bdc4a32cc515d7a025901ab17708034620acfaaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201321 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1511-1524 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:260-280 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c497aa5755c70bd3c5ec964c87af8432b8eea099cebd22201ab6cbe7233fa265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1995-2015 | crates/rvlite/src/sparql/parser.rs:2034-2054 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9420e66b73c0a4a50ddb1aa750410fde4adcbbf3243856150f2054e297f18d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 2): crates/ruvector-recall-bounded/src/lib.rs:304-320 | crates/ruvector-recall-bounded/src/lib.rs:436-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-recall-bounded/src/lib.rs:304\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0606f4debc0b89333608be320b1b1e1ff5c937c562e10b762718800fb167d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvector-rulake/src/bin/rulake-demo.rs:131-152 | crates/ruvector-rulake/src/bin/rulake-demo.rs:190-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/bin/rulake-demo.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0411e60defcc23887fed5cf44ee88a0d372c1dbda68384a1ae5e72123226c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-streaming-qng/src/static_pq.rs:55-75 | crates/ruvector-streaming-qng/src/stream_pq.rs:124-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/static_pq.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4322ce10497f839d08b125f84cb270f5551347f31ba15b39b9ce4c59dd6ac902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/ruvector-temporal-tensor/src/ffi.rs:49-69 | crates/ruvector-temporal-tensor/src/ffi.rs:90-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/ffi.rs:49\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/ffi.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32cdc4b64fa419081c619a3bc96c7a19d2c444edd9ac01bf70674b3db1353d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvllm/src/backends/coreml_backend.rs:1286-1306 | crates/ruvllm/src/backends/coreml_backend.rs:1421-1441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/coreml_backend.rs:1286\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e0131f5feedd2e9fe116bd17823fa9fb6686c3c7109572931731dc8ff9d22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvllm/src/memory_pool.rs:879-899 | crates/ruvllm/src/memory_pool.rs:1092-1112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/memory_pool.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa53b0ef3e204ff119d181dc6e72f3ceb62e85b7ea8410be0f90e885b9edcf73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/filesystem.rs:499-519 | crates/rvAgent/rvagent-backends/src/filesystem.rs:556-576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb661551200b90cecbd1461c5ce4b88a7af2d04cad656a55d7c237466a441c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:656-676 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:852-872 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:656\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs:849\u0060 calls \u0060max_value\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:655\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f11a0a53733395b6b98511f1e19f07a3a54bc63c175298ed33bc0fb5079e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1346-1366 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1769-1789 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b74424c27b9ef0044e9be232f3784a925cf9ef9c9b8692a175090e4ecb81594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:699-771 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:735-807 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:735\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e0e0f5e4d417d55c4e976e941306d1ffac54cad30f79d35d818d86463663a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:985-1019 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1035-1069 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:985\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"158730f0a59857f0f249bbc870b47335e0b126e2a9d0d6926bda6611e48552c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1047-1067 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1098-1118 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:1119\u0060 calls \u0060drop\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1068\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c73f306accbec0cc1b49b4e26370900f0ef7aaf3e78c6c8c0a3b09b0ad75d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:369-391 | patches/candle-core-0.9.2/src/storage.rs:378-400 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f0f08c830872d13e0754e127c8e8f9f77f7e39f00b4d1cf17f166ab74cd950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:400-422 | patches/candle-core-0.9.2/src/storage.rs:409-431 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d1a6ad3bdeb32c00856f6c92665f69add67af1fa16ab2bb385991516be8334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:431-453 | patches/candle-core-0.9.2/src/storage.rs:440-462 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaff89ab339cf9d40c6071deed9c964e10c21520b03318139e7cb73638ff5767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:462-484 | patches/candle-core-0.9.2/src/storage.rs:471-493 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e55e18851caa34e3691c63761182637813c38f627591431e3075756b1fdc92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/strided_index.rs:39-59 | patches/candle-core-0.9.2/src/strided_index.rs:42-62 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/strided_index.rs\u0060 and \u0060patches/candle-core-0.9.2/src/strided_index.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/strided_index.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cf3ed7c614b92b21b17d4f04ae367a32a60872126dce576fae8cfd01ac4311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:761-782 | patches/candle-core-0.9.2/src/tensor.rs:829-850 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55f96e01133de9f53389fbb9a03397981ad71734131fd6bd2e7178ad0c7964c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1238-1280 | patches/candle-core-0.9.2/src/tensor.rs:1496-1538 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8482339d6ae5cf05fc4fdaba5f3061b4ca95f3031e96b7bdc5099bfe30668dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/variable.rs:131-151 | patches/candle-core-0.9.2/src/variable.rs:131-151 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/variable.rs\u0060 and \u0060patches/candle-core-0.9.2/src/variable.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/variable.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b83f054851b1565369931a6889258ccee4047de4043d346270e89b1ed783b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u201321 lines \u00D7 12): patches/hnsw_rs/src/libext.rs:292-312 | patches/hnsw_rs/src/libext.rs:318-318 | patches/hnsw_rs/src/libext.rs:324-324 | patches/hnsw_rs/src/libext.rs:330-330 | patches/hnsw_rs/src/libext.rs:336-336 | patches/hnsw_rs/src/libext.rs:342-342 | scripts/patches/hnsw_rs/src/libext.rs:292-312 | scripts/patches/hnsw_rs/src/libext.rs:318-318 | scripts/patches/hnsw_rs/src/libext.rs:324-324 | scripts/patches/hnsw_rs/src/libext.rs:330-330 | scripts/patches/hnsw_rs/src/libext.rs:336-336 | scripts/patches/hnsw_rs/src/libext.rs:342-342 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/libext.rs:292\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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88119c192cb48a96d0230437f3038cdb553ed4e6e0eea9eb709629f124afa21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 8): crates/ruvector-postgres/src/attention/operators.rs:99-113 | crates/ruvector-postgres/src/attention/operators.rs:194-208 | crates/ruvector-postgres/src/attention/operators.rs:347-361 | crates/ruvector-postgres/src/attention/operators.rs:433-447 | crates/ruvector-postgres/src/attention/operators.rs:520-539 | crates/ruvector-postgres/src/attention/operators.rs:572-586 | crates/ruvector-postgres/src/attention/operators.rs:657-671 | crates/ruvector-postgres/src/attention/operators.rs:768-782 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/attention/operators.rs:99\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec9f616cdabec6844b692d38e8b34a74357f3c6bb574d0216c853a86840604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5): crates/sona/src/export/safetensors.rs:48-67 | crates/sona/src/export/safetensors.rs:79-98 | crates/sona/src/export/safetensors.rs:107-126 | crates/sona/src/export/safetensors.rs:135-154 | crates/sona/src/export/safetensors.rs:163-182 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sona/src/export/safetensors.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, \u0060crates/sona/src/export/safetensors.rs:71\u0060 calls \u0060iter\u0060, \u0060enumerate\u0060 and \u0060crates/sona/src/export/safetensors.rs:101\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/export/safetensors.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"20005b2b028f9bf05a78e55025b7c42ffdcdb3711b8a02c36b35c66fe96452af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 4): crates/ruvector-entropy-ann/src/search.rs:117-136 | crates/ruvector-entropy-ann/src/search.rs:258-276 | crates/ruvector-entropy-ann/src/search.rs:374-391 | crates/ruvector-entropy-ann/src/search.rs:423-440 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4043c4772b2ca9de58ac20400e53f9740af629763dd91c857bee48a3c9ab67d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): crates/rvf/rvf-runtime/src/store.rs:2415-2434 | crates/rvf/rvf-runtime/src/store.rs:2536-2555 | crates/rvf/rvf-runtime/src/store.rs:2642-2661 | crates/rvf/rvf-runtime/src/store.rs:2750-2769 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:2415\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcd7443e16524ee32489376c7a00851f07bc19888de723aab2aba37e2092fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/ruvector-attention-node/src/async_ops.rs:164-183 | crates/ruvector-attention-node/src/async_ops.rs:219-238 | crates/ruvector-attention-node/src/async_ops.rs:331-350 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-node/src/async_ops.rs:164\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/async_ops.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83a536f098a71c866dca9e4b30286edf333dc5a47857b20ec0bbfbeb0d19a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201320 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:203-222 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:263-275 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:177-189 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3858ee54aeb9dbd95a953d68d1379703234c35d72b274b69160ac29510fa6c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/ruvllm/src/backends/gemma2.rs:90-109 | crates/ruvllm/src/backends/gemma2.rs:113-132 | crates/ruvllm/src/backends/gemma2.rs:136-155 \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":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1f1cb57efe443394b15de9add848e509055d614ca0926da0bf494e35855a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-attention/src/sheaf/attention.rs:308-327 | crates/ruvector-attention/src/sheaf/attention.rs:405-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"892fbdcdb6581c2f28cff6228c2457259347838effe19daf94e4b08051901b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-cluster-rag/src/search.rs:76-95 | crates/ruvector-cluster-rag/src/search.rs:152-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 \u0060crates/ruvector-cluster-rag/src/search.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/search.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"989ac9046eba1b6903e5839c0076587064a0af81dc5d75de57a90cc498de4ba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-consciousness/src/chebyshev_phi.rs:101-120 | crates/ruvector-consciousness/src/sparse_accel.rs:221-240 \u2014 before extracting anything, compare \u0060crates/ruvector-consciousness/src/chebyshev_phi.rs\u0060 and \u0060crates/ruvector-consciousness/src/sparse_accel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/chebyshev_phi.rs:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/chebyshev_phi.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4a3bb7375ef81298f174d7c37ff8dd25944b1b05203c0935f72ec92205ed51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-core/src/advanced_features/matryoshka.rs:355-374 | crates/ruvector-core/src/advanced_features/matryoshka.rs:387-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/matryoshka.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d310fcd11a4aaf147aab831dd50d0c0f9eb7212197e821e827d7cae7293afc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:561-580 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:598-617 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb158118562daf28d056490e73b63661cac8992907ff30ec0f93d2ec26690ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:539-558 | crates/rvlite/src/cypher/parser.rs:529-548 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c24ca9aa8227ced76f8944bd505359d8def7434edd3c2c6641ca36ee740c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:567-586 | crates/rvlite/src/cypher/parser.rs:557-576 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"c166f1706b8bedabaad2314eff974835ad8ae8779b5fd84c930f86af63e805cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:275-294 | crates/ruvector-mincut/src/canonical/tree_packing/mod.rs:234-253 \u2014 \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-mincut/src/canonical/tree_packing/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:275\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c0fd7b706ba7d3913dbcc2188cd1c631c7de880fe0d3a7f6bbf432240231c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/btsp.rs:63-81 | crates/ruvector-nervous-system/src/plasticity/btsp.rs:128-147 \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":"crates/ruvector-nervous-system-wasm/src/btsp.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41c4dc1fc04d435a08efa4431c7e7e52e03b1af4a8a3b5344f76822c9b0b21f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-postgres/src/gnn/operators.rs:36-55 | crates/ruvector-postgres/src/gnn/operators.rs:165-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 \u0060crates/ruvector-postgres/src/gnn/operators.rs:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gnn/operators.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f320967f8ead1e8ded64319b53a97506f6f4dc3e730106c5415e8eb8933d2b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1258-1277 | crates/rvlite/src/sparql/executor.rs:624-643 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeeeac6947380debf975585f590659b04c24f821de2ac9df0372334f659fe320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1301-1320 | crates/rvlite/src/sparql/executor.rs:645-664 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc4286569a5ed3ccd689a2562518e0b2a2c1e4e799069b1abc0fccd6b497878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1561-1580 | crates/rvlite/src/sparql/executor.rs:838-857 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026mut SparqlContext\u0060 in one and \u0060\u0026SparqlContext\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"beac8e4cb8dfed1a205d8087fdf4d1f468c0ca776f937bde9dcbae2066e1c9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1973-1992 | crates/rvlite/src/sparql/parser.rs:2012-2031 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98abbed9664f379ad88954a65ab59b3fa78cf94ea1de6b599c7d59619d1f47b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-postgres/src/hybrid/fusion.rs:131-150 | crates/ruvector-postgres/src/hybrid/fusion.rs:245-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/hybrid/fusion.rs:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/fusion.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b34cd47df4e8f10a68b18d06a2728033205ebf373bfabe046509469cfc1d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/ruvix/crates/net/src/icmp.rs:250-267 | crates/ruvix/crates/net/src/ipv4.rs:397-416 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/icmp.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c10061923c5095f05ec269cad87492f3ba6588383956f6aeb8421baadc38f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvllm/src/kernels/accelerate.rs:296-315 | crates/ruvllm/src/kernels/accelerate.rs:357-376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/accelerate.rs:296\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/accelerate.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba95d0396c62bf04894c03aea5afd1065078b4e2f9e5b595ca96964dcac4b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/ruvllm/src/quantize/pi_quant.rs:970-989 | crates/ruvllm/src/quantize/pi_quant.rs:1071-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/pi_quant.rs:970\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4d6bed8f521ba19d972a3ea338b857329ca27c4416ee1a03a8bccd7e0dd723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/rvlite/src/sql/executor.rs:326-343 | crates/rvlite/src/sql/executor.rs:387-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvlite/src/sql/executor.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sql/executor.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfc804f8bf93b091a0f49a30e64877fccfd3ff5c3b6ffc14ded5bfac3c2f8fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1985-2004 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2573-2592 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60b91276939ceabd6ed491cf2d54c7281526b046b9d868c0565412680b7abf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:2040-2059 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2632-2651 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ef511ecd25e0c41e55d80d0774a114e65129fb83b5407a825e1d8833cbcae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1131-1165 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1184-1218 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1131\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f2730119fca3bb9b178a4a56eec91e0cbf09a0574da9f2818d38725cbdaa13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1423-1442 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1591-1610 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1423\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"948430478009222398ace2a4c55453360d8c0004c3f82bd597ca77454a369bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:280-300 | patches/candle-core-0.9.2/src/npy.rs:307-327 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56fbe7d0f9ff8a4f74125a8041acbd950edc4b2233ce6ccb767f0a20b3cbb34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201320 lines \u00D7 8): patches/candle-core-0.8.4/src/quantized/avx.rs:465-484 | patches/candle-core-0.8.4/src/quantized/avx.rs:551-570 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1212-1213 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1409-1410 | patches/candle-core-0.8.4/src/quantized/neon.rs:261-264 | patches/candle-core-0.8.4/src/quantized/simd128.rs:223-224 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1414-1415 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1675-1676 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/simd128.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c32e95f55804834c2d22e0098cc066b2fa0e51fc3b0762ec086c6665553df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:193-212 | patches/candle-core-0.9.2/src/quantized/cuda.rs:231-250 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d7960c1e8ec8bba260f285f3ff2bfdc5a17ea6f4e7f691b331b9598ad23f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/streaming.rs:95-114 | patches/candle-core-0.9.2/src/streaming.rs:95-114 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/streaming.rs\u0060 and \u0060patches/candle-core-0.9.2/src/streaming.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9318a53192aabeeb0d1eaf73cd249259a3b6d558e911514a6cb91b45b5dbb7cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:850-869 | patches/candle-core-0.9.2/src/tensor.rs:918-937 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdf8771a5d80e08de17427932af244a1848ebe82083140e2dde15f27e571f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/hnsw_rs/src/datamap.rs:279-298 | scripts/patches/hnsw_rs/src/datamap.rs:279-298 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/datamap.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/datamap.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 231 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d9e6188dd6647f80429b2e9e52535f0def7a4979644f46813cce8c8e50128e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:221-240 | scripts/patches/hnsw_rs/src/hnsw.rs:221-240 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec6a1ee448f3f0c1d1d02883819c95ddd737dbd90daf9b3ee3752a823ea5550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:540-559 | scripts/patches/hnsw_rs/src/hnsw.rs:533-552 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3463129c8999112832bd2a7ef9af5e5dc9c93d85c1e16fcb25867726f8730087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): crates/ruvllm/src/backends/phi3.rs:81-99 | crates/ruvllm/src/backends/phi3.rs:103-121 | crates/ruvllm/src/backends/phi3.rs:125-143 | crates/ruvllm/src/backends/phi3.rs:147-165 \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":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f7b642d6768967101bb956f577abf8de08fefeb3182a89124e3ad217aed684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1189-1207 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1231-1249 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1243-1261 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1286-1304 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1189\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e38adde8ed1c58a465cc975c40a142262f79d278d5ff40fe0f3d71847d88d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2053-2071 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:2089-2107 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2053-2071 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2090-2108 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:2053\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab7168326e61d68ed7674fe855bac33e008821a3e1fc66d6dc9a368a54f84c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): patches/hnsw_rs/src/hnswio.rs:451-469 | patches/hnsw_rs/src/hnswio.rs:550-568 | scripts/patches/hnsw_rs/src/hnswio.rs:451-469 | scripts/patches/hnsw_rs/src/hnswio.rs:550-568 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5df588b321e5d2652fe53e2e823c6b574dae7602f550aa92dc95c15363283d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): crates/ruvector-cnn/src/layers/quantized_conv2d.rs:97-115 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:88-105 | crates/ruvector-cnn/src/layers/quantized_linear.rs:72-89 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/quantized_depthwise.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs:96\u0060 calls \u0060bias\u0060 and \u0060crates/ruvector-cnn/src/layers/quantized_depthwise.rs:87\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7e43280f5f3817626825691c3fbb7b89d37b4c4ba5bd47308da8779fff8a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201319 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:225-243 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:277-290 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:191-202 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11bdb08213cb427c857029465758067b74c0e1d3dc1764ecdb7b093f36d541b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/ruvector-postgres/src/graph/sparql/executor.rs:460-478 | crates/ruvector-postgres/src/graph/sparql/executor.rs:527-545 | crates/rvlite/src/sparql/executor.rs:404-422 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:460\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdf68465263c44bce036376d6bae16140218346e2a3089f1686f14dcd6dfcd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/mcp-brain-server/src/aggregate.rs:27-45 | crates/mcp-brain-server/src/aggregate.rs:149-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/aggregate.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9721a43dc745244f1f71b6005576a6fe4cbbd24c2e3d5e7f6cf86e2bcd1f7d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/mcp-brain-server/src/bin/ruvbrain_worker.rs:127-145 | crates/mcp-brain-server/src/routes.rs:4130-4147 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/bin/ruvbrain_worker.rs:127\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/ruvbrain_worker.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e56c872bdb4a87ef082e06467e245d059cd073699235b82ef82251cd4168a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/micro-hnsw-wasm/src/lib.rs:859-878 | crates/micro-hnsw-wasm/src/lib.rs:1327-1346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/micro-hnsw-wasm/src/lib.rs:859\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"392402a5bd175224de5c05ff8dbd77043d923e3ef7a520dc120d72a37a3be6c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/prime-radiant/src/mincut/config.rs:58-75 | crates/ruvector-mincut/src/subpolynomial/mod.rs:97-115 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/mincut/config.rs:58\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/config.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"043d47edc8dc321e262d75f7957ad0531554d1595ecae704700ba988cdfdf0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-collections/src/manager.rs:233-251 | crates/ruvector-collections/src/manager.rs:291-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-collections/src/manager.rs:233\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-collections/src/manager.rs:232\u0060 calls \u0060to_string\u0060 and \u0060crates/ruvector-collections/src/manager.rs:290\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-collections/src/manager.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5f7a8a506eec8542072f7c1daed8ba529fa92e74ca015c59c0884d68db4abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:1263-1281 | crates/ruvector-core/src/simd_intrinsics.rs:1312-1330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:1263\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:1333\u0060 calls \u0060vsubq_s16\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:1284\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08458e5c56e13bca5f3c4f09514f3194690491227f195cd3af5ff27889bce71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/ruvector-entropy-ann/src/search.rs:87-105 | crates/ruvector-entropy-ann/src/search.rs:221-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-entropy-ann/src/search.rs:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"511049d2fd1839191599a6156a6e81b0883254a71197e8178ab78a9bb8119215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:209-248 | crates/ruvector-py/src/graph/cypher_eval.rs:222-261 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/cypher_exec.rs:209\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8e32feaebc872273b4e7de59705ad85318c94cbbb8af6dfe90b03cb3e9bc4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:648-666 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:692-710 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2b872eb986275ccf78d7bc8b0701152a78cea8d42bc6163f5427b9b10c9e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:110-125 | crates/ruvector-hailo-cluster/src/bin/worker.rs:343-361 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-hailo-cluster/src/bin/worker.rs:342\u0060 calls \u0060peer_identity\u0060, \u0060into_inner\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:110\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/fakeworker.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f20937bfa563cb3590bbb8b4505df5ae2cc57898c63906413849a1a410b8853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:213-242 | crates/ruvector-kge-wasm/src/model.rs:213-242 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d2250512facbe41f43d0956cd6c4be59b80f33e9ce29ceba8b083990c0c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/ruvector-math/src/tropical/polynomial.rs:139-156 | crates/ruvector-math/src/tropical/polynomial.rs:164-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/tropical/polynomial.rs:139\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tropical/polynomial.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1228d21d1fc6ded57580e9fde0cfb88776f4795ffc7aff110b4b58eaf94c31db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/speculative.rs:294-312 | crates/ruvector-mincut-gated-transformer/src/speculative.rs:328-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/speculative.rs:294\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/speculative.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b89a88038383bd1995ae9033cc2501be0864a917d52496773fb4396185a5a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:350-368 | crates/rvlite/src/sparql/executor.rs:263-281 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c295f997618f40836854723ae064dc601e718409c791708fc9768d52aef28ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:52-70 | crates/rvlite/src/sparql/parser.rs:76-94 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefad585fe1b8406bd071182edf7b57b2b828719009f597dc0a841db6ae28922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:228-246 | crates/rvlite/src/sparql/parser.rs:255-273 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvlite/src/sparql/parser.rs:251\u0060 calls \u0060nested\u0060, \u0060parse_group_graph_pattern_unguarded\u0060 and \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:227\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daeab3ec5abc1641ed78032b44603fe5ac20e69456bd8f8dcab925b191a2a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:494-512 | crates/rvlite/src/sparql/parser.rs:521-539 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"5229baeeee67c1e3ea96762fbe3054b84dbe22b9d638992a6c889820b2b1e99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:547-563 | crates/rvlite/src/sparql/parser.rs:578-596 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:547\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b573d7ff0e7dfd9691e04b0020b58988af7c35d05e7dd7b5bb2e31f7565aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw_am.rs:949-967 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1155-1171 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw_am.rs:949\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"decfd9d702a62d019b9d768ce72834edf0e06c949d3c098c6758c83dcb5d49a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-postgres/src/index/ivfflat.rs:281-299 | crates/ruvector-postgres/src/index/ivfflat.rs:333-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3127b9e5819d7178c80ebf8b67ed0eb1bf5b73fe7d9341f6a1d93f89bc74c40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-solver/src/backward_push.rs:118-136 | crates/ruvector-solver/src/random_walk.rs:205-223 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/backward_push.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d864733202522bc9a47f996e3d744422547d49f920748156d5c755227cea5e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvector-solver/src/router.rs:815-833 | crates/ruvector-solver/src/router.rs:1044-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/router.rs:815\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"7464236c698390493f1e68df1fdaae1c36742289a947b99019d682fe62421290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/ruvector-sparsifier/src/audit.rs:72-90 | crates/ruvector-sparsifier/src/audit.rs:131-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparsifier/src/audit.rs:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparsifier/src/audit.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ef173085994efaa589091157be5b9d042cc1cd6605e50f52f5f9f3023f84d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): crates/ruvector-temporal-tensor/src/persistence.rs:136-154 | crates/ruvector-temporal-tensor/src/persistence.rs:156-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/persistence.rs:136\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/persistence.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a539c7076b71dfb02bbe41c473ec2bfe48756b13e5c87a3e037b29e344dd8b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): crates/ruvector-wasm/kernels/rmsnorm.rs:116-134 | crates/ruvector-wasm/kernels/rmsnorm.rs:204-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-wasm/kernels/rmsnorm.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rmsnorm.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdca029f12f3d246406cb161ea92b046aa147903d5af877025b32ad165c72ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvix/crates/cli/src/commands/dtb.rs:924-942 | crates/ruvix/crates/cli/src/commands/dtb.rs:1027-1045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:924\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4704760b4b48587644fb40f6f88ffe91596ae4c31998c51022d2ae578fd4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): crates/ruvllm/src/gguf/loader.rs:747-761 | crates/ruvllm/src/gguf/loader.rs:787-805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/gguf/loader.rs:747\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/loader.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cecd3c178c5daf052d71973889d2371c59b713eef56e3e7fc523c1b11c0d7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvllm/src/witness_log.rs:556-574 | crates/ruvllm/src/witness_log.rs:828-846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/witness_log.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105a8594d9e7ffca702dae478db2f5584ce6cf00175edaceb72b08bc5a30767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rvf/rvf-runtime/src/read_path.rs:725-743 | crates/rvf/rvf-server/src/tcp.rs:277-295 \u2014 before extracting anything, compare \u0060crates/rvf/rvf-runtime/src/read_path.rs\u0060 and \u0060crates/rvf/rvf-server/src/tcp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/read_path.rs:725\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"106811742eb510c556aae0cef009afa11a3b13625a12220f429788afcc0cef5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:2237-2255 | crates/rvf/rvf-runtime/src/store.rs:2318-2336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:2237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-runtime/src/store.rs:2317\u0060 calls \u0060map_or\u0060 and \u0060crates/rvf/rvf-runtime/src/store.rs:2236\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8588af45a9290e74e1dfd37b7db1deff9687d35292d6f959a9e4b576d4c0e769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/mod.rs:114-132 | patches/candle-core-0.9.2/src/cpu/mod.rs:133-151 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcda2038e4e42e971554e73118544ff46551ccd6c27eacef477394a55512e82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:512-535 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:654-677 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c216e38097f2ab51b02c36f569b38f86d3753e152618da8695503e5feb8a682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1939-1957 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2379-2397 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1939\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8d883b334819ca1ad4e2e6fce87574a1d06a0e676d31186ea3593c3cb27c3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2508-2526 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:3104-3122 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2508\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed271dc23c829608ccc67079afc4f192371aeadc6d3f5e40b3d659f6f2ef8be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2555-2573 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:3166-3184 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2555\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d28ae1012e6ddb804e9fcee43ccb5ffb3dd3fba70425b40430e495f5f966db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/layout.rs:110-128 | patches/candle-core-0.9.2/src/layout.rs:110-128 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/layout.rs\u0060 and \u0060patches/candle-core-0.9.2/src/layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 182 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/layout.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f271aabda26701a302ba8523c4685d8d3614b7fe37b83ddbb2c46c4ec9c9d56d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1257-1275 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1312-1330 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ff12ce03a243e00fe7ce3fd175482d8f55577ea557bbaa4b898829e78c0c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1347-1365 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1513-1531 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1347\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"169b86ba2aea9611800a9978f7a8125d3eb35d7e353b8f626e550f52c61d81a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:78-101 | patches/candle-core-0.9.2/src/quantized/cuda.rs:110-133 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dd77a45af76fe02e903bb95bbef2f03527e0da84eecf6d26ba3335f5fea33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:106-124 | patches/candle-core-0.8.4/src/quantized/cuda.rs:163-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs:106\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":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"114ca55cb785835f519b2076a4216ad2f9f78691d7a404a3ba038f75d3e379ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:135-158 | patches/candle-core-0.9.2/src/quantized/cuda.rs:170-193 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26da91ea3615ad9bd053e916c6ea21f06ec4ada050a48dcb2af33c18c5d760a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201329 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:301-317 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:502-530 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:324-340 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:534-562 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:301\u0060 it does not close everything it opens, so those exact 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f25f5294caf353d0fbe276f7043d7ebaa0903438fbbc3a376a9ed4e56da68e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:435-453 | patches/candle-core-0.9.2/src/tensor.rs:498-516 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c096420d5fb5af105d6132b19c8770a2c7ad09bdf1336a8b9a37ab100738b232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1569-1589 | patches/candle-core-0.9.2/src/tensor.rs:1893-1913 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e603e78b59cda81a64e4f5ea9619815f0f5bede7f26077a24ac91c951cf85308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:500-518 | scripts/patches/hnsw_rs/src/hnsw.rs:500-518 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:500\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"010f446a858be7ff8976a3891654f1eb7f77e2c306f1dcf9022bdf6e174e8ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:807-839 | scripts/patches/hnsw_rs/src/hnswio.rs:807-839 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c4ccac5fa628a023ca02288d09c1c8d98d210ce7a175a6a0572525fc57efd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1380-1399 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1498-1517 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1497-1516 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1615-1634 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1380\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e366406ac35340081d76e15d962461114cbf0fa6bf5d4f437c8a5d399fe4b475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): crates/ruvector-consciousness/src/chebyshev_phi.rs:95-110 | crates/ruvector-consciousness/src/phi.rs:352-369 | crates/ruvector-consciousness/src/sparse_accel.rs:215-230 \u2014 before extracting anything, compare \u0060crates/ruvector-consciousness/src/chebyshev_phi.rs\u0060 and \u0060crates/ruvector-consciousness/src/phi.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/chebyshev_phi.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f077b5dc9e8f3c29bbdac3e87012f1b2eec9ba157e1d856f18744dc1726ffa99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/ruvix/crates/cli/src/commands/dtb.rs:912-929 | crates/ruvix/crates/cli/src/commands/dtb.rs:966-983 | crates/ruvix/crates/cli/src/commands/dtb.rs:1015-1032 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:912\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4c2108dbf009da97345bc42ddc8a382c81fff83c77648e5b1983020562b6e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/ruvix/crates/dma/src/controller.rs:225-242 | crates/ruvix/crates/dma/src/controller.rs:264-280 | crates/ruvix/crates/dma/src/controller.rs:301-317 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvix/crates/dma/src/controller.rs:319\u0060 calls \u0060sync_cache\u0060 and \u0060crates/ruvix/crates/dma/src/controller.rs:244\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/dma/src/controller.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d8698363b2cdb5ebf0bcb41924c497793ac8ec83b175b27b7045a84d28e9bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 3): crates/ruvllm-wasm/src/workers/pool.rs:750-771 | crates/ruvllm-wasm/src/workers/pool.rs:919-940 | crates/ruvllm-wasm/src/workers/pool.rs:1033-1053 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm-wasm/src/workers/pool.rs:750\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/pool.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ae09d9869eb0a1cd42a86485d984163e3b9cdc26dd0c26b825dee3b69764db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/ruvllm/src/metal/context.rs:323-340 | crates/ruvllm/src/metal/context.rs:621-637 | crates/ruvllm/src/metal/context.rs:685-701 \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, \u0060crates/ruvllm/src/metal/context.rs:619\u0060 calls \u0060set_buffer\u0060, \u0060Some\u0060 and \u0060crates/ruvllm/src/metal/context.rs:683\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68ab882da5b2c46240c93668b8bf4a616050a08323d3038d90b6fe3e6d626d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/mcp-brain-server/src/gist.rs:880-897 | crates/mcp-brain-server/src/routes.rs:7970-7987 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/gist.rs:880\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-brain-server/src/routes.rs:7969\u0060 calls \u0060timeout\u0060, \u0060from_secs\u0060 and \u0060crates/mcp-brain-server/src/gist.rs:879\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c23b7d9c85fae9106d0aa57ddfb8bf190dbcddfda46320f8a8c5715cc4fe06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): crates/ruvector-coherence-hnsw/src/search.rs:215-232 | crates/ruvector-coherence-hnsw/src/search.rs:319-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-coherence-hnsw/src/search.rs:215\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/search.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fc5f20f67475c05ca5425d3f760315834031e341178809dfd89b0e3000ceb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:289-309 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:309-329 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc44bf98daa358b286115217f40ce53a9f7431b0ec703409fc8ef2d04e31b727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/ruvector-hnsw-repair/src/graph.rs:75-92 | crates/ruvector-matryoshka/src/hnsw.rs:129-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-hnsw-repair/src/graph.rs:73\u0060 calls \u0060push\u0060 and \u0060crates/ruvector-matryoshka/src/hnsw.rs:127\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hnsw-repair/src/graph.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"69539261e5ae8eee7381cd2bf8d0fbbacf275d8228ea0f7f4265f15154944013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:401-418 | crates/ruvector-math/src/utils/sorting.rs:23-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6588c31525edfcd8acf0b32f53d465101c136d72a8b5aa945828ebb235e277b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:20-37 | crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:45-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:20\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1315256d2691b3f6502bc1cc87c151d056585ab7706022f11521c0e2a6e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:250-267 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:320-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e46de72661f3eb377e49b928e8f5fbc6376ea3bc0ea686915fd6e66180ab097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-mincut-wasm/src/routing.rs:60-77 | crates/ruvector-mincut-wasm/src/routing.rs:198-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-wasm/src/routing.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f6cca8c591f1c8f51296f91d7fda94a9180d20e6990fc46184ba733e7b571d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-mincut/src/jtree/hierarchy.rs:473-490 | crates/ruvector-mincut/src/jtree/hierarchy.rs:506-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/jtree/hierarchy.rs:473\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/hierarchy.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cd37e1095ec13e79157dcc680d8f50fabda0a03d3b8d87e647892ea5d56b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/ruvector-mincut/src/linkcut/mod.rs:360-377 | crates/ruvector-mincut/src/linkcut/mod.rs:397-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/linkcut/mod.rs:360\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/linkcut/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"65becebf22abce145051fd2bb83643d2cc66d7ab372b2b55f8cb7d628d787129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:191-208 | crates/rvlite/src/sparql/executor.rs:165-182 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:191\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc1e0d688afd5efc7426822109e676cbe55e626f466d327ff88e82dd922cb7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:208-225 | crates/rvlite/src/sparql/parser.rs:231-248 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f72d00e7a2b927e28e3b317c836a6a1a999f9d1029bfc4c2c1d4fd43a141924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:981-998 | crates/rvlite/src/sparql/parser.rs:1019-1036 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f8422bdb91bdc0369be9748e73320490911059a3f9057f0c2e9f7673dc363e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1587-1604 | crates/rvlite/src/sparql/parser.rs:1626-1643 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"803b106427ba11a5c915c94d6dcf45868541fd0911ff42e22f10e96145cac399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1607-1624 | crates/rvlite/src/sparql/parser.rs:1646-1663 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d207b250883ff1f475ab16382923d117b2234e7df910ad3c2597bdefb23523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-postgres/src/hybrid/executor.rs:249-266 | crates/ruvector-postgres/src/hybrid/executor.rs:268-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/executor.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0467f55bff4f2672bee864f22643cfd8438365295e15085db3b685f7ab44babd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): crates/ruvector-postgres/src/sparse/distance.rs:86-103 | crates/ruvector-postgres/src/sparse/distance.rs:129-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/sparse/distance.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/sparse/distance.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b288b252485ed5063da6c64c912b88badc40abdaef4f504d93398b5935d1cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-sparse-inference/src/lib.rs:101-118 | crates/ruvector-sparse-inference/src/lib.rs:127-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/lib.rs:101\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/lib.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdff617697c589c4012fe21eede5a29f81a5bb333a35cc69fd8756d5ff9ae1ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/ruvector-sparsifier/src/audit.rs:120-137 | crates/ruvector-sparsifier/src/audit.rs:184-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparsifier/src/audit.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-sparsifier/src/audit.rs:202\u0060 calls \u0060max\u0060 and \u0060crates/ruvector-sparsifier/src/audit.rs:139\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparsifier/src/audit.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6511d006b5d3171ff66a6de706fe6531fe4b2f4b746f9f122bbc6e13d984e6f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): crates/ruvector-speculative-ann/src/quantized_draft.rs:37-50 | crates/ruvector-speculative-ann/src/quantized_draft.rs:66-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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-speculative-ann/src/quantized_draft.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71152736f4881783f0ee6ec0b97f4aee76a30f9b1cdc5b6e5c1b1528e79ec1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): crates/ruvix/crates/cap/src/optimized.rs:265-282 | crates/ruvix/crates/cap/src/optimized.rs:290-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cap/src/optimized.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c57071849210f767724b8f4b67b48b06f5266b15bbb4bdcc4d399faae56f391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvllm/src/backends/gemma2.rs:580-597 | crates/ruvllm/src/backends/phi3.rs:458-475 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1937cae5fe3d0e3f0fc5ab7caf422d8ea231f90c76d759c4d56eb7654c1791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvllm/src/gguf/mod.rs:653-674 | crates/ruvllm/src/gguf/mod.rs:689-710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/gguf/mod.rs:653\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8648814677cd2d43a1971faee57c469e25ac0e1f035d04dd855a00fc2a1d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvllm/src/kernels/accelerate.rs:337-354 | crates/ruvllm/src/kernels/accelerate.rs:405-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/accelerate.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":"crates/ruvllm/src/kernels/accelerate.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a7065ca0757b3ec121008d6ab13f34ddf7a25ad6f84bbdda4a0142ef610225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvllm/src/kernels/matmul.rs:1118-1135 | crates/ruvllm/src/kernels/matmul.rs:1143-1160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/matmul.rs:1118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e87433a408468dd2f9207a082f2f6e65e086add2e91db3a343b5ed5da533af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): crates/ruvllm/src/models/openmythos/mod.rs:428-453 | crates/ruvllm/src/models/openmythos/mod.rs:489-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"809357648ce5a34910717e3d5b03ca988273d30e5f7e62ac00af7214bc4e718b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/rvAgent/rvagent-wasm/src/gallery.rs:724-741 | crates/rvAgent/rvagent-wasm/src/mcp.rs:428-445 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-wasm/src/gallery.rs:724\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/gallery.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bb6afbccb2b1f196aac1dcdb79758f83af646659f45fef1c67af5f6934f939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/timesfm/src/config.rs:59-76 | crates/timesfm/src/config.rs:83-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/timesfm/src/config.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"35885b1b61bcbdac18d2d88199264c5711b5b062c472e6b62320f7d0aaaa14d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:38-55 | patches/candle-core-0.9.2/src/backprop.rs:38-55 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/backprop.rs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.9.2/src/backprop.rs:56\u0060 calls \u0060Scatter\u0060 and \u0060patches/candle-core-0.8.4/src/backprop.rs:56\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":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3c0998cddefc1abf87d8ed469fe2313ad54b08fc62ab8974e6e30592c8ea19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:282-299 | patches/candle-core-0.9.2/src/conv.rs:309-326 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/conv.rs:282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4985d6b9b63cd162161635020972dccf4306001fa5f204be06820b28c5db977d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:73-101 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:91-119 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ba44e3151fea23d4153fc49ae7ca0448c122c16d44b5906a8e87aa63b53a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:638-655 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:831-848 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:638\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"104a5f4c40b07826a615f49cfb8d87d52bf6bd6e1dd2d5848e2dc656b50edd5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2490-2507 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:3076-3093 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd01b572300dfc8a30d7047a182d2b1f5c2d2f500a1d6388b5131a0f8cf4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2537-2554 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:3139-3156 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"66911546abc202a3a3464118a05f9c5931996030fb4937afce607cabfc560d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1997-2014 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:2052-2069 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1997\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d85af5ba66c87d7d42296743730edfa7177fb01fe5819355d3c0f6ab68605f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:411-440 | patches/candle-core-0.9.2/src/display.rs:422-451 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e1fd02c753c8e6e18b834e2cf5b2bd8e35a7e81ae88fec249ab54dc61d2811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:145-162 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:160-177 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:145\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d54786981e08a2bd431c07089fc2f36e1201d3f34a38f5f794d33d9fd7e4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:332-384 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:352-404 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a53df221d6c96a9a1243a724f0b530f1c91dfd725015e68d6959f5456d1817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:801-820 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:837-856 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab7779cea74450a4e6067545de50d492439319a4503e1e51a697862f18894ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:942-959 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:990-1007 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:942\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ce3b1a907ce9de52af2301fdfb975fb30ad742e6949bb214229874b5039aca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1487-1504 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1656-1673 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1487\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"273880477b792affce835f9687f4b6fc107b2ac37909c4f8e08deb6a0fddf812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:258-276 | patches/candle-core-0.9.2/src/npy.rs:285-303 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f75ffbd9d10ff4c552ba4bbafbfe13b7a04a6f6c7585eb877df4717181d3af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:407-424 | patches/candle-core-0.9.2/src/pickle.rs:418-435 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedc7215651bdeab13bf51fd01a7fb1131e2419d7c174153e18d9f63d362c6f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:238-257 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:239-258 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f51de0e43a6a09cbad5270ce7e375024886b4a883070edf07a425d1ea8e544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:356-373 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:357-374 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da04d4819ab6202f5ea743a3a77f16450edb23582c50e314fbf2ab153212a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:196-218 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:213-235 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"891a743d8131a09cd09b9e8389683f8861c8b939bc9cd628c35451ec387b4799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:398-423 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:426-451 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"541913c890ea2b0a71d615277c2dae7ee703bc36b1c4c759bd21a8f2625bf7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/metal.rs:171-188 | patches/candle-core-0.9.2/src/quantized/metal.rs:227-244 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/metal.rs:171\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":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"274443fe8b631ddcbbcfde0395ba4831bb11784e1f241a1c2b532f8e876fa068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:104-121 | patches/candle-core-0.9.2/src/safetensors.rs:121-138 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/safetensors.rs:104\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":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e960ac51405e15c86418122f32b623c21443e4e8a76c313fd987b9863405a2cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:47-64 | patches/candle-core-0.9.2/src/storage.rs:48-65 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"15df2734eaa83bd7279cc9bf1d3705ca93317f473d475d390a02da7a3009e47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2362-2397 | patches/candle-core-0.9.2/src/tensor.rs:2685-2720 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2233daf9028706f04a23f68a09f546db2a3fc5d63c76ffaf975e3f47e0c620df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6): crates/ruvllm_sparse_attention/src/attention.rs:215-231 | crates/ruvllm_sparse_attention/src/attention.rs:311-327 | crates/ruvllm_sparse_attention/src/attention.rs:473-489 | crates/ruvllm_sparse_attention/src/attention.rs:1141-1157 | crates/ruvllm_sparse_attention/src/attention.rs:1387-1403 | crates/ruvllm_sparse_attention/src/attention.rs:1483-1499 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c7fed83d27524f0e0ea00142da8a46cfe2f4681aa69d2a96bea268e531dbd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): crates/ruvector-cnn/src/simd/neon.rs:52-68 | crates/ruvector-core/src/simd_intrinsics.rs:691-707 | crates/ruvector-core/src/simd_intrinsics.rs:764-779 | crates/ruvector-core/src/simd_intrinsics.rs:894-909 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"158e23cba57fced3537d6c8fd350d1848a021fee26254291c9548c951923ca11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): crates/ruvllm/src/models/ruvltra.rs:237-253 | crates/ruvllm/src/models/ruvltra.rs:282-297 | crates/ruvllm/src/models/ruvltra.rs:316-331 | crates/ruvllm/src/models/ruvltra_medium.rs:305-321 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra_medium.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/ruvltra.rs:237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c394b4a954a6e2b04fe9936b38c10a7ff4fbe342e86fa110cb293234c82ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 4): patches/hnsw_rs/src/libext.rs:188-201 | patches/hnsw_rs/src/libext.rs:751-767 | scripts/patches/hnsw_rs/src/libext.rs:188-201 | scripts/patches/hnsw_rs/src/libext.rs:751-767 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/libext.rs:188\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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab0b8051758dbb3b4778f275a27145e7258d05c92916e683da5f81b2140b210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:133-153 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:236-256 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:344-360 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:133\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3e89d5853cf5360dc8ed5fd2bc8edff026d9636ad8525e9cbad892e950568f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): crates/ruvector-cnn/src/simd/avx2.rs:335-351 | crates/ruvector-cnn/src/simd/avx2.rs:486-500 | crates/ruvector-cnn/src/simd/wasm.rs:249-263 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/wasm.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:335\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"286ea226a9e140d824deb99eecfd24fceb9a6093d5615a863b2c16ccd4f0a4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:171-187 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:241-255 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:311-325 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:171\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee7d63306c4b1695ccfae272e158ca9ea9280c1b4dc0568fd6604e0bf3c89a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1046-1063 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1138-1155 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1246-1263 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1046\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c03864f464ed10b67d95aa586843dfe654af2723448bb3ddac90cbef57ac7b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/photonlayer-bench/src/decoder.rs:12-29 | crates/photonlayer-bench/src/privacy.rs:164-181 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/photonlayer-bench/src/decoder.rs:30\u0060 calls \u0060l2_normalize\u0060 and \u0060crates/photonlayer-bench/src/privacy.rs:182\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/decoder.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b91b378ce95a3c9719cb22448c8512a170a927289ccacb7f1a2725b0571814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201317 lines \u00D7 10): crates/prime-radiant/src/attention/adapter.rs:176-180 | crates/ruvector-attention/src/curvature/fused_attention.rs:306-310 | crates/ruvector-attention/src/hyperbolic/hyperbolic_attention.rs:60-76 | crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:52-68 | crates/ruvector-attention/src/info_geometry/natural_gradient.rs:88-92 | crates/ruvector-attention/src/pde_attention/diffusion.rs:204-208 | crates/ruvector-attention/src/topology/gated_attention.rs:268-272 | crates/ruvector-attention/src/transport/centroid_ot.rs:315-319 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:276-280 | crates/ruvector-graph-transformer/src/manifold.rs:1244-1247 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/attention/adapter.rs\u0060 and \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3936928533cac10939cf30ae4cc8c4b7c8d8a030c61b0febcb4849eb729aac6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-attention/src/sheaf/attention.rs:245-261 | crates/ruvector-attention/src/sheaf/sparse.rs:277-293 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/sheaf/attention.rs:245\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9018632bb0210b535e34d0cd709050f4b26366b420ce5f0c673fd8f3341990bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-bench/src/bin/profiling_benchmark.rs:219-235 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:299-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/profiling_benchmark.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c975f0e040cec213749cfc37e3b73eba825c183fd8f8d3aa55aa6ef074ae91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-coherence-hnsw/src/search.rs:262-279 | crates/ruvector-coherence-hnsw/src/search.rs:369-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-coherence-hnsw/src/search.rs:262\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/search.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a1be6c2adf00e79deeb2747771b65f32eae4954da3400340821616a8affd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-delta-core/src/window.rs:269-285 | crates/ruvector-delta-core/src/window.rs:336-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-core/src/window.rs:269\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/window.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4835426d3d51926dd41c9a41cd69ee1e3c1158eddac63cfb0f51dfc7c529e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): crates/ruvector-delta-wasm/src/simd.rs:123-146 | crates/ruvector-delta-wasm/src/simd.rs:158-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 \u0060crates/ruvector-delta-wasm/src/simd.rs:123\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-wasm/src/simd.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1827293489737b60c91ed69bc542ca81cbf932b1ecfd1b92297ec6cca9d6116d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-kge-ffi/src/optimize.rs:189-205 | crates/ruvector-kge-wasm/src/optimize.rs:189-205 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/optimize.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/optimize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 149 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/optimize.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff760f55227ab9730f6a410703125ebe488ed63e832a1236a29ffd31731d9848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/ruvector-math/src/spectral/graph_filter.rs:180-196 | crates/ruvector-math/src/spectral/wavelets.rs:244-258 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/spectral/graph_filter.rs:180\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/graph_filter.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfc18f3ac712dc0a75c843d2955bb2d057aeaabca01191277d142aa655a3427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-memory-admission/src/policy.rs:197-217 | crates/ruvector-memory-admission/src/policy.rs:348-368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/policy.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"442642502a324a7dab8cde5d13df4dc6dc16e56f98063b9b48cd1fdea8564029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:265-281 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:294-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e9d9476db2b7d9c67eb3bff87832c8677e2dbeade8e9c40c5cdb6f5a862200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-mincut/src/expander/mod.rs:406-423 | crates/ruvector-mincut/src/expander/mod.rs:617-633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/expander/mod.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":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9b0680d73a00e7434274e862dc398f68646f0cd76bd03cdb1db1be356569c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-mincut/src/jtree/coordinator.rs:489-505 | crates/ruvector-mincut/src/jtree/coordinator.rs:520-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/jtree/coordinator.rs:489\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/coordinator.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"4515bbe38004a12b94d7d26fb8e004a690c2128a6bcc45cfe1d7ee36c03e37ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-mincut/src/snn/causal.rs:461-477 | crates/ruvector-mincut/src/snn/causal.rs:481-497 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/causal.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65fb25d85978a82face355269b99e3776d236909927415451a751f7918858c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/ruvector-mincut/src/snn/synapse.rs:445-461 | crates/ruvector-mincut/src/snn/synapse.rs:468-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/snn/synapse.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":"crates/ruvector-mincut/src/snn/synapse.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a254053b8542d0a4e20aaaec21205fb2163478c00b7a32986264ac1d85222cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-nervous-system/src/compete/kwta.rs:82-98 | crates/ruvector-nervous-system/src/compete/kwta.rs:116-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system/src/compete/kwta.rs:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/compete/kwta.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dc35158ba202c55bdc8a2ab98a4748b01b0873217be9bec1dbb059cf655a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:441-461 | crates/rvlite/src/sparql/parser.rs:468-488 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba5891311320a6285735d2f60840e6ea949e77394df8cd0de7ca1bb34b64bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:464-491 | crates/rvlite/src/sparql/parser.rs:491-518 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bddf3f1bcae0001186ec5fa17a9ccce3acad2864f978698fdc87512b16fe630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:756-772 | crates/rvlite/src/sparql/parser.rs:794-810 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a712c6a8deb43a0bfd292f8800e641fb9a3f6ce4c15f21b470db8a1f84a922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1221-1237 | crates/rvlite/src/sparql/parser.rs:1259-1275 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f225ce02f237259d11d3c4a6ac48f40cd88e9c97122e54c23aaddf6333f7351c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1904-1920 | crates/rvlite/src/sparql/parser.rs:1943-1959 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e9c83597bb96bc75fd91aec4aca7bbd6eb3d141b636118bcda3cca92f237a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): crates/ruvector-py/src/rabitq.rs:154-170 | crates/ruvector-py/src/rabitq.rs:418-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-py/src/rabitq.rs:154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/rabitq.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3795f66e0f105a2184aebd6d5e03798dcac75a074a525b81c26dda132e16fabe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/ruvector-temporal-tensor/src/quantizer.rs:113-128 | crates/ruvector-temporal-tensor/src/quantizer.rs:237-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/quantizer.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":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"784a4585505b708d9d141131680f104098226711d8ebdeae17053df06a41794e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/ruvector-temporal-tensor/src/quantizer.rs:450-466 | crates/ruvector-temporal-tensor/src/quantizer.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 \u0060crates/ruvector-temporal-tensor/src/quantizer.rs:450\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea460bfaaa02d1a670946ff91105888130f1ef2f79b00e4976b266c765e3856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvix/crates/dma/src/config.rs:152-168 | crates/ruvix/crates/dma/src/config.rs:175-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/dma/src/config.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53c216aefadd477bfa6c71ec7c6612f4ce458a2274576b5dc4775c3ccef7f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/ruvix/crates/nucleus/src/vector_store.rs:264-280 | crates/ruvix/crates/nucleus/src/vector_store.rs:310-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/vector_store.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a0fd544ff277fbd3f6e9a814f865f5b56ea72adf1f16dd0ba43f08592f43df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvix/crates/queue/src/ring.rs:260-276 | crates/ruvix/crates/queue/src/ring.rs:322-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/queue/src/ring.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cbd8db196a0a89fd8cd7a8ea55282e6500e2c2eeecaa9cd6f95bb6cc19a307"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/ruvllm/src/backends/hybrid_pipeline.rs:737-753 | crates/ruvllm/src/backends/hybrid_pipeline.rs:795-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/hybrid_pipeline.rs:737\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/hybrid_pipeline.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"149466483cb05c4f1beb19e575df100da9664a670e1a186b5938a9bcbf734698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:884-900 | crates/ruvllm/src/kernels/attention.rs:970-986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"543662ecec421871c5a2d70a7ad3e56ee855479574fe36af78c74d5719d459b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvllm/src/lora/micro_lora.rs:326-342 | crates/ruvllm/src/lora/micro_lora.rs:422-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/lora/micro_lora.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a124d801c9325f2d5c0d67723f515e5168e5b264c210dbb6c709091c3b09dc3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/ruvllm/src/metal/context.rs:602-618 | crates/ruvllm/src/metal/context.rs:668-683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/context.rs:602\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94456bc7a786080cbb486f111192048bdcdaa6a90d6a7fc6d0439a4d7892d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvllm/src/metal/operations.rs:401-417 | crates/ruvllm/src/metal/operations.rs:531-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/operations.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d31b50f9ac240cacde23ca0ce941473eda839997cfb880731392970a55de938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvllm/src/serving/engine.rs:194-210 | crates/ruvllm/src/serving/engine.rs:234-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/serving/engine.rs:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee43cf04d8a5d42e8f3d11ce4bf51a2a3bb753651a70898fc85d81de5b1a6a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:151-167 | crates/ruvllm_sparse_attention/src/attention.rs:1322-1338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a5c713fc023e0480302b0bc4d26f49c3945bcc2c4021bb7234bde2aed84fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:1608-1624 | crates/ruvllm_sparse_attention/src/attention.rs:1737-1753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:1608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"1710df0501a7ab676078afa6d9d202f2200c7b1d0f791910298da4e34faccac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rvAgent/rvagent-mcp/src/transport.rs:89-105 | crates/rvAgent/rvagent-mcp/src/transport.rs:108-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/transport.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"50078778ca42ee68294a995671ba56b04366680829700a3408b2ed584861d87e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/rvf/rvf-index/src/distance.rs:79-95 | crates/rvf/rvf-index/src/distance.rs:175-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/distance.rs:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-index/src/distance.rs:78\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs:174\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/distance.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"121d5d4833f62af79966a1a212ccbee26cfadb7f6dac98f1842d56dd892f41b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/rvm/crates/rvm-cap/src/derivation.rs:254-269 | crates/rvm/crates/rvm-cap/src/derivation.rs:351-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvm/crates/rvm-cap/src/derivation.rs:254\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/derivation.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49cc61c8db334d54f8229ba03c9e927fe5e36c6e28f4a353ac7956f582b75b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:197-213 | patches/candle-core-0.9.2/src/conv.rs:212-228 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4354d1230b84ca56a7d21c205f52d95d0aa43e1a71321120d5d34a4ae8d26b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/kernels.rs:175-191 | patches/candle-core-0.9.2/src/cpu/kernels.rs:216-232 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/kernels.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/kernels.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/kernels.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7f0ec04735bcf6503de81ac2353a15af17d8285e150ca777382f5216cac079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:747-781 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:943-977 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:747\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a112d4a0e0a16079959ea35703f2c3c10490965f04ea426a429d7075df20213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1966-1982 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2416-2432 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1966\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f2700f172c2dca7e1040bc4cc4f711666340ba34233a3d1e5ce92bb3eedb51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2130-2146 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2624-2640 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2130\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ee24b54eb7940c27f94055a1fd9eb64e9e2b96d016607953fbd09dfd24d611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2204-2221 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2728-2745 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2204\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3101561fff2a60d32b7c68a37fac6f673408b1bec57fde0d64d5a86d188f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:966-982 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1015-1031 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:966\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eac20f376fbf9849fc29d1f9a473346da2686ae3b505545f7dfe0277ae8fe89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1317-1333 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1435-1451 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1317\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dae1ea64b1354b86ade89e68e2f269488a9f4934c554c965f13adff1fe292c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:303-319 | patches/candle-core-0.9.2/src/npy.rs:330-346 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d58a83a77491ddccff4e58decf36bbf31084fb26c12d5393ed1c715bf30e585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:134-153 | patches/candle-core-0.9.2/src/safetensors.rs:151-170 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/safetensors.rs:134\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"489f3e3efae847ae24aafcbde4525b5cb1e0ae57bea5d9f23e00eeece768ba0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:604-620 | patches/candle-core-0.9.2/src/storage.rs:641-657 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99ca20ed1c8277684c66e3c79b60ce641f6f7f3812424a736a420ee815e78b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:675-703 | patches/candle-core-0.9.2/src/tensor.rs:743-771 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec3cede94720e8ae94cc661888f807d6b0e52cef1f691989bbf458b947ba935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1942-1958 | patches/candle-core-0.9.2/src/tensor.rs:2266-2282 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ab29fb0ff94601c35fb81144a286b2435822cf159afea03caa736a52102269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.9.2/src/metal_backend/mod.rs:1478-1501 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1528-1551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:1478\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":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce0b90c125d37386aaa093cb1a7cfe619b4522a2f06639739fb2a0b2ef62dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/hnsw_rs/src/api.rs:70-86 | scripts/patches/hnsw_rs/src/api.rs:70-86 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/api.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/api.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"patches/hnsw_rs/src/api.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f5ca5d0b2c12946609193a074a9fcb636ac652f2716a66d8a13755ddd45a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 4): crates/ruvector-core/src/simd_intrinsics.rs:208-222 | crates/ruvector-core/src/simd_intrinsics.rs:279-291 | crates/ruvector-core/src/simd_intrinsics.rs:340-355 | crates/ruvector-core/src/simd_intrinsics.rs:407-419 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:208\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:223\u0060 calls \u0060_mm512_sub_ps\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:292\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b65a9101b4a6b86c5e31320a51fa37683903fb4104660d72a805b80ec401af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): patches/candle-core-0.8.4/src/tensor.rs:1354-1369 | patches/candle-core-0.8.4/src/tensor.rs:1470-1485 | patches/candle-core-0.9.2/src/tensor.rs:1611-1626 | patches/candle-core-0.9.2/src/tensor.rs:1794-1809 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1354\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d3ce4b6ba052c77c86d600ed66ef547882d607d5e2db0cbef37e6ef10120fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:120-135 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:177-192 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:92-107 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6e4ab23a3540a0c257ff302cf375062d1971e31bc5521ba7799845691cad09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/ruvllm/src/policy_store.rs:251-266 | crates/ruvllm/src/session_index.rs:202-217 | crates/ruvllm/src/witness_log.rs:529-543 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/policy_store.rs\u0060 and \u0060crates/ruvllm/src/witness_log.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/policy_store.rs:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/policy_store.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee7d6002e9d66c56d9a8d5c47c52e32c390fc16cb35e8a7c926ab1d0828455c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/rvf/rvf-runtime/src/store.rs:286-301 | crates/rvf/rvf-runtime/src/store.rs:375-390 | crates/rvf/rvf-runtime/src/store.rs:462-477 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"737303dac5205b9ebd928e205522fb0780ce083e2bceaf047442b9ba0ef7585d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:911-926 | crates/mcp-brain-server/src/routes.rs:1106-1121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:911\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1303857d070326c5ab338851d82667680254f995cdd43a0fd45b862d5530187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:4870-4885 | crates/mcp-brain-server/src/routes.rs:5169-5184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-brain-server/src/routes.rs:4867\u0060 calls \u0060Path\u0060 and \u0060crates/mcp-brain-server/src/routes.rs:5166\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":4870}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c9aaf1c7057315588346305ba90f85c86d640275acfcb898d923ab00dbfaf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/mcp-brain/src/server.rs:77-92 | crates/mcp-gate/src/server.rs:153-168 \u2014 before extracting anything, compare \u0060crates/mcp-brain/src/server.rs\u0060 and \u0060crates/mcp-gate/src/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain/src/server.rs:77\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59f39cad1b14bb016cbb487462d3a9eb6abc4a049fba933f0fa2cfbbb6b2590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/prime-radiant/src/mincut/adapter.rs:110-125 | crates/ruvector-mincut/src/subpolynomial/mod.rs:305-320 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/mincut/adapter.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/mincut/adapter.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"253b92562d3ac2985d65d92b29850b5ca83e064d418b789aaab017da138b0e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/prime-radiant/src/simd/vectors.rs:60-75 | crates/prime-radiant/src/simd/vectors.rs:295-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/vectors.rs:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/vectors.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91dfac42521adff216a834de36d8c4d06fe1341209e6172830f7bbfdcbf816e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruvector-attention/src/pde_attention/diffusion.rs:79-94 | crates/ruvector-attention/src/pde_attention/diffusion.rs:138-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/pde_attention/diffusion.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec35ebf6b601d2f3a00109956ab5e4aa8f7c8d84ef2d90f0962794ac0ea5a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/ruvector-cnn/src/contrastive/augmentation.rs:501-523 | crates/ruvector-cnn/src/contrastive/augmentation.rs:526-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/augmentation.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"30274bfd09cd7737872c3495b252bd2257b5088aaa46f243e69138a1e4cd869e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:1360-1375 | crates/ruvector-core/src/simd_intrinsics.rs:1401-1415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:1360\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:1418\u0060 calls \u0060_mm256_sub_epi16\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:1378\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1a7e0a7ab1c12963c90aa34eeab0ae34298f744af61e1590e8e79112065e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-delta-core/src/encoding.rs:118-133 | crates/ruvector-delta-core/src/encoding.rs:362-377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-core/src/encoding.rs:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/encoding.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc0e60e28d380d50b96ee1ef45aa17ac136dfd2cff391786c256cb89abb199c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-delta-wasm/src/apply.rs:85-100 | crates/ruvector-delta-wasm/src/simd.rs:27-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-wasm/src/apply.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":"crates/ruvector-delta-wasm/src/apply.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c2c9eb6b543935acc86c94dc27df3bd44f6c89e4cd3e873f28a80c47b0151f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:169-184 | crates/ruvector-py/src/graph/cypher_eval.rs:159-174 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/cypher_exec.rs:169\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc300cbf4444fbb84e14dbb9d009fdfdfc9a34373042a41d299d36fc440c2c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-graph-transformer/src/manifold.rs:1048-1063 | crates/ruvector-graph-transformer/src/manifold.rs:1068-1083 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/manifold.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2176956fcdb743bdfeb50eb644877eb5b5af748eda0f424e7fdb19421f82ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:118-133 | crates/rvlite/src/cypher/parser.rs:114-129 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1010c84227c0d5bd7e1c53b0ba0ac9189e5ceb639e3b9986f0a60eadb5d11e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:973-988 | crates/rvlite/src/cypher/parser.rs:880-895 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fb776e70b64f9b243b6a61a1f77b542f7ccf35f90d23c1357b0ab9c4bff2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:433-448 | crates/ruvector-hailo-cluster/src/bin/embed.rs:442-457 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:433\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ee7db35df1d02c80aa556482e0fc25b79026b8f7490a7436820faf15852baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:305-326 | crates/ruvector-hailo-cluster/src/bin/worker.rs:805-823 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:305\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/fakeworker.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5232ebadad0aec7f71fcd58e6215eb1e476a37fb31dfce69a1db5c10e5b55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-math/src/optimization/polynomial.rs:272-287 | crates/ruvector-math/src/optimization/polynomial.rs:331-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/optimization/polynomial.rs:272\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/polynomial.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0503e7a9b8c29bd4eaa257f2d48dfaf2ad2507438a5ecaeb229cda2bc9faf225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-math/src/spectral/graph_filter.rs:158-173 | crates/ruvector-math/src/spectral/wavelets.rs:227-242 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/spectral/graph_filter.rs:158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/graph_filter.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc0150b7f1a932808a52ded8f85a397c5486d84a29bedf41738666db1a4dadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/squat.rs:219-234 | crates/ruvector-mincut-gated-transformer/src/kv_cache/squat.rs:238-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/squat.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebc1a3a08cd69f6eb3e17767671e1accc6bce16e7387446ae91fb0ab2db1e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/workspace.rs:327-342 | crates/ruvector-nervous-system/src/routing/workspace.rs:410-425 \u2014 before extracting anything, compare \u0060crates/ruvector-nervous-system-wasm/src/workspace.rs\u0060 and \u0060crates/ruvector-nervous-system/src/routing/workspace.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/workspace.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1323f8dd093b760467988dfc4ca5fd93b807de809cc0abceaf9ea61bf2bc91ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-nervous-system/src/hopfield/network.rs:144-159 | crates/ruvector-nervous-system/src/hopfield/network.rs:205-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/hopfield/network.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e5b8aba657d127e2f906d2e83cc69d3448cb178873d95b434501fe4db6b7ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:215-230 | crates/ruvector-postgres/src/distance/simd.rs:279-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc8e0872422513dfc98549d35652a77d422cc419e6bc9331666a80668bce5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/gnn/message_passing.rs:86-103 | crates/ruvector-postgres/src/gnn/message_passing.rs:147-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/gnn/message_passing.rs:86\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gnn/message_passing.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eba5db8058947b7588808c144bbb8975aa6a54eb2f37ac641db8b3bf5ea1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:806-821 | crates/rvlite/src/sparql/executor.rs:429-444 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc832ac9bf339d6ebbd02e28bdf7638ad66dc73b065a46d2f4a174f3dbb8f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1410-1425 | crates/rvlite/src/sparql/executor.rs:700-715 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b68ef84a5740e5c18609773e6e8530dfbaab319f406e79d0eaa9ddcc3a02cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1240-1255 | crates/rvlite/src/sparql/parser.rs:1278-1293 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0586ba6c4c7ed0f2b5478ac979b7e6fcfba367879eb219a6ff32d4fbac15afa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1470-1485 | crates/rvlite/src/sparql/parser.rs:1508-1523 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae6f2a40647adce08fd32afa7ffc7e6c660be490f334165bf04ec430fe4f895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1783-1798 | crates/rvlite/src/sparql/parser.rs:1822-1837 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"604709aa6c7bdbbc3268729c2c501023f717764ca8e145910522477eca8ac12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2018-2033 | crates/rvlite/src/sparql/parser.rs:2057-2072 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d5b53255cb987890aa137457641adb39705b3140b2620650bbb3a205090eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2211-2226 | crates/rvlite/src/sparql/parser.rs:2250-2265 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:2211\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a1580cdf3d57c18f3c3c71419a49cc39b3163a457ef2a6f4b321f2192d51d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruvector-postgres/src/hybrid/fusion.rs:156-171 | crates/ruvector-postgres/src/hybrid/fusion.rs:181-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/hybrid/fusion.rs:156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/fusion.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4803a9744230015e992aeb483bcbc1af4b98e83910e072d899472585810b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/ruvector-postgres/src/types/halfvec.rs:342-357 | crates/ruvector-postgres/src/types/halfvec.rs:463-476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.rs:342\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/types/halfvec.rs:364\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvector-postgres/src/types/halfvec.rs:481\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59a8c50d986ae68578d8023a4fe03144dbea403ba2491a5eef5d6464f317068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruvector-postgres/src/types/halfvec.rs:443-457 | crates/ruvector-postgres/src/types/halfvec.rs:539-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.rs:443\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a8f593fa0047ed1e12dfd5bc9833f4d0fc107ee6aa5ab88bec0f7fdbc93814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruvector-pq-search/src/codebook.rs:219-234 | crates/ruvector-pq-search/src/ivf_pq.rs:205-219 \u2014 before extracting anything, compare \u0060crates/ruvector-pq-search/src/codebook.rs\u0060 and \u0060crates/ruvector-pq-search/src/ivf_pq.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-pq-search/src/codebook.rs:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-pq-search/src/codebook.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7496ed92af28c1aeda8a75a0b5cf289465560c0f9117fe139ea5133a2bf5266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/ruvector-rabitq/src/index.rs:773-785 | crates/ruvector-rabitq/src/index.rs:819-834 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rabitq/src/index.rs:773\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/index.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb67016f294821262ec9c63ea5c3844645e6ad74dbf409de70383ded9200fded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-robotics/src/perception/mod.rs:328-343 | crates/ruvector-robotics/src/perception/scene_graph.rs:147-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-robotics/src/perception/mod.rs:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/perception/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a203dd4008bc6f4de730eb4935557a3697986f45083785bd5f9666092b81ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-typesafe-core/src/bank.rs:239-254 | crates/ruvector-typesafe-core/src/bank.rs:287-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-typesafe-core/src/bank.rs:239\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/bank.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea8f194e9e0304aa7f1eb5c3c4b0d4233f7987a746693ad58ab6b8a1abce1d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvix/crates/drivers/src/gic.rs:267-282 | crates/ruvix/crates/drivers/src/gic.rs:294-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/drivers/src/gic.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53c463bc3d9df8379a34d59cd6e0e65b59f36e70a7a44ea9238d416abe41589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruvix/crates/vecgraph/src/graph_store.rs:204-218 | crates/ruvix/crates/vecgraph/src/vector_store.rs:178-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/graph_store.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f86046d9c4e2371f11500d327ebb6f015def00d0c6e10a5ad4f0bdb940bf3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvllm/src/backends/coreml_backend.rs:1362-1377 | crates/ruvllm/src/backends/coreml_backend.rs:1521-1536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/coreml_backend.rs:1362\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5ecec937d716d57beafc5d06248981cbd4540c28d4208c016781db6848c210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:1275-1290 | crates/ruvllm/src/kernels/matmul.rs:1251-1265 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/kernels/attention.rs\u0060 and \u0060crates/ruvllm/src/kernels/matmul.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.rs:1275\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1cd3cbddbd3b45b700b752262fc3c431440fc0468c26a9a954beb57f6e2d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ruvllm/src/memory_pool.rs:1233-1251 | crates/ruvllm/src/memory_pool.rs:1294-1312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/memory_pool.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b2b61e9c1c825d105c443ee8815217956f2faf2eeb792e81c8041f69f2a113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/ruvllm/src/metal/context.rs:737-751 | crates/ruvllm/src/metal/context.rs:806-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/context.rs:737\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/metal/context.rs:736\u0060 calls \u0060create_buffer_with_data\u0060 and \u0060crates/ruvllm/src/metal/context.rs:805\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"0875dffb772a060d89e13d851d411b095894a25b1dfd84f94f2f9b98f3175acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvllm/src/quantize/pi_quant_simd.rs:457-472 | crates/ruvllm/src/quantize/pi_quant_simd.rs:734-749 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant_simd.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3498d22af2223e3a45b9c04fb87e4ec71cf48c5bbfb3a0f1235b8688d4cee364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvllm/src/training/contrastive.rs:329-344 | crates/ruvllm/src/training/real_trainer.rs:315-330 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/training/contrastive.rs\u0060 and \u0060crates/ruvllm/src/training/real_trainer.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/training/contrastive.rs:329\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4899bce733692a0815ad11fa54d54a7cbadf0fac518f5d2302af7d0f53298833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:142-157 | crates/ruvllm_sparse_attention/src/attention.rs:388-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27bf545b88a5e59454c8ffb9c4262253816c799a01fac895ed1aed7c325e966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/filesystem.rs:263-278 | crates/rvAgent/rvagent-backends/src/filesystem.rs:309-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-backends/src/filesystem.rs:263\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5431c49c9d8f4accb6adbc8d43b80eac9cc01b1a63d365478dbb7b66b9503937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/rvAgent/rvagent-wasm/src/gallery.rs:432-447 | crates/rvAgent/rvagent-wasm/src/gallery.rs:493-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-wasm/src/gallery.rs:432\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/gallery.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c138d5101282a29b18b74265c066f4bc78e597244fe2f7b6b91066fe02860eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/rvf/rvf-cli/src/cmd/filter.rs:105-117 | crates/rvf/rvf-cli/src/cmd/freeze.rs:48-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/filter.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"972222721afd9d5cfd81b53b07720895929dfef6dab25ef9f732b510444a87d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/rvf/rvf-runtime/src/safety_net.rs:164-179 | crates/rvf/rvf-runtime/src/safety_net.rs:224-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/safety_net.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/safety_net.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d9ee56667dfc674d49edb7b6f6127bee3c40a6da405e95aa43a295603c6c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:480-495 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:589-604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:480\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80857ea67e27bf59cd211409f3f0331c2f1005b9dccf20a22caff2d5aa8bc3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2089-2104 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2573-2588 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"771f09934b843b1d11ba23719e9cfad04e2b430e96c90316bec8161b8e84fe78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2577-2592 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:3188-3203 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2577\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db8be8b3670293bcf057b705da1b8d845e50a55ad22ad933088c760e4afb22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:387-402 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:408-423 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:387\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"811b7f84654f4648014a4a0a8f249b50e99587839058f693b1c767a89ab32ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1112-1127 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1164-1179 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ba3eb5fe727e622cc7327abb6bc6d5979939570892282454852afbce938aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1277-1292 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1333-1348 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1277\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e20740cd3490cccebb5af78e89384b0eb09d631c70daaa1537b426849b051c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1593-1608 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1742-1757 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1593\u0060 it begins part-way through the construct above it, so those exact 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, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:1758\u0060 calls \u0060command_encoder\u0060, \u0060set_label\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1609\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfcfc4c651b58dd26572f4edd6649189295debcb8c32ff3030faf512f03d004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:392-407 | patches/candle-core-0.9.2/src/npy.rs:419-434 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dcfc8c0399791aa9da75e2515ad5c6f0345514f4c49d50adb4740ea8706d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:614-626 | patches/candle-core-0.9.2/src/pickle.rs:634-649 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/pickle.rs:634\u0060 it does not close everything it opens, so those exact 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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"428d0ae27372fe027db9b8d62c9f7a3d25d7bb4c04d4b20b4693b6b38adbe93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:253-268 | patches/candle-core-0.9.2/src/quantized/cuda.rs:293-308 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf1779962208bb360b428f00f11db8bd1c4b5710052bf35b1e1f1d9ac6cde8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:484-499 | patches/candle-core-0.9.2/src/quantized/cuda.rs:723-738 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa77bd0d6303225d606bd75a24cc6d80b3fa5b7461276ea41d616d905e0d12b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:160-175 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:161-176 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e6a64ecdd01342d5e70a3ad40465efc92ebbc6adcf322e075b0327b1661d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:376-391 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:377-392 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f03059f260e3a6d53c8b06acc91e047d7261906d8fdacb1a0ead8a7fa74bbbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1315-1339 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1581-1605 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1315\u0060 it begins part-way through the construct above it, so those exact 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, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1340\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:1606\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"771e09470f1b904c231635d26343f87124dbb6660470064593a0954936eaa323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/simd128.rs:37-52 | patches/candle-core-0.8.4/src/quantized/simd128.rs:77-92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/simd128.rs:37\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":"patches/candle-core-0.8.4/src/quantized/simd128.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4793df83191ccafa470d27f3765eb4bfff634e2228fea23b37fd287f7d598c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:317-332 | patches/candle-core-0.9.2/src/safetensors.rs:472-487 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/safetensors.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":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"022e17d5e22728855114d62eb89d03f1de9e1b5115406881056aebe77bbc4930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:891-906 | patches/candle-core-0.9.2/src/tensor.rs:959-974 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"4435beb33b9c1c75bd51736a4ae659fa6c70e5a42c87560036bd3683dc4d6e07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2484-2499 | patches/candle-core-0.9.2/src/tensor.rs:2807-2822 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef56c149605b0953f42c0313c8f12538f46acf040bae9f8624337afee4591bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/ruvllm/src/backends/gemma2.rs:648-662 | crates/ruvllm/src/backends/phi3.rs:526-540 | crates/ruvllm/src/models/ruvltra.rs:653-667 | crates/ruvllm/src/models/ruvltra.rs:848-862 | crates/ruvllm/src/models/ruvltra_medium.rs:652-666 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:648\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"7031ba9afe3865872b5ac98eec53c4b1c51a78c32166a9ec81ab2ad20f8725a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 5): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:781-792 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1009-1023 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1095-1109 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:977-988 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1205-1219 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:781\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f45cee2101e0bb1a60f75b43e0e27c9704934eadda29722da6027262837aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:106-120 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:211-224 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:318-331 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:419-432 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a17a94904e793a286b43c2e9e87f8cf4335985742e7dfc5448b4f85d8e7cef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): crates/prime-radiant/src/simd/energy.rs:63-77 | crates/prime-radiant/src/simd/matrix.rs:207-220 | crates/prime-radiant/src/simd/vectors.rs:204-217 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/energy.rs:63\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce09b6fae5c030be5421ecf2beab3e050e751b41262075fcacdd5d3d985d35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): crates/ruvector-attention/src/sheaf/attention.rs:276-289 | crates/ruvector-attention/src/sheaf/attention.rs:331-345 | crates/ruvector-attention/src/sheaf/attention.rs:453-467 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/sheaf/attention.rs:276\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0aec0da2acb0b81b373d6f8af986cf8d475fb51588592b0ad8aa066ea421ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruvector-attention/src/sparse/flash.rs:67-81 | crates/ruvector-attention/src/sparse/linear.rs:120-134 | crates/ruvector-attention/src/sparse/local_global.rs:80-94 \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":"crates/ruvector-attention/src/sparse/flash.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"943aa1ee178e490f767c4b19d361d8255c51be090e09e0a685c44582e9a5f072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/ruvector-core/src/quantization.rs:552-564 | crates/ruvector-core/src/simd_intrinsics.rs:1284-1298 | crates/ruvector-core/src/simd_intrinsics.rs:1336-1348 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/quantization.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/quantization.rs:552\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:1333\u0060 calls \u0060vsubq_s16\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:1281\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d6926dfed9bf43b8ebe4a0e5f68eaf1444e2e1dd3d69b12448b3a249af814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:273-287 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:302-316 | crates/ruvector-turboquant/src/rotation.rs:197-209 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:273\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaa0816f35a8030b995db00db68c98dd758556b5de00606d7a7b0e8f745e86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruvector-namespace-merge/src/router.rs:44-58 | crates/ruvector-namespace-merge/src/router.rs:98-112 | crates/ruvector-namespace-merge/src/router.rs:263-277 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-namespace-merge/src/router.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-namespace-merge/src/router.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab7bf99300f6b20cf9aab47ff714fc03d631bd053c583d89861b2b628ffcdc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruvector-rairs/src/ivf.rs:61-75 | crates/ruvector-rairs/src/rairs.rs:75-89 | crates/ruvector-rairs/src/seil.rs:87-101 \u2014 before extracting anything, compare \u0060crates/ruvector-rairs/src/rairs.rs\u0060 and \u0060crates/ruvector-rairs/src/seil.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/ivf.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f968df9cb88f503ae9e4cac4ff8bcaf7789c919e7fa9bb8e5402d8ee74d98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruvector-spann/src/index.rs:155-169 | crates/ruvector-spann/src/index.rs:256-270 | crates/ruvector-spann/src/index.rs:386-400 \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":"crates/ruvector-spann/src/index.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b59d967c1fd3a4f042ab11bc2c374fd2f6decd1ca0caf5114cee2dad1ff135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruvector-wasm/kernels/rmsnorm.rs:267-281 | crates/ruvector-wasm/kernels/rope.rs:240-254 | crates/ruvector-wasm/kernels/swiglu.rs:212-226 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rmsnorm.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e526cc9cb462fd9bc55a00e126e28446e9cf76955538021c64414c0a3d6c708b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ruvllm/src/backends/coreml_backend.rs:1355-1369 | crates/ruvllm/src/backends/coreml_backend.rs:1414-1428 | crates/ruvllm/src/backends/coreml_backend.rs:1514-1528 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/coreml_backend.rs:1355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cff44db8952307ad96f2a53196d3c107f443a71e56b7f3ec0f0d0e7425a6d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1295-1309 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1497-1511 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1562-1576 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1295\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c67e4993294f85b9c8bf282c7b86ec12b70aef41421f9e06d9cfa30a48fff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/mcp-brain-server/src/cognitive.rs:129-143 | crates/ruvllm/src/quantize/quip.rs:662-676 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/cognitive.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bb318ec45b43e3185c384e112ad46b9ed2d1f98c12b5a4247f8f398fafaee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/prime-radiant/src/gpu/dispatch.rs:150-164 | crates/prime-radiant/src/gpu/dispatch.rs:208-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/gpu/dispatch.rs:150\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/dispatch.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e363b5ac3db9b8cca25a283b0455a2a4bfcd3cff5cd6424c2ee6f80bd225e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-acorn/src/index.rs:113-127 | crates/ruvector-acorn/src/index.rs:185-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/index.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0158a1dec5997e9b74d901b79a7d02a73fe840737e8fa694a2daf56a81bb1209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruvector-attention/src/moe/expert.rs:67-81 | crates/ruvector-attention/src/moe/expert.rs:129-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/moe/expert.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":"crates/ruvector-attention/src/moe/expert.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0c44a4ea9ab801e79ddf9f12d10a9e9b6488f0046c6c1108e609edf15d6c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): crates/ruvector-cnn/src/kernels/int8_scalar.rs:155-178 | crates/ruvector-cnn/src/kernels/int8_scalar.rs:267-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_scalar.rs:155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_scalar.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5151c843fede500e5ae348b8b713c1403424d5089bc88fffce1c0c9e6840bc92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruvector-cnn/src/simd/avx2.rs:316-330 | crates/ruvector-cnn/src/simd/avx2.rs:469-481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:316\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fee042c8a50df357f46fbb900295efc61e9edc264acbc3299980d79278f6394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:154-177 | crates/ruvector-cnn/src/simd/wasm.rs:120-143 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/wasm.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c552fb82a685e1bed7fb7ec5f8864c814ca6afbb6867a1acd253d190ea2846cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:221-235 | crates/ruvector-cnn/src/simd/neon.rs:310-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:221\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"658ecdbc1f31122c6deea2aed750d9b42bf83e0360f421899fc5b06d9416013a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-core/src/advanced_features/product_quantization.rs:436-450 | crates/ruvector-core/src/quantization.rs:671-685 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/advanced_features/product_quantization.rs\u0060 and \u0060crates/ruvector-core/src/quantization.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/product_quantization.rs:436\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/product_quantization.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e2efbab93dd6253a5757f54cd03fa311082554659882c82ed64a6df4d12feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:488-502 | crates/ruvector-core/src/simd_intrinsics.rs:705-714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71c2c39a144b3384eab7671fb0ea6891045d9ae0a2e0186b479479d3da9a09a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:585-599 | crates/ruvector-core/src/simd_intrinsics.rs:839-853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:585\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:835\u0060 calls \u0060vaddq_f32\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:583\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6984d7af7f0d176fbb0e52858b8a9e61d79a6c0e88731dc6f98113bb4c8cec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-core/src/storage.rs:162-176 | crates/ruvector-graph/src/storage.rs:169-183 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/storage.rs\u0060 and \u0060crates/ruvector-graph/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/storage.rs:162\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fec6f9ac7100dddc60139dae31a2a0bc1aa94bb1bc31f8944c2085fbc12492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-diverse-beam/src/search.rs:111-125 | crates/ruvector-diverse-beam/src/search.rs:269-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diverse-beam/src/search.rs:111\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-diverse-beam/src/search.rs:267\u0060 calls \u0060with_capacity\u0060 and \u0060crates/ruvector-diverse-beam/src/search.rs:109\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/search.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d3b66370f8e90415f2517cb6dcc6cde20553815108578cc21842df8186f545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:589-603 | crates/rvlite/src/cypher/parser.rs:579-593 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32c347eda5b4fd17773d10af01d4d03cf2e52d4e48c13d8e9f410c4b98300bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:279-293 | crates/ruvector-hailo-cluster/src/bin/embed.rs:275-284 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd45173c0bff2c8a4dc3f3f0edcd13a33497951faa60a5ba20d318ba4f0f003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-hailo/src/cpu_embedder.rs:147-161 | crates/ruvector-hailo/src/host_embeddings.rs:79-93 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo/src/cpu_embedder.rs\u0060 and \u0060crates/ruvector-hailo/src/host_embeddings.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":"crates/ruvector-hailo/src/cpu_embedder.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5a0c28d1bcc22fbb3fec61fca5e4d97cddf1ccfe55ea2fea4110520086fc46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-hyperbolic-hnsw/src/tangent.rs:59-73 | crates/ruvector-hyperbolic-hnsw/src/tangent.rs:82-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hyperbolic-hnsw/src/tangent.rs:59\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw/src/tangent.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d38dc6ff96ab1d23195ce77b8ab3f16b42bf81d8f008ab7e56dd5b75d2d2b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:383-397 | crates/ruvector-kge-wasm/src/model.rs:383-397 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e227321ddf1f15df159617a312d4aa5d51f680ade8191491110ac278e6c9d03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruvector-math/src/product_manifold/manifold.rs:211-225 | crates/ruvllm/src/bitnet/rlm_embedder.rs:927-939 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/product_manifold/manifold.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61914f269f28a9109c6083083e422ec607b69c649873c1a8e02700abe535d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:362-378 | crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:479-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:362\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/flash_attention.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd3d9b4d20e59eb0c7b01301aa1cc502d769fbe1507baa74ba475352ba5b077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/rope.rs:217-231 | crates/ruvector-mincut-gated-transformer/src/rope.rs:272-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/rope.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":"crates/ruvector-mincut-gated-transformer/src/rope.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2888712f48c51848e9ebad73c20eca271343f34e35f3e81259ecc73a6b6cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/ruvector-mincut/src/algorithm/replacement.rs:192-206 | crates/ruvector-mincut/src/algorithm/replacement.rs:210-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/replacement.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"24df25c1b5c266c929a0eb62d16056733f603e49a3a55fcb780ce308f16bf29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruvector-mincut/src/canonical/mod.rs:498-512 | crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:181-193 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/canonical/mod.rs:498\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e7785ce1fe10aadefb5d6a7df92be4b6d19589335c147a94ebaa4f3a82c52f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201321 lines \u00D7 3): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:450-466 | crates/ruvector-profiler/src/config_hash.rs:52-61 | crates/rvf/rvf-types/src/sha256.rs:130-150 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-profiler/src/config_hash.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-profiler/src/config_hash.rs:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b2df06c9037df81ccd91e2701237fcc9973a4ba7da1585fab11b09ba2c08bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/ruvector-mincut/src/instance/bounded.rs:321-331 | crates/ruvector-mincut/src/instance/stub.rs:116-130 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/instance/bounded.rs\u0060 and \u0060crates/ruvector-mincut/src/instance/stub.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/instance/bounded.rs:321\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/instance/bounded.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b399747d038b63d9c654a7c547b50e36e883b237282a26758cdf9e22e104671f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/graph/cypher/executor.rs:248-262 | crates/ruvector-postgres/src/graph/cypher/executor.rs:271-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/executor.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ad66730ea61e50c65626cba0b2e0714eb37d0070abdfdb1e612af26c5cca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1233-1247 | crates/rvlite/src/sparql/executor.rs:608-622 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:1233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9ad2fe69374b5b1727e5d72077f7e7cd4470bdd1996e715d734f829fb9d221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:76-90 | crates/rvlite/src/sparql/parser.rs:99-113 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b359b2d779951f71d81df5de4793fac69cab9161662dedb9fe853d3dcf7a5a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:775-789 | crates/rvlite/src/sparql/parser.rs:813-827 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ce3b1219c584de3a2b63676c7940530059d11d717977964e7fbd974518802b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:933-947 | crates/rvlite/src/sparql/parser.rs:971-985 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf7de926dbe7188ca6bd90380f3d707ed8f6ae9d20b8b70828d411c5c55bf15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1801-1822 | crates/rvlite/src/sparql/parser.rs:1840-1861 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"22acb20322859baf6bf56ff5325ef8ffd1083f2612c2c6447ddf49b0a0b317ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2241-2255 | crates/rvlite/src/sparql/parser.rs:2280-2294 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8483d3a9d028e1118edd60b50aa10ac0b8b0585b3883ceb0f6b5196f3bce4f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2287-2301 | crates/rvlite/src/sparql/parser.rs:2329-2343 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:2287\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"22330b54f851b53625a5eecef0ba9b344fb03be29b7e6b298775cdfa57dd57c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/tenancy/validation.rs:176-190 | crates/ruvector-postgres/src/tenancy/validation.rs:222-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/tenancy/validation.rs:176\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/validation.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc969d7396443ffca9d669c367d7e14f2d967c441d0fc386e400cd71e875e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/types/scalarvec.rs:75-89 | crates/ruvector-postgres/src/types/scalarvec.rs:101-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/scalarvec.rs:75\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/scalarvec.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e403f2e5f8b7cb2e2f7cef5d97d6135953fb87db21419d3a2b0cf6e078f248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruvector-rairs/src/kmeans.rs:33-45 | crates/ruvllm/src/claude_flow/reasoning_bank.rs:831-845 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rairs/src/kmeans.rs:33\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/kmeans.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd99b7f8bdb2c13345feaccde2b27f29f473ed15ea30503fbc52864f68600af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-rulake/src/cache.rs:735-749 | crates/ruvector-rulake/src/cache.rs:806-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/cache.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"4218a91973a9cb0b20cf464d48b1ad906a2525c5bff8f57bc0aa920459bb7cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-solver/src/cg.rs:145-159 | crates/ruvector-solver/src/cg.rs:166-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 \u0060crates/ruvector-solver/src/cg.rs:145\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060alpha\u0060 to \u0060f32\u0060 in one and \u0060f64\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fecb11bb06f7d740f40700e03b3793d544decc3016822faa488fc6c7489940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvix/crates/bcm2711/src/mailbox.rs:562-576 | crates/ruvix/crates/bcm2711/src/mailbox.rs:597-611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/bcm2711/src/mailbox.rs:562\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mailbox.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1c23279a68273cfc26d0bc6644a455f52daae978435d1d83c58392e19ec492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvix/crates/bcm2711/src/mailbox.rs:714-728 | crates/ruvix/crates/bcm2711/src/mailbox.rs:749-763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/bcm2711/src/mailbox.rs:714\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mailbox.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c061cef505e877fffcd365614026c524125435f97b275ba15e46d0664ecb65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvix/crates/cli/src/commands/dtb.rs:575-589 | crates/ruvix/crates/cli/src/commands/dtb.rs:621-635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:575\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edaf58ade9b6823ec238a8ecad78c6b814a2b56d051005136731959d1c74389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/ruvllm/src/backends/phi3.rs:283-293 | crates/ruvllm/src/models/ruvltra.rs:523-537 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/phi3.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/ruvltra.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bc708ad02923034c304330625f8657418a8eab7aab15c2fd86383b33162e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:1575-1589 | crates/ruvllm/src/bitnet/backend.rs:2082-2092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:1575\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e9541b52563a0d2f0e9258c3cdb3ef4bb93a8cff2cf82dd61f0108da98686f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvllm/src/bitnet/tl1_avx2.rs:54-68 | crates/ruvllm/src/bitnet/tl1_wasm.rs:56-70 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/bitnet/tl1_avx2.rs\u0060 and \u0060crates/ruvllm/src/bitnet/tl1_wasm.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/tl1_avx2.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda3279e61dda42ada1b45aee09ed279299fd4a67559dc3a6796a31b99609a2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruvllm/src/claude_flow/hooks_integration.rs:505-517 | crates/ruvllm/src/claude_flow/hooks_integration.rs:684-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/claude_flow/hooks_integration.rs:505\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/hooks_integration.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76a67ba455b48254c08abd94416ffdd873437058568be0e901f43bac9d57ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvllm/src/claude_flow/reasoning_bank.rs:492-506 | crates/ruvllm/src/claude_flow/reasoning_bank.rs:891-905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/claude_flow/reasoning_bank.rs:492\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"11818214dd7e78d7eebeeec95b5fd58d9c3c18f55fb0c7ec5f693dde10298339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruvllm/src/context/semantic_cache.rs:254-268 | crates/ruvllm/src/context/semantic_cache.rs:303-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/context/semantic_cache.rs:251\u0060 calls \u0060write\u0060, \u0060Some\u0060, \u0060get_mut\u0060 and \u0060crates/ruvllm/src/context/semantic_cache.rs:300\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/semantic_cache.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"530e1725c9217482deb98149db7fb5f9400687bbe24d439299034cfa8ba9e7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/ruvllm/src/kernels/activations.rs:552-566 | crates/ruvllm/src/kernels/attention.rs:1840-1852 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/kernels/activations.rs\u0060 and \u0060crates/ruvllm/src/kernels/attention.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/activations.rs:552\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/activations.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a756f0dbb1deaf4653a07c45370024e97f1140c4b5ca89a3763a36cc0b8f56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:1675-1689 | crates/ruvllm/src/kernels/attention.rs:1726-1739 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.rs:1675\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7aaf58568e50f3470ae683d64135ad38490b76a6b620dc74b841c3086518ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvllm/src/metal/context.rs:868-882 | crates/ruvllm/src/metal/context.rs:941-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 \u0060crates/ruvllm/src/metal/context.rs:868\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"040944f0245d233485901248a67a766c9a7e5a2e9ff8d61be65efdbe11058858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvllm/src/serving/engine.rs:212-226 | crates/ruvllm/src/serving/engine.rs:252-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/serving/engine.rs:212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0b3ed863e9ea14b9332b93510a58d6bb9a0074c4b99a362e5094100ab376bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:258-272 | crates/ruvllm_sparse_attention/src/attention.rs:419-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 \u0060crates/ruvllm_sparse_attention/src/attention.rs:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"258790dbea56bf024d6a6d927e693a6f11570edd977fdd18a43bf6b21b9e2ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rvf/rvf-ebpf/src/lib.rs:424-438 | crates/rvf/rvf-ebpf/src/lib.rs:496-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf/rvf-ebpf/src/lib.rs:441\u0060 calls \u0060infer_program_type\u0060 and \u0060crates/rvf/rvf-ebpf/src/lib.rs:512\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-ebpf/src/lib.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"905d64c5cede5543acfbfbd9dac7e9119cd99c60d18f57acff789d0d2f87dc74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rvf/rvf-import/src/bin/rvf_import.rs:69-83 | crates/rvf/rvf-import/src/bin/rvf_import.rs:85-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-import/src/bin/rvf_import.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a352d70c5d40336c838f36124b3efcb5776b1469626b0b5893d1667097738a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rvf/rvf-index/src/distance.rs:143-157 | crates/rvf/rvf-index/src/distance.rs:258-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/distance.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/distance.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6228108860deb7dbd6a15f5ae2789a1be179b83451343ebfa8e4b0ae22083382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:354-368 | crates/rvf/rvf-runtime/src/store.rs:442-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"127dfc9fb17202701d7539fafd3c7a863d650f95ff16bbfc20d1e354cdfa58f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201315 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:2264-2270 | crates/rvf/rvf-runtime/src/store.rs:2355-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 \u0060crates/rvf/rvf-runtime/src/store.rs:2264\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e35f980dd756b78c86fc2c1a08f53abf56bb20ad7b466ae9a00cdc704e2e1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/rvm/crates/rvm-hal/src/aarch64/uart.rs:202-216 | crates/rvm/crates/rvm-hal/src/aarch64/uart.rs:226-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060val\u0060 to \u0060u64\u0060 in one and \u0060u32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/uart.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49984470ed4db4b775e05c7ede20cc124eeef8591938b80215fa272ea436d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rvm/crates/rvm-kernel/src/lib.rs:1001-1015 | crates/rvm/crates/rvm-kernel/src/lib.rs:1037-1051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvm/crates/rvm-kernel/src/lib.rs:1001\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"5865e446407fb888b212acc3ba3ff55c165184c9aea583be9eb266e6cccd8c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/rvm/crates/rvm-witness/src/replay.rs:72-86 | crates/rvm/crates/rvm-witness/src/versioned.rs:338-348 \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":"crates/rvm/crates/rvm-witness/src/replay.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e00e6f97d2c1679519b71af14ffe05cc75dadf972cebc497f5d64356c92557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:459-485 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:596-622 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f0d09c7ebb336fa947cc6ff62ecbd8f96fe2ada0fbc58578cba8193f7ca119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:939-958 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1135-1154 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"195638406edddb4b268a0002de5a0ffb3e8b678efbb99695eed9e0cede2506e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2411-2425 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2929-2943 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2411\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82d1b04600cfb0405ad101f0fb01212496bd85ef73f091bed81ff0f1a1c9b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:313-327 | patches/candle-core-0.9.2/src/device.rs:416-430 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43b15754d24b765fc8efc3409fa51725442207dc007957ca7776da0ded3d2e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:330-344 | patches/candle-core-0.9.2/src/device.rs:433-447 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2ed2dc64e68ec6f2cdd5d462d382bcc785f4dd089ead90ccc621e90acbc06c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:863-877 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:908-922 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:863\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, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:923\u0060 calls \u0060drop\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:878\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"04be5be8f93552ba38a20ad2b3f8d30a56ac3dd3b5f65f8fd7c813f77f842605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1173-1187 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1226-1240 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a49570b28dae1228c717fbf69126d756c1a189797e9782be492bb33a69d0ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1215-1229 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1269-1283 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"22021d08308918fc4f79744a88a90ac0071eee39be714cb7770d068d9d0664cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1609-1623 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1760-1774 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb462b09431aafdbac74dbea8119c18ee433345d36c3c30e26bad34c5e95adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:354-370 | patches/candle-core-0.9.2/src/npy.rs:381-397 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"add6a3c4b0bc2b8b6fd95c26cea6883505a0f0183a7394568d5b51196b68e054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:328-342 | patches/candle-core-0.9.2/src/pickle.rs:339-353 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24b7e8c4113f5137aa99435eba7f4f3b86d28bd6a3800796ef67c7bb55f2683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:310-324 | patches/candle-core-0.9.2/src/quantized/cuda.rs:350-364 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"481007df1d25fcf0c7eb0e6b9e33d717d2e14523857fefe05d435b07b5123f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:326-340 | patches/candle-core-0.9.2/src/quantized/cuda.rs:366-380 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"73801d3203d93911884e40ec449875f68a1560476cea074a3f7ecebdeaab6c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:44-58 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:44-58 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"accc86f75f35532fac6bf34402dbd1d9958099a0fbd9ad8546c80a2b8c1b03a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:66-80 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:67-81 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs:66\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0214f4b644fe0305195d47f6b7eba08aa9ba85c0d9e1341e35dea3f2a74c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:92-106 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:93-107 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e3b553905f2300643470e26f6e68ce6efc721424caf4bf1531875f6c650076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201315 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:960-974 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1102-1105 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1068-1082 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1305-1308 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:960\u0060 it begins part-way through the construct above it, so those exact 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50538569aa8e1a863a34c6b18619af5e8d68909595ffe0c9f0dc80c9f0da895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/metal.rs:213-227 | patches/candle-core-0.9.2/src/quantized/metal.rs:373-387 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/metal.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":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f53196d36a26c194151a6bf153028b5af019ed8b8a82f588cfe6308f48fd5e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:42-56 | patches/candle-core-0.9.2/src/quantized/mod.rs:60-74 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"135a3dabc0cbdf86ab5600fbda936fc48ca066e632585c6aec973c6f66489b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:153-167 | patches/candle-core-0.9.2/src/quantized/mod.rs:274-288 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"671083e551c5865db60284c7a23bba45b61a9356d17b745aecf1d867236e10ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:174-188 | patches/candle-core-0.9.2/src/quantized/mod.rs:297-311 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b463d9159858536484a6d8109fda2a7bd2e9d20f3d3e8ae349f4f100ae27e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/neon.rs:51-64 | patches/candle-core-0.8.4/src/quantized/neon.rs:83-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:51\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":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"166959e5eb57c6530a6595a1d5ade5edb67e245de66cf0b1547f378c36f32aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:77-91 | patches/candle-core-0.9.2/src/storage.rs:86-100 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8203ffbd9a3b4a5fc7f0bcb7bd6d0ec530f16515bf8a21b1be11eb10157693a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:94-108 | patches/candle-core-0.9.2/src/storage.rs:103-117 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"197467edc7c78217da6334374a5fa0cc97a650cb533935440e5fd750573e916a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:111-125 | patches/candle-core-0.9.2/src/storage.rs:120-134 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a99e25c9fe89d410c161730d1b1463189c8a7e2051d00679004efc483b829a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:163-177 | patches/candle-core-0.9.2/src/storage.rs:172-186 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"981532f8da687d1b45cf5b402f6781fb1f2926157e907926488aafda63e29a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:180-194 | patches/candle-core-0.9.2/src/storage.rs:189-203 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4202014a5b994a65accc6ef096b99da8451887f1a03e17ecb2a240528f574d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:197-211 | patches/candle-core-0.9.2/src/storage.rs:206-220 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"989af8112a01179c9140279b3d141520617670955c43277b297070c8c978042a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:312-326 | patches/candle-core-0.9.2/src/storage.rs:321-335 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"55acabfb86dac44c0b43bd77619f5e4ddcc9ff9aa13baa4f81d9401a9552ab10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:492-506 | patches/candle-core-0.9.2/src/storage.rs:501-515 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"201e39f023b8225ee4e70f12f5f566200f3170d4dcc072d040be712a9f4d2225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:514-528 | patches/candle-core-0.9.2/src/storage.rs:523-537 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0ad36ec7ed82639b3a7d798fa3474fba968f3fdda7575b8ecd1c2bd1473414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:531-545 | patches/candle-core-0.9.2/src/storage.rs:540-554 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"234aa86011c003cc82b53a45cd7274eb2c5bb047ef413d2405fafd67f53935b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:548-562 | patches/candle-core-0.9.2/src/storage.rs:557-571 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5552c971999a6ac69e74d15a992f270d80a67d48ec3dfeb05c1acf3cc713eec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1175-1189 | patches/candle-core-0.9.2/src/tensor.rs:1356-1370 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1175\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"062d07296d797e4a9faf7735e6005eb004a0526e30f4323ff22468a482a49de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1213-1227 | patches/candle-core-0.9.2/src/tensor.rs:1394-1408 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1213\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b72deeb015e843d7413dd67413d5ae66990ec6ce9d729f09f3f659c54d92c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2027-2041 | patches/candle-core-0.9.2/src/tensor.rs:2351-2365 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b20699fc70efef9779bde5981ac7d2829c8fd30408ad0011cbc9d7e71766aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/k_quants.rs:314-328 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:525-538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c4b53c138964cf6644f0654e6672643098cf4c54b87a3df7364e2db01d27ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/hnsw_rs/src/flatten.rs:75-89 | scripts/patches/hnsw_rs/src/flatten.rs:75-89 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/flatten.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/flatten.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/flatten.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1ba4ce42e189aee24e773e428b308321cba4d53544b092b6bd06cc5686614c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1749-1763 | scripts/patches/hnsw_rs/src/hnsw.rs:1635-1649 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6cdb9eb9707174a219dc24c8deadabdfdb6dce7b6ddf047a02f9694a482f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1771-1785 | scripts/patches/hnsw_rs/src/hnsw.rs:1657-1671 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ca756d78b6098267d570e43fdbe6501f42a0fb302d979dae018474bc903efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 7): crates/ruvector-temporal-tensor/src/f16.rs:65-78 | crates/ruvllm/src/bitnet/backend.rs:3500-3512 | crates/ruvllm/src/bitnet/gguf_export.rs:69-82 | crates/ruvllm/src/gguf/quantization.rs:1037-1050 | crates/ruvllm/src/kernels/quantized.rs:921-934 | crates/ruvllm/src/quantize/quip.rs:725-737 | crates/ruvllm/src/quantize/ruvltra_quant.rs:895-908 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/quantize/quip.rs\u0060 and \u0060crates/ruvllm/src/quantize/ruvltra_quant.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/f16.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/f16.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa11cdae10ee8e5094d3399b98b3cec930e8cb4c05ba5a52f7cc5177b8a0b5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 5): crates/ruvector-temporal-tensor/src/quantizer.rs:320-331 | crates/ruvector-temporal-tensor/src/quantizer.rs:358-369 | crates/ruvector-temporal-tensor/src/quantizer.rs:435-446 | crates/ruvector-temporal-tensor/src/quantizer.rs:531-542 | crates/ruvector-temporal-tensor/src/quantizer.rs:617-630 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/quantizer.rs:320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9401192d58c844f704e676e0d8c4d561451d08f63796fdd4282f2b1688a003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/prime-radiant/src/substrate/edge.rs:212-225 | crates/prime-radiant/src/substrate/edge.rs:273-286 | crates/prime-radiant/src/substrate/edge.rs:333-346 | crates/prime-radiant/src/substrate/node.rs:88-101 \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":"crates/prime-radiant/src/substrate/edge.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6e3f8ad88b52e7eb973778f948b3004644f65fe8c69f30486f46c9db7036db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): crates/ruvector-cnn/src/simd/neon.rs:22-35 | crates/ruvector-core/src/simd_intrinsics.rs:656-669 | crates/ruvector-core/src/simd_intrinsics.rs:736-747 | crates/ruvector-core/src/simd_intrinsics.rs:865-876 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:673\u0060 calls \u0060vsubq_f32\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs:38\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"28964d7967d07550e3c36e1157ab39cf1087e3a06f1966e599b28c352e23504b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): crates/ruvector-cnn/src/simd/neon.rs:33-46 | crates/ruvector-core/src/simd_intrinsics.rs:745-758 | crates/ruvllm/src/kernels/attention.rs:1775-1787 | crates/ruvllm/src/kernels/matmul.rs:1202-1215 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba34e530424e186a5f692e8802968648348db4657787298907e3304209e8518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/ruvector-postgres/src/distance/simd.rs:189-202 | crates/ruvector-postgres/src/distance/simd.rs:545-558 | crates/ruvector-postgres/src/distance/simd.rs:682-695 | crates/ruvector-postgres/src/distance/simd.rs:1423-1436 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:189\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ce9ae04c622c0ef73ae08c562081637031fcef9f5810f10a4c0a223b1fd215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/ruvector-postgres/src/graph/sparql/executor.rs:462-475 | crates/ruvector-postgres/src/graph/sparql/executor.rs:529-542 | crates/rvlite/src/sparql/executor.rs:341-354 | crates/rvlite/src/sparql/executor.rs:406-419 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:462\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea79efa638bbd7613b908d1fd890cd32101f21f126a712743121436bcc706755"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): patches/candle-core-0.8.4/src/metal_backend/mod.rs:200-213 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:251-264 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:217-230 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:270-283 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:200\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac0515bd0eb69536aa44da0313e5973019fad84ae51d4621fd001d3b69b2d6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): patches/hnsw_rs/src/libext.rs:512-525 | patches/hnsw_rs/src/libext.rs:606-620 | scripts/patches/hnsw_rs/src/libext.rs:512-525 | scripts/patches/hnsw_rs/src/libext.rs:606-620 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/libext.rs:512\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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c66c39b6cd0f04e649cb95471fa21b7e3a61dfa6c538d661268bf7c15547c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/ruvector-attention/src/transport/centroid_ot.rs:164-176 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:104-116 | crates/ruvector-math/src/product_manifold/manifold.rs:179-192 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/transport/centroid_ot.rs\u0060 and \u0060crates/ruvector-math/src/optimal_transport/sinkhorn.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/transport/centroid_ot.rs:164\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 \u0060a\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":"crates/ruvector-attention/src/transport/centroid_ot.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc3b9f664e5c713f9dc6552c640b5c0b277a2e42216cdd67ab53ca65358c3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:167-180 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:270-283 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:374-387 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b1c6decca28c0aa396082335ef89bf3eff04048c2df8727154e16a3d9bc878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/ruvector-cnn/src/kernels/int8_wasm.rs:38-51 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:166-178 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:336-347 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_wasm.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2de66175d09405f676a5403c1a5a1180a51b39c1abb55069c934ac47e116178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ruvector-core/src/advanced_features/matryoshka.rs:233-246 | crates/ruvector-core/src/advanced_features/matryoshka.rs:363-376 | crates/ruvector-core/src/advanced_features/matryoshka.rs:395-408 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/matryoshka.rs:233\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/matryoshka.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"282b6c1ab1ba58a4c9ff328bc7e35dcf4ec89b38d720b737ba7345c2e8ccd7fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/ruvector-graph-transformer-node/src/transformer.rs:987-998 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:1054-1065 | crates/ruvector-graph-transformer/src/temporal.rs:430-443 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"541d92c95f0c9a6748a5b27cce401ec3029a6e5bb6f6ea8f5538075f9de3f3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/bench.rs:283-302 | crates/ruvector-hailo-cluster/src/bin/embed.rs:279-293 | crates/ruvector-hailo-cluster/src/bin/stats.rs:229-243 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6c38caf25e5324b5e4d826478d256fd123d0c1aa7d516432333303349f1950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ruvector-lsm-ann/src/bin/benchmark.rs:123-136 | crates/ruvector-lsm-ann/src/bin/benchmark.rs:174-187 | crates/ruvector-lsm-ann/src/bin/benchmark.rs:224-237 \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, \u0060crates/ruvector-lsm-ann/src/bin/benchmark.rs:173\u0060 calls \u0060compact\u0060 and \u0060crates/ruvector-lsm-ann/src/bin/benchmark.rs:122\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-lsm-ann/src/bin/benchmark.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2690109812093e40381d14985835e6d7acae1390780b06d32e7c1e21dc4a7f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/ruvector-mincut-gated-transformer/src/attention/window.rs:177-190 | crates/ruvector-mincut-gated-transformer/src/attention/window.rs:339-351 | crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:433-445 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut-gated-transformer/src/attention/window.rs\u0060 and \u0060crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/attention/window.rs:177\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/window.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4358b13a2e017aebd1288e746ad04acffec460eda75cfbcb945de276572ae22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ruvector-postgres/src/distance/simd.rs:1301-1314 | crates/ruvector-postgres/src/distance/simd.rs:1384-1397 | crates/ruvector-postgres/src/distance/simd.rs:1465-1478 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:1315\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs:1479\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fa005ffa34279e7f3ef7dc1f970e31293d48f4abcb8a4993e32d42fbea7adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ruvllm-wasm/src/workers/pool.rs:729-742 | crates/ruvllm-wasm/src/workers/pool.rs:896-909 | crates/ruvllm-wasm/src/workers/pool.rs:1007-1020 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/pool.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4738d1724e460a91b2bf1fe3e95a3500005627143a158d6442fd942b244fd82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/ruvllm/src/backends/gemma2.rs:501-514 | crates/ruvllm/src/models/ruvltra.rs:621-634 | crates/ruvllm/src/models/ruvltra_medium.rs:627-640 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 219 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:501\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"14edb3186e6d4a68d90f25ddddbf1360605137a0ef4993413c55a5218f3a8ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): crates/ruvllm/src/metal/operations.rs:466-479 | crates/ruvllm/src/metal/operations.rs:587-598 | crates/ruvllm/src/metal/operations.rs:699-710 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/operations.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7ae54f29337a39e996635794f930b5b8860fc78a03ad0d7cc4bb43ee60a9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 3): crates/rvf/rvf-cli/src/cmd/filter.rs:151-164 | crates/rvf/rvf-cli/src/cmd/freeze.rs:79-86 | crates/rvf/rvf-cli/src/cmd/rebuild_refcounts.rs:155-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/filter.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a1ca02488121201e6004da31613e44e35bf01ad059196bbdd90d11dbf9c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/simd128.rs:308-321 | patches/candle-core-0.8.4/src/quantized/simd128.rs:326-339 | patches/candle-core-0.8.4/src/quantized/simd128.rs:345-358 \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 \u0060patches/candle-core-0.8.4/src/quantized/simd128.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":"patches/candle-core-0.8.4/src/quantized/simd128.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad4d2349c41541bacb75ca59ba3f8387ff105670a9806bd5c8b42b8ec6e4987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/prime-radiant/src/coherence/history.rs:263-276 | crates/prime-radiant/src/coherence/history.rs:284-296 \u2014 both copies are in the same file, so extract the block 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":"crates/prime-radiant/src/coherence/history.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab0e89dbc6b2f90740726698685130cedd05b43ae66d2cb785e93db88de33a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/prime-radiant/src/governance/witness.rs:434-447 | crates/prime-radiant/src/ruvllm_integration/witness_log.rs:406-419 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/witness.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57b838274fbf58de73597ecdf3f981fb80b19bfe9bf05294fb6b538904554db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-bench/src/bin/comparison_benchmark.rs:229-242 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:287-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:229\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dcec704f73daac0b3b7770fd118c5faa631bbad5abf945e93a2b7c3e16dcfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-cnn/src/quantize/graph_rewrite.rs:310-323 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:354-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/quantize/graph_rewrite.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":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af8e808c5a9ca44b30b79e9ca277e014e435413f883c2f6754a4362b8b6b30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-cnn/src/simd/avx2.rs:25-38 | crates/ruvector-cnn/src/simd/avx2.rs:57-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:25\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"709bf412dc8277dbe1966ceac4f9a0e213c209e148505c3f7290fe0ff24f69b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:448-461 | crates/ruvector-cnn/src/simd/wasm.rs:427-440 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/wasm.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"286d398810551c3ba430922aadf3c6a4b3f00b59b48f545783ba5f32aa95ca3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201314 lines \u00D7 3): crates/ruvector-acorn/src/search.rs:54-56 | crates/ruvector-coherence-hnsw/src/search.rs:189-202 | crates/ruvector-coherence-hnsw/src/search.rs:293-306 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/search.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"332a0327efd75dda9c98be5c01eedaa9f7439795ca9b7a964f7db5f6abee69bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): crates/ruvector-consciousness/src/arena.rs:40-53 | crates/ruvector-solver/src/arena.rs:79-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-solver/src/arena.rs:88\u0060 calls \u0060as_mut_ptr\u0060, \u0060drop\u0060 and \u0060crates/ruvector-consciousness/src/arena.rs:53\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/arena.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"35902310aae73e7af656e24e790e7f5d86c8d869a50fb621cffec7fb0b4ec760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-consciousness/src/phi.rs:333-346 | crates/ruvector-consciousness/src/phi.rs:851-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b997ee4087403cb5ece05562ac189a77f1a407623557f82911f5a347f8877e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/ruvector-core/src/advanced_features/sparse_vector.rs:230-243 | crates/ruvector-core/src/advanced_features/sparse_vector.rs:392-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 \u0060crates/ruvector-core/src/advanced_features/sparse_vector.rs:230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/sparse_vector.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fae0ad9bc75cae6f2140d4d2d6ea582f9fc99b08823dce2993310361ee04d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-core/src/index/hnsw.rs:142-155 | crates/ruvector-core/src/index/turbo4.rs:301-314 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/index/hnsw.rs:142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/hnsw.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0136d3e0080a4cd57f4745e83315bbb14c68b1bdfb277cdf1d04c41f0c3c8c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-core/src/integration.rs:48-61 | crates/ruvector-core/src/integration.rs:175-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/integration.rs:48\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/integration.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ed70be4ec32c7a12c305161e3383cae6f926e0ab72883dc96e25d3f849afe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-edge-store/src/ops/vector.rs:285-298 | edge/gateway/src/vectors.rs:301-314 \u2014 before extracting anything, compare \u0060crates/ruvector-edge-store/src/ops/vector.rs\u0060 and \u0060edge/gateway/src/vectors.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/vector.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8223fac999aa332c888559c5e74c3ce93d848b69b5f4c0b25c8cd966d830bdab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-fpga-transformer/src/backend/native_sim.rs:293-306 | crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:68-81 \u2014 before extracting anything, compare \u0060crates/ruvector-fpga-transformer/src/backend/native_sim.rs\u0060 and \u0060crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"253dd6daf3cc92680fa11e4b2e2b0423b14b588df005e4bc5bfec3d42fbc097e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:109-122 | crates/ruvector-py/src/graph/cypher_eval.rs:96-109 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6062632363a1d6691f88293fb4226ad15c43cc69aebda04a484fe09d31f5bf74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:391-428 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:406-443 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eccbe2dd91f8aecbf7197de1cf80fe0b9755284ca3bc402ed2b22a6a24808e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-graph-transformer/src/physics.rs:606-619 | crates/ruvector-graph-transformer/src/physics.rs:730-743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/physics.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e3f33ad6b61766c622c4b76a332aaed261cb689586129259d3742dd86a66c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-graph/src/hybrid/vector_index.rs:106-119 | crates/ruvector-graph/src/hybrid/vector_index.rs:126-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/hybrid/vector_index.rs:106\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/hybrid/vector_index.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"498284a3c6a9ecf6a6a56fc6c33849b7b093cbc24aa7699bb9dc960bccebf0de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:182-195 | crates/ruvector-hailo-cluster/src/bin/embed.rs:142-155 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:182\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3d99e1056c344f42a9dba150a58d3becb366d57fcc6f9bb0ee4be051106100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/ruvector-math/src/information_geometry/fisher.rs:165-178 | crates/ruvector-math/src/information_geometry/kfac.rs:204-215 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/information_geometry/fisher.rs\u0060 and \u0060crates/ruvector-math/src/information_geometry/kfac.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/information_geometry/fisher.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/fisher.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e558ae835db01e66665457aeacb93cbb7e2f9db73a3d64831752f8b92d842f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-math/src/product_manifold/manifold.rs:345-358 | crates/ruvector-math/src/spherical/mod.rs:129-142 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/product_manifold/manifold.rs\u0060 and \u0060crates/ruvector-math/src/spherical/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b627891ae178f86fb8d3e2231a78e6c70e56ba410e725e2281944edc359febc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/attention/window.rs:299-312 | crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:245-258 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut-gated-transformer/src/attention/window.rs\u0060 and \u0060crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/attention/window.rs:299\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/window.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dfd56d31f3a69623a57f0de93becd8b0fe6b5fa245d2bb07c03c1a56c1ec26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:360-373 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:393-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:360\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23dd70f125acdd42acd0cc8a459bde77d81c0536c39e8f976ed63c81bb2b602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-mincut-node/src/lib.rs:76-89 | crates/ruvector-mincut-node/src/lib.rs:103-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/lib.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1041b2ff4c9080d803c5aa3d25c7618cd074c3d6896ecc8129a51b927a87ecbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-mincut/src/optimization/parallel.rs:458-471 | crates/ruvector-mincut/src/optimization/parallel.rs:489-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/optimization/parallel.rs:458\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/parallel.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b186cf243bf3caf3f34c039d9415a5f1479ac575cf6062a552d74269486784e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-mincut/src/subpolynomial/mod.rs:434-447 | crates/ruvector-mincut/src/subpolynomial/mod.rs:536-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/subpolynomial/mod.rs:434\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcff50cd37b13d38908cf7ab15a07220fb66bbfa3f2df03507ae00232a3b17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/workspace.rs:218-231 | crates/ruvector-nervous-system-wasm/src/workspace.rs:245-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system-wasm/src/workspace.rs:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/workspace.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42ae815c21dae70142f146a70c188da1150cdcd998a83de0c629b96a8138c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruvector-postgres/src/attention/operators.rs:115-128 | crates/ruvector-postgres/src/attention/operators.rs:210-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/attention/operators.rs:115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a1e4e23a41263f283983661a6743efd638c139782007d8dfc9b2266e6cc7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:879-892 | crates/rvlite/src/sparql/executor.rs:502-515 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c040cdbfb2b4f8aa4d7c79c151b811785569047e74654eb92bc97f25af46d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1511-1524 | crates/rvlite/src/sparql/executor.rs:788-801 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdd4cd89239792091eb90473dd4773a7226b431fad4e79a21c301e705d89e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/functions.rs:483-491 | crates/ruvector-postgres/src/graph/sparql/functions.rs:509-522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/functions.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b261eb77c5f23f9c829ca7f21819186f69735ac262208dbded13f8294a0514e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:515-528 | crates/rvlite/src/sparql/parser.rs:546-559 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvlite/src/sparql/parser.rs:542\u0060 calls \u0060nested\u0060, \u0060parse_path_alternative_unguarded\u0060 and \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:514\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"914f2a896a3e36fb48ce3edbe397775baab99a0e8249a2ea46ddb1db62407fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:531-544 | crates/rvlite/src/sparql/parser.rs:562-575 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"57445343a8cb93a8a45ec77a9800d5bb4d214d2ee35fadc0b8db30849d29efd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:646-659 | crates/rvlite/src/sparql/parser.rs:684-697 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a61995c6cd9b2b59e49e2a0743c3cbb658ef45bd86ac72e7b17c7df165ac80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:662-675 | crates/rvlite/src/sparql/parser.rs:700-713 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd61edd130d5f6ff6b275da0611fd73d9005b76cd6a64a2d6e4a07d8b0ce382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1767-1780 | crates/rvlite/src/sparql/parser.rs:1806-1819 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1f23a8a1567550a934bda276cd7d26cefc221ddf920de4f880428ab81fbb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1861-1874 | crates/rvlite/src/sparql/parser.rs:1900-1913 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"af376016ea26dcac26a7d2ebe7b4f633a9b4c2b78e31d7b543ec9258b51fd2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1886-1899 | crates/rvlite/src/sparql/parser.rs:1925-1938 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bf1ec223a21f4c1fbac415f1db2ddb3b99382b229905d82074829ebdc26bdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruvector-postgres/src/sparse/distance.rs:23-36 | crates/ruvector-postgres/src/sparse/distance.rs:186-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/sparse/distance.rs:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/sparse/distance.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"11009807152e10a8e093c6da28510d8fbc47eb162faf2bcc7b5a72cf8c438522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-py/src/hnsw.rs:259-272 | crates/ruvector-py/src/rabitq.rs:425-438 \u2014 before extracting anything, compare \u0060crates/ruvector-py/src/hnsw.rs\u0060 and \u0060crates/ruvector-py/src/rabitq.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/hnsw.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae937ba4292c84745cbf1d7aca46920360d7041cd85316a53ea5615a1ad737a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-py/src/sona.rs:110-123 | crates/ruvector-py/src/sona.rs:149-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/sona.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"297aa30a2e9ea04525b1541006d3e1562bc4fef6568706290e0292e91d428ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-robotics/src/perception/obstacle_detector.rs:128-147 | crates/ruvector-robotics/src/perception/scene_graph.rs:104-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-robotics/src/perception/obstacle_detector.rs:128\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/perception/obstacle_detector.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e6f680c792eb29120d41d66c4428dc19a14397ace989da1cbea698b299a7db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-solver/src/neumann.rs:374-387 | crates/ruvector-solver/src/true_solver.rs:564-577 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-solver/src/true_solver.rs:584\u0060 calls \u0060iter\u0060, \u0060collect\u0060 and \u0060crates/ruvector-solver/src/neumann.rs:390\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/neumann.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26ca62cc74a7b5852c0362f0f004ad80915400343abb9afd407417f842e54cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruvector-solver/src/random_walk.rs:390-403 | crates/ruvector-solver/src/random_walk.rs:501-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/random_walk.rs:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/random_walk.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4b8dfc94ff3b85aa59a2e2928bd169085113103143464a6086d4b3f6e53fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-sota-bench/src/bin/sift1m_bench.rs:39-52 | crates/ruvector-sota-bench/src/bin/sift1m_bench.rs:74-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sota-bench/src/bin/sift1m_bench.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sift1m_bench.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e421748d0de8b2abaab876b88fc041be3b2846c23a425b0d9ead3e83fdaf5096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-sparse-inference/src/backend/cpu.rs:244-257 | crates/ruvector-sparse-inference/src/backend/cpu.rs:290-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/backend/cpu.rs:244\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-sparse-inference/src/backend/cpu.rs:260\u0060 calls \u0060_mm256_mul_ps\u0060, \u0060_mm256_fmadd_ps\u0060 and \u0060crates/ruvector-sparse-inference/src/backend/cpu.rs:304\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"98418fc1c6d1cff649301d424ccaae9a47a02211129140c92e18e043a405796a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-sparse-inference/src/integration/ruvector.rs:95-108 | crates/ruvector-sparse-inference/src/integration/ruvllm.rs:233-246 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/integration/ruvector.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bceeb21f15ff1bab23402336e79ff64acacf2e6ed288291d1a17ce4611b14c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-sparse-inference/src/precision/quantizers.rs:253-266 | crates/ruvector-sparse-inference/src/precision/quantizers.rs:314-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/precision/quantizers.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":"crates/ruvector-sparse-inference/src/precision/quantizers.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aa09cb5eb014f83d68e55506b7318128338a354d0ae453e9921de18253006a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-turboquant/src/rotation.rs:192-205 | crates/rvf/rvf-quant/src/rabitq.rs:104-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/rotation.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d547ddb6cdc3662aeabeaf147ff6f6dd8e37e9530e5d5c7f72c06a88c9a498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvix/crates/bcm2711/src/mailbox.rs:460-473 | crates/ruvix/crates/bcm2711/src/mailbox.rs:493-506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/bcm2711/src/mailbox.rs:460\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mailbox.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f19640f855ef66d17a6a68a72346949acb2cd9b7dc851d64eb68c48437948b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruvix/crates/rpi-boot/src/early_uart.rs:212-225 | crates/ruvix/crates/rpi-boot/src/early_uart.rs:229-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060u64\u0060 in one and \u0060u32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/rpi-boot/src/early_uart.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa4b9fad506280ba394a64b1c5ae25efb7caf7bf414ebcf8c0cb116b1bd6c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvix/crates/shell/src/commands/mem.rs:9-22 | crates/ruvix/crates/shell/src/commands/vectors.rs:9-22 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/shell/src/commands/mem.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"872d414b88ccac7506ea736c4d1cc3dbdb87e7b5e12fe8558f7dd36e3483a23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/ruvllm/src/gguf/quantization.rs:565-578 | crates/ruvllm/src/gguf/quantization.rs:615-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/gguf/quantization.rs:565\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5b50e0232e94063a751057fd70932667435046d458e7e5aa38bd1b03675d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvllm/src/hub/download.rs:502-515 | crates/ruvllm/src/hub/progress.rs:159-172 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/hub/progress.rs:176\u0060 calls \u0060as_secs\u0060 and \u0060crates/ruvllm/src/hub/download.rs:519\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/download.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3277541f9be9980f4e29cb106289bb94490b183c34b8f9714f6b64562876e3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/ruvllm/src/kernels/norm.rs:104-117 | crates/ruvllm/src/kernels/norm.rs:441-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/norm.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"01097808590523834d258a1cb5b132f992613a3041fca1fbfe8544ea8a1d3c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvllm/src/metal/context.rs:186-199 | crates/ruvllm/src/metal/context.rs:242-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5404699193cb8e510936557ce1d58a2697664b6b6473f907ad5ce2ef169fac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruvllm/src/quantize/hadamard.rs:638-651 | crates/ruvllm/src/quantize/hadamard.rs:664-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/hadamard.rs:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"e693cf556746247611925b6448847eea89c8a018e730bc689fa47c82886079d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvllm/src/quantize/pi_quant.rs:710-723 | crates/ruvllm/src/quantize/pi_quant.rs:757-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"15401597650052446c86eee5180b2f6c67f913d2ad45a5a4cafe121f023a19af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ruvllm/src/quantize/ruvltra_quant.rs:662-675 | crates/ruvllm/src/quantize/ruvltra_quant.rs:743-755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/ruvltra_quant.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"5291e123d4b50fa07c663265b691e84ade4600a27bd12ff46efb389cc85b83d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:941-954 | crates/ruvllm_sparse_attention/src/attention.rs:1233-1246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f6e370498a201160703291e6164a33cd633def89bdf9a0c69bba1f30ec5217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/rvAgent/rvagent-core/src/graph.rs:378-391 | crates/rvAgent/rvagent-core/src/graph.rs:417-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/graph.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d540b6cc33b122547007a62bb10a72412810819c9b4894478e333feac9d250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rvAgent/rvagent-wasm/src/mcp.rs:778-791 | crates/rvAgent/rvagent-wasm/src/mcp.rs:808-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-wasm/src/mcp.rs:778\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/mcp.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce226f8a4430068e1172b5aa0c0ed94f53ba4e9667004254da9b6782f6addf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/rvf/rvf-ebpf/src/lib.rs:442-455 | crates/rvf/rvf-ebpf/src/lib.rs:512-524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-ebpf/src/lib.rs:442\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-ebpf/src/lib.rs:441\u0060 calls \u0060infer_program_type\u0060 and \u0060crates/rvf/rvf-ebpf/src/lib.rs:510\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-ebpf/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e6aeb10e21676efd698e1debb5a17de88d4df8a21cab65f259715c8ee6eb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:2604-2617 | crates/rvf/rvf-runtime/src/store.rs:2716-2726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:2604\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e089e669ac5e1db23b2e44fa8be7974bc8da4faac8677aa3a00afd6c2d2c2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rvf/rvf-solver-wasm/src/alloc_setup.rs:17-30 | crates/rvf/rvf-wasm/src/alloc_setup.rs:17-30 \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":"crates/rvf/rvf-solver-wasm/src/alloc_setup.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7357a5db9a5fd3201261d4ba5b464b2f0f778c6d42fd58053093d1cfc0a21f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rvlite/src/cypher/executor.rs:347-360 | crates/rvlite/src/cypher/executor.rs:412-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060pattern\u0060 to \u0060\u0026NodePattern\u0060 in one and \u0060\u0026RelationshipPattern\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/executor.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbbb29516747d30f2ef962a08ec38e48c303ddafd67dae02dbcf6b3d0b37721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rvm/crates/rvm-types/src/witness.rs:151-164 | crates/rvm/crates/rvm-types/src/witness.rs:368-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-types/src/witness.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03854e9d05f00605f2254f02c6c0555f5071dbb2d1c519eb83c49787e82f3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/sona/src/export/huggingface_hub.rs:353-366 | crates/sona/src/export/mod.rs:186-199 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sona/src/export/huggingface_hub.rs:353\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/export/huggingface_hub.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"774b48ea1231765c6f7935a496d60e9949fefa6f504b97de111f07cd82261859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:301-314 | patches/candle-core-0.9.2/src/conv.rs:328-341 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/conv.rs:301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c984d08b34e7984d4a79b232b435be264bdec33afaf6b105fea624b6000a134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/mod.rs:150-173 | patches/candle-core-0.9.2/src/cpu/mod.rs:169-192 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1625ce61d02aebfa1700ab37e739d5ee524328fcab83b74700b1ee845c407a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:389-411 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:407-429 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1482139a8d6aff4668247077c60f08730df71bfbd1ef8452f45ec1f2e6ce7357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:484-493 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:537-550 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:484\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"563582288e7a5afca94b33d4c1f6fe5774f6e4592a4210878f441d7b8fd4eb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:532-541 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:643-656 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:532\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65f88414780b35f14e06fcb2522331e9bea7266643cd3f175642083318669ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:874-887 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1057-1070 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:874\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccb7051249b054dbf388cb141afc2c40e8eb9e0bbf4891d223dfaf503f7e5db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:361-374 | patches/candle-core-0.9.2/src/device.rs:464-477 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e533b9bd68105af818282ee0e89f87618ffe75e31f434dd24a6c9a148eff44e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:377-390 | patches/candle-core-0.9.2/src/device.rs:480-493 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f12c8ef2d69bed6dd526135b8c681b26310678a61b1106663e81ec143ad90da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:238-251 | patches/candle-core-0.9.2/src/quantized/cuda.rs:278-291 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d988a8b80fe66e0384ee132c5f4c8f5992fdb66b626bda5f3685ed22ac810a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:84-97 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:84-97 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs:84\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d834582c0dee045ef07aa0e5171d6cadc14802447e744ecd26a0a6563fb2a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:347-360 | patches/candle-core-0.9.2/src/safetensors.rs:502-515 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25bdd3a86f6f8eee877726792e25f9338922dbe129d3aa59dc3af8cc490dcc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/streaming.rs:77-90 | patches/candle-core-0.9.2/src/streaming.rs:77-90 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/streaming.rs\u0060 and \u0060patches/candle-core-0.9.2/src/streaming.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b2fc1ecc09eb9eaca77a2a37c472b1e917de8a0c5ff6d3cdb541bdbb5ed835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:872-888 | patches/candle-core-0.9.2/src/tensor.rs:940-956 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"5091610902f08b23710a7c223b4606f745f81f7018b428446d4823c1077b530b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2559-2572 | patches/candle-core-0.9.2/src/tensor.rs:2882-2895 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2221062112ca8ab3432d36219629fa873f0ef3e0052f6fe7f173e3685dae6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:821-834 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:870-883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:821\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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeb842601a5ddea7d9d6d62924c5feb96bb9bb2c606ff7f38d0fdb51de28b76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/mod.rs:509-522 | patches/candle-core-0.9.2/src/quantized/mod.rs:552-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/mod.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"1195773e24f669c7b0e654483075ada4a5b11ff84f89c9e555e97c6126265583"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:244-257 | scripts/patches/hnsw_rs/src/hnsw.rs:244-257 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e317831249d371e05434fc254ff0775b26f17c8c4089b835c59becbe297a5974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 11): crates/prime-radiant/src/attention/adapter.rs:147-158 | crates/ruvector-attention/src/curvature/fused_attention.rs:288-299 | crates/ruvector-attention/src/curvature/tangent_space.rs:177-188 | crates/ruvector-attention/src/info_geometry/fisher.rs:172-183 | crates/ruvector-attention/src/pde_attention/diffusion.rs:186-197 | crates/ruvector-attention/src/topology/gated_attention.rs:250-261 | crates/ruvector-attention/src/transport/cached_projections.rs:78-89 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:299-310 | crates/ruvector-diskann/src/distance.rs:349-352 | crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:131-143 | crates/ruvector-solver/src/cg.rs:120-131 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/attention/adapter.rs\u0060 and \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\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":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73c90840bfb9815a5133fb054e92869e6f01da56da94d387c6391fbbc8b774a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): crates/mcp-brain-server/src/routes.rs:6746-6758 | crates/mcp-brain-server/src/routes.rs:6782-6794 | crates/mcp-brain-server/src/routes.rs:6837-6849 | crates/mcp-brain-server/src/routes.rs:6893-6905 | crates/mcp-brain-server/src/routes.rs:6940-6952 | crates/mcp-brain-server/src/routes.rs:7045-7057 | crates/mcp-brain-server/src/routes.rs:7228-7240 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-brain-server/src/routes.rs:6835\u0060 calls \u0060Json\u0060 and \u0060crates/mcp-brain-server/src/routes.rs:6744\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6746}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d39259f0e5cfabbbb4633f7de4f905a974e9893566f7fcd85534ebc819bfb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): crates/ruvector-hailo-cluster/src/bin/bench.rs:202-214 | crates/ruvector-hailo-cluster/src/bin/embed.rs:202-214 | crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:171-183 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:232-244 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:147-159 | crates/ruvector-hailo-cluster/src/bin/stats.rs:147-159 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:202\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f153dd2965a4985db837d4cbba2f56357f55a660565483f7d909601333f1e369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201313 lines \u00D7 9): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2222-2234 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2324-2336 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1370-1382 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1484-1496 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:899-901 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1090-1092 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2746-2758 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:945-947 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1142-1144 \u2014 \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 90 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4f0bed1b16b3307755663bd75e5a2e362aa28b83e6dda07741b9b1aa9dfc1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): crates/ruvector-attention/src/transport/centroid_ot.rs:162-173 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:102-113 | crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:193-204 | crates/ruvector-math/src/product_manifold/manifold.rs:177-189 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/transport/centroid_ot.rs\u0060 and \u0060crates/ruvector-math/src/optimal_transport/sinkhorn.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/transport/centroid_ot.rs:162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\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":"crates/ruvector-attention/src/transport/centroid_ot.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f66205434f3466d6c20113aab0120d432ace793bd810db6cd7429b6c9d8b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/ruvector-graph/src/cypher/parser.rs:708-720 | crates/ruvector-graph/src/cypher/parser.rs:745-757 | crates/rvlite/src/cypher/parser.rs:698-710 | crates/rvlite/src/cypher/parser.rs:735-747 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cc92852ccb11feb05daa9b8ea6be443ceb70ef554dc521a7c2ed39ead8ce87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/ruvix/crates/net/src/icmp.rs:252-264 | crates/ruvix/crates/net/src/ipv4.rs:400-412 | crates/ruvix/crates/net/src/udp.rs:141-153 | crates/ruvix/crates/net/src/udp.rs:196-208 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/icmp.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f01ba76c4966f5385d219f27dd6deb1ab25980f0024d810e4bef9ec6d13424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): crates/ruvllm/src/backends/gemma2.rs:906-918 | crates/ruvllm/src/backends/phi3.rs:775-787 | crates/ruvllm/src/models/ruvltra.rs:1085-1097 | crates/ruvllm/src/models/ruvltra_medium.rs:975-986 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:906\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026Gemma2Config\u0060 in one and \u0060\u0026Phi3Config\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/backends/gemma2.rs:923\u0060 calls \u0060logit_soft_cap\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs:788\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"d947fc4401bd89fd5dd01c7e41b1a2865ac845a3eb882f9c5c06e273b2db033a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): patches/hnsw_rs/src/hnsw.rs:1572-1584 | patches/hnsw_rs/src/hnsw.rs:1671-1683 | scripts/patches/hnsw_rs/src/hnsw.rs:1458-1470 | scripts/patches/hnsw_rs/src/hnsw.rs:1557-1569 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:1572\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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"154cc32b75c0e70dfb000da1b75e69ebef99fcf4d33fa5d08f7ab6779f34e8ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/mcp-brain-server/src/aggregate.rs:22-34 | crates/mcp-brain-server/src/aggregate.rs:146-156 | crates/mcp-brain-server/src/cognitive.rs:98-108 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/aggregate.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c38135446dcf96e5b4ad573ec9a1a8dfe96e7b5d38b504744299cb4e5234f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvector-attn-mincut/src/gating.rs:46-58 | crates/ruvector-graph-condense/src/gnn_eval.rs:123-135 | crates/ruvector-graph-condense/src/gnn_eval.rs:139-151 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attn-mincut/src/gating.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c47829ea900580e0fa90b1a464520032fbe52cd4370a7ab1a86d598eb1dd922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvector-bench/src/bin/memory_benchmark.rs:227-239 | crates/ruvector-bench/src/bin/memory_benchmark.rs:321-333 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:141-154 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/profiling_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs:227\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/memory_benchmark.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c9a0a3ccc2a9b3335679c677040adcb10693a41178eb726f4e44b9396df278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/ruvector-cnn/src/kernels/int8_avx2.rs:257-269 | crates/ruvector-cnn/src/kernels/int8_neon.rs:252-264 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:264-275 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:257\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"243ece84b83a7d0001534e8ba1737cd88430a096d1d264aa4b85e524328d3c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): crates/ruvector-cnn/src/kernels/int8_avx2.rs:318-339 | crates/ruvector-cnn/src/kernels/int8_neon.rs:303-324 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:276-297 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:318\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"033e21fcfe4c4bde9f1918ede3b24e83f9667dc5de153d00fa67a6105f6ef227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvector-cnn/src/quantize/graph_rewrite.rs:146-158 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:416-428 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:450-462 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/quantize/graph_rewrite.rs:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4023b57a1b8eb6f7f72dcec19883a288b241f77c9d33b4e44ed7ebf8f129f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/ruvector-cnn/src/simd/avx2.rs:683-694 | crates/ruvector-cnn/src/simd/neon.rs:445-457 | crates/ruvector-cnn/src/simd/wasm.rs:424-436 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:683\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa50935488a28c356c4ea96e3d76724af31c3377017ae5246b91bd05866468ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:476-488 | crates/ruvector-core/src/simd_intrinsics.rs:520-531 | crates/ruvector-core/src/simd_intrinsics.rs:608-619 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:476\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:493\u0060 calls \u0060vsubq_f32\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:536\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67081d29d48dff3f0b2b2d56babe979b5901ee16429b791072dcc434c95a959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 6): crates/ruvector-graph-transformer-node/src/transformer.rs:72-81 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:82-91 | crates/ruvector-verified/src/proof_store.rs:72-84 | crates/ruvix/crates/nucleus/src/witness_log.rs:216-219 | crates/rvf/rvf-crypto/src/attestation.rs:55-59 | crates/rvf/rvf-crypto/src/witness.rs:46-49 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99b8ca6ded872701a4ab3c0a2f1af47c6dd1b381cc7a363a6ff92ccd3b87994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/bench.rs:443-455 | crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:314-326 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:355-367 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.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":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"752f5f3baf73212ff8c69bb5246cc2cbc77cab8cc4e21d1bbc7190c4d2a982d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:72-84 | crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:97-109 | crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:132-144 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:72\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ff3666531617694eda35d8473f415f197e6e7c0a2d90558c1767bea0762aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvector-mincut/src/cluster/hierarchy.rs:517-530 | crates/ruvector-mincut/src/cluster/hierarchy.rs:598-610 | crates/ruvector-mincut/src/subpolynomial/mod.rs:1024-1037 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/cluster/hierarchy.rs:517\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbe27fb7ee033ff4f30c824f45d4664076df9004ea15b238a47acb807590a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/ruvector-postgres/src/distance/simd.rs:1275-1287 | crates/ruvector-postgres/src/distance/simd.rs:1356-1367 | crates/ruvector-postgres/src/distance/simd.rs:1447-1458 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1275\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bef1a0f38669913ab4a15c8e9b1a50a88db2a6022a4261d0af61f7c9d6b1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvix/crates/cli/src/commands/dtb.rs:930-942 | crates/ruvix/crates/cli/src/commands/dtb.rs:990-1002 | crates/ruvix/crates/cli/src/commands/dtb.rs:1033-1045 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:930\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc519e955578469d31a8df4319674400dfdfde62b9e86547b4967a4bafded03f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/ruvllm/src/kernels/attention.rs:906-916 | crates/ruvllm/src/kernels/attention.rs:991-1001 | crates/ruvllm/src/kernels/attention.rs:1134-1146 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.rs:906\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7d587b6b7f48fce8c0ffadd7c0fd14cff0056bbfc7c248d136f5053509d8f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvllm/src/kernels/attention.rs:937-949 | crates/ruvllm/src/kernels/attention.rs:1022-1034 | crates/ruvllm/src/kernels/attention.rs:1180-1197 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf1732463b4856e88f2c0b3bb46f321f89633f075fad2618d2b1859a752f417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ruvllm/src/reflection/perspectives.rs:400-412 | crates/ruvllm/src/reflection/perspectives.rs:610-622 | crates/ruvllm/src/reflection/perspectives.rs:817-829 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/reflection/perspectives.rs:400\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/perspectives.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9776391d451e77294e669e5d038a1a4216b4fc991b466e2e5e132fc967c6b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/sona/src/export/dataset.rs:61-73 | crates/sona/src/export/dataset.rs:137-149 | crates/sona/src/export/dataset.rs:192-204 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sona/src/export/dataset.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/sona/src/export/dataset.rs:60\u0060 calls \u0060clone\u0060 and \u0060crates/sona/src/export/dataset.rs:136\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/export/dataset.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa1b6ba8cbf54d4bb33449122596dac51784e5d6409b7b5ed56ac686f0d17ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): patches/candle-core-0.8.4/src/cpu/avx.rs:132-147 | patches/candle-core-0.9.2/src/cpu/avx.rs:132-147 | patches/candle-core-0.9.2/src/cpu/avx.rs:211-226 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/avx.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/avx.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu/avx.rs:132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/avx.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"199663a076db6264797b9ae7ec26af834a51450cd8be31e923cae4e6c0fed6b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2535-2547 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2595-2606 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2654-2665 \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 \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2535\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7efc505d3759d985b32bab1c74559e2a5d6c0a5d4ba3aea62ab0ab024548ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/emergent-time/src/state.rs:19-31 | crates/emergent-time/src/state.rs:35-47 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/state.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1bd23d57f6b62abbffc78ae35063e1caaf3fd3c16926720189825132c95bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mcp-brain-server/src/notify.rs:278-290 | crates/mcp-brain-server/src/notify.rs:335-347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/notify.rs:278\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1975e246da77fc5909e37bdf0ef4673c079bb1b9fbc075517585c17dab3a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:1338-1350 | crates/ruvllm/src/claude_flow/reasoning_bank.rs:706-718 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:1338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"03237fa067b8089279f96df467b3da664252f6a0919211be17a8c114324d22ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:6595-6607 | crates/mcp-brain-server/src/routes.rs:6621-6633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:6595\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6595}}}],"partialFingerprints":{"codehealthFindingId/v1":"96645a328699b8b965c474612171f03f9992b99ff1ea41c319d012a54bed73fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): crates/photonlayer-bench/src/baselines.rs:71-83 | crates/photonlayer-bench/src/baselines.rs:115-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/photonlayer-bench/src/baselines.rs:115\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/baselines.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ac28f295ee5360d0ea23bb0badabb0b9ec042e2862876d255f7980d519cc95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/prime-radiant/src/governance/witness.rs:345-357 | crates/prime-radiant/src/ruvllm_integration/witness_log.rs:329-341 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/governance/witness.rs:345\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/witness.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1f5041145269223172065f4c56ee6d387770c4e256efb8d58056d1222423f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/prime-radiant/src/simd/energy.rs:168-180 | crates/prime-radiant/src/simd/energy.rs:237-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/energy.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a192a5d442fd49c1689e7e21622e90d7a0dcde9a82d6d5f648ba8577889d6311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/prime-radiant/src/storage/file.rs:402-414 | crates/prime-radiant/src/storage/file.rs:457-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/storage/file.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/file.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4a91ec2b7b2fffb5d5af28d315681e4e8cc5143e2fd807183d1f6698742889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/graph.rs:144-156 | crates/ruvector-gnn-wasm/src/lib.rs:195-207 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/graph.rs\u0060 and \u0060crates/ruvector-gnn-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-unified-wasm/src/graph.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf8c4b17b4ce79795469c35cdb5d51d6e9b9188dbc46315bcb8432dfbce27d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/poincare.rs:147-158 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:494-506 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/hyperbolic/poincare.rs\u0060 and \u0060crates/ruvector-hyperbolic-hnsw/src/poincare.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/hyperbolic/poincare.rs:147\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6021f41892abcb6376a801b84f4b70ec499d3f237bb75a783bc2b413fd0fd514"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-attention/src/training/loss.rs:52-64 | crates/ruvector-attention/src/training/loss.rs:81-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/training/loss.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f13986ece7ca262c99856f49a42b70080fb9896f7cac2e859055aeaa39ae55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/ruvector-cli/src/cli/hooks.rs:644-654 | crates/ruvector-crv/src/stage_ii.rs:82-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cli/src/cli/hooks.rs:644\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eac629a4ba25bc24a067cb3ee234a71da6d6a0fb61144a5bd6a19a7732267e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-cli/src/cli/hooks.rs:1677-1689 | crates/ruvector-cli/src/cli/hooks.rs:1713-1725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b6dba6edaea92f2637d9f8c93f0b67fe36b647bb892f53b0f1c0551084884b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvector-cnn/src/contrastive/infonce.rs:369-381 | crates/ruvector-temporal-coherence/src/lib.rs:101-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/contrastive/infonce.rs:369\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 \u0060a\u0060 to \u0060\u0026[f64]\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/infonce.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fbfdc85c8135c8ee5929b7027400c4ad5418f4fc40505e0f934babf14a7707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/ruvector-cnn/src/layers/quantized_conv2d.rs:71-83 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:70-78 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/quantized_depthwise.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs:71\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e324a396d867c60018089a51f36ce146bbdd9697d536da8bf59cc89c6e57c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-cnn/src/simd/avx2.rs:612-624 | crates/ruvector-cnn/src/simd/wasm.rs:340-352 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/wasm.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:612\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccd4281f07aacbfcc39c3b8654336a2d87963c4c7aed797e5627b62d9c77f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:478-493 | crates/ruvector-cnn/src/simd/wasm.rs:459-474 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/wasm.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:478\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fcaafd7705cbf3aefe838aa1c1174c6f168bab8c80930950926237034b1566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvector-coherence/src/spectral.rs:108-119 | crates/ruvector-solver/src/simd.rs:337-349 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-coherence/src/spectral.rs:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence/src/spectral.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e32ed0ae11181872bb73551ee928426a42662e8d034a648a5f6117c7e119c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-consciousness/src/geomip.rs:187-199 | crates/ruvector-consciousness/src/phi.rs:235-247 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/geomip.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"93aeb57f0d130dbc9d190106dfcc47071b03e9ee244f168fb577089c75eb3d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-consciousness/src/iit4.rs:119-131 | crates/ruvector-consciousness/src/iit4.rs:161-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/iit4.rs:119\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/iit4.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a4f5a27ae9bb7cfcd992685dd0854f536631f51430c68646550721ac8863d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvector-consciousness/src/parallel.rs:191-202 | crates/ruvector-consciousness/src/phi.rs:528-540 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/parallel.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4b6eb43012c326ad2a29787f15aaa8daaafdf8b65aa72675b4eaff066a8b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvector-core/src/arena.rs:280-291 | crates/ruvector-core/src/arena.rs:484-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/arena.rs:280\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/arena.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7d450bea0390281292fdd3870778ec90e8765a78e307b8bc821d70a742d41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:568-580 | crates/ruvector-core/src/simd_intrinsics.rs:815-823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:565\u0060 calls \u0060as_ptr\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:813\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5788e701f5d629822b1abed01f360d006645eda5c7f8b31d968b6151388bdbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:1378-1390 | crates/ruvector-core/src/simd_intrinsics.rs:1421-1431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:1378\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:1418\u0060 calls \u0060_mm256_sub_epi16\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:1376\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f12262be8cf7a5173a08980bd24abec21d1a7e126e4d41c7dce215aa5a9ae06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-economy-wasm/src/ledger.rs:15-27 | crates/ruvector-economy-wasm/src/stake.rs:15-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-economy-wasm/src/ledger.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef36b1310c5693d675e7b7d54a136990597043284afe1c3b065eb9d9ae8dc7db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 3): crates/ruvector-entropy-ann/src/search.rs:81-84 | crates/ruvector-entropy-ann/src/search.rs:217-229 | crates/ruvector-entropy-ann/src/search.rs:342-354 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f3280ddaaa287760c9c77212abfc74eb54317038eeeddc8ae5ef40718dd101"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:434-446 | crates/ruvector-fpga-transformer/src/backend/fpga_pcie.rs:514-526 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5dea2a4cd7dbc8097fa49beb51db2bd5b63e6bbbe64e4a004198a0a615cd05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-gnn/src/compress.rs:220-232 | crates/ruvector-gnn/src/compress.rs:260-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/compress.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dc28d860034042eef23569b265ec51df438dcb338b2f136fbe8e7bb894aa7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:124-136 | crates/ruvector-py/src/graph/cypher_eval.rs:111-123 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/cypher_exec.rs:124\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8152c6a0d4a003cc8161806b40e5649dea0dbbd0cf65c889a689040af80e5f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:84-96 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:94-106 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-transformer-node/src/transformer.rs:84\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a92bbc71f410fc0c3222dacce0de17f1ef831b047b56c0545131e279ea774fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:312-324 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:332-344 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fd33ce970db1c919dfed3f00597b248af0a71682b51dc562e2318758bd29e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-graph-transformer/src/biological.rs:290-302 | crates/ruvector-graph-transformer/src/biological.rs:310-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060weights\u0060 to \u0060\u0026[f32]\u0060 in one and \u0060\u0026mut [f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/biological.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb805c0434bf47e78a1fe0f7fba6ebffec29b3dbc440f6244a3134373d736e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/ruvector-graph-transformer/src/physics.rs:386-398 | crates/ruvector-graph-transformer/src/physics.rs:545-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-transformer/src/physics.rs:386\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/physics.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe9bb9e8b09025cdcaf0a02a2744d688c40605df32e2c2335bd5307deab276a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-graph/src/cypher/ast.rs:355-367 | crates/rvlite/src/cypher/ast.rs:355-367 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/ast.rs\u0060 and \u0060crates/rvlite/src/cypher/ast.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/ast.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfb24166d3cd9ea342a3eab839fc57f40e117e7ab6a32f56ac4b9b1adc87ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:136-159 | crates/rvlite/src/cypher/parser.rs:132-155 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ec93fa9f87486138182aaaf5d48df1b10a7bce6f8355f0e05eab6b55d72bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/embed.rs:312-324 | crates/ruvector-hailo-cluster/src/bin/stats.rs:253-265 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/stats.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 136 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs:312\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e195017f41ad56e160299f6df55acb6b8a66fe315ae2727138ca20f1cdfe17d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/embed.rs:452-464 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:247-259 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs:452\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71d2c6b1dce1d6d2d79db4b4807bcf085085e325ed0b095ffe29347686256f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:32-44 | crates/ruvector-kge-wasm/src/model.rs:32-44 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96016e78a6f2c27e17dfdb1c79719df900d66455f6405d2881a9b715a682e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-math/src/homology/filtration.rs:112-124 | crates/ruvector-math/src/homology/filtration.rs:199-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 \u0060crates/ruvector-math/src/homology/filtration.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/filtration.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"680706282a8b591241e89afcda612078f95f70b9c34e43b53997908cf58e88e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-math/src/product_manifold/manifold.rs:453-465 | crates/ruvector-math/src/spherical/mod.rs:227-239 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/product_manifold/manifold.rs\u0060 and \u0060crates/ruvector-math/src/spherical/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c4f7569ea609bf97042069d3ac0d2e50277198043b26dc1d7f42a5a9221278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/arena.rs:149-161 | crates/ruvector-mincut-gated-transformer/src/arena.rs:177-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/arena.rs:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/arena.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be7da0c1b307993bd9aa1b0fa1c0b8d8fcbdab765787e9d99185244b98eee3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvector-mincut/src/optimization/cache.rs:225-237 | crates/ruvector-mincut/src/optimization/cache.rs:257-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 \u0060crates/ruvector-mincut/src/optimization/cache.rs:225\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/cache.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"375b308a05ccdc9bea5a77c8583f3f66713f9dbd1cb1407ac74fae8447fe5323"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/wta.rs:63-75 | crates/ruvector-nervous-system/src/compete/wta.rs:86-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/wta.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbf3d4c4e761dc65a3752d60193a39b3df7f1351296e7792dfbe486818ae004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1039-1051 | crates/ruvector-postgres/src/distance/simd.rs:1554-1566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1039\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"75333e400cad6d329dd0b4a6ea01045e9e5ee7eb12099dc220367999e4c89b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1316-1328 | crates/ruvector-postgres/src/distance/simd.rs:1479-1491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1316\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:1315\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs:1478\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d935cb7d93e75145b6cb232779e34d2f8e900bc65666e9839f6d15621eb443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvector-postgres/src/gnn/message_passing.rs:70-82 | crates/ruvector-postgres/src/gnn/message_passing.rs:132-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/gnn/message_passing.rs:70\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gnn/message_passing.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f125b1e091aa700a18a13622941f784e378b9e07d0dd15f6bcdb88681b46e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:329-341 | crates/rvlite/src/sparql/executor.rs:241-253 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d7a4510518c288f32463ea7b6f0bb33fdc2b8193d628bf284398428f0c29a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1542-1554 | crates/rvlite/src/sparql/executor.rs:819-831 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"045d5274c886f0388625717d5383949d229e307adcb4291992b165dc0dc530d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-postgres/src/healing/functions.rs:126-138 | crates/ruvector-postgres/src/healing/functions.rs:165-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/functions.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7929c088d7ccb653ce9978876d6753a4651314b30986fad703e1bf697d9db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-postgres/src/solver/operators.rs:276-289 | crates/ruvector-postgres/src/solver/operators.rs:482-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/solver/operators.rs:276\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dd7bcad10c31283d6c94f84527bc0828ad6a9445b51653ff47e66858b1284b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-rairs/src/rairs.rs:132-144 | crates/ruvector-rairs/src/seil.rs:206-218 \u2014 before extracting anything, compare \u0060crates/ruvector-rairs/src/rairs.rs\u0060 and \u0060crates/ruvector-rairs/src/seil.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rairs/src/rairs.rs:132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/rairs.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"88adaef3b4c52307fb1cefc4964ff0ef318dfe6872674952a008e42ad89ed565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/ruvector-robotics/src/domain_expansion.rs:166-175 | crates/ruvector-robotics/src/domain_expansion.rs:198-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-robotics/src/domain_expansion.rs:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/domain_expansion.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9c594cab060b42a40daa07be8d5a90a0c3ce8de7c359405911511528d8c1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-solver-node/src/lib.rs:369-381 | crates/ruvector-solver-node/src/lib.rs:426-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver-node/src/lib.rs:369\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-solver-node/src/lib.rs:367\u0060 calls \u0060swap\u0060 and \u0060crates/ruvector-solver-node/src/lib.rs:424\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/src/lib.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4200b39ee2a6f71b09170190a2b102170ed394ce16d50dba18ff5dd36896b78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-solver/src/random_walk.rs:405-417 | crates/ruvector-solver/src/random_walk.rs:517-529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/random_walk.rs:405\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/random_walk.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16ffda991ed5b147fa726a057b2609a6d5f7b3dd2b248b2c4af1b3f99361ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-sparse-inference/src/predictor/lowrank.rs:258-270 | crates/ruvector-sparse-inference/src/predictor/lowrank.rs:273-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/predictor/lowrank.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1e9c60741dd5271cede2c7b776da9bef0dcf17206a4322cec84b7cce3dba4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvector-temporal-tensor/src/bitpack.rs:23-34 | crates/ruvector-temporal-tensor/src/store.rs:274-286 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/bitpack.rs:23\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/bitpack.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b501f65d0d048ca16633decdec767937d470c370e327992508932b2c859642ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-turboquant/src/bits1.rs:202-214 | crates/ruvector-turboquant/src/score.rs:35-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-turboquant/src/bits1.rs:202\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/bits1.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33aebe075e167b6e7a72ca0472d7ddb81d8efd38d95a24f3ba07c2b6749a9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvix/crates/boot/src/stages.rs:506-518 | crates/ruvix/crates/boot/src/witness_log.rs:405-417 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/stages.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e601238fadf892c86ec1425ec78a03d909ca7178f31d80c8284ea677bc63a9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvix/crates/region/src/slab.rs:317-329 | crates/ruvix/crates/region/src/slab_optimized.rs:325-337 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/region/src/slab.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060handle\u0060 to \u0060SlotHandle\u0060 in one and \u0060OptimizedSlotHandle\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvix/crates/region/src/slab.rs:315\u0060 calls \u0060validate_handle\u0060 and \u0060crates/ruvix/crates/region/src/slab_optimized.rs:324\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/slab.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b90507914a5f1e1ebf423736aa3380e6fb771039a5aff842416d0af9a89b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm-wasm/src/webgpu/compute.rs:229-241 | crates/ruvllm-wasm/src/webgpu/compute.rs:793-805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/webgpu/compute.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fcfe02b4679db1dd5e7e9d53cf381d31456d0eb689ef17dbf421993b525e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:2578-2588 | crates/ruvllm/src/bitnet/backend.rs:2592-2604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed7863a8a846b5392d38a8563716f0397b5cf7ff5899bf102c18b1da76003b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:3397-3408 | crates/ruvllm/src/bitnet/backend.rs:3552-3564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:3397\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"900f721e03234b247b5d602b4b2d003af541ee450a80be9e84c5a0fb1524b158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm/src/claude_flow/hooks_integration.rs:948-960 | crates/ruvllm/src/claude_flow/hooks_integration.rs:1085-1097 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/claude_flow/hooks_integration.rs:948\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/hooks_integration.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bceb0f71a551ab3bcec2ebac783ab7a71106f61cd816475c918d837caf03332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm/src/claude_flow/reasoning_bank.rs:830-842 | crates/sona/src/reasoning_bank.rs:296-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/claude_flow/reasoning_bank.rs:830\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b73ea00abe362951f8fd13f3fcb58fd15ab7891133c767e728689804e7e500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm/src/kernels/accelerate.rs:291-305 | crates/ruvllm/src/kernels/accelerate.rs:422-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/accelerate.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/kernels/accelerate.rs:307\u0060 calls \u0060as_ptr\u0060 and \u0060crates/ruvllm/src/kernels/accelerate.rs:435\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/accelerate.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"07863056217f0523f1ed54db48b9f861aefb1ce26dffc1ae537f141c47dad70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm/src/kernels/quantized.rs:662-674 | crates/ruvllm/src/kernels/quantized.rs:827-839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/kernels/quantized.rs:659\u0060 calls \u0060vzip2_u8\u0060 and \u0060crates/ruvllm/src/kernels/quantized.rs:824\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/quantized.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6666f515a8a5e5c59022b0efd2f8420324f1c8b8bd9245573408c40de77a39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm/src/lora/micro_lora.rs:196-208 | crates/ruvllm/src/lora/micro_lora.rs:227-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/lora/micro_lora.rs:196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0024231fb806fc2c9b00f89fcce40c4e85d706cd95298dca73129a9b3d72833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvllm/src/metal/operations.rs:437-449 | crates/ruvllm/src/metal/operations.rs:566-577 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/operations.rs:437\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/operations.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6714a9c6dd94e1b5603f7503007753c60ed7225c881375f7deb5678fbd30a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/ruvllm/src/models/openmythos/mod.rs:575-587 | crates/ruvllm/src/models/rdt.rs:1083-1093 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/openmythos/mod.rs\u0060 and \u0060crates/ruvllm/src/models/rdt.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5087360697f3e0c50cf99107d69da8ae0aca347dd251f62b32c78f06d72747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm/src/quantize/incoherence.rs:426-438 | crates/ruvllm/src/quantize/incoherence.rs:455-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/incoherence.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/incoherence.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5948c05c7ab7e88b70420dc65388c795c774546c736262bba4e5a32547cb1c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm/src/quantize/ruvltra_quant.rs:578-590 | crates/ruvllm/src/quantize/ruvltra_quant.rs:600-612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/ruvltra_quant.rs:578\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/ruvltra_quant.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a0365ecad8308f32a9c4b3286df166680d1819a7a7a81a1a1df7189e0ac4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/ruvllm/src/serving/engine.rs:637-649 | crates/ruvllm/src/serving/engine.rs:673-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c718c731124322fed214b9f6a00125c742d09e95e6737fce24a065eba270c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvAgent/rvagent-core/src/agi_container.rs:213-225 | crates/rvAgent/rvagent-wasm/src/rvf.rs:426-438 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/agi_container.rs\u0060 and \u0060crates/rvAgent/rvagent-wasm/src/rvf.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-core/src/agi_container.rs:213\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4711743c080660e6b66a822ebcb08b9945bd52d46dbfb759f01f566de95ecbc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvAgent/rvagent-core/src/agi_container.rs:266-278 | crates/rvAgent/rvagent-wasm/src/rvf.rs:503-515 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/agi_container.rs\u0060 and \u0060crates/rvAgent/rvagent-wasm/src/rvf.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-core/src/agi_container.rs:266\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8e25c6a6f6ccc27da506450fd3ef57d29f969aaf29e56e1e792bf3b173d0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvAgent/rvagent-core/src/parallel.rs:40-52 | crates/rvAgent/rvagent-core/src/parallel.rs:89-101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-core/src/parallel.rs:40\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvAgent/rvagent-core/src/parallel.rs:88\u0060 calls \u0060acquire\u0060, \u0060expect\u0060 and \u0060crates/rvAgent/rvagent-core/src/parallel.rs:39\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/parallel.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2190b043879f480ccd6e41254cb12d0323b5f7c6aaba99bbabf96f7b7555b2e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvAgent/rvagent-wasm/src/gallery.rs:676-688 | crates/rvAgent/rvagent-wasm/src/mcp.rs:382-394 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-wasm/src/gallery.rs:676\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/gallery.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f8403cb81c142e8f1342745b62cae1a9e548bac85ebaeef96d930b072a89cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvf/rvf-index/src/distance.rs:64-76 | crates/rvf/rvf-index/src/distance.rs:161-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/distance.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf/rvf-index/src/distance.rs:78\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs:175\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/distance.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70179f26479ab6c92fc405a2557d1ff7977fe37ef3ec90c084038e854f40aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvf/rvf-index/src/distance.rs:202-214 | crates/rvf/rvf-index/src/distance.rs:276-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/distance.rs:202\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf/rvf-index/src/distance.rs:216\u0060 calls \u0060vsubq_f32\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs:290\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/distance.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5998de943abc0f37cd7876640f1a74a31af25aaa0b17f7c0bc0b714eb939eeec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:392-404 | crates/rvf/rvf-runtime/src/store.rs:479-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:392\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7724cabbd93d9f271a0614a75a6014d40b1e9467c10081a6f00f2f67853b3e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvlite/src/lib.rs:363-375 | crates/rvlite/src/lib.rs:393-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvlite/src/lib.rs:363\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/lib.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e01baabd5bfce99e9e22604dae79f9537a324436f009fbb3ddc60087149dbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvlite/src/lib.rs:422-434 | crates/rvlite/src/lib.rs:455-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvlite/src/lib.rs:422\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"13024dbebad4da0eedb49a302a373625ab15554d108b49cbed906dd8b79e843c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rvm/crates/rvm-coherence/src/mincut.rs:137-149 | crates/rvm/crates/rvm-coherence/src/mincut.rs:155-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 \u0060crates/rvm/crates/rvm-coherence/src/mincut.rs:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/mincut.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7734b9ec3d46c10eaeddb8def096d88f698f8ecbb5559492e3f4b37d46b829e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:132-144 | patches/candle-core-0.9.2/src/conv.rs:133-145 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b065c7f6f06610268cb6e9ebf0448d5e0e4fe8a849c037ffc03e3b465d8603d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:259-271 | patches/candle-core-0.9.2/src/conv.rs:274-286 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4f1d3e6db3e1cdd54d183748c4330f0a5fff726f6b9a8326d31d73f54a5677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/mod.rs:71-92 | patches/candle-core-0.9.2/src/cpu/mod.rs:90-111 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"247c431336cf32bb548c08777e62395eca85318c3fef24adc82f71a49cea4930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2145-2157 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2652-2664 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2145\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b06602dde25c0f1ab902ef646642e61f2ce0f7724f746ce6c4eb2809ee1685a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2401-2413 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2905-2917 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2401\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2401}}}],"partialFingerprints":{"codehealthFindingId/v1":"417833066217f4ab9ab00ec97bb66134874abdb6dc9ce57dab126b00d8b313fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/device.rs:277-289 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:409-421 \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 \u0060patches/candle-core-0.8.4/src/cuda_backend/device.rs:277\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd9e4fda4557505ab37df9c80fa325287c50967ca03abd6816e3f31501c4737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1705-1717 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2230-2242 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1705\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeb8eccfa71f712dfc222d1ed77f418c74381f53a77f1c3bb13cb6d9b1894b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/custom_op.rs:222-234 | patches/candle-core-0.9.2/src/custom_op.rs:222-234 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/custom_op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/custom_op.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5369b9b2d6389153bcd09ba36187ce2fbc4ac1d5d03aabe2b19ec55be3c4aaf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): patches/candle-core-0.8.4/src/custom_op.rs:401-411 | patches/candle-core-0.9.2/src/custom_op.rs:404-416 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/custom_op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/custom_op.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/custom_op.rs:401\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 \u0060kernel\u0060 to \u0060ug::lang::ssa::Kernel\u0060 in one and \u0060candle_ug::lang::ssa::Kernel\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":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9a59422f20c54069b5b7b73fba8a1cc88489565482fa6858cf2ef8d2961a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/indexer.rs:117-129 | patches/candle-core-0.9.2/src/indexer.rs:117-129 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/indexer.rs\u0060 and \u0060patches/candle-core-0.9.2/src/indexer.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/indexer.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fc5684e258338c150dbeb0d0ac8d817dfab64d68f42dfb798af7aedd970d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:173-185 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:189-201 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:173\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:202\u0060 calls \u0060size_in_bytes\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:186\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0454740f120f0ec44d2d9436dc06495e27af1da91913b9061d37794997a974d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:224-236 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:242-254 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:255\u0060 calls \u0060size_in_bytes\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:237\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"126fedf6a7bc021bebb7c7d9a4c89f39b61320e79e94383008fbe43d9bde7309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69\u201370 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:623-691 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:658-727 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:623\u0060 it does not close everything it opens, so those exact 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, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:728\u0060 calls \u0060size_in_bytes\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:692\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"262ded0080c62702b07b2bb31d75a8296ed9b9c028f064929d6415755e5e4f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:846-859 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:886-899 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a41c54da84fb9765fea2ff303c47f00a3d5d1e974243f8dc670526f2d1f3ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:195-222 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:196-223 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6274bffef0e27181787a5695d5dd19efc032b410682f3e5919abedeb4dc11f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:335-347 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:358-370 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:348\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:371\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"92df55b3b5c40c069f8e4437c72c0fe8943eda0c9c141b1efee1e7fe8a743787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1721-1744 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2149-2172 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1745\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:2173\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e4aecfec551d093ff68c224e61003d3f7abf71f0960d4f6f9d5e6a4100c6db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:426-438 | patches/candle-core-0.9.2/src/quantized/mod.rs:726-738 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:426\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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aa66def78def5c88c9814e2bdbb2711dfde72ea8c1d24bc661c4a26c996b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:165-177 | patches/candle-core-0.9.2/src/tensor.rs:165-177 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceddd3225dbe33775ef87f395df55301f94d30bf7a54615324ec13a595b65575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:522-534 | patches/candle-core-0.9.2/src/tensor.rs:576-588 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecf58b4db0b2e4cba7c8ad2f87059bb14bc724492c6b3de8eff3bb43034ec3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2282-2294 | patches/candle-core-0.9.2/src/tensor.rs:2605-2617 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:2282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb69061938915f72f989e864ab3d9b799e35845033790c1c8f45ab92c98f379f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2441-2453 | patches/candle-core-0.9.2/src/tensor.rs:2764-2776 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d458d5e9f5016af5f2dd81fd3c923a3cc168e8bd1a41ff0f1072c4bdc9250d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.9.2/src/cpu_backend/mod.rs:522-534 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:537-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27f6633113db3496e1438d0f0c8370b59d7f0bd7bebe9ca0d2679c49fb78cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/device.rs:361-373 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:515-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cuda_backend/device.rs:361\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":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b782355e1ee5dedca171ccd2ebacf2d40d2248d0eb5999a443e8d9daf0b6c832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.9.2/src/metal_backend/mod.rs:198-210 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:251-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 \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:198\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/metal_backend/mod.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d88aff1c1d4c9ce5a06a87268e5d4a210fe1205f591ea555e6e4ee688c8e403"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/cuda.rs:321-333 | patches/candle-core-0.9.2/src/quantized/cuda.rs:390-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs:321\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"patches/candle-core-0.9.2/src/quantized/cuda.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec212391266a3724258fd917ad9ba73a4f848cac4974139e6e4de4bb322b6295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:448-466 | scripts/patches/hnsw_rs/src/hnsw.rs:448-466 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a75826cf799bb86fccd447096f386688f81c905eb91fb58fceba17c10faccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 8): crates/ruvector-postgres/src/graph/sparql/parser.rs:2131-2142 | crates/ruvector-postgres/src/graph/sparql/parser.rs:2163-2172 | crates/ruvector-postgres/src/graph/sparql/parser.rs:2185-2194 | crates/ruvector-postgres/src/graph/sparql/parser.rs:2210-2220 | crates/rvlite/src/sparql/parser.rs:2170-2181 | crates/rvlite/src/sparql/parser.rs:2202-2211 | crates/rvlite/src/sparql/parser.rs:2224-2233 | crates/rvlite/src/sparql/parser.rs:2249-2259 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dcab4b22f0ff31c6702ce231ca70c6f6e3aeca26e1316e68a05f699ee44cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 7): crates/ruvector-cnn/src/simd/neon.rs:26-36 | crates/ruvector-core/src/simd_intrinsics.rs:660-671 | crates/ruvector-core/src/simd_intrinsics.rs:739-748 | crates/ruvector-core/src/simd_intrinsics.rs:810-819 | crates/ruvector-core/src/simd_intrinsics.rs:868-878 | crates/ruvllm/src/kernels/matmul.rs:206-217 | crates/ruvllm/src/kernels/matmul.rs:1196-1205 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:673\u0060 calls \u0060vsubq_f32\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs:38\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"74738137505acd178d9e2d480d03ee9f2a2ee4849f9b175c8a20a51761f52683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): patches/candle-core-0.8.4/src/quantized/k_quants.rs:921-932 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:934-945 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:947-958 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1029-1040 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1042-1053 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1055-1066 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:921\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"708c2248dc13d62b49f8dcb135532df9cd8a93c35f9ecda4ad207af6fb6416c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): crates/ruvector-attention/src/transport/cached_projections.rs:69-79 | crates/ruvector-attention/src/transport/centroid_ot.rs:148-158 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:88-98 | crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:121-132 | crates/ruvector-math/src/product_manifold/manifold.rs:162-173 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/transport/cached_projections.rs\u0060 and \u0060crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/transport/cached_projections.rs:69\u0060 it does not close everything it opens, so those exact 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 \u0060a\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":"crates/ruvector-attention/src/transport/cached_projections.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef860f9e2bb9c99d1da4df589db8f2dad87c4716d54fccf9ec3ce03b1639eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:108-119 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:213-223 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:320-330 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:421-431 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:137-148 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/agenticdb_benchmark.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":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4c5d069db947669565d4bbec65de6cfd59d165ddb891eadec793c72e121eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): crates/rvf/rvf-runtime/src/store.rs:2420-2431 | crates/rvf/rvf-runtime/src/store.rs:2541-2552 | crates/rvf/rvf-runtime/src/store.rs:2647-2658 | crates/rvf/rvf-runtime/src/store.rs:2755-2766 | crates/rvf/rvf-runtime/src/store.rs:2786-2797 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb2e87b72fc19fb7a5f1b3309bc5cd1fc0ea64e8f337a32c545ee6ecdee5f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1050-1061 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1142-1153 | patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:151-162 | patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:305-316 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1250-1261 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6983f6d2449cfdf1216b26ecc92545bc330a45a055a448c486381974c6abe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/ruvector-bench/src/bin/comparison_benchmark.rs:101-112 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:148-159 | crates/ruvector-bench/src/bin/latency_benchmark.rs:116-127 | crates/ruvector-bench/src/bin/latency_benchmark.rs:290-301 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"582830307e325a1ce45ec5af2c3b82b5dd4d565fdf166f3f53501ab4f278ebd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): crates/ruvector-core/src/simd_intrinsics.rs:479-490 | crates/ruvector-core/src/simd_intrinsics.rs:523-533 | crates/ruvector-core/src/simd_intrinsics.rs:563-573 | crates/ruvector-core/src/simd_intrinsics.rs:611-621 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:479\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:493\u0060 calls \u0060vsubq_f32\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:536\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2fad11dbb920eaa3701107f6319a5bbb0f743c155a705bcbd9c57bcfaa0793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): crates/ruvector-graph/src/cypher/parser.rs:607-617 | crates/ruvector-graph/src/cypher/parser.rs:645-656 | crates/rvlite/src/cypher/parser.rs:597-607 | crates/rvlite/src/cypher/parser.rs:635-646 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:607\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-graph/src/cypher/parser.rs:618\u0060 calls \u0060consume\u0060, \u0060parse_expression\u0060 and \u0060crates/ruvector-graph/src/cypher/parser.rs:657\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3aa7b8ab351076ad19e6a02203fc840ffb312ef3042a8de322df83197d8f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 4): crates/ruvector-kge/src/train/loss.rs:35-44 | crates/ruvllm/src/kernels/activations.rs:603-614 | crates/ruvllm/src/kernels/ane_ops.rs:640-651 | crates/ruvllm/src/kernels/attention.rs:1064-1075 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/kernels/activations.rs\u0060 and \u0060crates/ruvllm/src/kernels/attention.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/kernels/ane_ops.rs:636\u0060 calls \u0060is_empty\u0060 and \u0060crates/ruvllm/src/kernels/activations.rs:602\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/train/loss.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"11798e8ba5829edd0931477863dcfc4abe78757732771837912d4e183f0e9f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/ruvector-py/src/cluster.rs:72-83 | crates/ruvector-py/src/hnsw.rs:253-264 | crates/ruvector-py/src/rabitq.rs:161-172 | crates/ruvector-py/src/rabitq.rs:419-430 \u2014 before extracting anything, compare \u0060crates/ruvector-py/src/hnsw.rs\u0060 and \u0060crates/ruvector-py/src/rabitq.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/cluster.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cd5c76056574df11ebcb1707cfa6b2fb3399b287cd6d4a008c7dbd0c9ce198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/ruvllm/src/metal/context.rs:332-343 | crates/ruvllm/src/metal/context.rs:404-415 | crates/ruvllm/src/metal/context.rs:629-640 | crates/ruvllm/src/metal/context.rs:693-704 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/context.rs:332\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cb280f448fc9ff5e2c791827d0a109c95e8b717884a25fafd52a8a709eb607"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:842-853 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:915-926 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1038-1049 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1111-1122 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:842\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdf602b7474abb671c85edc00b243b1dd999d440d70e59701d2078fca26c9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1401-1412 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1519-1530 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1518-1529 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1636-1647 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1401\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7664819f68e3530ca49344d45fe83ac1e8d2eb73844821672d1cdbf57acb46b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:198-213 | patches/candle-core-0.8.4/src/cpu_backend/utils.rs:239-254 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:247-262 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:288-303 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs:198\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49988d6a2c8fde3d48aa4af481796507c5e85b133d9288cdd365746327f4e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201330 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1262-1291 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1460-1486 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1464-1493 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1726-1752 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b124f3480061b495e50477f9c11fcf937f5101503a8e67c05e77590e998e1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): patches/candle-core-0.8.4/src/safetensors.rs:107-118 | patches/candle-core-0.8.4/src/safetensors.rs:138-149 | patches/candle-core-0.9.2/src/safetensors.rs:124-135 | patches/candle-core-0.9.2/src/safetensors.rs:155-166 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/safetensors.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e101a790bc7e85439c82549188638f54d62ce010bac76e6e0464b350ba3b0ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 4): patches/hnsw_rs/src/libext.rs:138-149 | patches/hnsw_rs/src/libext.rs:694-701 | scripts/patches/hnsw_rs/src/libext.rs:138-149 | scripts/patches/hnsw_rs/src/libext.rs:694-701 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6413328535b63bd39776e997ec2438616d82e7c05c267e931a4d966d7517c7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-bench/src/bin/ann_benchmark.rs:158-169 | crates/ruvector-bench/src/bin/ann_benchmark.rs:173-184 | crates/ruvector-bench/src/bin/ann_benchmark.rs:188-199 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/ann_benchmark.rs:158\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/ann_benchmark.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2b88d4ba6cd9fcbb5e08349c679ce7053580aeba0320150b26784bb6bb4724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-bench/src/bin/comparison_benchmark.rs:329-340 | crates/ruvector-bench/src/bin/latency_benchmark.rs:360-371 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:157-168 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"348e324c9a52ea216dc140cdcdec8219aed6726fc68d09d7fccbac6f633bdf24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): crates/ruvector-cnn/src/kernels/int8_avx2.rs:155-166 | crates/ruvector-cnn/src/kernels/int8_neon.rs:149-157 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:151-159 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:155\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb9d9a0e06f97c047a3339e338d49b34e64e075286e732ba901e570c9a8bf52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:1469-1480 | crates/ruvector-core/src/simd_intrinsics.rs:1491-1501 | crates/ruvector-core/src/simd_intrinsics.rs:1510-1520 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:1469\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fc3c33043720f86561e1550bf8451b7ad5bef91c9ef84ee567247ee0c6708d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-hybrid/src/bm25.rs:115-126 | crates/ruvector-hybrid/src/fusion.rs:163-174 | crates/ruvector-hybrid/src/fusion.rs:232-243 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hybrid/src/bm25.rs:115\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hybrid/src/bm25.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a2f8c72bcd75981001beb8b1c51ce7b109db6ef13747d5ec0536e166572ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-mincut-gated-transformer/src/arena.rs:122-133 | crates/ruvector-mincut-gated-transformer/src/arena.rs:150-161 | crates/ruvector-mincut-gated-transformer/src/arena.rs:178-189 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/arena.rs:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/arena.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b18eb6cabba1e3bdc415f9744ad284e17c0adc0e3aee44aed8145acd26f065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:268-279 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:297-308 | crates/ruvector-rabitq/src/rotation.rs:223-234 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:268\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4983fffc7e0fd3d050a710891efe2a55d088b4bba6a98ac8c6846c32a1785b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:473-490 | crates/ruvector-profiler/src/config_hash.rs:67-83 | crates/rvf/rvf-types/src/sha256.rs:159-176 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-profiler/src/config_hash.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:473\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"69429386449df6a382afa946ce8704bd2d914c9c202207e6810a6efbf6388369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-postgres/src/types/binaryvec.rs:351-362 | crates/ruvector-postgres/src/types/productvec.rs:370-381 | crates/ruvector-postgres/src/types/scalarvec.rs:396-407 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"54593e94b6f92d0966a82f71c288caa002bdc528ceee5874ed432489a15b9f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): crates/ruvector-postgres/src/types/halfvec.rs:350-361 | crates/ruvector-postgres/src/types/halfvec.rs:402-411 | crates/ruvector-postgres/src/types/halfvec.rs:470-479 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.rs:350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-postgres/src/types/halfvec.rs:400\u0060 calls \u0060_mm256_setzero_ps\u0060 and \u0060crates/ruvector-postgres/src/types/halfvec.rs:349\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"965c9dcea0ece92c078364f227b7ea1d218b0a246c7fe252b160398a3948a509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): crates/ruvector-solver/src/simd.rs:102-113 | crates/ruvector-solver/src/simd.rs:204-212 | crates/ruvector-solver/src/simd.rs:348-356 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/simd.rs:102\u0060 it begins part-way through the construct above it, so those exact 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 \u0060matrix\u0060 to \u0060\u0026CsrMatrix\u003Cf32\u003E\u0060 in one and \u0060\u0026CsrMatrix\u003Cf64\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"690d756ce905956a209f7338625c67d60a1f96e2623ea7a5855da3067863bcef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-solver/src/types.rs:112-123 | crates/ruvector-solver/src/types.rs:146-157 | crates/ruvector-solver/src/types.rs:196-207 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/types.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\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":"crates/ruvector-solver/src/types.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da8fa4d2200f622e826313a181f1f0e78ade68f67bfd81f5bfe6d555e5c79d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-temporal-tensor/src/store.rs:591-602 | crates/ruvector-temporal-tensor/src/store.rs:1094-1105 | crates/ruvector-temporal-tensor/src/store.rs:1180-1191 \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, \u0060crates/ruvector-temporal-tensor/src/store.rs:1090\u0060 calls \u0060remove_data\u0060, \u0060remove_from_bucket\u0060 and \u0060crates/ruvector-temporal-tensor/src/store.rs:589\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/store.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"6550c02305c4e9e034dddd6baf02760cf768a90f4ffb15f510dbe3f2955b5d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvllm/src/backends/gemma2.rs:755-766 | crates/ruvllm/src/backends/phi3.rs:634-645 | crates/ruvllm/src/models/ruvltra.rs:914-925 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"68187909ee6f4be96057d43035d7c36ac7d617727c7bdd40dce147f34edc5c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): crates/ruvllm/src/bitnet/backend.rs:3004-3015 | crates/ruvllm/src/bitnet/backend.rs:3227-3236 | crates/ruvllm/src/bitnet/backend.rs:3295-3304 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":3004}}}],"partialFingerprints":{"codehealthFindingId/v1":"a731e624414a9f40008b5c01a254e993fc44bdd8f156b841fd9a6349c08eef48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/ruvllm/src/kv_cache.rs:465-476 | crates/ruvllm/src/kv_cache.rs:600-611 | crates/ruvllm/src/kv_cache.rs:706-716 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kv_cache.rs:465\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddff37d0e9ffa27800b506d1886f9934db4d43fc34d989f298b105539235938f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/cognitum-gate-kernel/src/evidence.rs:78-95 | crates/cognitum-gate-kernel/src/evidence.rs:108-128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/evidence.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d575461e8fbac0b2ce5d1f392b5e83291d7d1d5967d45dd32cc7849121f8038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:1540-1551 | crates/mcp-brain-server/src/routes.rs:3649-3660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:1540\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa421c11662ddf97f95119642ef8751e08fd9f6e20fad8c5a1851881dc242276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:2288-2299 | crates/mcp-brain-server/src/routes.rs:4830-4841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"add171c74b86df4b1ab84e82705284db0a43437490c3d29c60618bfea67e070b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/prime-radiant/src/security/validation.rs:343-354 | crates/prime-radiant/src/security/validation.rs:382-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/security/validation.rs:343\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/security/validation.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fcfa67ebec6be25342a97a628f00dcdb089f29f6349cc8b30bd38b3383b1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/prime-radiant/src/simd/energy.rs:245-257 | crates/prime-radiant/src/simd/vectors.rs:71-83 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/energy.rs:245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b728b8e9090605af3c54f9c8a4788933c0da55a732e7892a13352d701e3313d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ruvector-acorn/src/dist.rs:12-21 | crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:180-191 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-acorn/src/dist.rs:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/dist.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2e76f2027e449fb5f0624ed8be75163aeb7ac0f9f1ff94821a0262ebd20f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/ruvector-acorn/src/search.rs:68-79 | crates/ruvector-adaptive-ann/src/search.rs:81-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-acorn/src/search.rs:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/search.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2e70ef7d05719c3b09d7370a57da022fdcf48d50608657658f0295008eb05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/poincare.rs:101-111 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:433-444 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/hyperbolic/poincare.rs\u0060 and \u0060crates/ruvector-hyperbolic-hnsw/src/poincare.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8637745df2baeb70c14291e80e5ca36ae911174222e5519ab7b0e42a69992742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-bet4-ivf-bench/src/kernel.rs:152-163 | crates/ruvector-bet4-ivf-bench/src/kernel.rs:202-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bet4-ivf-bench/src/kernel.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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/kernel.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaa0afb6f33e26568f135f5fc89526bd4e71ba1c7aa6f37d3c75ae24087f0ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-cli/src/cli/commands.rs:209-220 | crates/ruvector-cli/src/cli/graph.rs:457-467 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cli/src/cli/commands.rs:209\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/commands.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87648778cf3bc97d681d5664d0310fd3dfc8191270da661f2eb572f7fe84636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-cnn/src/kernels/int8_avx2.rs:311-322 | crates/ruvector-cnn/src/kernels/int8_neon.rs:296-307 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:311\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd339314bc824109e8749040c24402e5ddf8b9c49a0e74dece2a538f22529699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201312 lines \u00D7 4): crates/ruvector-cnn/src/simd/avx2.rs:547-550 | crates/ruvector-cnn/src/simd/avx2.rs:554-565 | crates/ruvector-cnn/src/simd/avx2.rs:571-582 | crates/ruvector-cnn/src/simd/avx2.rs:583-597 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:547\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2d11d631774b7473d9fff24772570f802a5cb02ca6852e705a6632ef42c99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:188-199 | crates/ruvector-cnn/src/simd/wasm.rs:156-167 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/wasm.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7ccce893fbed63fedb8eb6e21022ce45945e8c3633cfa0e0ddc2dc66ac1904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-cnn/src/simd/scalar.rs:266-277 | crates/ruvector-cnn/src/simd/scalar.rs:304-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/scalar.rs:266\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a688f3182c2cd1587191f9521d037a64f6861e0030a695c0665e957b0531748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-core/src/advanced_features/diskann.rs:177-188 | crates/ruvector-core/src/advanced_features/diskann.rs:288-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/diskann.rs:177\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/diskann.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"767889fbda265e6c933d590fb0dc88d4f91249fccf13780ad64e1dd8fce0256f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-core/src/advanced_features/multi_vector.rs:261-272 | crates/ruvector-core/src/advanced_features/multi_vector.rs:307-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/multi_vector.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd717b31a5201b7fb3e76e1a4892db7f55fbb6c9236b67cf51b35887c17aac6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201312 lines \u00D7 2): crates/ruvector-core/src/advanced_features/product_quantization.rs:165-176 | crates/ruvector-core/src/quantization.rs:219-224 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/advanced_features/product_quantization.rs\u0060 and \u0060crates/ruvector-core/src/quantization.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/product_quantization.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/product_quantization.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a54458ae31dab982f855edf8b753f3f03ea54a24e47994e5b825e05002e89c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-core/src/advanced_features/product_quantization.rs:191-202 | crates/ruvector-core/src/advanced_features/product_quantization.rs:229-240 \u2014 both copies are in the same file, so extract the block 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":"crates/ruvector-core/src/advanced_features/product_quantization.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0263e8531ade8736d9ae9e64e238b036d78bc003e5a7f51b79d9624c5f06e652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:86-97 | crates/ruvector-core/src/simd_intrinsics.rs:973-981 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:101\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:983\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d97ff9950fec811e85d99aec3f09b8c67c7139a5066e622a8fb1fc19ea6a585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:104-115 | crates/ruvector-core/src/simd_intrinsics.rs:983-990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:101\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:982\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1e8d0d8eab8a2ad0cac83bd4260b2278373a3d7988007a11e4f5a79637560b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:239-250 | crates/ruvector-core/src/simd_intrinsics.rs:304-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:238\u0060 calls \u0060_mm512_sub_ps\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:303\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"135dc857df9fb31de8a8a8cff97c5cbddc78c2678ec6c70192b64c6e6488cf38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:485-496 | crates/ruvector-core/src/simd_intrinsics.rs:666-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:485\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"450e33d6a35c7f7dd5edfed235ed6a162494b3967f819774bb84745a1300168a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-delta-core/src/delta.rs:347-358 | crates/ruvector-delta-wasm/src/apply.rs:14-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-core/src/delta.rs:347\u0060 it does not close everything it opens, so those exact 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 \u0060base\u0060 to \u0060\u0026mut Vec\u003Cf32\u003E\u0060 in one and \u0060\u0026mut [f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/delta.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1c0cd7fd2375b2894e1a00c6842ec336b0819e5f4f357c6431b7fc83d0a831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-delta-wasm/src/apply.rs:9-20 | crates/ruvector-delta-wasm/src/apply.rs:113-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-wasm/src/apply.rs:9\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-wasm/src/apply.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc5af4ce5df3ba2b597d256994846555b66c0068410f8301d895350a9319c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-diskann-node/src/lib.rs:118-129 | crates/ruvector-diskann-node/src/lib.rs:143-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diskann-node/src/lib.rs:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann-node/src/lib.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fd4ae08535451cb3601a6de4fee8fdb2e9398cccbba51829bdfb749be0a084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-diskann/src/distance.rs:265-276 | crates/ruvector-diskann/src/distance.rs:368-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diskann/src/distance.rs:265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-diskann/src/distance.rs:277\u0060 calls \u0060f32x4_sub\u0060 and \u0060crates/ruvector-diskann/src/distance.rs:380\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/distance.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f551870293463f28ae94d5aa84b172f5616dd6dbac3e51bab854768c248cd3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-diskann/src/distance.rs:292-303 | crates/ruvector-diskann/src/distance.rs:392-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diskann/src/distance.rs:292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-diskann/src/distance.rs:291\u0060 calls \u0060f32x4_sub\u0060 and \u0060crates/ruvector-diskann/src/distance.rs:391\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/distance.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e73c3dc91d81003f94d066e33386dab26d40441ec31a4cd1ba2be04ed4def6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-edge-store/src/ops/vector.rs:234-246 | edge/gateway/src/vectors.rs:248-260 \u2014 before extracting anything, compare \u0060crates/ruvector-edge-store/src/ops/vector.rs\u0060 and \u0060edge/gateway/src/vectors.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/vector.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"482924cad469174f7090750d2807a919d03423074f7b6e6ee0f8dee5c3b722d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:276-287 | crates/ruvector-py/src/graph/cypher_eval.rs:312-323 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/cypher_exec.rs:276\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7b6476da09f2a1cff3f069d48a341d2e114dd0d151f4ba26331537845ae57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph-node/src/lib.rs:1002-1013 | crates/ruvector-graph-node/src/lib.rs:1047-1058 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/lib.rs:1002\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb278873ed57369b17aa480fead658783c143a57b6ea3890d9795ccf0ffb9d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:1121-1132 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:1204-1215 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"792aab9adce4b8d695b97f909c1885a9d92a3fe98877071ac14fe817a80457d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph-transformer/src/economic.rs:540-551 | crates/ruvector-graph-transformer/src/economic.rs:553-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/economic.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ead98c4f7f3c9cb239e3b32c3d3bc7437a83b288c06953f51666afb4b7147e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph-transformer/src/sublinear_attention.rs:148-159 | crates/ruvector-graph-transformer/src/sublinear_attention.rs:206-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-transformer/src/sublinear_attention.rs:148\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/sublinear_attention.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21fedb297a7447950e361b62640e9ba1d8994640f499d7cf95acda943bd3d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:104-115 | crates/rvlite/src/cypher/parser.rs:100-111 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1be80078b19402dbe3067c8642a83d290708d1aa185a7b396174ac498a18d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:1037-1048 | crates/rvlite/src/cypher/parser.rs:938-949 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcf1d8519c3e355927b9d3072c128b954528de024fa51534f5e6e82f9e18d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph/src/cypher/semantic.rs:206-217 | crates/ruvector-graph/src/cypher/semantic.rs:400-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/semantic.rs:206\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 \u0060clause\u0060 to \u0060\u0026MatchClause\u0060 in one and \u0060\u0026WithClause\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/semantic.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd19071c3143956c48fd17f033e3557ed2d65afbf0df5fd604629178e226b0c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-graph/src/optimization/cache_hierarchy.rs:291-301 | crates/ruvector-graph/src/optimization/cache_hierarchy.rs:307-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/optimization/cache_hierarchy.rs:291\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/cache_hierarchy.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04dbda736e30ff6a76c1158b97b767c1197885fb85b37abacda25e97b67c4b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-hailo-cluster/src/pool.rs:155-166 | crates/ruvector-hailo-cluster/src/proto.rs:62-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/pool.rs:155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/pool.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a041e3624b77420d483a1dbd2c0c3aa782c42089ee590b08209752d3c412765e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-hyperbolic-hnsw/src/poincare.rs:136-147 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:314-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hyperbolic-hnsw/src/poincare.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw/src/poincare.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4885540121ca8ff1455e3f70713530db943bd35353bb29a5b718c9db365102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:267-278 | crates/ruvector-kge-wasm/src/model.rs:267-278 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2223659784a0c75a1a1377e448518b961c798b8b1d71b1ddec86c612787d7adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:329-340 | crates/ruvector-kge-wasm/src/model.rs:329-340 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bf29eb784bd8fc06dd0b3915fed73610a5c734abb9dd8e56e4f1ad35a1e89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:347-366 | crates/ruvector-kge-wasm/src/model.rs:347-366 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef0759726db55e2936aab0c1cf041d3301bb5b327f35516ad93d8a1a8388b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs:229-240 | crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs:259-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6be3e2d8b1676c2cd7f60c8be0822c937b6379b34a2345966a9453fd242ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-mincut-wasm/src/lib.rs:703-714 | crates/ruvector-mincut-wasm/src/lib.rs:753-764 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-wasm/src/lib.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a86deb81d7de4bcde80945e4996a8b9607df9f85967051f8d072806b3892bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-mincut/src/connectivity/cache_opt.rs:130-141 | crates/ruvector-mincut/src/connectivity/cache_opt.rs:158-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/connectivity/cache_opt.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/connectivity/cache_opt.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f457162e3ef75bd5e8019c89b7a129e23ec29d01d41c8d6311132766a8cbf9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-mincut/src/expander/mod.rs:205-216 | crates/ruvector-mincut/src/expander/mod.rs:245-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/expander/mod.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":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c409a5e84690d03ff37f0f1ab955b3503e7e8229301ceb2819cf092e9b9fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ruvector-mincut/src/linkcut/mod.rs:347-358 | crates/ruvector-mincut/src/linkcut/mod.rs:383-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/linkcut/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"172786fcf523728a7cdcf8b67b3f09bb6dc892d9e65635e932253aa8d6c40720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/hdc.rs:91-113 | crates/ruvector-nervous-system/src/hdc/vector.rs:185-209 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060other\u0060 to \u0060\u0026Hypervector\u0060 in one and \u0060\u0026Self\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/hdc.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ac144e346551735475cd5e1e42c99bb1479780bc173bc57dbcc47de1c341f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-nervous-system/src/separate/sparsification.rs:144-155 | crates/ruvector-nervous-system/src/separate/sparsification.rs:177-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system/src/separate/sparsification.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/separate/sparsification.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9602a55c65c6b2e712dfa7da8f232a0a2e643f3a6ecf648e7b92746d56b8bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1540-1548 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:206-217 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20371e025b42d4f87740231d99822afa39cf5fd3ce55a72cfcaaf3bd6b3feba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/ruvector-postgres/src/gated_transformer/mod.rs:157-168 | crates/ruvector-postgres/src/gated_transformer/mod.rs:454-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/gated_transformer/mod.rs:157\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gated_transformer/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2404c4b209189f72abc7caf3ce97a73d64d25a9807daab75216bcfe24c5a5dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-postgres/src/gnn/gcn.rs:34-45 | crates/ruvector-postgres/src/gnn/graphsage.rs:56-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gnn/gcn.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e628748744bac3fa5b18966054fcb24fc57c76b3afd955d9fc14d7e9dc518fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1025-1036 | crates/ruvector-postgres/src/graph/sparql/executor.rs:1051-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:1025\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"c658bc854480d9daab81dda247fbb3eb15149e838f1535340b5c4ab954580223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-postgres/src/healing/mod.rs:86-97 | crates/ruvector-postgres/src/healing/mod.rs:101-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 \u0060crates/ruvector-postgres/src/healing/mod.rs:86\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/healing/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e037f923e198c6101111b6889f6c1ed76629e34aea0bc40b56e51273cf403e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-postgres/src/quantization/binary.rs:108-119 | crates/ruvector-postgres/src/types/binaryvec.rs:225-235 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/binary.rs\u0060 and \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/binaryvec.rs:225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/quantization/binary.rs:120\u0060 calls \u0060_mm256_add_epi64\u0060 and \u0060crates/ruvector-postgres/src/types/binaryvec.rs:236\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/binary.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d214d626221f462e8481203b525754dbb3b8c8a72bf6fe805a255e7fedb4816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-postgres/src/tenancy/validation.rs:163-174 | crates/ruvector-postgres/src/tenancy/validation.rs:209-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/tenancy/validation.rs:163\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/validation.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c77739942b565daaedf1a06c9be097d2bfdff02dce9ee2f5d43a13d5fd9a3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-pq-search/src/codebook.rs:242-253 | crates/ruvector-pq-search/src/ivf_pq.rs:227-238 \u2014 before extracting anything, compare \u0060crates/ruvector-pq-search/src/codebook.rs\u0060 and \u0060crates/ruvector-pq-search/src/ivf_pq.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-pq-search/src/codebook.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":"crates/ruvector-pq-search/src/codebook.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"471c2ffe9cc6af4de10e1dae847f22c15ee9ab83376659e0e58422f2af1b083e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-recall-bounded/src/lib.rs:248-259 | crates/ruvector-recall-bounded/src/lib.rs:411-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cedf3702cdb522f927e80d506aa17bb73816e8494f96bc69a165fd94c36762b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-rulake/src/bin/rulake-demo.rs:52-63 | crates/ruvector-rulake/src/bin/rulake-demo.rs:77-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rulake/src/bin/rulake-demo.rs:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/bin/rulake-demo.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2654792f080020a794bab059e93935f1f2aba3ae72980198c77cc5103988f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-solver/src/types.rs:345-356 | crates/ruvector-solver/src/types.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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/types.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"663fbf23f1bf2ee55cc1b2536b8a08e297c6cfc3a7e333e8a8a84ebcfea528db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ruvector-sparse-inference/src/model/gguf.rs:410-421 | crates/ruvector-sparse-inference/src/model/gguf.rs:531-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/model/gguf.rs:410\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcc35b12a0d6657477b7318381bbc0d8b4c0e8ba400f967cddf3f4550528223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-sparse-inference/src/precision/quantizers.rs:130-141 | crates/ruvector-sparse-inference/src/precision/quantizers.rs:149-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/precision/quantizers.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5242847c78f264ca9080443201e44670b30cfb91254c8621945ce1a06af46a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvector-streaming-qng/src/dataset.rs:36-47 | crates/ruvector-streaming-qng/src/dataset.rs:71-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-streaming-qng/src/dataset.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":"crates/ruvector-streaming-qng/src/dataset.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dea05a3eb2b09b6243afc827fe077eb19ebe3161dbad3c1b22fda5babf236b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-temporal-tensor/src/quantizer.rs:177-188 | crates/ruvector-temporal-tensor/src/quantizer.rs:232-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/quantizer.rs:177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"66577595eca258522e515109d755b28d36e807a60d27542eac1f0c8eee46615c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-timesfm/src/forecaster.rs:91-102 | crates/ruvector-timesfm/src/forecaster.rs:119-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-timesfm/src/forecaster.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-timesfm/src/forecaster.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"157d09ff559ef734c94a46b780fc48c3bda9f45d7f0074d62c41b77a351262e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-wasm/src/kernel/signature.rs:65-76 | crates/ruvector-wasm/src/kernel/signature.rs:86-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-wasm/src/kernel/signature.rs:65\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/kernel/signature.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bf4b17b8636a8aa42fcdbf95645e9e2c7f667d36be9288c18be0e7e2e434a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvix/crates/cap/src/table.rs:229-240 | crates/ruvix/crates/cap/src/table.rs:249-260 \u2014 both copies are in the same file, so extract the block 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":"crates/ruvix/crates/cap/src/table.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"94da82d8ff5540006a399135948b1e202311f8c87b1c48a8a53bae6c91e81a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvix/crates/net/src/stack.rs:317-328 | crates/ruvix/crates/net/src/stack.rs:494-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/stack.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"658ded36c199afedbb1fbcc693a7807c7d1688328a644a109c9ee56f6d150c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm-wasm/src/pi_quant_wasm.rs:291-302 | crates/ruvllm/src/quantize/pi_quant.rs:1409-1420 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/pi_quant_wasm.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b431a86eef95d3b13e07df396b606d9244cf89ba7f48dced70aab21af59ad31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm-wasm/src/pi_quant_wasm.rs:390-401 | crates/ruvllm-wasm/src/pi_quant_wasm.rs:540-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/pi_quant_wasm.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6035cc86860663c9baa3a05c88d6b69edf5a7f7200959120a67a688879297606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u201312 lines \u00D7 21): crates/prime-radiant/src/attention/adapter.rs:180-181 | crates/ruvector-attention/src/attention/flash.rs:508-508 | crates/ruvector-attention/src/curvature/fused_attention.rs:310-311 | crates/ruvector-attention/src/hyperbolic/lorentz_cascade.rs:127-128 | crates/ruvector-attention/src/info_geometry/natural_gradient.rs:92-93 | crates/ruvector-attention/src/pde_attention/diffusion.rs:208-209 | crates/ruvector-attention/src/sheaf/sparse.rs:427-429 | crates/ruvector-attention/src/topology/gated_attention.rs:272-273 | crates/ruvector-attention/src/transport/centroid_ot.rs:319-320 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:280-281 | crates/ruvector-decompiler/src/transformer.rs:400-401 | crates/ruvector-gnn/src/layer.rs:207-207 | crates/ruvector-graph-transformer/src/economic.rs:155-155 | crates/ruvector-graph-transformer/src/manifold.rs:1247-1248 | crates/ruvector-graph-transformer/src/physics.rs:406-407 | crates/ruvector-graph-transformer/src/physics.rs:408-408 | crates/ruvector-py/src/gnn.rs:430-431 | crates/ruvllm/src/backends/coreml_backend.rs:696-707 | crates/ruvllm/src/backends/coreml_backend.rs:1116-1127 | crates/ruvllm/src/backends/gemma2.rs:490-491 | crates/ruvllm/src/qat/distillation.rs:341-342 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/attention/adapter.rs\u0060 and \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/coreml_backend.rs:696\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-graph-transformer/src/physics.rs:407\u0060 calls \u0060iter\u0060, \u0060exp\u0060, \u0060collect\u0060 and \u0060crates/prime-radiant/src/attention/adapter.rs:180\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7a37fe59828ecfcf1cee7cff63404c0f4bc87261bafaf16faac2f495d37e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:1686-1697 | crates/ruvllm/src/bitnet/backend.rs:1921-1931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:1686\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d9a61c31bda9c7522c70f052dd749971afdaa049092a69d0c1f23874797e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201312 lines \u00D7 3): crates/ruvllm/src/bitnet/expert_cache.rs:540-551 | crates/ruvllm/src/bitnet/expert_cache.rs:559-561 | crates/ruvllm/src/bitnet/expert_cache.rs:599-610 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/expert_cache.rs:540\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/expert_cache.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"4582a2de4257e7054f718c3a6a690e18ad3cd23faddc00433cdba9d5262e4b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvllm/src/claude_flow/pretrain_pipeline.rs:1291-1301 | crates/ruvllm/src/claude_flow/task_generator.rs:1047-1058 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/claude_flow/pretrain_pipeline.rs:1291\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/pretrain_pipeline.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe2ddad55a976c093a3f045090c543d988e17ea1844b427638c7d4ad678d94b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvllm/src/claude_flow/reasoning_bank.rs:747-758 | crates/ruvllm/src/claude_flow/reasoning_bank.rs:1131-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":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6ca274583a3e9d5bfec7aebc45d0267bc70a1dca9d9cc9abefb379573528c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/kernels/activations.rs:579-590 | crates/ruvllm/src/kernels/attention.rs:1900-1911 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/kernels/activations.rs\u0060 and \u0060crates/ruvllm/src/kernels/attention.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/activations.rs:579\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/activations.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace9c44270c637ba0a18d56cebe991fb274b3358d4b935513b09f8718778b81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:1053-1064 | crates/ruvllm/src/kernels/attention.rs:1420-1431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb55c1870d920c8d2fd53722f50e84b4aabce091ba0e5136737aeb5998675a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/kernels/quantized.rs:468-479 | crates/ruvllm/src/kernels/quantized.rs:512-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/quantized.rs:468\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/quantized.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78bf0e454508192b5c64105059317591c7b31cda3b7ae65009e14b1f018b7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ruvllm/src/kernels/quantized.rs:629-640 | crates/ruvllm/src/kernels/quantized.rs:714-723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/quantized.rs:629\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/quantized.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7a0d8458e5827cecd29547d74320a1933a0553d6d180799cc05c713e076ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/kernels/rope.rs:241-252 | crates/ruvllm/src/kernels/rope.rs:494-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/rope.rs:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/rope.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"852f0b61633a914605130ca23fcab6b16c8ca5f83b9d3202c0698c15fe051518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/ruvllm/src/models/openmythos/mod.rs:331-342 | crates/ruvllm/src/models/rdt.rs:768-776 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/openmythos/mod.rs\u0060 and \u0060crates/ruvllm/src/models/rdt.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/mod.rs:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9681b6cceb0453855facb7542ed2993c797b1adc3a57ff88faed0365271d6f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/models/openmythos/rope.rs:38-49 | crates/ruvllm/src/models/rdt.rs:1122-1133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/rope.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7322b6f9e5a8edff3af6a15f4b917bb5e9db5f58f8c39d79f697c17dc7864be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvllm/src/models/openmythos/rope.rs:64-74 | crates/ruvllm/src/models/rdt.rs:1152-1163 \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":"crates/ruvllm/src/models/openmythos/rope.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40270a4af69dab7b49467e0aa8268dd00ed582cfdf74d85d597adeb9d964751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/models/ruvltra.rs:989-1000 | crates/ruvllm/src/models/ruvltra_medium.rs:904-915 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra_medium.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/ruvltra.rs:989\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026RuvLtraConfig\u0060 in one and \u0060\u0026RuvLtraMediumConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3f038708e843142303e647ac459a05b0f1edf3ec981cd49d08816cee7269d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/quality/validators.rs:234-245 | crates/ruvllm/src/quality/validators.rs:397-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quality/validators.rs:234\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/validators.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"153f615b56d51fe2092e72d11256ceb6bdfc14eb82e99f1f4b4fbb202b397503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/quantize/hadamard.rs:413-424 | crates/ruvllm/src/quantize/hadamard.rs:470-481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/hadamard.rs:413\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd185fffb54784118c1caaf38f037a9f3182cea6d7a0a30c4230156a12dfaed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvllm/src/quantize/ruvltra_quant.rs:1015-1026 | crates/ruvllm/src/quantize/ruvltra_quant.rs:1054-1064 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/ruvltra_quant.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e0593152796ac16d8ac6cc992ca98790cd1afedcbdb28e91771a0e4ce762a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ruvllm/src/serving/engine.rs:790-801 | crates/ruvllm/src/serving/engine.rs:1051-1061 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/serving/engine.rs:790\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"3235c4a74829d5b6990ba85753da149ccfa98e2f9e06d924bfa852296c988daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:139-150 | crates/ruvllm_sparse_attention/src/attention.rs:1308-1319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"694f91a523e2c49a1bb6ea921dbb91f9466a92781af696f161f879c7107e85c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201312 lines \u00D7 3): crates/ruvllm_sparse_attention/src/attention.rs:329-340 | crates/ruvllm_sparse_attention/src/attention.rs:491-493 | crates/ruvllm_sparse_attention/src/attention.rs:1501-1512 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:329\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b312816aef07c3619a0e978a8aaf92fa0c5c85425488ce5d1aff7bd8745cb93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:1131-1138 | crates/ruvllm_sparse_attention/src/attention.rs:1961-1972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:1131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"004c42fa5b714e66610d9631047fcc03faa14665ab34b187b0a1858fecd0d1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/filesystem.rs:533-544 | crates/rvAgent/rvagent-backends/src/filesystem.rs:579-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-backends/src/filesystem.rs:533\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"477c1d906a54f9dba84bebb36ac79f7ea23056439880c308f872429a5b99e42b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvAgent/rvagent-core/src/agi_container.rs:36-47 | crates/rvAgent/rvagent-wasm/src/rvf.rs:36-47 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/agi_container.rs\u0060 and \u0060crates/rvAgent/rvagent-wasm/src/rvf.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-core/src/agi_container.rs:36\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a146dabe17e885ae5f375c163cda349f75fc13b34cd1a778a5993a8d4f394c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvAgent/rvagent-mcp/src/client.rs:72-83 | crates/rvAgent/rvagent-mcp/src/client.rs:140-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/client.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c408f85f8e6778e0a0f5d35093e987c462d8b93fc39672b372926afa2d0f4538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/rvf/rvf-index/src/codec.rs:247-258 | crates/rvf/rvf-index/src/codec.rs:261-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/codec.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b5c7c3b3f616628cac60c7ab02841939660623bfa5b07b56c011a962e66035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/rvf/rvf-runtime/src/cow.rs:252-263 | crates/rvf/rvf-runtime/src/cow.rs:278-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/cow.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b9a700baea881f8ed8c467cc30af7a01f9fb3305626a90362f4d06f2cf0281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvf/rvf-runtime/src/read_path.rs:617-628 | crates/rvf/rvf-server/src/tcp.rs:347-358 \u2014 before extracting anything, compare \u0060crates/rvf/rvf-runtime/src/read_path.rs\u0060 and \u0060crates/rvf/rvf-server/src/tcp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/read_path.rs:617\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"33eee851fdac3e92068d67bc5463d8ce360a6cbec61cba990e1e7a8beac0cf57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:2272-2283 | crates/rvf/rvf-runtime/src/store.rs:2501-2512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:2272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c405964178d90587bddbfdf512cbf5796bbd5711618cabd661a92b5a480c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvf/rvf-types/src/agi_container.rs:445-456 | crates/rvf/rvf-types/src/witness.rs:236-247 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-types/src/agi_container.rs:445\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/agi_container.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df8144f611afd1aee7d3dff21677ac9507fd4ab113c0ed505b53823b802fdfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/rvf/rvf-wasm/src/store.rs:217-228 | crates/rvf/rvf-wasm/src/store.rs:248-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-wasm/src/store.rs:217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf/rvf-wasm/src/store.rs:259\u0060 calls \u0060write_u32\u0060 and \u0060crates/rvf/rvf-wasm/src/store.rs:229\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wasm/src/store.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a3e3ca1c575e18cd297f91fb83ddd11130a40c85c1d841aeb02d54b7e4bb86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvf/rvf-wire/src/stream/mod.rs:114-125 | crates/rvf/rvf-wire/src/stream/mod.rs:130-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"99407998e6a7aacf29b70e14961c78f11dee0bc965aec2999ca4307dea4bea01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/rvforge-reader/src/receipts.rs:102-113 | crates/rvforge-reader/src/witness_receipt.rs:210-220 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvforge-reader/src/receipts.rs:102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/receipts.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"226822014f45863d5a322916cb5c7d572701b35ad58ef9c00a97c62de1d1ebef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvlite/src/lib.rs:818-829 | crates/rvlite/src/lib.rs:835-846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvlite/src/lib.rs:818\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/lib.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a607e02c3b8e5fbfd7bbc9e2da8123a70eda7a77b9862a1fdcb176e0c292a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/rvlite/src/sparql/parser.rs:2320-2331 | crates/rvlite/src/sparql/parser.rs:2346-2355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvlite/src/sparql/parser.rs:2320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/parser.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9df24740eceb6ac2e1854b40658e87b38d9957eb03439530c73267ae534843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvlite/src/sparql/triple_store.rs:242-253 | crates/rvlite/src/sparql/triple_store.rs:284-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/sparql/triple_store.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f571a546781ddfae95eae4cd18abb2259f1555c27bf0181f57d240a1cf284f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvm/crates/rvm-witness/src/seal.rs:488-499 | crates/rvm/crates/rvm-witness/src/seal.rs:537-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/seal.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"58541ac0aac3e7babe7755796055448a49afbcd093458a183aacfbdc1b5338e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/sona/src/napi.rs:268-279 | crates/sona/src/napi_simple.rs:414-425 \u2014 before extracting anything, compare \u0060crates/sona/src/napi.rs\u0060 and \u0060crates/sona/src/napi_simple.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/napi.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30ad40716f36c4eb70a42f2fb8931b6fc09e28f359f3fc516ac63abe132f216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:409-421 | patches/candle-core-0.9.2/src/backprop.rs:414-426 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf2d49945986dea76b6f18c1cbaaf4c5c7ffce87decd7483cc990c51eaad57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:955-966 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1145-1155 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:955\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b888c474c0dde084ab5c22b0942766ec77a5e027d1e5ead1e0e4bd1c9271852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:226-246 | patches/candle-core-0.9.2/src/device.rs:346-366 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b813d1133a5e1e6c2621b13e0fc52e42f15b0296de008d4404fff61fff89c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:264-284 | patches/candle-core-0.9.2/src/device.rs:384-404 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"133687a729689736088b5cbaa8c37292f5decaf8968ffea713c25aa3c36757e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:347-358 | patches/candle-core-0.9.2/src/device.rs:450-461 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fcaf05ce29e19c5dc1712ed07d0ca81afdebc2ea2997a89b9806d881f17f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:13-21 | patches/candle-core-0.8.4/src/display.rs:503-514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/display.rs:503\u0060 it does not close everything it opens, so those exact 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":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cc4e5a285d56b24a4d875a393f24fd4b7cf3cc40b386d43b79b01957556dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:878-908 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:924-954 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:878\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:923\u0060 calls \u0060drop\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:877\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b65f3affcb91a366328a613dc823fb699f41bdaa68a15e515c4f398a7e16299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1028-1045 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1078-1095 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd68d5d1413d516bb50ca5e6f0ea346e0fa20d46962d547b33c984b0985ef140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1068-1079 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1120-1131 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:1119\u0060 calls \u0060drop\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1067\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cbdd524d18033faeca580ac13fbe608f1dd3ac2cc167d3b86933287d39fa7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1304-1315 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1421-1432 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:1421\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1ec5b4a485c07a5ba6dffc2e823b04fbc0102362a52006eda80e53f0788d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1543-1552 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1692-1703 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1543\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04c91a977e1037e9967d1ee6dc1472080203faba7ac51580a2f64ae1b061618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1638-1659 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1786-1807 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1638\u0060 it begins part-way through the construct above it, so those exact 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, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:1808\u0060 calls \u0060command_encoder\u0060, \u0060set_label\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1660\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f99be0b3a5f5bdcb5fcd389c42f4900ee58c1612e30c7278f7fe0b84baa36d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:76-87 | patches/candle-core-0.9.2/src/npy.rs:76-87 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/npy.rs:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4783f002fcc18c3c39a6de96e19720cc59f0808f488889c8a3e081016eca0802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/avx.rs:591-601 | patches/candle-core-0.8.4/src/quantized/avx.rs:604-615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b7eb111aec0c374cc36934097acffd36665715215dd41772dfaa65d482bafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:144-155 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:144-155 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fc9d228c34bd4601ececde99fcb43651804665ddb34cdaf68ea1654a8282ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/neon.rs:247-258 | patches/candle-core-0.8.4/src/quantized/neon.rs:330-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:247\u0060 it does not close everything it opens, so those exact 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 \u0060xs\u0060 to \u0060\u0026[BlockQ5K]\u0060 in one and \u0060\u0026[BlockQ4K]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:245\u0060 calls \u0060vdupq_n_u8\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:329\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":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a8c7c848fe69578d4eec819820348002c2304588d32f0ac0a739751b0a37c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:168-179 | patches/candle-core-0.9.2/src/safetensors.rs:185-196 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1f13230e015bcbf91086e557ae15ac25d8e5c362c77344d63f36c855b7045b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/sort.rs:144-155 | patches/candle-core-0.9.2/src/sort.rs:174-185 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/sort.rs\u0060 and \u0060patches/candle-core-0.9.2/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/sort.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c7ae45b92d0fed98901c1e732baf7b4d75c1c99681361cd267e308c879600c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/sort.rs:215-226 | patches/candle-core-0.9.2/src/sort.rs:261-272 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/sort.rs\u0060 and \u0060patches/candle-core-0.9.2/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a40f1c70a5547f4565dd1faef4b364b4eb50f80544afbae856057f160d5c61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:17-28 | patches/candle-core-0.9.2/src/storage.rs:18-29 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d485427349a0b0b8d3881d71efc69b297c363fa74b7e27d8b09ce830fc6a79d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): patches/candle-core-0.8.4/src/streaming.rs:178-196 | patches/candle-core-0.9.2/src/streaming.rs:178-196 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/streaming.rs\u0060 and \u0060patches/candle-core-0.9.2/src/streaming.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dae898517aee00147a52470f702805feb24c0fbdf494c1817ad1b0b20a5e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:597-609 | patches/candle-core-0.9.2/src/tensor.rs:665-677 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:597\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efb7a0c6ec23c73cea7acb7f98a396c62fdb94ee52313d9c630099ab794c4b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:622-636 | patches/candle-core-0.9.2/src/tensor.rs:690-704 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1e007388ff8f2872f68f00977ea124357a3bc3db1deb2cb7c53d4f0cda226d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1308-1319 | patches/candle-core-0.9.2/src/tensor.rs:1566-1577 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6745b41df8b9475db8c06957e32ea1e5afc17ca91ffcecb4ce392ac4ef59b3d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:149-160 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:280-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:149\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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0514e0aff0b7e668af8a56da609b5f6d693d908cacbc3e2f11c3c966d74c6df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): patches/candle-core-0.9.2/src/display.rs:13-21 | patches/candle-core-0.9.2/src/display.rs:540-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/display.rs:540\u0060 it does not close everything it opens, so those exact 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":"patches/candle-core-0.9.2/src/display.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1534f38533a1c9f9ad3b6f282da296e4ed16a20b5a510f8d595d03adcdbebd87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.9.2/src/safetensors.rs:270-281 | patches/candle-core-0.9.2/src/safetensors.rs:367-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/safetensors.rs:270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5732b30a2842370ce7ec1f6b7e9264986533efbec36ee8465aba3202efc5ba69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/hnsw_rs/src/flatten.rs:114-125 | scripts/patches/hnsw_rs/src/flatten.rs:114-125 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/flatten.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/flatten.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/flatten.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c254b77343458891f63d809e03f2b22db2389daf7e60102776963ff29c742cf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:176-187 | scripts/patches/hnsw_rs/src/hnsw.rs:176-187 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7c2704e1440f21749607313dd727560941507f26f16658ff81a57cecc31814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:190-201 | scripts/patches/hnsw_rs/src/hnsw.rs:190-201 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"db002888d9bdf0e0707e5f1da19df964cb2e431a7ba08f7e92be7b5c2e4293e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1245-1256 | scripts/patches/hnsw_rs/src/hnsw.rs:1231-1242 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:1245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"27edba6a0e2cf8bf2458e43d1d3aef7d239d0f48c0cdc7ab57aa5e28924f2a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 21): crates/ruvector-postgres/src/attention/operators.rs:94-104 | crates/ruvector-postgres/src/attention/operators.rs:108-118 | crates/ruvector-postgres/src/attention/operators.rs:189-199 | crates/ruvector-postgres/src/attention/operators.rs:203-213 | crates/ruvector-postgres/src/attention/operators.rs:293-303 | crates/ruvector-postgres/src/attention/operators.rs:342-352 | crates/ruvector-postgres/src/attention/operators.rs:356-366 | crates/ruvector-postgres/src/attention/operators.rs:428-438 | crates/ruvector-postgres/src/attention/operators.rs:442-452 | crates/ruvector-postgres/src/attention/operators.rs:520-530 | crates/ruvector-postgres/src/attention/operators.rs:534-544 | crates/ruvector-postgres/src/attention/operators.rs:567-577 | crates/ruvector-postgres/src/attention/operators.rs:581-591 | crates/ruvector-postgres/src/attention/operators.rs:652-662 | crates/ruvector-postgres/src/attention/operators.rs:666-676 | crates/ruvector-postgres/src/attention/operators.rs:763-773 | crates/ruvector-postgres/src/attention/operators.rs:777-787 | crates/ruvector-postgres/src/gnn/operators.rs:29-39 | crates/ruvector-postgres/src/gnn/operators.rs:77-87 | crates/ruvector-postgres/src/gnn/operators.rs:158-168 | crates/ruvector-postgres/src/gnn/operators.rs:215-225 \u2014 there are 21 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 21 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/attention/operators.rs:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30ca43b16c8394610fa5c5aae24d32e7d59aaaf63a760221cd151f84172458b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): crates/ruvector-attention/src/curvature/component_quantizer.rs:148-158 | crates/ruvector-attention/src/curvature/fused_attention.rs:279-289 | crates/ruvector-attention/src/curvature/tangent_space.rs:168-178 | crates/ruvector-attention/src/info_geometry/fisher.rs:163-173 | crates/ruvector-attention/src/pde_attention/diffusion.rs:177-187 | crates/ruvector-attention/src/topology/gated_attention.rs:241-251 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:290-300 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 and \u0060crates/ruvector-attention/src/curvature/tangent_space.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/curvature/component_quantizer.rs:148\u0060 it does not close everything it opens, so those exact 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 \u0060a\u0060 to \u0060\u0026[i8]\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/component_quantizer.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b43921b162588ad327b89ae4b2865d73c4ee823035a08cfbdf2264b5eff845b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 7): crates/ruvector-attention/src/graph/dual_space.rs:278-297 | crates/ruvector-attention/src/graph/edge_featured.rs:345-364 | crates/ruvector-attention/src/graph/rope.rs:291-310 | crates/ruvector-attention/src/moe/moe_attention.rs:185-204 | crates/ruvector-attention/src/sparse/flash.rs:164-183 | crates/ruvector-attention/src/sparse/linear.rs:182-201 | crates/ruvector-attention/src/sparse/local_global.rs:140-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times. 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 \u0060keys\u0060 to \u0060\u0026[\u0026[f32]]) -\u003E (Vec\u003Cf32\u003E\u0060 in one and \u0060\u0026[\u0026[f32]]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/dual_space.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b565ca2c80e6ded9f8bcae5015ba154378352930ee8547d0f53799e6ed8b4a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 6): crates/ruvector-fpga-transformer/src/backend/native_sim.rs:464-470 | crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:297-303 | crates/ruvector-fpga-transformer/src/quant/lut.rs:153-163 | crates/ruvector-mincut-gated-transformer/src/attention/window.rs:174-184 | crates/ruvector-mincut-gated-transformer/src/attention/window.rs:337-345 | crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:431-439 \u2014 before extracting anything, compare \u0060crates/ruvector-fpga-transformer/src/backend/native_sim.rs\u0060 and \u0060crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/backend/native_sim.rs:464\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98869182ad26fd399f505b9099d52c0475f558165ac8cd052405b123f6a8c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 6): crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:294-300 | crates/ruvector-fpga-transformer/src/quant/lut.rs:148-158 | crates/ruvector-mincut-gated-transformer/src/attention/window.rs:169-179 | crates/ruvector-mincut-gated-transformer/src/attention/window.rs:333-341 | crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:427-435 | crates/ruvllm/src/kernels/ane_ops.rs:636-644 \u2014 before extracting anything, compare \u0060crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs\u0060 and \u0060crates/ruvector-fpga-transformer/src/quant/lut.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:294\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:422\u0060 calls \u0060into_iter\u0060, \u0060collect\u0060 and \u0060crates/ruvector-mincut-gated-transformer/src/attention/window.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":"crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"534ef242c6ae89cb712ee4459a9edc32323b188f9fb6238a00e70b0f2e9a87cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 7): crates/ruvllm/src/quantize/pi_quant_simd.rs:276-286 | crates/ruvllm/src/quantize/pi_quant_simd.rs:289-299 | crates/ruvllm/src/quantize/pi_quant_simd.rs:302-312 | crates/ruvllm/src/quantize/pi_quant_simd.rs:315-325 | crates/ruvllm/src/quantize/pi_quant_simd.rs:328-338 | crates/ruvllm/src/quantize/pi_quant_simd.rs:341-351 | crates/ruvllm/src/quantize/pi_quant_simd.rs:352-361 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/quantize/pi_quant_simd.rs:275\u0060 calls \u0060vandq_u32\u0060, \u0060vshlq_u32\u0060, \u0060vst1q_f32\u0060 and \u0060crates/ruvllm/src/quantize/pi_quant_simd.rs:352\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant_simd.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f37bfd4fe6ef24e4152630c47f4478ae9ecffac80e435f9ac5a53f4db687d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 5): patches/candle-core-0.8.4/src/tensor.rs:2253-2262 | patches/candle-core-0.8.4/src/tensor.rs:2291-2301 | patches/candle-core-0.9.2/src/tensor.rs:2576-2585 | patches/candle-core-0.9.2/src/tensor.rs:2614-2624 | patches/candle-core-0.9.2/src/tensor.rs:2960-2970 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:2291\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.8.4/src/tensor.rs:2262\u0060 calls \u0060Ok\u0060, \u0060Tensor\u0060, \u0060clone\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs:2970\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e271c4fa087dd4e4f79e0f31921ef1cbabe3c658b83012db89e70376aa68a004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/ruvector-attn-mincut/src/gating.rs:31-41 | crates/ruvector-fpga-transformer/src/backend/native_sim.rs:465-475 | crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:298-308 | crates/ruvector-fpga-transformer/src/quant/lut.rs:156-168 \u2014 before extracting anything, compare \u0060crates/ruvector-fpga-transformer/src/backend/native_sim.rs\u0060 and \u0060crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attn-mincut/src/gating.rs:31\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attn-mincut/src/gating.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b0aff826d3a78929f6a6687fc5cf7004de6e53d87c61357fe2fde760a366a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/ruvector-cnn/src/layers/quantized_conv2d.rs:141-151 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:127-137 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:44-54 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:135-145 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/quantized_depthwise.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab54df18ea2318dfe3e76eac1ec3918b0d35e2f91d8b47018b37f21e7475632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/ruvector-graph/src/cypher/parser.rs:524-534 | crates/ruvector-graph/src/cypher/parser.rs:1216-1226 | crates/rvlite/src/cypher/parser.rs:514-524 | crates/rvlite/src/cypher/parser.rs:1087-1097 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:524\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0ab41b07220751d943b83794274805b2a2661987b579ef295a40cbcb757422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/ruvector-postgres/src/graph/sparql/parser.rs:1682-1692 | crates/ruvector-postgres/src/graph/sparql/parser.rs:1730-1740 | crates/rvlite/src/sparql/parser.rs:1721-1731 | crates/rvlite/src/sparql/parser.rs:1769-1779 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bd3336bccf8887bc5efb9e6a53c6d7ae437b914e989de506d6d8d574657c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/ruvector-postgres/src/hyperbolic/operators.rs:32-42 | crates/ruvector-postgres/src/hyperbolic/operators.rs:108-118 | crates/ruvector-postgres/src/hyperbolic/operators.rs:147-157 | crates/ruvector-postgres/src/hyperbolic/operators.rs:186-196 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hyperbolic/operators.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"564c07a9394aeab9f3e86becb63822ddc50002c8d9b615f52087127d7e9e5ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/ruvllm/src/backends/phi3.rs:319-329 | crates/ruvllm/src/kernels/attention.rs:1606-1616 | crates/ruvllm/src/models/ruvltra.rs:572-582 | crates/ruvllm/src/models/ruvltra_medium.rs:587-597 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/phi3.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"229f817b95c225a985868e5a5f69d5268d93fc10774327b2e466ec8d7093019f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 4): crates/ruvllm/src/lora/micro_lora.rs:329-337 | crates/ruvllm/src/lora/micro_lora.rs:373-383 | crates/ruvllm/src/lora/micro_lora.rs:425-433 | crates/ruvllm/src/lora/micro_lora.rs:495-505 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/lora/micro_lora.rs:329\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/lora/micro_lora.rs:491\u0060 calls \u0060vdupq_n_f32\u0060 and \u0060crates/ruvllm/src/lora/micro_lora.rs:370\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb8cbd7aedcce9e8402091e8df6c40fb78cfe46b9708213baeefb7db0514d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): patches/candle-core-0.8.4/src/safetensors.rs:282-292 | patches/candle-core-0.8.4/src/safetensors.rs:312-322 | patches/candle-core-0.9.2/src/safetensors.rs:437-447 | patches/candle-core-0.9.2/src/safetensors.rs:467-477 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bc6470439ebea5360f84e6db1733bcce37260853e653dfa507fef55fe63314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): patches/hnsw_rs/src/hnswio.rs:504-514 | patches/hnsw_rs/src/hnswio.rs:593-603 | scripts/patches/hnsw_rs/src/hnswio.rs:504-514 | scripts/patches/hnsw_rs/src/hnswio.rs:593-603 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnswio.rs:504\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1dfb3a9626dd5152fd76f2159b5e4e856433734621bcb6e4a6ebc030ba8097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/prime-radiant/src/simd/matrix.rs:179-189 | crates/prime-radiant/src/simd/matrix.rs:249-258 | crates/prime-radiant/src/simd/vectors.rs:256-266 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/matrix.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/matrix.rs:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/matrix.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bef3f1c03196357012390657362dab18c7b9e8cd4ea16e8c5eac64dd6d3d639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvector-cnn/src/layers/pooling.rs:34-44 | crates/ruvector-cnn/src/layers/pooling.rs:119-129 | crates/ruvector-cnn/src/layers/pooling.rs:221-231 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/pooling.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc8dc2f2024562f0160212b45bfca6fb363c2e016397dd512fecaaec54fa960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvector-core/src/quantization.rs:525-535 | crates/ruvector-core/src/simd_intrinsics.rs:1265-1275 | crates/ruvector-core/src/simd_intrinsics.rs:1314-1324 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/quantization.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/quantization.rs:525\u0060 it does not close everything it opens, so those exact 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 \u0060a\u0060 to \u0060\u0026[u8]\u0060 in one and \u0060\u0026[i8]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f123ad0bee1ee2c02fc6af258767b9c148a99bc3a5e80dd130aa1fc7c9bc2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:132-142 | crates/ruvector-core/src/simd_intrinsics.rs:1078-1085 | crates/ruvector-postgres/src/distance/simd.rs:1015-1022 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:131\u0060 calls \u0060_mm256_setzero_ps\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:1077\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"752b2289ffc016875fb3679b0b91899bdacd29a26c7d1908bfbf1464485a340f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruvector-dag/src/healing/strategies.rs:39-49 | crates/ruvector-dag/src/healing/strategies.rs:80-89 | crates/ruvector-dag/src/healing/strategies.rs:112-121 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-dag/src/healing/strategies.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/healing/strategies.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"149d22f1f2955251d29a3b5f49b6da6560c5dcdf183976da3ac703a03432e7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/bench.rs:323-334 | crates/ruvector-hailo-cluster/src/bin/embed.rs:315-325 | crates/ruvector-hailo-cluster/src/bin/stats.rs:256-266 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:323\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c17e9626e8f5dd08a8d7ca7cfb77d869739d988896f3190134cb598e011eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:189-199 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:249-259 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:164-175 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c49623ed2d809473abf03edfd20f1b91f634b1db1a7fc36ce54803ce41338c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvector-kge-ffi/src/ops.rs:64-74 | crates/ruvector-kge-wasm/src/ops.rs:64-74 | crates/ruvector-temporal-tensor/src/agentdb.rs:83-94 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/ops.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/ops.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 247 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-kge-ffi/src/ops.rs:64\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"83840d4378e8a384c07248c7ee171128522cb28c75d8143d5d758afb20f48bbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:98-108 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:187-196 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:320-329 \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":"crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dcc107744cde27a31d09c43fa672f138a6313832fe9638160babb095117af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruvector-mincut/src/fragment/mod.rs:269-278 | crates/ruvector-mincut/src/instance/bounded.rs:362-371 | crates/ruvector-mincut/src/instance/stub.rs:167-177 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/instance/bounded.rs\u0060 and \u0060crates/ruvector-mincut/src/instance/stub.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/fragment/mod.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3556f5f725ac50b7b0c6099fd8d9187db70c7f24da0e7ad39eda7dc1b50cc555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruvector-nervous-system-wasm/src/wta.rs:217-227 | crates/ruvector-nervous-system-wasm/src/wta.rs:258-267 | crates/ruvector-nervous-system-wasm/src/wta.rs:292-301 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/wta.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caf3ad0e1f19f9cec268e58022273acb40880e6dc7546acf82f9752d045889f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruvector-postgres/src/index/hnsw_am.rs:588-598 | crates/ruvector-postgres/src/index/hnsw_am.rs:1304-1313 | crates/ruvector-postgres/src/index/hnsw_am.rs:1392-1401 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"922b37e46cc839e4f3b279619b551f375399fcec9e900749b3a26de461c88d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvector-rairs/src/ivf.rs:128-138 | crates/ruvector-rairs/src/rairs.rs:129-139 | crates/ruvector-rairs/src/seil.rs:203-213 \u2014 before extracting anything, compare \u0060crates/ruvector-rairs/src/rairs.rs\u0060 and \u0060crates/ruvector-rairs/src/seil.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rairs/src/ivf.rs:128\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/ivf.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9575dba310f50975ae58dd247c7aac0a791ed0e1cc3c6b2cb8e13fea22d330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvector-solver/src/random_walk.rs:359-369 | crates/ruvector-solver/src/random_walk.rs:420-430 | crates/ruvector-solver/src/random_walk.rs:657-667 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/random_walk.rs:359\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/random_walk.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca14c7ac67054734c675498c1ce514d6315b70b6b84a4171c537f27f3d9a35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 3): crates/ruvector-solver/src/simd.rs:122-130 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:490-500 | crates/rvf/rvf-index/src/distance.rs:129-135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/simd.rs:122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060v\u0060 to \u0060std::arch::x86_64::__m256\u0060 in one and \u0060core::arch::x86_64::__m256\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3e3855e43ecb474d5bfcfea7e1af2b0e360befb30f33996093e54c975c1578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruvix/crates/bcm2711/src/mmio.rs:97-107 | crates/ruvix/crates/rpi-boot/src/early_uart.rs:118-127 | crates/ruvix/crates/rpi-boot/src/lib.rs:233-242 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/bcm2711/src/mmio.rs\u0060 and \u0060crates/ruvix/crates/rpi-boot/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mmio.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe0a99beea278fceb9e5b35ea4bbba33fcc3c81d3a36fa12ed95215442e0b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvix/crates/vecgraph/src/simd_distance.rs:252-262 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:287-297 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:315-325 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:266\u0060 calls \u0060vsubq_f32\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:299\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c933e93636935aafed1598de0c92c3e04d896b7ce57d2fe94bb39e5399b7707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvix/crates/vecgraph/src/simd_distance.rs:400-410 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:431-441 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:459-469 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:400\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:413\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:443\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c7d8648556f7b76f4e2b6b80a6bf9f007bffb45ddf57cde83785c7e835a82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvllm/src/metal/context.rs:186-196 | crates/ruvllm/src/metal/context.rs:242-252 | crates/ruvllm/src/metal/context.rs:447-457 \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":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e585d61c9ea5f202522edb0fa600f257d3f9f9d9ee9817b907df904dc356783e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/ruvllm/src/metal/context.rs:398-408 | crates/ruvllm/src/metal/context.rs:895-904 | crates/ruvllm/src/metal/context.rs:968-977 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f08133eeaf1a05da156b8b09f36ee3c3ce1ce56586f3e8ee38e839a2dd4f042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/rvf/rvf-quant/src/codec.rs:219-229 | crates/rvf/rvf-runtime/src/read_path.rs:736-746 | crates/rvf/rvf-server/src/tcp.rs:288-298 \u2014 before extracting anything, compare \u0060crates/rvf/rvf-runtime/src/read_path.rs\u0060 and \u0060crates/rvf/rvf-server/src/tcp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-quant/src/codec.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7d15e504e11f9e7f297923ce9d44793fa57ef97cd31d2db9702487d7b2766f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/rvf/rvf-runtime/src/read_path.rs:721-731 | crates/rvf/rvf-server/src/tcp.rs:274-283 | crates/rvf/rvf-server/src/tcp.rs:344-353 \u2014 before extracting anything, compare \u0060crates/rvf/rvf-runtime/src/read_path.rs\u0060 and \u0060crates/rvf/rvf-server/src/tcp.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/read_path.rs:721\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-server/src/tcp.rs:272\u0060 calls \u0060with_capacity\u0060 and \u0060crates/rvf/rvf-runtime/src/read_path.rs:720\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa249a8b267e41e2804bfe49cc726f55f89cc631c9475f6cc9136da3a0a3a469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/avx.rs:185-191 | patches/candle-core-0.8.4/src/quantized/avx.rs:394-404 | patches/candle-core-0.8.4/src/quantized/avx.rs:617-623 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7322809b3b1d89e5548a02b12775d3bf804aabca9e6fe80db45b265a592d6683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:6797-6807 | crates/mcp-brain-server/src/routes.rs:8147-8157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6797}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c2fdd0c2cc173a01a824c24bf170e280406da30a3f625d02034efcd04607ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201311 lines \u00D7 4): crates/mcp-brain-server/src/routes.rs:7648-7657 | crates/mcp-brain-server/src/routes.rs:7793-7803 | crates/mcp-brain-server/src/routes.rs:7869-7870 | crates/mcp-brain-server/src/routes.rs:8133-8134 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:7869\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/mcp-brain-server/src/routes.rs:7657\u0060 calls \u0060collect\u0060 and \u0060crates/mcp-brain-server/src/routes.rs:7870\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7648}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf1c470d6dec91ebd71abcc630d2c2f55431d4c64dfb60781cb1840a7d55769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mcp-brain-server/src/symbolic.rs:483-493 | crates/mcp-brain-server/src/symbolic.rs:496-506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/symbolic.rs:483\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb72674d8561b16b689679bd22517dfad169af647c014c271d6cd105fc8347c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mcp-brain/src/server.rs:58-68 | crates/mcp-gate/src/server.rs:129-139 \u2014 before extracting anything, compare \u0060crates/mcp-brain/src/server.rs\u0060 and \u0060crates/mcp-gate/src/server.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64f13b0c73b5d167a0cea23fb1d7333d1bdd52c456517158686f421ea49eeec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/prime-radiant/src/gpu/dispatch.rs:165-175 | crates/prime-radiant/src/gpu/dispatch.rs:288-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/gpu/dispatch.rs:165\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/dispatch.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5042098f7a721935b41df7e8cbbaf47cabb2e2d446b4eb1bd8d5dbbadc9bb4b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/prime-radiant/src/substrate/graph.rs:523-533 | crates/prime-radiant/src/substrate/graph.rs:540-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/substrate/graph.rs:523\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/graph.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcedeeae5cdb8a7aafdc231342348ca1596b4a6ac9c283cada5f31dd9d5658e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-adaptive-ann/src/graph.rs:73-83 | crates/ruvector-coherence-hnsw/src/graph.rs:85-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-adaptive-ann/src/graph.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/graph.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15f0b503eb180d044ea2d9a85107fa68ac12027823d9e38fe8c02cf02917bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-attention-node/src/training.rs:81-91 | crates/ruvector-attention-node/src/training.rs:156-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-node/src/training.rs:81\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/training.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9f8390102afa13d64cc1adbbc36f3466731b4ffadab14412cf08ddbd7ba2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/hyperbolic_attention.rs:110-120 | crates/ruvector-attention/src/hyperbolic/hyperbolic_attention.rs:136-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/hyperbolic_attention.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab02eb9aabfb8b14f3539c6a2408aba7bfa37625bd62820feac1ff5bcf1e560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-attention/src/sparse/local_global.rs:43-53 | crates/ruvector-attention/src/sparse/local_global.rs:60-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/sparse/local_global.rs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sparse/local_global.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"411f847199856872632c8bd4773bbe044baecda3a1dc4f7e8b7a7f49a85dd8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-cnn/src/contrastive/infonce.rs:365-375 | crates/ruvector-postgres/src/distance/scalar.rs:42-51 \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 \u0060a\u0060 to \u0060\u0026[f64]\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/infonce.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecd147aafa2d5a2bff77cd91d3d513d4f42b327198b57ba8ea03f6bd567e16f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-cnn/src/simd/avx2.rs:297-307 | crates/ruvector-cnn/src/simd/avx2.rs:450-460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:297\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d569a914e53b989931f6804bd1e305d79b9aee40350c8b3b465ddc105b77284a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:274-284 | crates/ruvector-cnn/src/simd/scalar.rs:126-136 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:274\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1025040224c1359ddac95c7f4957b88e34b9129b28d107ec6cf710a0734012b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:399-409 | crates/ruvector-cnn/src/simd/wasm.rs:374-384 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/wasm.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 135 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:399\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97dde37b4e69f323fad7e77bec321ac62fd0550634ac3fa81736624660d540b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-cnn/src/simd/scalar.rs:113-123 | crates/ruvector-cnn/src/simd/scalar.rs:162-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/scalar.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":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"073eadce6e08afff726b6d2ff2194b07392e4e88073be7389040c2f78ffb33e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-cnn/src/simd/wasm.rs:235-245 | crates/ruvector-cnn/src/simd/wasm.rs:326-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/wasm.rs:235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/wasm.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6a54a064a784e2203e4bcfa7314cbebc32e7ac8eb1c387c936c2014c381105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-coherence-hnsw/src/coherence.rs:24-34 | crates/ruvector-recall-bounded/src/lib.rs:51-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-coherence-hnsw/src/coherence.rs:24\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/coherence.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b276fa3547464255848b1881bcfde89cf3fa6808c58701a077ac0cbec06b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-consciousness-wasm/src/lib.rs:138-148 | crates/ruvector-consciousness-wasm/src/lib.rs:309-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness-wasm/src/lib.rs:138\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness-wasm/src/lib.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1010d93fcf330203c0b02d775044dedce995647438cc5bb1a13fc542126f8ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-consciousness/src/phi.rs:406-416 | crates/ruvector-postgres/src/integrity/mincut.rs:307-317 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7f70f927bfab82217cd0bd8ec5e3039aaee05c263b0a862e95814072ccf34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/ruvector-consciousness/src/rsvd_emergence.rs:168-178 | crates/ruvector-consciousness/src/rsvd_emergence.rs:211-219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/rsvd_emergence.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/rsvd_emergence.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bec2e2398f604b861f001739a0a472bce55ef543a401ea55c5bf266453cdb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-core/src/advanced_features/product_quantization.rs:425-435 | crates/ruvector-core/src/quantization.rs:659-669 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/advanced_features/product_quantization.rs\u0060 and \u0060crates/ruvector-core/src/quantization.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/product_quantization.rs:425\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/product_quantization.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"12422894947c3fdbaf7c07efa4a8cddba26d188c0afaca0181934a01bf852951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): crates/ruvector-core/src/cache_optimized.rs:329-334 | crates/ruvector-core/src/simd_intrinsics.rs:94-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/cache_optimized.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c225195423323bb7274f21bb7f22368fa4d8da037c349b930a515114ab8ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-core/src/quantization.rs:444-454 | crates/ruvector-core/src/quantization.rs:706-716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/quantization.rs:444\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"298c6a744c0ed37e0e301e82cdf7884fa70c5d2ecb3013232c9a78814a5402c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-core/src/storage.rs:220-230 | crates/ruvector-core/src/storage.rs:265-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/storage.rs:232\u0060 calls \u0060db\u0060, \u0060begin_write\u0060, \u0060open_table\u0060 and \u0060crates/ruvector-core/src/storage.rs:278\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d653e9607972b198ebf46d2b21cbe8e4ac2adbc96881aa344e6e65abe77088de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-core/src/storage_memory.rs:77-87 | crates/ruvector-core/src/storage_memory.rs:114-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/storage_memory.rs:126\u0060 calls \u0060push\u0060 and \u0060crates/ruvector-core/src/storage_memory.rs:89\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage_memory.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9f0e40ae4cd802f5f2c746a011221af173eaf2f561ac17be22bde7ab51d10d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-crv/src/stage_iii.rs:173-183 | crates/ruvector-crv/src/stage_vi.rs:68-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-crv/src/stage_iii.rs:173\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/stage_iii.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa3ae1ce1407931181e9a347d9a59533b6ab7f25dd0be8325ffcc7d3c6fdb28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs:178-188 | crates/ruvector-dag/src/qudag/crypto/ml_kem.rs:214-224 \u2014 before extracting anything, compare \u0060crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs\u0060 and \u0060crates/ruvector-dag/src/qudag/crypto/ml_kem.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"35176c809d46bfab99742455b8281b25cfb97eb08bff6701e1f511ab7d4b4b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-decompiler/src/model_decompiler.rs:120-130 | crates/ruvector-decompiler/src/model_decompiler.rs:154-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 \u0060crates/ruvector-decompiler/src/model_decompiler.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_decompiler.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae3c0983da042bcebe0bcc23b904b59c14e25d3cb10d8d0b07f6036439e8b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-delta-core/src/compression.rs:221-231 | crates/ruvector-delta-core/src/compression.rs:255-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-core/src/compression.rs:221\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/compression.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5f0a221d559b4e570ffd027ecea3d59758f077b3fc7ad263028955c3d45e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-delta-index/src/lib.rs:458-468 | crates/ruvector-delta-index/src/lib.rs:755-765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-index/src/lib.rs:458\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-delta-index/src/lib.rs:754\u0060 calls \u0060filter\u0060 and \u0060crates/ruvector-delta-index/src/lib.rs:457\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-index/src/lib.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2a0a9af1f10536c2faea5357ddaaf9ed9f5bdcfe2b142654f10f47eb9c426c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-edge-store/src/ops/vector.rs:91-101 | edge/gateway/src/vectors.rs:75-85 \u2014 before extracting anything, compare \u0060crates/ruvector-edge-store/src/ops/vector.rs\u0060 and \u0060edge/gateway/src/vectors.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/vector.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1b5ce1c83f2a4b284d986925600eaf586e65e55a7d4fe94facbc970d883f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:315-325 | crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:355-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:315\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4f6ab1c9dd9be59e4df01f68f6bcc412e464b360c71429ac26ffd9bf73078e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:517-527 | crates/ruvector-fpga-transformer/src/backend/native_sim.rs:422-432 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:517\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3512c9ab714542d94c30016a4693eebf08bc7fd9521fbcc15a6cbeb2861ae20b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-gnn/src/mmap.rs:100-110 | crates/ruvector-gnn/src/mmap_fixed.rs:71-81 \u2014 before extracting anything, compare \u0060crates/ruvector-gnn/src/mmap.rs\u0060 and \u0060crates/ruvector-gnn/src/mmap_fixed.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"96304d8059fe953f105c0acddb975fff2be320be491e2031545a699a276d38c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-graph/src/storage.rs:112-121 | crates/ruvector-router-core/src/storage.rs:43-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 \u0060crates/ruvector-graph/src/storage.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/storage.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5120f29ceb1a7c03d2105f58956dd45f22bc965851aa9131d61bd2475236e3f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-graph/src/transaction.rs:217-227 | crates/ruvector-graph/src/transaction.rs:232-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/transaction.rs:217\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/transaction.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a174ffb47528a77e19df42df6fe5ce9672395c63b48b20778d5037477477d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/embed.rs:544-553 | crates/ruvector-hailo-cluster/src/bin/embed.rs:557-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs:544\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0440f25cb877218b279523b97ac6ad0f2945944044342cef67eed8b26c2fad72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/ruvector-hailo-cluster/src/rate_limit.rs:139-149 | crates/ruvector-hailo-cluster/src/rate_limit.rs:176-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/rate_limit.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2529fe46483552e9cbfcd4ed443d430c45505c8ac4019618574c76f27ca8415c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-hailo/src/cpu_embedder.rs:115-125 | crates/ruvector-hailo/src/host_embeddings.rs:60-70 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo/src/cpu_embedder.rs\u0060 and \u0060crates/ruvector-hailo/src/host_embeddings.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo/src/cpu_embedder.rs:115\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo/src/cpu_embedder.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"90972a70b2ff94380be702a04a003734452025fa7ec76cc1ea5f8ded43b40011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-math/src/homology/distance.rs:18-28 | crates/ruvector-math/src/homology/distance.rs:144-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/distance.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6bd9570024f77adfd30b9596626b91e13d1888e0da681c7fece5dec22acfe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-math/src/spectral/graph_filter.rs:46-56 | crates/ruvector-math/src/spectral/graph_filter.rs:64-74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/spectral/graph_filter.rs:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spectral/graph_filter.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcff81d24875b06682f86472b3c8a89faba88ded01d1556e046bf177091ee589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-math/src/tensor_networks/contraction.rs:206-216 | crates/ruvector-math/src/tensor_networks/contraction.rs:218-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/contraction.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc1a5d806f66def8223dd96fcf47e0308276ab251fbfdd2836741e6ca180a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-math/src/tensor_networks/cp_decomposition.rs:113-122 | crates/ruvector-math/src/tensor_networks/cp_decomposition.rs:141-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/cp_decomposition.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b070799afff48a3204caf62553981abd68f3dcf87ddbd92175554df1283d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-maxsim/src/score.rs:23-33 | crates/ruvector-maxsim/src/score.rs:96-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-maxsim/src/score.rs:23\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-maxsim/src/score.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d44959c58b0110c8b839adc44334a12bc4570e10aee3aae80a76c177b3e117f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:228-238 | crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:519-529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/flash_attention.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fa21478fe0aefce3c1858730c32bf4a40c7f22043b6f0a57de1aef7568d72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:362-383 | crates/ruvector-mincut/src/canonical/tree_packing/mod.rs:201-222 \u2014 \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-mincut/src/canonical/tree_packing/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dd015e7149f709b1d2cf6aa4d5fabc65ad124a43685e1cb6e52b357e082cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-mincut/src/jtree/coordinator.rs:369-379 | crates/ruvector-mincut/src/jtree/coordinator.rs:393-403 \u2014 both copies are in the same file, so extract the block 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":"crates/ruvector-mincut/src/jtree/coordinator.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deb49e1118c3b09c87c182334649875136c30ae7208de342a8521a48f3aae25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-mincut/src/jtree/level.rs:633-643 | crates/ruvector-mincut/src/jtree/level.rs:653-663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/jtree/level.rs:633\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/level.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c6823ca44745e787b6843a94ddd75dfecc1a24deccdecbf2697704e00fd9e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-mincut/src/monitoring/mod.rs:238-248 | crates/ruvector-mincut/src/monitoring/mod.rs:265-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/monitoring/mod.rs:238\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/monitoring/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"08af9aa84a6dcb64dd0ce034e378618da932dea1eb54ffdd42aa105e217ac290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): crates/ruvector-nervous-system/src/plasticity/eprop.rs:328-338 | crates/ruvector-nervous-system/src/plasticity/eprop.rs:342-352 | crates/ruvector-nervous-system/src/plasticity/eprop.rs:353-361 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system/src/plasticity/eprop.rs:353\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-nervous-system/src/plasticity/eprop.rs:361\u0060 calls \u0060sample\u0060, \u0060collect\u0060 and \u0060crates/ruvector-nervous-system/src/plasticity/eprop.rs:338\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/plasticity/eprop.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb3d4d2ab34cb778346ec21222a4a95f96023fb8ca6cdc6acf43b57c66424f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-postgres/src/graph/cypher/parser.rs:133-143 | crates/ruvector-postgres/src/graph/cypher/parser.rs:211-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/cypher/parser.rs:133\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/parser.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"849ea993b34cc1d9281104fea68eb79f1b05e71519812eeeac53db6f43ac7eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2326-2336 | crates/rvlite/src/sparql/parser.rs:2370-2380 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"304b88a5d6cd6e950df1cf8f6c4854adb4a997914ad1d2b4f4744854a66b7590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/triple_store.rs:579-589 | crates/rvlite/src/sparql/triple_store.rs:500-510 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/triple_store.rs\u0060 and \u0060crates/rvlite/src/sparql/triple_store.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/triple_store.rs:579\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/triple_store.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f58b7ede7b13301627ebbaef4365c45a71318f04b038176ff6f612f33edf5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ruvector-postgres/src/quantization/binary.rs:54-74 | crates/ruvector-postgres/src/types/binaryvec.rs:180-200 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/binary.rs\u0060 and \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/quantization/binary.rs:54\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/binary.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4aadf1f13f225978b73cabc49759d460ca97c0c158cc92a5ba67d7de2214f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-pq-search/src/codebook.rs:195-205 | crates/ruvector-pq-search/src/ivf_pq.rs:181-191 \u2014 before extracting anything, compare \u0060crates/ruvector-pq-search/src/codebook.rs\u0060 and \u0060crates/ruvector-pq-search/src/ivf_pq.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-pq-search/src/codebook.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16a0f293b63306cd49a0630ff4aeba8d79f2317b602bd4fd6110cd8e9978050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-rabitq/src/main.rs:38-53 | crates/ruvector-rulake/src/bin/rulake-demo.rs:25-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/main.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea033453486a458d62f49732ec71f95e2106fb27be662ec3c6391db31be1509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-rabitq/src/scan.rs:213-223 | crates/ruvector-rabitq/src/scan.rs:248-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rabitq/src/scan.rs:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-rabitq/src/scan.rs:259\u0060 calls \u0060get_unchecked\u0060, \u0060_popcnt64\u0060, \u0060add\u0060 and \u0060crates/ruvector-rabitq/src/scan.rs:224\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/scan.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee009d5a1fbcd39ad3c17fedb88421f9cadc19efab5cca19c2a2427664ec703c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-rairs/src/rairs.rs:110-120 | crates/ruvector-rairs/src/seil.rs:117-126 \u2014 before extracting anything, compare \u0060crates/ruvector-rairs/src/rairs.rs\u0060 and \u0060crates/ruvector-rairs/src/seil.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/rairs.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"577d9c3fefac86f2628bc5d0b843dd6582b2c4b4f9841bb95c2e0215a2cef327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/ruvector-router-core/src/index.rs:303-311 | crates/ruvector-router-core/src/index.rs:334-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-router-core/src/index.rs:303\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/src/index.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aa06bbc928b003a85f44fb9ec42394efd9a7b386a1ee8be098bbf40ab5f60b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/ruvector-solver/src/bmssp.rs:426-434 | crates/ruvector-solver/src/true_solver.rs:169-179 \u2014 before extracting anything, compare \u0060crates/ruvector-solver/src/bmssp.rs\u0060 and \u0060crates/ruvector-solver/src/true_solver.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/bmssp.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee9b2fa8fbf1854a74147ece32264f2a289e5b8661aa77c6eba5eb0f76ff31f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-solver/src/cg.rs:79-89 | crates/ruvector-solver/src/cg.rs:111-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/cg.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\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":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2014f4c4c6428bb82929ca18a7c5e5dcbeec9985c02720d054698ccc87b902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-solver/src/simd.rs:41-51 | crates/ruvector-solver/src/simd.rs:163-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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 \u0060matrix\u0060 to \u0060\u0026CsrMatrix\u003Cf32\u003E\u0060 in one and \u0060\u0026CsrMatrix\u003Cf64\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f734e6f5d812afed132d61b6a7ba19a0c2268113cd551da1daeb59a5bc675a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-solver/src/true_solver.rs:165-175 | crates/ruvector-solver/src/true_solver.rs:207-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/true_solver.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/true_solver.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a42215f6c0461785c2543c55244efacd0594339495cdec5df741582e5d119a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-sota-bench/src/bin/sift1m_bench.rs:299-308 | crates/ruvector-sota-bench/src/runners/core_hnsw.rs:54-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sift1m_bench.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"90603f14ccf70decec22268d46d977f427aaa0d62e6dcefac212a99d0412e2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-sparse-inference/src/backend/cpu.rs:202-212 | crates/ruvector-sparse-inference/src/backend/cpu.rs:378-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/backend/cpu.rs:202\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f447869d2e4dd6038502c5ce5096e0acc0c1ace02431be97f0fb13a8ee757b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-sparse-inference/src/model/gguf.rs:455-465 | crates/ruvector-sparse-inference/src/model/gguf.rs:495-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/model/gguf.rs:455\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15c4aa4ad8cb2320582fa7e6ef8ddcb6e4e0b1d8664dd6c85957ed1c0d2c86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 3): crates/ruvector-sparse-inference/src/precision/quantizers.rs:89-91 | crates/ruvector-sparse-inference/src/precision/quantizers.rs:218-228 | crates/ruvector-sparse-inference/src/precision/quantizers.rs:300-310 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/precision/quantizers.rs:218\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/precision/quantizers.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"273df84a2c9376c61ec8216a0d3af7e9553bfafaa6d399b1714d043c30ecbc90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-streaming-qng/src/dataset.rs:54-64 | crates/ruvector-streaming-qng/src/dataset.rs:88-98 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-streaming-qng/src/dataset.rs:54\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/dataset.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0838a877ef4dd45ea7d7e57c5167625a9547059464ef020d57f0a660cae3d8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-temporal-tensor/src/persistence.rs:105-115 | crates/ruvector-temporal-tensor/src/persistence.rs:161-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 \u0060crates/ruvector-temporal-tensor/src/persistence.rs:105\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/persistence.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aff12e7c9bb9c4ca079ff703bafa0d8a0a2a8f9e9beec9b5cae5a20ff64c35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvector-timesfm/src/forecaster.rs:191-201 | crates/ruvector-timesfm/src/forecaster.rs:248-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-timesfm/src/forecaster.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfdcf77df1e4d5c66b821401b05edf3d7522461e37a6f296d826044b7cbfe84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-tiny-dancer-core/src/model.rs:288-298 | crates/ruvector-tiny-dancer-core/src/model.rs:345-355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/model.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcb77bfe708615610e50e98c8a48fb68c8174a93f80cd648b65e9e4f1bedfbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvix/crates/bcm2711/src/mmio.rs:122-132 | crates/ruvix/crates/rpi-boot/src/lib.rs:247-256 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/bcm2711/src/mmio.rs\u0060 and \u0060crates/ruvix/crates/rpi-boot/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mmio.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2d2239437f76f14281f942bd5a6ed18f8ad00fd78913392487e25a7d86a480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvix/crates/bcm2711/src/mmio.rs:261-271 | crates/ruvix/crates/rpi-boot/src/lib.rs:218-228 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/bcm2711/src/mmio.rs\u0060 and \u0060crates/ruvix/crates/rpi-boot/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mmio.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a592a7a94613fe216eeaa50f66e59df6cddcb03c002650352f976b15d7468e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvix/crates/cli/src/commands/dtb.rs:742-752 | crates/ruvix/crates/cli/src/commands/dtb.rs:827-837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:742\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f9286e1a4f109422bfc9d9924ea66aca50405fad234309852f3b64c5ef8d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/ruvix/crates/vecgraph/src/simd_distance.rs:442-452 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:469-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:442\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:441\u0060 calls \u0060_mm256_loadu_ps\u0060, \u0060as_ptr\u0060, \u0060add\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:468\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed0214a45142a9faad93826b8c0d91cdb03fddc861f04be39dfa88941203934"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvix/qemu-swarm/src/console.rs:323-333 | crates/ruvix/qemu-swarm/src/node.rs:454-464 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/qemu-swarm/src/console.rs:323\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/console.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b726f8ab90bdc0ec24aa73903eb53b1dd19e41524ddcc0627ca55fc2ffe8fa17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm-cli/src/commands/benchmark.rs:447-457 | crates/ruvllm-cli/src/commands/chat.rs:661-671 \u2014 before extracting anything, compare \u0060crates/ruvllm-cli/src/commands/benchmark.rs\u0060 and \u0060crates/ruvllm-cli/src/commands/chat.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm-cli/src/commands/benchmark.rs:447\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/benchmark.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a29bd26a6150ce1e483795e60e091bae5fef427c81be8ae003777b498534919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/backends/candle_backend.rs:950-960 | crates/ruvllm/src/backends/candle_backend.rs:1133-1143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/candle_backend.rs:950\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e99eb2462a4b767f18ca967864dfae8806139f06ab1aee190752f005506274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ruvllm/src/evaluation/harness.rs:183-193 | crates/ruvllm/src/evaluation/real_harness.rs:339-348 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/evaluation/harness.rs\u0060 and \u0060crates/ruvllm/src/evaluation/real_harness.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/evaluation/real_harness.rs:339\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/harness.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"316af840786170f54d6cf792cf7d303ecf14950179ea80688c19234d68d20b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/evaluation/harness.rs:197-207 | crates/ruvllm/src/evaluation/real_harness.rs:352-362 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/evaluation/harness.rs\u0060 and \u0060crates/ruvllm/src/evaluation/real_harness.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/harness.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf081b4da2ea3b65e257d9057a0e65a81305a579cb8f5b60bc641fb1ffeb5b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/gguf/quantization.rs:606-616 | crates/ruvllm/src/gguf/quantization.rs:688-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/gguf/quantization.rs:606\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe57f47ed9eb94a6653d8fe50f8fa7663d23762c1b0e31f51b1d3f8fe9254f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:1314-1324 | crates/ruvllm/src/kernels/attention.rs:1375-1385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.rs:1314\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ef8e21e08e98634d03ef1f900f47950066276c1a4171ac4acc0a2a2e1a2dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201311 lines \u00D7 9): crates/ruvector-attention/src/training/mining.rs:174-175 | crates/ruvector-postgres/src/attention/mod.rs:183-186 | crates/ruvector-postgres/src/operators.rs:370-371 | crates/ruvector-typesafe-train/src/train/eval.rs:31-32 | crates/ruvllm/src/backends/candle_backend.rs:1337-1339 | crates/ruvllm/src/backends/mistral_backend.rs:1444-1445 | crates/ruvllm/src/kernels/attention.rs:1433-1443 | crates/ruvllm/src/kv_cache.rs:977-987 | crates/ruvllm/src/paged_attention.rs:459-460 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 9 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 9 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/candle_backend.rs:1337\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/kernels/attention.rs:1433\u0060 calls \u0060iter\u0060, \u0060sum\u0060 and \u0060crates/ruvector-postgres/src/operators.rs:370\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/training/mining.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f7e86a9da89213bd2d0721df656fb63738960967af074e56605cbbdfa922bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/kernels/rope.rs:333-343 | crates/ruvllm/src/kernels/rope.rs:407-417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/rope.rs:333\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/rope.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9de3dd5a6bf2877cdc842380ef724d33619796c064cd2091e5929a834e5ed30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/models/openmythos/act_kernel.rs:376-386 | crates/ruvllm/src/models/openmythos/act_kernel.rs:404-414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/act_kernel.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31412f0c8410b2b53f7a618368da154d5f475dd11a055f652f34ec052fa3978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 3): crates/ruvllm/src/models/openmythos/attention.rs:205-214 | crates/ruvllm/src/models/openmythos/attention.rs:437-439 | crates/ruvllm/src/models/rdt.rs:618-628 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/attention.rs:205\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/attention.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc46f3d84b19644823504dcc6531ea95366a0e68f80f0bb4ba52664d9638ea57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/models/openmythos/mod.rs:460-470 | crates/ruvllm/src/models/openmythos/mod.rs:521-531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/mod.rs:460\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefa326791c772eb5e42268272619a71801727e3e2f60ef05855b56b53418b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/moe/affinity.rs:72-82 | crates/ruvllm/src/quantize/hadamard.rs:555-565 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/moe/affinity.rs:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/affinity.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5054e1fe3bb50e46ca01e3be237cc558bb721454b9d585d15534691c8485ad01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/moe/affinity.rs:99-109 | crates/ruvllm/src/quantize/hadamard.rs:579-589 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/moe/affinity.rs:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/affinity.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"be99033b3a5a9552279f880d31d029777d1cb5f361d2f53f46fc7649dd67fad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/quality/coherence.rs:534-544 | crates/ruvllm/src/quality/diversity.rs:664-674 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quality/coherence.rs:534\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b3685f2921130e88a50377cbe29ec9de3e6190b43c88d9fe8c26ada1f90f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/quality/coherence.rs:743-753 | crates/ruvllm/src/quality/scoring_engine.rs:863-873 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/quality/coherence.rs\u0060 and \u0060crates/ruvllm/src/quality/scoring_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quality/coherence.rs:743\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/quality/scoring_engine.rs:860\u0060 calls \u0060to_lowercase\u0060 and \u0060crates/ruvllm/src/quality/coherence.rs:741\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a987db097c47bcfb864a78dbce0887d2ca4d1b949c4fe1e240df40a52745ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/reasoning_bank/distillation.rs:196-206 | crates/ruvllm/src/reflection/error_recovery.rs:377-387 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/reasoning_bank/distillation.rs:196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/reflection/error_recovery.rs:376\u0060 calls \u0060to_lowercase\u0060 and \u0060crates/ruvllm/src/reasoning_bank/distillation.rs:195\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reasoning_bank/distillation.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db6f4d1348d4a74ce7c68c93986ad713034f46a7cd221f65631afb084a998d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/tokenizer.rs:193-203 | crates/ruvllm/src/tokenizer.rs:226-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/tokenizer.rs:193\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/tokenizer.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"095c32f6825a30f711115a5a7ff757e3a8eb90e9c1dd1f73a4027f1a7c3f5d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/training/claude_dataset.rs:273-283 | crates/ruvllm/src/training/tool_dataset.rs:357-367 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/claude_dataset.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5638b53aa2e05f578fe6427e076b2d276b7570a59864c398f7e57bed593c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/anthropic.rs:165-175 | crates/rvAgent/rvagent-backends/src/gemini.rs:203-213 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-backends/src/anthropic.rs\u0060 and \u0060crates/rvAgent/rvagent-backends/src/gemini.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/anthropic.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c040a47d65b467a51458c9b4c2aec9b7be9ac11c8688d0fce8b0a802fd20fff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/filesystem.rs:245-255 | crates/rvAgent/rvagent-backends/src/filesystem.rs:291-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e6289ce01473d47153cb0c60cfbdd8127de2b915fc96ceb0921af30c3ada34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvAgent/rvagent-mcp/src/transport.rs:127-137 | crates/rvAgent/rvagent-mcp/src/transport.rs:143-153 \u2014 both copies are in the same file, so extract the block 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":"crates/rvAgent/rvagent-mcp/src/transport.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be5407d8a61b1f8fb84e3c19124ec356875f7139531ee849710b82c7b437d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvf-forge-core/src/container.rs:102-112 | crates/rvf/rvf-wire/src/tail_scan.rs:46-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf-forge-core/src/container.rs:102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf-forge-core/src/container.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"205b9e441be7b3670b6c6596524483d007a4438ffe78972fe5bc0ed0ba9d09fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvf/rvf-ebpf/src/lib.rs:130-140 | crates/rvf/rvf-kernel/src/lib.rs:205-221 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-ebpf/src/lib.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e4349f99bc04d1e41ffce7d8e2e20972f717934408ae34f32cbccfed231719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvf/rvf-ebpf/src/lib.rs:254-264 | crates/rvf/rvf-ebpf/src/lib.rs:284-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-ebpf/src/lib.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2652e36677b28b11a0c804db1137a4a10b02129c8a4fc1c51562f21589f2fe4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvf/rvf-index/src/progressive.rs:166-176 | crates/rvf/rvf-index/src/progressive.rs:345-355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/progressive.rs:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/progressive.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f98ea42e63ab7eeeb6915211849cf5993b09dc57b8b248f903ff3307ecb4ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:637-647 | crates/rvf/rvf-runtime/src/store/dir_growth.rs:198-204 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:637\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73c8d948c16c005589383963c1107127f27b43b11e36865007f9606bffca8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:1303-1321 | crates/rvf/rvf-runtime/src/store.rs:1407-1424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:1303\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b89ae040a4a6c9a5c40a134a98ae9f9c9705ebf3f4ec67fa72b0ab463e649c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/rvf/rvf-runtime/src/write_path.rs:565-575 | crates/rvf/rvf-runtime/src/write_path.rs:603-610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/write_path.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"489908ab50cf3787cfa3a07ccb843f5d81cdfd1c7ae0e4cccf11606cd7dc32f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvf/rvf-solver-wasm/src/alloc_setup.rs:35-45 | crates/rvf/rvf-wasm/src/alloc_setup.rs:35-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/alloc_setup.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1473541a35a4657ee9ad81f0616aac8f1e7a6ffa96770414188b6bedc941ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvlite/src/cypher/lexer.rs:272-282 | crates/rvlite/src/cypher/lexer.rs:290-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvlite/src/cypher/lexer.rs:272\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/lexer.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd38a7de37108a29f5714c6c6231f8ba7781bc60e9825f5429b165fdcd89af18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvm/crates/rvm-cap/src/table.rs:268-278 | crates/rvm/crates/rvm-cap/src/table.rs:289-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/table.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f850e17b6897fc4b0539f7aae168a23a061c988869bddf5e307cfc55344897fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvm/crates/rvm-proof/src/engine.rs:102-115 | crates/rvm/crates/rvm-proof/src/engine.rs:182-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvm/crates/rvm-proof/src/engine.rs:102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/engine.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c047698ab24384f7c6888c6879fbd6e6c35fc0b7d3cd96667e8c046f7cc6ce4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rvm/crates/rvm-proof/src/signer.rs:130-140 | crates/rvm/crates/rvm-proof/src/signer.rs:301-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/signer.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"286f1ba910c224b2796fce7054dea4efe46c92196d86de0ab9682694da39b156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 4): crates/sonic-ct/src/phantom.rs:143-146 | crates/sonic-ct/src/phantom.rs:155-165 | crates/sonic-ct/src/phantom.rs:169-179 | crates/sonic-ct/src/phantom.rs:185-188 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sonic-ct/src/phantom.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sonic-ct/src/phantom.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf9a6bf77b8ed9ef17e4836d03dd945ee652616bc72b7f76365ac1b36923f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): edge/auth-worker/src/platform.rs:52-62 | edge/gateway/src/platform.rs:84-94 \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":"edge/auth-worker/src/platform.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cf5b927879838b17fa989e6f5c44cd85efdf8334ee81ba6968e542cac8ba47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1587-1597 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2082-2092 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c591efad5d9da26f7f1246bd50fdee578c51d83e7b92c992fcfcbb09d1a3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1600-1610 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2095-2105 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ed63b36f41d72cf755bbf7f363fb0be2d95070206a3530328ee450e883e781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/device.rs:172-182 | patches/candle-core-0.9.2/src/metal_backend/device.rs:127-137 \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":"patches/candle-core-0.8.4/src/metal_backend/device.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"175ec2364599e22f140e3e4d8bbd78e97e88ff6983054b77bc4da49e44652014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:379-389 | patches/candle-core-0.9.2/src/npy.rs:406-416 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd9f3ab455a3a6867b02c3d8854ab161c2e695208c9d87bab34fa0ec30b5b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/avx.rs:294-304 | patches/candle-core-0.8.4/src/quantized/avx.rs:429-439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/avx.rs:294\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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cace040ab9af1c8bf1ab8bd33191e14acc1d6e8849a141eaa05218533a86c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/avx.rs:490-498 | patches/candle-core-0.8.4/src/quantized/avx.rs:580-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/avx.rs:490\u0060 it does not close everything it opens, so those exact 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, \u0060patches/candle-core-0.8.4/src/quantized/avx.rs:577\u0060 calls \u0060_mm256_loadu_si256\u0060, \u0060as_ptr\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/avx.rs:488\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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"691dd245fe4b039a3e68e610e3863b5d98ccd20fe0e0357f78f2679c61788137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1530-1561 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1876-1907 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1530\u0060 it begins part-way through the construct above it, so those exact 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, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1562\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:1908\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fc816121c9f704a341ea89ebec98c4feff3e4ff08b1e3b04e026908b0574e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:572-595 | patches/candle-core-0.9.2/src/storage.rs:609-632 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"22efcf8708edd5f48ddbd2250ec5b0f2166ce9216a146267946ac5f40c926c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:746-759 | patches/candle-core-0.9.2/src/storage.rs:807-820 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"02acb0bf9517a0335cba0f704f01bef270ab15f80fb16c51daa06f76e9216b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:925-935 | patches/candle-core-0.9.2/src/tensor.rs:993-1003 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c0d2d2e64052c4c16450ff1af8090312850344e71483da7675446fb41296c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1058-1071 | patches/candle-core-0.9.2/src/tensor.rs:1126-1139 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"27acdbb18672536093eed87ff2abd6212de44b6df31277a56eeaeb10e4561b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1136-1146 | patches/candle-core-0.9.2/src/tensor.rs:1204-1214 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39ae5140bf9e3dafbec97355b122454d54853428f7fa9d31294ac45a6e09c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1386-1396 | patches/candle-core-0.9.2/src/tensor.rs:1693-1703 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1386\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9457ddbbc1bd9fa010edef4ff66a804725fe12b1bb6f700ed6ad7af1bc7535b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1927-1937 | patches/candle-core-0.9.2/src/tensor.rs:2251-2261 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"58afd0d45b3f5bec34b9917ba24e86bc1d28c4da27ad1249caadc494d043bc34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2009-2020 | patches/candle-core-0.9.2/src/tensor.rs:2333-2344 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"0463a6098ed1647c5186ec8991834a2cd3b6370a58273ed7760325269d9bba36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2103-2113 | patches/candle-core-0.9.2/src/tensor.rs:2426-2436 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5773a498b54a5b3e83d672ca91fb515ee0d1f07a51b13272c6fe3916077409f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2144-2154 | patches/candle-core-0.9.2/src/tensor.rs:2467-2477 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2144}}}],"partialFingerprints":{"codehealthFindingId/v1":"60011325e6967e45fea373316756c7e9a585387d2a82ebee309c01b4ea6dabfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:450-460 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:503-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:450\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:449\u0060 calls \u0060arg\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:502\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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"3747fcbd529c6e22b40b1c5c7cca45f2c70db80872fc512305d8b9d180436496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1790-1805 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1973-1988 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c2df9a8d31e97c622ef59726cf8a89d013e6d59b6ea7819ec219df2705fdbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/k_quants.rs:1548-1559 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1825-1836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:1548\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63ca68c11ff97e4d7ab07fab59823657509399248e319385791622b8595bb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:359-369 | scripts/patches/hnsw_rs/src/hnsw.rs:359-369 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a665aa7dc819c2816825b75fc6f1326b5f07e8456a9f9fb4665f4a12e75b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1717-1739 | scripts/patches/hnsw_rs/src/hnsw.rs:1603-1625 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54a81d2717c2f96c18a91e7d95d98a96f49c15802b2b67fb250f713d6a358b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 14): crates/ruvllm_sparse_attention/src/attention.rs:199-208 | crates/ruvllm_sparse_attention/src/attention.rs:217-226 | crates/ruvllm_sparse_attention/src/attention.rs:295-304 | crates/ruvllm_sparse_attention/src/attention.rs:313-322 | crates/ruvllm_sparse_attention/src/attention.rs:457-466 | crates/ruvllm_sparse_attention/src/attention.rs:475-484 | crates/ruvllm_sparse_attention/src/attention.rs:1143-1152 | crates/ruvllm_sparse_attention/src/attention.rs:1162-1171 | crates/ruvllm_sparse_attention/src/attention.rs:1371-1380 | crates/ruvllm_sparse_attention/src/attention.rs:1389-1398 | crates/ruvllm_sparse_attention/src/attention.rs:1467-1476 | crates/ruvllm_sparse_attention/src/attention.rs:1485-1494 | crates/ruvllm_sparse_attention/src/attention.rs:1981-1990 | crates/ruvllm_sparse_attention/src/attention.rs:2000-2009 \u2014 all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c847403ce3d9d1f0a6ee9f6c21439b9260f46dcbe77f9f6446e2a01cb551750d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 11): crates/prime-radiant/src/simd/matrix.rs:316-325 | crates/ruvllm/src/backends/gemma2.rs:650-659 | crates/ruvllm/src/backends/phi3.rs:528-537 | crates/ruvllm/src/kernels/matmul.rs:846-855 | crates/ruvllm/src/kernels/matmul.rs:1166-1175 | crates/ruvllm/src/models/ruvltra.rs:655-664 | crates/ruvllm/src/models/ruvltra.rs:850-859 | crates/ruvllm/src/models/ruvltra_medium.rs:654-663 | crates/ruvllm/src/qat/lora_qat.rs:682-691 | crates/ruvllm/src/qat/lora_qat.rs:697-706 | crates/ruvllm/src/qat/lora_qat.rs:711-720 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/matrix.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb099eba1a38f48ff6c97446ef62f90b618ae9bf28482fc6a15f79ec3108273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 10): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2304-2318 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2320-2334 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2336-2350 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2352-2366 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2368-2382 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2384-2398 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2400-2414 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2416-2430 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2432-2446 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2448-2462 \u2014 all 10 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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a9e2aecfcb843b79bd8d08fbf1c385aa4229065a5d314b6c2dfa6d635eabbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9): crates/ruvector-attention/src/curvature/component_quantizer.rs:149-158 | crates/ruvector-attention/src/curvature/fused_attention.rs:280-289 | crates/ruvector-attention/src/curvature/tangent_space.rs:169-178 | crates/ruvector-attention/src/info_geometry/fisher.rs:164-173 | crates/ruvector-attention/src/pde_attention/diffusion.rs:178-187 | crates/ruvector-attention/src/topology/gated_attention.rs:242-251 | crates/ruvector-attention/src/transport/cached_projections.rs:70-79 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:291-300 | crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:122-132 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 and \u0060crates/ruvector-attention/src/curvature/tangent_space.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/curvature/component_quantizer.rs:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/component_quantizer.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"146ae75c637687c1fdd756c50c5664d7f2eedf3ca4948ed5186bb6068b76a6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 9): crates/ruvector-core/src/simd_intrinsics.rs:89-98 | crates/ruvector-core/src/simd_intrinsics.rs:134-143 | crates/ruvector-core/src/simd_intrinsics.rs:976-982 | crates/ruvector-core/src/simd_intrinsics.rs:1080-1086 | crates/ruvector-core/src/simd_intrinsics.rs:1123-1131 | crates/ruvector-postgres/src/distance/simd.rs:982-988 | crates/ruvector-postgres/src/distance/simd.rs:1017-1023 | crates/ruvector-postgres/src/distance/simd.rs:1058-1064 | crates/ruvector-postgres/src/distance/simd.rs:1083-1089 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:131\u0060 calls \u0060_mm256_setzero_ps\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:88\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"24368a10bc15b90258486e7532b7018db4ce5c3a0a695c4be74bf996c94f68b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9): crates/ruvix/crates/boot/src/manifest.rs:652-661 | crates/rvf/rvf-quant/src/binary.rs:56-65 | crates/rvf/rvf-quant/src/binary.rs:66-75 | crates/rvf/rvf-runtime/src/read_path.rs:562-571 | crates/rvf/rvf-runtime/src/read_path.rs:616-625 | crates/rvf/rvf-runtime/src/read_path.rs:724-733 | crates/rvf/rvf-server/src/tcp.rs:276-285 | crates/rvf/rvf-server/src/tcp.rs:346-355 | crates/rvm/crates/rvm-proof/src/lib.rs:198-207 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/boot/src/manifest.rs\u0060 and \u0060crates/rvf/rvf-runtime/src/read_path.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf/rvf-runtime/src/read_path.rs:736\u0060 calls \u0060with_capacity\u0060 and \u0060crates/rvf/rvf-quant/src/binary.rs:66\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/manifest.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacf2e8e1734630c50bf445467ce5f2215fc6508f9b26fc467b0eee18d3966b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/ruvector-cnn/src/layers/conv.rs:228-237 | crates/ruvector-cnn/src/layers/pooling.rs:35-44 | crates/ruvector-cnn/src/layers/pooling.rs:98-107 | crates/ruvector-cnn/src/layers/pooling.rs:120-129 | crates/ruvector-cnn/src/layers/pooling.rs:200-209 | crates/ruvector-cnn/src/layers/pooling.rs:222-231 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/conv.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/pooling.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c722256b631c0d63a1a6387a39b0b16c7ef468f0bcebaf07047749c3653ab273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/ruvector-graph-condense/src/gnn_eval.rs:157-166 | crates/ruvllm-wasm/src/workers/mod.rs:319-329 | crates/ruvllm/src/backends/gemma2.rs:528-538 | crates/ruvllm/src/backends/phi3.rs:404-414 | crates/ruvllm/src/models/ruvltra_medium.rs:748-758 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-condense/src/gnn_eval.rs:157\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 \u0060a\u0060 to \u0060\u0026[f64]\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/models/ruvltra_medium.rs:760\u0060 calls \u0060silu\u0060, \u0060silu_vec\u0060 and \u0060crates/ruvllm/src/backends/gemma2.rs:539\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/gnn_eval.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"be06f2df7d221a948589f93d049885593ccfbdf0a650fcf26e2f7a3f256eeea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/ruvix/crates/cli/src/commands/dtb.rs:742-751 | crates/ruvix/crates/cli/src/commands/dtb.rs:827-836 | crates/ruvix/crates/cli/src/commands/dtb.rs:916-925 | crates/ruvix/crates/cli/src/commands/dtb.rs:970-979 | crates/ruvix/crates/cli/src/commands/dtb.rs:1019-1028 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:742\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1a3df06a96ca2c262fa715a72d5d630a1d7f884e290495a1145459e8a86053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): crates/ruvix/crates/nucleus/src/checkpoint.rs:217-229 | crates/ruvix/crates/nucleus/src/checkpoint.rs:260-272 | crates/ruvix/crates/nucleus/src/graph_store.rs:550-562 | crates/ruvix/crates/nucleus/src/vector_store.rs:420-432 | crates/ruvix/crates/nucleus/src/witness_log.rs:571-583 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/nucleus/src/checkpoint.rs:217\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/checkpoint.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bbd522b3362547bb912db0a239333f9d11a5c33ddd6cbe224d4f6a1d262228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): crates/prime-radiant/src/coherence/energy.rs:602-610 | crates/ruvector-attention/src/transport/centroid_ot.rs:152-160 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:92-100 | crates/ruvector-math/src/product_manifold/manifold.rs:166-175 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/transport/centroid_ot.rs\u0060 and \u0060crates/ruvector-math/src/optimal_transport/sinkhorn.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/coherence/energy.rs:602\u0060 it does not close everything it opens, so those exact 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 \u0060a\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":"crates/prime-radiant/src/coherence/energy.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57de8e8149e44aae377c16828d809e5b318e1a7c1b09ae5837df88250690365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 4): crates/prime-radiant/src/simd/energy.rs:168-182 | crates/prime-radiant/src/simd/energy.rs:237-251 | crates/prime-radiant/src/simd/vectors.rs:60-77 | crates/prime-radiant/src/simd/vectors.rs:295-310 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/energy.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbae71dfaeacbcaf2f29477650d1179c0a1ee7001e8dd359d33c95b9a33d6c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): crates/ruvector-cnn/src/simd/avx2.rs:518-526 | crates/ruvector-cnn/src/simd/neon.rs:220-229 | crates/ruvector-cnn/src/simd/neon.rs:309-318 | crates/ruvector-cnn/src/simd/wasm.rs:284-292 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:518\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eee447d2932626051b50304098c87fe4fc0a7319ee6adbf4fbe806f817926d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/ruvector-cnn/src/simd/neon.rs:49-58 | crates/ruvector-core/src/simd_intrinsics.rs:761-770 | crates/ruvllm/src/kernels/matmul.rs:1234-1243 | crates/ruvllm/src/kernels/norm.rs:90-99 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:49\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f9268c113f1f7681c6622727530db652f64dc81783c9d55b60da4d8b3ba976"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): crates/ruvector-coherence-hnsw/src/coherence.rs:21-28 | crates/ruvector-maxsim/src/score.rs:20-27 | crates/ruvector-maxsim/src/score.rs:93-100 | crates/ruvector-temporal-tensor/src/agentdb.rs:79-88 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/coherence.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f037ed2244de79e786f791fac54b68e2c3bf2f0440a09bd2a2de32eaeef76f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/ruvector-hailo-cluster/src/bin/embed.rs:113-122 | crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:122-131 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:179-188 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:94-103 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs:113\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/embed.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3d9b003dbee98fd04a628ef60c7f2bbeb32911275461e138b0ecf01b3a2308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:272-281 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:301-310 | crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs:92-101 | crates/ruvector-rabitq/src/rotation.rs:227-236 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs:272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060\u0026mut Vec\u003Cf32\u003E\u0060 in one and \u0060\u0026mut [f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b03aa6eea1419b1d653ff59f330442f30bfe4dd46e09ac229ad0c06949b9f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): crates/ruvector-postgres/src/distance/simd.rs:455-463 | crates/ruvector-postgres/src/distance/simd.rs:508-517 | crates/ruvector-postgres/src/distance/simd.rs:571-579 | crates/ruvector-postgres/src/distance/simd.rs:613-621 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:455\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:464\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs:580\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca065ee27c066f28bd9385effdb5da9a26b6420d5936d9410d578596fc47f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/ruvector-robotics/src/rvf.rs:143-153 | crates/ruvector-robotics/src/rvf.rs:181-191 | crates/ruvector-robotics/src/rvf.rs:210-220 | crates/ruvector-robotics/src/rvf.rs:286-296 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-robotics/src/rvf.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/rvf.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbacada0b1a829eed9c5313726293c78c41bf77776753629b85072a8610c8c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): crates/ruvector-sparse-inference/src/model/gguf.rs:406-415 | crates/ruvector-sparse-inference/src/model/gguf.rs:442-450 | crates/ruvector-sparse-inference/src/model/gguf.rs:478-486 | crates/ruvector-sparse-inference/src/model/gguf.rs:527-535 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/model/gguf.rs:406\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-sparse-inference/src/model/gguf.rs:452\u0060 calls \u0060from_le_bytes\u0060, \u0060from_bits\u0060, \u0060to_f32\u0060 and \u0060crates/ruvector-sparse-inference/src/model/gguf.rs:418\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6abba0558cd8ed9f615586603073b6d05b503b71e6f9cae181fdedb40da161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/ruvllm/src/backends/coreml_backend.rs:1285-1294 | crates/ruvllm/src/backends/coreml_backend.rs:1361-1370 | crates/ruvllm/src/backends/coreml_backend.rs:1420-1429 | crates/ruvllm/src/backends/coreml_backend.rs:1520-1529 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac662b2ed967682991959e7e5d9f677ea5c1dab2279de0a7e8d65098232118f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/ruvllm/src/backends/gemma2.rs:777-786 | crates/ruvllm/src/backends/phi3.rs:648-657 | crates/ruvllm/src/models/ruvltra.rs:928-937 | crates/ruvllm/src/models/ruvltra_medium.rs:831-840 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:777\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/backends/phi3.rs:645\u0060 calls \u0060forward\u0060 and \u0060crates/ruvllm/src/backends/gemma2.rs:774\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3dc6d748a7b9af06cf74ddf9192bb39eb1006419f720174edb5ae41a732dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1367-1378 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1485-1496 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1484-1495 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1602-1613 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1367\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"408d8c4369133181e78f49c28109e3c4097abaa769477a199ff6c21a75a0df77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1290-1300 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1492-1502 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1557-1567 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1834-1844 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e85b4a0a84465e1284eb421ada81abdacca9f712f7105f7586300801905baf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): patches/candle-core-0.8.4/src/tensor.rs:595-604 | patches/candle-core-0.8.4/src/tensor.rs:1607-1616 | patches/candle-core-0.9.2/src/tensor.rs:663-672 | patches/candle-core-0.9.2/src/tensor.rs:1931-1940 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:595\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"480e6ae97830c1990b0764f4b8d0a894206c2fe2e4f9783e4b973181447a29a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): patches/candle-core-0.9.2/src/quantized/mod.rs:483-492 | patches/candle-core-0.9.2/src/quantized/mod.rs:518-526 | patches/candle-core-0.9.2/src/quantized/mod.rs:560-569 | patches/candle-core-0.9.2/src/quantized/mod.rs:588-597 \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 \u0060patches/candle-core-0.9.2/src/quantized/mod.rs:483\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"patches/candle-core-0.9.2/src/quantized/mod.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"40921a7e3e6cfd6e92f417aa4a2c27b7da6b696c74ae13032010f54c5ab284da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/micro-hnsw-wasm/src/lib.rs:708-717 | crates/micro-hnsw-wasm/src/lib.rs:733-742 | crates/micro-hnsw-wasm/src/lib.rs:1144-1153 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/micro-hnsw-wasm/src/lib.rs:708\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03774323fcf13ce7ae14aa502ef8e9d01ce06d5e878919f8c4975b706ed1e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201310 lines \u00D7 6): crates/prime-radiant/src/attention/adapter.rs:182-190 | crates/ruvector-attention/src/hyperbolic/lorentz_cascade.rs:128-129 | crates/ruvector-attention/src/info_geometry/natural_gradient.rs:94-101 | crates/ruvector-attention/src/pde_attention/diffusion.rs:210-219 | crates/ruvector-decompiler/src/transformer.rs:401-403 | crates/ruvector-graph-transformer/src/manifold.rs:1248-1249 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/attention/adapter.rs\u0060 and \u0060crates/ruvector-attention/src/info_geometry/natural_gradient.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/attention/adapter.rs:182\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/prime-radiant/src/attention/adapter.rs:182\u0060 calls \u0060iter\u0060, \u0060sum\u0060 and \u0060crates/ruvector-attention/src/hyperbolic/lorentz_cascade.rs:128\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c70b7d8ba32e9918e56290b409edbdd8357cf7d3ae89777aa484eb3d5e4a19e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-attention-node/src/async_ops.rs:57-66 | crates/ruvector-attention-node/src/async_ops.rs:84-93 | crates/ruvector-attention-node/src/async_ops.rs:116-125 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-node/src/async_ops.rs:57\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/async_ops.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf41de9e2437eacdbeabbe7ed1db1073492a7029e3153b1c6853ebfdb6f6e08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/ruvector-attention/src/transport/cached_projections.rs:29-38 | crates/ruvector-coherence-hnsw/src/dataset.rs:50-57 | crates/ruvector-coherence-hnsw/src/dataset.rs:110-118 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/transport/cached_projections.rs:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/transport/cached_projections.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"58613cf65c1b80f857ec506ec1ca777cdf28079ff4158f3c320505a806a4fbe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-consciousness/src/chebyshev_phi.rs:113-122 | crates/ruvector-consciousness/src/phi.rs:372-381 | crates/ruvector-consciousness/src/sparse_accel.rs:233-242 \u2014 before extracting anything, compare \u0060crates/ruvector-consciousness/src/chebyshev_phi.rs\u0060 and \u0060crates/ruvector-consciousness/src/phi.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/chebyshev_phi.rs:113\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/chebyshev_phi.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dde497986b5337aa2d0c894b7a99da5f10b1dec876de18e96ca9b575277d7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/ruvector-core/src/advanced_features/matryoshka.rs:243-251 | crates/ruvector-core/src/advanced_features/matryoshka.rs:405-413 | crates/ruvector-core/src/advanced_features/multi_vector.rs:194-203 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/advanced_features/matryoshka.rs\u0060 and \u0060crates/ruvector-core/src/advanced_features/multi_vector.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/matryoshka.rs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/matryoshka.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bad6eda47b48127e7c4af227e51924b41ff5fae91b931971e3fb295267ef65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/ruvector-delta-wasm/src/apply.rs:81-90 | crates/ruvector-delta-wasm/src/simd.rs:24-32 | crates/ruvector-delta-wasm/src/simd.rs:59-67 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-wasm/src/apply.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-wasm/src/apply.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a0dfb5f1b61e7c4e27e869d6fdee0312ee39a4f5bf46ce591d9f116e541674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-graph/src/storage.rs:251-260 | crates/ruvector-graph/src/storage.rs:328-337 | crates/ruvector-graph/src/storage.rs:421-430 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/storage.rs:251\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/storage.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede1c8cf344716fb912b7118b10eeacb5818a12b36cbb8b8fd540e0a05b1424f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-math/src/information_geometry/fisher.rs:204-213 | crates/ruvector-math/src/information_geometry/kfac.rs:172-181 | crates/ruvector-math/src/information_geometry/kfac.rs:241-250 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/information_geometry/fisher.rs\u0060 and \u0060crates/ruvector-math/src/information_geometry/kfac.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/information_geometry/fisher.rs:204\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/fisher.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e2a239d4f6a83a27c659262f226d226a0091b88f2adb7b2b81bdd1ef8e2c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/ruvector-postgres/src/distance/simd.rs:168-177 | crates/ruvector-postgres/src/distance/simd.rs:215-222 | crates/ruvector-postgres/src/distance/simd.rs:279-286 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:178\u0060 calls \u0060_mm512_fmadd_ps\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs:223\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8284b68b74a5a02b2f0a87b64f8df4c55c52bd51798c5a8bdc3c571f201459fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-postgres/src/graph/operators.rs:686-695 | crates/ruvector-postgres/src/graph/sparql/triple_store.rs:583-592 | crates/rvlite/src/sparql/triple_store.rs:504-513 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/triple_store.rs\u0060 and \u0060crates/rvlite/src/sparql/triple_store.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/operators.rs:686\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/operators.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87768d87c1b891299f996e35442124d27c234817a9cbce0941fd72bca96987c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): crates/ruvllm/src/kv_cache.rs:471-480 | crates/ruvllm/src/speculative.rs:1067-1074 | crates/ruvllm/src/speculative.rs:1204-1210 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kv_cache.rs:471\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1fc430e825426738cbdd170562f46a67ae1d233f7903777907c6a73b747422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvllm/src/quantize/hadamard.rs:393-402 | crates/ruvllm/src/quantize/hadamard.rs:449-458 | crates/ruvllm/src/quantize/hadamard.rs:506-515 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9d54a841a20c8f7e04c59b4bccc05c4f98613d6ef94397ca83a003c5d40467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvllm_sparse_attention/src/attention.rs:1608-1617 | crates/ruvllm_sparse_attention/src/attention.rs:1714-1723 | crates/ruvllm_sparse_attention/src/attention.rs:1737-1746 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7aa7990e55f4a063fa75c7ca9fd14f201de6ceb7c36d7e313608d3622425d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/rvf/rvf-runtime/src/store.rs:2490-2499 | crates/rvf/rvf-runtime/src/store.rs:2593-2602 | crates/rvf/rvf-runtime/src/store.rs:2705-2714 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:2490\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"185652006f44442ed6d005e32da60df3c9fdf06e30994f1214b1c4264d535ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): patches/candle-core-0.9.2/src/quantized/k_quants.rs:898-908 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1529-1539 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1806-1816 \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 \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:898\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f331220a7a968ff0f41baecfcf1b10fa63adf3b82a53888fd8b32a813bce2c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:683-692 | crates/mcp-brain-server/src/routes.rs:968-977 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:683\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e42d9e31c8a017370693363f83400b38c9c09b81d885c21c2f744be9f6a731f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/mcp-brain/src/tools.rs:423-432 | crates/mcp-brain/src/tools.rs:724-732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b8addd398a585a9a6480c7249675b0b51db8841289047c9dcbb2d3f951d8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/photonlayer-bench/src/privacy.rs:76-85 | crates/ruvector-consciousness/src/rsvd_emergence.rs:122-131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/privacy.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf406acb98ae5c80872a4627f73f06bc26583ca5c178a2982e19e14d1efbc232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/prime-radiant/src/coherence/engine.rs:629-638 | crates/prime-radiant/src/coherence/engine.rs:686-695 \u2014 both copies are in the same file, so extract the block 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":"crates/prime-radiant/src/coherence/engine.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafd0cc913a4ddd11fcbc08a7a641f3fefa00b4009218b06c4d0a6900d75a0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/prime-radiant/src/ruvllm_integration/memory_layer.rs:1025-1034 | crates/rvAgent/rvagent-middleware/src/hnsw.rs:173-182 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/memory_layer.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50c06c393dff6b79913159284a7885424b305c6f663450946875a690b91e664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/prime-radiant/src/security/validation.rs:138-147 | crates/prime-radiant/src/security/validation.rs:348-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/security/validation.rs:138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/prime-radiant/src/security/validation.rs:347\u0060 calls \u0060with_capacity\u0060 and \u0060crates/prime-radiant/src/security/validation.rs:135\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/security/validation.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"299933717fcdebbaf2af5e822b6f2ef31a05a7f3fd033b684755e5e414048be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-acorn-wasm/src/lib.rs:88-97 | crates/ruvector-rabitq-wasm/src/lib.rs:89-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn-wasm/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"29da15bed4832820a1cca0373f5e6ea55fb296fa53d01b22180395f868017823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-attention/src/attention/scaled_dot_product.rs:76-85 | crates/ruvector-attention/src/attention/scaled_dot_product.rs:117-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/attention/scaled_dot_product.rs:76\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/scaled_dot_product.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b28512789b7f8c476c6515cd23858864deebbbbfb3db3945ac8285134c0b92b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:169-178 | crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:226-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:169\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b433a01bfac4896ec4c0c9adccfb105c7d1fa6e9919bdba32ff12c4e16cf8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/ruvector-attention/src/transport/centroid_ot.rs:89-98 | crates/ruvector-diskann/src/pq.rs:117-123 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/transport/centroid_ot.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/transport/centroid_ot.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9e526b03a037679af32ca96d5e880713c6efe677760a28de8b0c21739c29c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-bench/src/bin/comparison_benchmark.rs:197-206 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:255-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:197\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:253\u0060 calls \u0060sqrt\u0060 and \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:195\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"52775a362474c722ee70d96c394bb347c69a9b9c8c0f097654cfd747949d31c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-bet4-ivf-bench/src/kernel.rs:88-97 | crates/ruvector-bet4-ivf-bench/src/pq.rs:97-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/kernel.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6327009f04ccd0456bf234846f4b756c4976d64836112e269a11c63332287cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-cnn/src/kernels/int8_avx2.rs:47-56 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:238-247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:47\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed32b6c8650eaa5db412c439fb2f22189f2217dd5622141aae44bb3a8cae1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-cnn/src/kernels/int8_avx2.rs:285-292 | crates/ruvector-cnn/src/simd/wasm.rs:300-309 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:285\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4292c69b03eecdff52cc4b2c2ec3b1ad7aace6f003bed916621efa6ff72d7b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:19-28 | crates/ruvllm/src/kernels/matmul.rs:1185-1194 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvllm/src/kernels/matmul.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 73 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e56ce076a3f72050c966b3f2ae4e8791fffb3115d4026571cd7d2b42431016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:260-269 | crates/ruvector-cnn/src/simd/neon.rs:345-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd43ce0883659d117654118a116010e590c1a6ea26ee93ca6a0544f7fb8361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-cnn/src/simd/neon.rs:358-367 | crates/ruvector-cnn/src/simd/scalar.rs:174-183 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8b765d7419dff47e895aad049a11bc79c6bda0e50ebd96216788ad8bde95f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvector-consciousness/src/iit4.rs:41-50 | crates/ruvector-consciousness/src/simd.rs:92-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/iit4.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4397c4f593638a7762ba3abd5bb741035c0ff8b60f7aedd4bb4c3bbefc4a6305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-consciousness/src/phi.rs:411-420 | crates/ruvector-consciousness/src/rsvd_emergence.rs:204-211 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-consciousness/src/phi.rs:423\u0060 calls \u0060estimate_largest_eigenvalue\u0060 and \u0060crates/ruvector-consciousness/src/rsvd_emergence.rs:212\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca7402ac1e3cca4ee2c88c2040ebd908b2c35ffd39e4090152a94aac554d4b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-core/src/advanced/tda.rs:215-224 | crates/ruvector-core/src/advanced/tda.rs:264-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced/tda.rs:215\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced/tda.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8193105b08a592561b4c74e898922a8bdeadf8ef2a0adca096cb07df712cf75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/ruvector-core/src/advanced_features/matryoshka.rs:437-455 | crates/ruvector-core/src/advanced_features/multi_vector.rs:325-344 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/advanced_features/matryoshka.rs\u0060 and \u0060crates/ruvector-core/src/advanced_features/multi_vector.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/matryoshka.rs:437\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/matryoshka.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c593d9da80f8e1582e18ad396d9853156c91ef9887e04e0318bc6893bf8a917a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-core/src/pdx.rs:133-142 | crates/ruvector-core/src/pdx.rs:153-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/pdx.rs:133\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/pdx.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e954a22db617c1edae591ad7cbc1bb0d51a9ef0db1761da27b808d39cdd254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-core/src/quantization.rs:48-57 | crates/ruvector-core/src/quantization.rs:300-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddef67eb5e73ffdc13bdc370edb981bc0278458377cdef26514c344e110be25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-crv/src/session.rs:155-164 | crates/ruvector-crv/src/session.rs:233-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/session.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc6aee72fe9548d9f9bb040d70296374441328654bdee6a2c08445840b60a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-dag/src/attention/parallel_branch.rs:201-211 | crates/ruvector-dag/src/attention/temporal_btsp.rs:123-133 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-dag/src/attention/parallel_branch.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/attention/parallel_branch.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"52694974c07ff9956b25c889b01ca2649ad246a044f500961702b983cfbe7766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-dag/src/mincut/local_kcut.rs:73-82 | crates/ruvector-mincut/src/localkcut/mod.rs:302-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-dag/src/mincut/local_kcut.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/mincut/local_kcut.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"814fdd75153ef1180eba599425fd63916307225608c067ad5434ae23caa169b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs:198-207 | crates/ruvector-dag/src/qudag/crypto/ml_kem.rs:231-240 \u2014 before extracting anything, compare \u0060crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs\u0060 and \u0060crates/ruvector-dag/src/qudag/crypto/ml_kem.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs:198\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2947c7b36958a02c573d881b3802831cdbf29ed869d6e975b0d2350982aa3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-delta-core/src/encoding.rs:128-137 | crates/rvf/rvf-server/src/tcp.rs:218-227 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/encoding.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f36012513683099e7f8813546485ab94d67f49df44e0721862032694cd20fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/ruvector-delta-index/src/lib.rs:242-251 | crates/ruvector-delta-index/src/lib.rs:270-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-index/src/lib.rs:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-index/src/lib.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92e502fa78b243b856e3132ba5e8f39ef2de0ac8ec1e790cc8cec8fa2495e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvector-gnn/src/compress.rs:311-319 | crates/ruvector-router-core/src/quantization.rs:118-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-gnn/src/compress.rs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/compress.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"796524b3bbe2ee687c793b9318ae6647c96769de27838d9409b473a54de92ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-gnn/src/mmap.rs:152-161 | crates/ruvector-gnn/src/mmap.rs:413-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9497585200b49a7b3b505bb73a2d8f9913c4ffa594dad4f77d247e06584039e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvector-graph-node/src/lib.rs:984-992 | crates/ruvector-graph-node/src/lib.rs:1028-1037 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/lib.rs:984\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a82f5014ac005048d8be1580f945e7864a59f20d86b024a783454666cea9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:903-911 | crates/rvlite/src/cypher/parser.rs:865-874 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:903\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fdcfe9f82907b11b178cdff79916881a5b850168dbec78eda7f342b8436e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:158-167 | crates/ruvector-hailo-cluster/src/bin/embed.rs:125-134 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:158\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da1eff864c0dfa0bfecfc0aa9a3f58a4b82de6bd7b78aaeadf8f30c9981c10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-kalshi/src/brain.rs:122-131 | crates/ruvector-kalshi/src/rest.rs:106-113 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-kalshi/src/brain.rs:122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/brain.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac4ceebf93c2a6ea44e02766a2bfed4a64a6d10617399cd0f60a796305c6a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-kge-ffi/src/optimize.rs:226-241 | crates/ruvector-kge-wasm/src/optimize.rs:222-237 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/optimize.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/optimize.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 149 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/optimize.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea604287f706198a93673d0c330e7147c969f317f8abbcb137d28c265f0e674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-math/src/optimal_transport/sinkhorn.rs:174-184 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:187-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/sinkhorn.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"137030ae09058ab0f7d5b92df692a235c56d48de90f1c46f360f160027b16421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-math/src/optimization/sos.rs:281-290 | crates/ruvector-math/src/optimization/sos.rs:312-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/optimization/sos.rs:281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/sos.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f069f6eee764dcd59da51626f79d37a78f9bc9a8aeaf36b36529d3710c74fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-math/src/tropical/neural_analysis.rs:92-102 | crates/ruvector-math/src/tropical/neural_analysis.rs:176-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/tropical/neural_analysis.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-math/src/tropical/neural_analysis.rs:187\u0060 calls \u0060push\u0060 and \u0060crates/ruvector-math/src/tropical/neural_analysis.rs:104\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tropical/neural_analysis.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1c0cb6fa7fc309e3fac16675af5f63e8eb6ed896b5a761f2cd3531fc168ad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvector-math/src/tropical/neural_analysis.rs:153-161 | crates/ruvector-math/src/tropical/neural_analysis.rs:273-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/tropical/neural_analysis.rs:153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tropical/neural_analysis.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"804a6d73ab1540f8fe566cbf752dd12c6987b11190613393fddc90c4dc6b2a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/spectral.rs:468-477 | crates/ruvector-temporal-tensor/src/delta.rs:305-312 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/spectral.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a319d64a6baf612cfe942a67d2b257b9e0a9be49c40f52d01e6d1345bd9d179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-mincut/src/cluster/hierarchy.rs:534-543 | crates/ruvector-mincut/src/cluster/hierarchy.rs:614-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4a8a653657e1c6c9ddedaeae66fbbc08022aae0b0f7980093d8fa06e9d14bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-mincut/src/euler/mod.rs:189-198 | crates/ruvector-mincut/src/euler/mod.rs:458-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/euler/mod.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"000bcc67568bf14c160c24d4d6b298ffcbf8c6ec50ad4910c2fe5e484c648f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-mincut/src/expander/mod.rs:380-389 | crates/ruvector-mincut/src/expander/mod.rs:594-603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ba61b1f0853d9c8972cb91a40628470a1f6fa0391fb94c46e30777ee6994c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-mincut/src/expander/mod.rs:507-516 | crates/ruvector-mincut/src/witness/mod.rs:391-401 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7e8855210ab80365f8bdf252c216f75e7519b6bf02b0f0a306f899f50bd4ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-mincut/src/optimization/benchmark.rs:445-454 | crates/ruvector-mincut/src/optimization/benchmark.rs:469-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/benchmark.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec2908059a467905e791c1d62fc19f8bdb3413416c58c26f638e94afb5ce04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-mincut/src/snn/network.rs:260-269 | crates/ruvector-mincut/src/snn/network.rs:275-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/snn/network.rs:260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/network.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6bbd7f5e3f3296532c86ca445cf67c00d3ce074d1b24e9164f0dc2899928a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/attention/flash.rs:351-360 | crates/ruvector-postgres/src/attention/scaled_dot.rs:295-304 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/flash.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"149237ce09dc2f6948aa9142e82864297e1136c3a2b9b63471e4d92e6f616e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/attention/operators.rs:927-936 | crates/ruvector-postgres/src/attention/operators.rs:975-984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/attention/operators.rs:927\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e1f076f7a2c41530730eb08a8000172c9520f7ec8ae7cd73443a14cee5eaa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1020-1028 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:356-365 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af1036465a6b92aa230ca8f704d5e30961e474f06debee2bb86000231efd7c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1577-1586 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:295-304 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1577\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4864b536f8f36110788dc0bd9e319f108b5d77906ff2cc0a71c112af781fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/functions.rs:234-242 | crates/ruvector-postgres/src/graph/sparql/functions.rs:405-414 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/functions.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9406605edae7a0137a386136bebe33008dfc5c1a06b49f1ca7ed4a450580855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:737-753 | crates/rvlite/src/sparql/parser.rs:775-791 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009ecd5fff8c1a0eac2889a2beb1094696f4148eff6939f537e45a77bb5271c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/triple_store.rs:348-357 | crates/rvlite/src/sparql/triple_store.rs:221-230 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/triple_store.rs\u0060 and \u0060crates/rvlite/src/sparql/triple_store.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/triple_store.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":"crates/ruvector-postgres/src/graph/sparql/triple_store.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"986fd1032fa05ae1cc8fd5b23230b30b4af85a26cc34f3bb6b58f5ae54facb59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-postgres/src/hybrid/mod.rs:131-138 | crates/ruvector-postgres/src/hybrid/mod.rs:272-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/hybrid/mod.rs:131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a466758d36734870d0a8c891bf489751c8668c4495dabc12cc7d5e34a611b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw_am.rs:1736-1745 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1597-1604 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw_am.rs:1736\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e501181d0509faef71a9acbf0b25102778a243eb00afbd2a0d09fc12bfc7692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/integrity/events.rs:501-510 | crates/ruvector-postgres/src/integrity/events.rs:512-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/events.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f1e991e7d474a358527818f7fce03c597a23dbcc5d7c4e6b85f18b03dcc7e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/quantization/scalar.rs:53-62 | crates/ruvector-postgres/src/types/scalarvec.rs:224-233 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/scalar.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/scalar.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"311231924a6f120d8bdefeddf0019a7f3fd9aa9bc0eef0d5fd4f59191e8e4804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvector-postgres/src/tenancy/mod.rs:464-471 | crates/ruvector-postgres/src/tenancy/registry.rs:142-151 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/tenancy/mod.rs:464\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/mod.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"6808371d754fa5525e27662b677b4f8590fb17cc1f0d8548af4b4451ac94808e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-rabitq/src/index.rs:807-816 | crates/ruvector-rabitq/src/index.rs:885-894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rabitq/src/index.rs:807\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/index.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb53e4169cef17a26982874cc02863a3557262ac735b2d2dea9ac745894e6c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-rairs/src/rairs.rs:46-55 | crates/ruvector-rairs/src/seil.rs:60-69 \u2014 before extracting anything, compare \u0060crates/ruvector-rairs/src/rairs.rs\u0060 and \u0060crates/ruvector-rairs/src/seil.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/rairs.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ecf2e34ccaa6104cf0625bd218ec37e2bc8eed6a35c149fe8c21686a660ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-recall-bounded/src/lib.rs:216-225 | crates/ruvector-recall-bounded/src/lib.rs:376-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f1da1eb418f64a292d88fa507d4fe4a7217452855dbf5a5f42dbd5dd27e5aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-router-cli/src/main.rs:136-145 | crates/ruvector-router-cli/src/main.rs:164-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-cli/src/main.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e34ed235b956abbd4e447ab8a4a91e157073b6d08417f81644223f6c9b70b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-router-ffi/src/lib.rs:167-177 | crates/ruvector-router-ffi/src/lib.rs:198-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-router-ffi/src/lib.rs:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-ffi/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d2afbc4c12a3d3a6dd275e10ee0ac9af2f49f22fba8638a11b60099d0ad89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-solver/src/backward_push.rs:315-324 | crates/ruvector-solver/src/forward_push.rs:382-391 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/backward_push.rs:315\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/backward_push.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cceb9516d674c87e8161297de03c24e345bc55254f1468e59fd5f728b523cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-solver/src/bmssp.rs:528-537 | crates/ruvector-solver/src/router.rs:875-884 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/bmssp.rs:528\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e09f1cf0b629139afc28d62a079b55e359bd709ac4f61384120b3f9c2f0712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-sparsifier/src/audit.rs:107-116 | crates/ruvector-sparsifier/src/audit.rs:164-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparsifier/src/audit.rs:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparsifier/src/audit.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6372179668d4d4f38c0c252c978de4866c1372f3ff062f16fa5c1d1fab3b3f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-temporal-tensor/src/agentdb.rs:75-84 | crates/rvAgent/rvagent-middleware/src/hnsw.rs:169-178 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/agentdb.rs:75\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/agentdb.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff895b96f4f820f02dd1cbcf72fbb16a65edb7c03df22ebfbdbf5ac378a1b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-temporal-tensor/src/ffi.rs:145-154 | crates/ruvector-temporal-tensor/src/ffi.rs:204-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/ffi.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adf16fa51cba47ac8e2d948e2305e7ed67d42ea94274e5ce733dac3c5838d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-temporal-tensor/src/quantizer.rs:121-130 | crates/ruvector-temporal-tensor/src/quantizer.rs:148-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/quantizer.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c94a86dc4335c74ffe897b2c64ae2361be7be4062a2257a8ae0a00bfb9afedb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-typesafe-core/src/bank.rs:228-237 | crates/ruvector-typesafe-core/src/bank.rs:276-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-typesafe-core/src/bank.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/bank.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b78d7f2d711976a479fb9c41eb90c87d4394e1f062de38a3ff1f8423736f820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvix/crates/drivers/src/gic.rs:207-216 | crates/ruvix/crates/drivers/src/gic.rs:228-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/drivers/src/gic.rs:207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/drivers/src/gic.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"781673eaaf6e7d6ab8d9edcead316dca515b4dda3caf4db03078ae1ff382e503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvix/crates/net/src/udp.rs:128-137 | crates/ruvix/crates/net/src/udp.rs:185-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvix/crates/net/src/udp.rs:193\u0060 calls \u0060from\u0060 and \u0060crates/ruvix/crates/net/src/udp.rs:141\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/udp.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a897286d0d599bbffbcb89e52b7cf2ded5cd89566f29e59d001f3e65b31201b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvix/crates/region/src/manager.rs:143-152 | crates/ruvix/crates/region/src/manager.rs:194-203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/manager.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bf352703a5c449e8180804316b03b7b5d208165d6f98d8994e67b976408ade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvllm-wasm/src/workers/pool.rs:687-696 | crates/ruvllm-wasm/src/workers/pool.rs:1087-1095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm-wasm/src/workers/pool.rs:687\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/pool.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae28393d754c70dc24370d120449212b98c34efcb6e0b8962436fae272743ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/autodetect.rs:962-971 | crates/ruvllm/src/autodetect.rs:981-990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/autodetect.rs:962\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"3032959b608d6c146b594da72ef31a5d1f782fa4669d04ad572d8ad5f314515c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvllm/src/backends/gemma2.rs:381-389 | crates/ruvllm/src/models/ruvltra.rs:552-561 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 219 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5808acc2828966d0ddd4421aa0b4f3c0b6710f6c09b3127cbb46889653464c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:3238-3247 | crates/ruvllm/src/bitnet/backend.rs:3307-3316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ba2fec7cccd5451b5de12f50ac09d617565de0347eabeb98bb3b366ddb9b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvllm/src/bitnet/expert_cache.rs:563-572 | crates/ruvllm/src/bitnet/expert_cache.rs:586-594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/expert_cache.rs:563\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/expert_cache.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bc703cba813145e0dc74dc9914aa9b984ef40f94c19212d5b0e9291c921df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/bitnet/tl1_avx2.rs:91-100 | crates/ruvllm/src/bitnet/tl1_wasm.rs:78-87 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/bitnet/tl1_avx2.rs\u0060 and \u0060crates/ruvllm/src/bitnet/tl1_wasm.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/tl1_avx2.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d2f74b1296b1ec86d99d6fa924207667b776b7e980a3c3cf8015d4af1bb615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvllm/src/bitnet/tl1_avx2.rs:181-196 | crates/ruvllm/src/bitnet/tl1_wasm.rs:199-214 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/bitnet/tl1_avx2.rs\u0060 and \u0060crates/ruvllm/src/bitnet/tl1_wasm.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/tl1_avx2.rs:181\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/tl1_avx2.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8becdeca26d61e12f6e82b48a75c5fd75dff362947148a1faf3adc3905fe4a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/claude_flow/reasoning_bank.rs:1065-1074 | crates/sona/src/reasoning_bank.rs:450-459 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/claude_flow/reasoning_bank.rs:1065\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/reasoning_bank.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"283964b721c12e3858b56364b7e2cbd7d8755e4246485fc008a2c47903113b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/gguf/loader.rs:336-346 | crates/ruvllm/src/gguf/tensors.rs:269-279 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/gguf/loader.rs:336\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/loader.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ace9166625570f323eaac62184111a0166165568598e263d9ca577dc0f089a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/gguf/loader.rs:498-508 | crates/ruvllm/src/gguf/mod.rs:776-786 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/gguf/loader.rs:498\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/loader.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d5a6367327918a49055f3ef50ccb2ad286808e61d0b1479a100c9b6864035b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:773-782 | crates/ruvllm/src/kernels/attention.rs:835-844 \u2014 both copies are in the same file, so extract the block 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":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9c5a16d8959a993324d218ff3e9cb980c1b9e9a350c388a9f11eb7fd7df342"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvllm/src/kernels/quantized.rs:443-452 | crates/ruvllm/src/kernels/quantized.rs:510-518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/quantized.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c88678a457b0e0645ef73e49c2ef46b93e2b47323d895c2bd2894ef8d88bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/ruvllm/src/metal/context.rs:525-532 | crates/ruvllm/src/metal/context.rs:856-865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/context.rs:525\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a10d1a59de52bd4cbefeb4b24016d5fcd17b47d32d4866fb5cd94e4a4d5fe1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvllm/src/models/rdt.rs:827-844 | crates/ruvllm/src/models/rdt.rs:871-888 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/rdt.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"b782908d4edaa81c60d04b56f075272a9d33fd55e6fb968712106198a3e1f4f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/models/ruvltra.rs:452-461 | crates/ruvllm/src/models/ruvltra_medium.rs:510-519 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra_medium.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/ruvltra.rs:452\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026RuvLtraConfig\u0060 in one and \u0060\u0026RuvLtraMediumConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad28e7fdeffb062c603ab5cdbcd3d24de0c00aab4652dfedecb87060904baaad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201310 lines \u00D7 3): crates/ruvllm/src/optimization/metrics.rs:649-658 | crates/ruvllm/src/optimization/metrics.rs:680-688 | crates/ruvllm/src/quality/scoring_engine.rs:790-794 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/optimization/metrics.rs:649\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/optimization/metrics.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ce173bc1b0e2be41d4a5ee6628f59e80f223819be649c84efd969f47767e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/quality/diversity.rs:503-512 | crates/ruvllm/src/quality/diversity.rs:633-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/diversity.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba04fed1f79d1d2439cf06f6121057bb99e7780625be66a7529c545dd1290e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/quantize/pi_quant.rs:340-350 | crates/ruvllm/src/quantize/pi_quant.rs:380-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/pi_quant.rs:340\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"810dd3a766843db40ed5775a2f981f357d969c828de6e9297e23517f20933e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/quantize/turbo_quant.rs:427-436 | crates/ruvllm/src/quantize/turbo_quant.rs:541-550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2bb769278a29e5f25d879e9efd3f01f5fd8423037287d950f26520b0ab6e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/ruvllm/src/session.rs:245-254 | crates/ruvllm/src/session.rs:265-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/session.rs:245\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/session.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d16b792e4fee9bd4aba8af16ca39583536cc088e4b9f0ab5bbcdeea6b63d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/speculative.rs:518-527 | crates/ruvllm/src/speculative.rs:784-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/speculative.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e59173cf1fbf18085f996cddac4fe79fd73440eecdec1ea26cf3246d6fc477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/filesystem.rs:167-176 | crates/rvAgent/rvagent-backends/src/filesystem.rs:196-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-backends/src/filesystem.rs:167\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7c515984e5fd70cc2d9b46d8af147dd2d0f8f58b654bf718e3de97f7088a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvf/rvf-ebpf/src/lib.rs:251-260 | crates/rvf/rvf-ebpf/src/lib.rs:268-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-ebpf/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"730f81e5919b51942eea39d084d90639b46f77efa10025cd5e4b121bc34ff4b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/rvf/rvf-index/src/hnsw.rs:298-307 | crates/rvf/rvf-index/src/hnsw.rs:403-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d95c0bfd73f1ca03c684ded1bc2b23361c676274b09da25bc1299d26e69e5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvf/rvf-runtime/src/write_path.rs:455-464 | crates/rvf/rvf-runtime/src/write_path.rs:495-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/write_path.rs:455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/write_path.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"8828e9f75c023800e13cd2550901ac73876caf5795779d823a1a0bf03e47dbd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvf/rvf-types/src/qr_seed.rs:148-158 | crates/rvf/rvf-types/src/witness.rs:233-242 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-types/src/qr_seed.rs:148\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-types/src/qr_seed.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8c0aa005e91b999dbe244879b767b82b1a9cfef10f1050ea037fa2aa4ed83b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvf/rvf-wasm/src/distance.rs:115-124 | crates/rvf/rvf-wasm/src/store.rs:321-330 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wasm/src/distance.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"decf3f0913bb3e140da6b9cc333b94927f1ce21b88a558ada19d4ddb82017497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvm/crates/rvm-witness/src/seal.rs:477-486 | crates/rvm/crates/rvm-witness/src/seal.rs:519-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/seal.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb22b1bc01d9f548d65de83da644020c53359e6a84e85cfeca821530dbd62d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): edge/gateway/src/durable.rs:272-281 | edge/gateway/src/m3_transport.rs:27-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/durable.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc6d0d6c410f9adc05cda61ab4fbfc1138253962e0fd1777f0f3d32c308b5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:749-758 | patches/candle-core-0.9.2/src/backprop.rs:769-778 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcabf036fb2f624ce86ef80a3ebf48e3a79d0a28bc606a02b1618a4d1a29f158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:435-450 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:482-497 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:435\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3eef1e45f87962fd7bc6205b6a3dd8652a32e43210fa089696a4412ddf8f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:783-798 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:908-923 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab58c34f97cc907a044400c3b153ef938f6b17038766623f384271b186dd0e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:829-838 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:953-962 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"74facb848740500330f667ec93bb10c4fbac20c9cb3e9fbbbcbb7d6f1b03c117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1786-1798 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2293-2305 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1786\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"876f22a8d731a9d42fc95e173ffc7668f0899196e6fd7b40ec202b7101e1b957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1940-1949 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2523-2532 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e50428092d7774c89053f3a111bdd82a0ae4b987de81e32211a302901e62ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/custom_op.rs:171-180 | patches/candle-core-0.9.2/src/custom_op.rs:171-180 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/custom_op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/custom_op.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3db81da5d630946c6ca8a4fdbf2c6a248093c2371764e50fca36578dd3744ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/custom_op.rs:472-481 | patches/candle-core-0.9.2/src/custom_op.rs:474-483 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/custom_op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/custom_op.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f1769eac4b0f8d27fd92bdf710251553e7acf501c4cb2a13c69dac13e3cab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/error.rs:255-264 | patches/candle-core-0.9.2/src/error.rs:264-273 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/error.rs\u0060 and \u0060patches/candle-core-0.9.2/src/error.rs\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"patches/candle-core-0.8.4/src/error.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac2b6059d2880ae83b87a2e54f68b855b5b78f1b63fb6b12dd743e4ad67d33b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:810-819 | patches/candle-core-0.9.2/src/pickle.rs:834-843 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"28df77823b23902b82cd487cc58bd8097a7fff561339a328dacfcfb16805c363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:108-117 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:108-117 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7e81e1f1a029349b4f53055a7210fd34c2e45256e0f950b4920e89210886a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:36-46 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:37-47 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"262b3e5611b59c9f97a1f7c4ff5abcc1fc02487e88e238a9a1c1fe615d208418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:221-230 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:222-231 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"370e03f24619573624ff05d48fe95946f4e0c121decdbcb18114e8220bb7c383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:226-235 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:242-251 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b199cdb98ab30f71280e787984f9b029b42c4a6462521e69f94b44570da5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:620-629 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:651-660 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fa2357e3b59293b80f810a6cadfc966ad8dbb243510ab93a70d56eed4debb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:675-689 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:726-740 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:675\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"101869a3622a05514d08b9b44d06193cb15fa5155c9a366788d5185180412b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:706-715 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:756-765 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c62059fc8cb6ab6e270910d85de4c2c4f4c9d47c358b81872f117b88e3aa87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1160-1169 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1361-1370 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c7bac5da79641401b7ac338731358b51a6ed7bd5d63fddd515cf9f92867f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1172-1181 | patches/candle-core-0.8.4/src/quantized/simd128.rs:180-189 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/simd128.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 83 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caa1c820abcad74774141c8762393bc03192186e37b3fad52264e40e98e6a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1574-1583 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1919-1928 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"35746592557c92867d631aa4b365c742e15e512d27b9003630c7065a7c6f4f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1652-1660 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1998-2007 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1652\u0060 it does not close everything it opens, so those exact 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5082e9cce8a94b80592b66be1cbd27a8f34a9c31334457e73e5227bfc4bda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1757-1766 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2184-2193 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6db89a6310daa37af3fb9e5ac455cbf54324c1783d3dd37ec1009bba4c15bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:370-382 | patches/candle-core-0.9.2/src/quantized/mod.rs:633-645 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7198057feec040ecce4083da8104eda4d641bb1b4515555f9903e0858c645119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:474-483 | patches/candle-core-0.9.2/src/quantized/mod.rs:783-792 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b2a3a5af6e2a633e9c8e3928985f7780441ef6a0ab502c6d390a144b14510a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:485-494 | patches/candle-core-0.9.2/src/quantized/mod.rs:794-803 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5946c5275b63bd490fb6210ef9e8f4059f96a3b44c1e494b49689c524779e19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/sort.rs:127-136 | patches/candle-core-0.9.2/src/sort.rs:157-166 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/sort.rs\u0060 and \u0060patches/candle-core-0.9.2/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"986a85f1059a35e4b9a819264bb1593024d403f36069073c62fb056a10c6e3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:772-787 | patches/candle-core-0.9.2/src/storage.rs:833-848 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"f315906a8cb143472f34c157a180bd5b0068b648b801bbb8b40de93184178c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/streaming.rs:54-63 | patches/candle-core-0.9.2/src/streaming.rs:54-63 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/streaming.rs\u0060 and \u0060patches/candle-core-0.9.2/src/streaming.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23cf4318e38a2cce59196ecc42765905d6291b3f161a625c8a3270f21e22d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1288-1302 | patches/candle-core-0.9.2/src/tensor.rs:1546-1560 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ac071918ec99dd38af1cd5d70f5a1bb30ff42bcdb815c40141d0623e22cf22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1341-1350 | patches/candle-core-0.9.2/src/tensor.rs:1599-1608 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85d3d6949a14a06dfc599d912c619a745e2dfda4122518440393b4dd13c9efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1400-1409 | patches/candle-core-0.9.2/src/tensor.rs:1724-1733 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e6407b959feabc349fa3340c5461da36eb4b365849b32087625c6c66f79195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2045-2057 | patches/candle-core-0.9.2/src/tensor.rs:2369-2381 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:2045\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"9260641ce5c653d767b36fe12bc6ac87a5642fa05318c94b4108c6b83c28e53c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2320-2329 | patches/candle-core-0.9.2/src/tensor.rs:2643-2652 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c8554c9c6da4535fc6e23c9f77d44cd056b658c9ef677f2d8e638fa58595f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/device.rs:256-271 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:280-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cuda_backend/device.rs:256\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":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"576e50ad22002252067b2f6f7be77e9ca113d5dd1806a5195dc0eacd76738cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:199-208 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:252-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:199\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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55029de6b398a8312eba222446362281acee548217f58ed5e6a2a86a36186e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): crates/ruvix/crates/boot/src/manifest.rs:664-672 | crates/ruvix/crates/boot/src/manifest.rs:675-683 | crates/rvf/rvf-cli/src/cmd/rebuild_refcounts.rs:48-56 | crates/rvf/rvf-runtime/src/cow_map.rs:106-114 | crates/rvf/rvf-runtime/src/read_path.rs:573-581 | crates/rvf/rvf-runtime/src/read_path.rs:583-591 | crates/rvf/rvf-runtime/src/store.rs:4781-4789 | crates/rvf/rvf-runtime/src/store.rs:4791-4799 | crates/rvf/rvf-wasm/src/segment.rs:37-45 | crates/rvf/rvf-wasm/src/segment.rs:47-55 | crates/rvm/crates/rvm-proof/src/lib.rs:188-196 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/boot/src/manifest.rs\u0060 and \u0060crates/rvf/rvf-runtime/src/read_path.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/boot/src/manifest.rs:664\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/manifest.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e57aaa8c9e7f2e2c7ad8e9cb9e6354166a6b680a9fce68ee54b3da28151f8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/ruvix/crates/boot/src/manifest.rs:654-663 | crates/ruvix/crates/boot/src/manifest.rs:665-674 | crates/rvf/rvf-quant/src/binary.rs:58-66 | crates/rvf/rvf-runtime/src/read_path.rs:564-572 | crates/rvf/rvf-runtime/src/read_path.rs:574-582 | crates/rvf/rvf-runtime/src/store.rs:4782-4790 | crates/rvf/rvf-wasm/src/segment.rs:38-46 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/boot/src/manifest.rs\u0060 and \u0060crates/rvf/rvf-runtime/src/read_path.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/boot/src/manifest.rs:654\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/manifest.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f320866e75c268f06d60d10bf389d696052b10042436db37cc62e1738b574c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 6): crates/prime-radiant/src/ruvllm_integration/memory_layer.rs:1024-1032 | crates/ruvector-coherence-hnsw/src/coherence.rs:20-27 | crates/ruvector-maxsim/src/score.rs:19-26 | crates/ruvector-maxsim/src/score.rs:92-99 | crates/ruvector-temporal-tensor/src/agentdb.rs:78-86 | crates/rvAgent/rvagent-middleware/src/hnsw.rs:172-180 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/memory_layer.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce62887a21be340b044691978bab34f8ee0abea2e36f8ca06dd41e68c7e08b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): crates/ruvector-attention-cli/src/commands/serve.rs:117-127 | crates/ruvector-attention-cli/src/commands/serve.rs:146-156 | crates/ruvector-attention-cli/src/commands/serve.rs:175-185 | crates/ruvector-attention-cli/src/commands/serve.rs:203-213 | crates/ruvector-attention-cli/src/commands/serve.rs:231-241 | crates/ruvector-attention-cli/src/commands/serve.rs:261-271 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-cli/src/commands/serve.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/serve.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"965105e84cced553dd7c23d22c484d28e321bafa22eb44f53f78719301dfddbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 6): crates/ruvector-cnn/src/simd/neon.rs:21-29 | crates/ruvector-core/src/simd_intrinsics.rs:655-663 | crates/ruvector-core/src/simd_intrinsics.rs:735-742 | crates/ruvector-core/src/simd_intrinsics.rs:804-811 | crates/ruvector-core/src/simd_intrinsics.rs:864-871 | crates/ruvllm/src/kernels/matmul.rs:1187-1195 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:812\u0060 calls \u0060vdupq_n_f32\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs:32\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e59364eae8b9a57a47d04c081e92333b64b1ecd97fd857d15fd3ec85a8cc92b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2269-2281 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1420-1432 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:946-954 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2793-2805 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1912-1924 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:994-1002 \u2014 \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 90 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2269\u0060 it does not close everything it opens, so those exact 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3330a7c10c62bd955ef9911fb6046e80f8740e47ec2872276858ce506fd21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1275-1283 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1472-1480 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1477-1485 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1543-1551 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1738-1746 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1820-1828 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1275\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0199327d4dc5972e28acb39f59c2de5eb7e959f41ee2a24175344fef38175287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 5): crates/ruvector-solver/src/simd.rs:121-128 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:489-497 | crates/rvf/rvf-index/src/distance.rs:84-90 | crates/rvf/rvf-index/src/distance.rs:128-134 | crates/rvf/rvf-index/src/distance.rs:178-184 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060v\u0060 to \u0060std::arch::x86_64::__m256\u0060 in one and \u0060core::arch::x86_64::__m256\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-index/src/distance.rs:78\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/rvf/rvf-index/src/distance.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":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad94c398a04e7f8cf06639371bc395653a9e8c97211c8517f1477ba9dda3813e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/rvAgent/rvagent-mcp/src/client.rs:35-43 | crates/rvAgent/rvagent-mcp/src/client.rs:71-79 | crates/rvAgent/rvagent-mcp/src/client.rs:98-106 | crates/rvAgent/rvagent-mcp/src/client.rs:119-127 | crates/rvAgent/rvagent-mcp/src/client.rs:139-147 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/client.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea55d389f7e2640bafdad51da5ac375ebd3767f78ddc8ec10d26156d632a3f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/mcp-brain/src/tools.rs:376-384 | crates/mcp-brain/src/tools.rs:705-713 | crates/ruvllm/src/policy_store.rs:397-405 | crates/ruvllm/src/witness_log.rs:638-646 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/policy_store.rs\u0060 and \u0060crates/ruvllm/src/witness_log.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/mcp-brain/src/tools.rs:714\u0060 calls \u0060get\u0060, \u0060and_then\u0060, \u0060as_str\u0060 and \u0060crates/mcp-brain/src/tools.rs:385\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0811e319554f5077ef5e3e98cb4d683e887a1f2703c603f42dd69c3df0be8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ruvector-cnn/src/layers/pooling.rs:102-110 | crates/ruvector-cnn/src/layers/pooling.rs:204-212 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:48-56 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:139-147 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/pooling.rs:102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/pooling.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d93e2e71bea74bcff25b82ee239f2f2acb3438618222ce53d72bb4f162a52ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ruvector-core/src/simd_intrinsics.rs:131-139 | crates/ruvector-postgres/src/distance/simd.rs:1274-1282 | crates/ruvector-postgres/src/distance/simd.rs:1355-1363 | crates/ruvector-postgres/src/distance/simd.rs:1446-1454 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"968dd0984e9347c4831adb16fb7ad83327d57eb857f440a865de798a19dff386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ruvector-domain-expansion/src/planning.rs:358-366 | crates/ruvector-domain-expansion/src/rust_synthesis.rs:325-333 | crates/ruvector-domain-expansion/src/tool_orchestration.rs:384-392 | crates/ruvector-robotics/src/domain_expansion.rs:613-621 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-domain-expansion/src/planning.rs:358\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/planning.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e3e8c524fa5e3d5c713944807c717dfab3a8ad8c1e4d7ac018ad76e2a42d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ruvector-gnn/src/compress.rs:313-321 | crates/ruvector-postgres/src/quantization/binary.rs:27-35 | crates/ruvector-postgres/src/types/binaryvec.rs:50-58 | crates/ruvector-router-core/src/quantization.rs:121-129 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/binary.rs\u0060 and \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/compress.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7df2099c98f39bc8785b2ce19b1d8e6450ad8e1bbf16d58e7440dd1a685a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ruvector-postgres/src/distance/simd.rs:130-138 | crates/ruvector-postgres/src/distance/simd.rs:213-221 | crates/ruvector-postgres/src/distance/simd.rs:244-252 | crates/ruvector-postgres/src/distance/simd.rs:277-285 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:139\u0060 calls \u0060_mm512_sub_ps\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs:222\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4190029dca4d70f081678870a3df33020b64da1835acc8e518dc7d44d85d6a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ruvix/crates/nucleus/src/kernel.rs:470-478 | crates/ruvix/crates/nucleus/src/kernel.rs:531-539 | crates/ruvix/crates/nucleus/src/kernel.rs:568-576 | crates/ruvix/crates/nucleus/src/kernel.rs:603-611 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/kernel.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc74db99db1ed729b7d17135e2ac3ea99b04f26b50196e7993d370d0ba89822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 4): patches/candle-core-0.8.4/src/backprop.rs:294-311 | patches/candle-core-0.8.4/src/backprop.rs:324-340 | patches/candle-core-0.9.2/src/backprop.rs:296-313 | patches/candle-core-0.9.2/src/backprop.rs:326-342 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/backprop.rs:294\u0060 it begins part-way through the construct above it, so those exact 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, \u0060patches/candle-core-0.8.4/src/backprop.rs:312\u0060 calls \u0060Err\u0060 and \u0060patches/candle-core-0.8.4/src/backprop.rs:341\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":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ac27b1c3515b734307c4cf579d49ed0df027d4b12b52b39cb41b07b7f9a423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:201-209 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:403-411 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:218-226 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:431-439 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2970d8f5e8f438893836398626c0f67bb9faa6f208a6cab73a7620ea6b8cfbf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): patches/candle-core-0.8.4/src/tensor.rs:1171-1179 | patches/candle-core-0.8.4/src/tensor.rs:1209-1217 | patches/candle-core-0.9.2/src/tensor.rs:1352-1360 | patches/candle-core-0.9.2/src/tensor.rs:1390-1398 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6973fba22bf9f576e27f629a0b9cb7b1e4914952db610812e8a261dc529fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): patches/candle-core-0.9.2/src/quantized/cuda.rs:619-630 | patches/candle-core-0.9.2/src/quantized/cuda.rs:647-658 | patches/candle-core-0.9.2/src/quantized/cuda.rs:676-687 | patches/candle-core-0.9.2/src/quantized/cuda.rs:700-711 \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 \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs:619\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":"patches/candle-core-0.9.2/src/quantized/cuda.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd7a280f2f4fbac755c408fac8437ef6a56be8749998ddd869b7de5e84d83a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): patches/hnsw_rs/src/hnsw.rs:1540-1548 | patches/hnsw_rs/src/hnsw.rs:1600-1608 | scripts/patches/hnsw_rs/src/hnsw.rs:1426-1434 | scripts/patches/hnsw_rs/src/hnsw.rs:1486-1494 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:1540\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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5a76bee1ebdf9a931a158c87a2b7aed8d9f3a215ea4ce014298ba38cbf8078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): patches/hnsw_rs/src/hnswio.rs:483-491 | patches/hnsw_rs/src/hnswio.rs:581-589 | scripts/patches/hnsw_rs/src/hnswio.rs:483-491 | scripts/patches/hnsw_rs/src/hnswio.rs:581-589 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnswio.rs:483\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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"39480e6006e074ce5c61f3ba1aa8bec7e50477e827b1417db296747892874eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): patches/hnsw_rs/src/libext.rs:158-165 | patches/hnsw_rs/src/libext.rs:714-722 | scripts/patches/hnsw_rs/src/libext.rs:158-165 | scripts/patches/hnsw_rs/src/libext.rs:714-722 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/libext.rs:158\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":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a97a33aef3bb2f982a057d8a5211201fa68b4aa28139b0e3f52fe3074dc06c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): patches/hnsw_rs/src/libext.rs:179-186 | patches/hnsw_rs/src/libext.rs:741-749 | scripts/patches/hnsw_rs/src/libext.rs:179-186 | scripts/patches/hnsw_rs/src/libext.rs:741-749 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccef30e4a779b3d122eeeab0d8712163e8ae85e87a164eec9b750eb2ea5d806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/mcp-brain-server/src/symbolic.rs:482-490 | crates/mcp-brain-server/src/symbolic.rs:495-503 | crates/mcp-brain-server/src/symbolic.rs:508-516 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/symbolic.rs:482\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/symbolic.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59137011cf49f6cbb48954fb500b7e078e6d76fc49baa3749ed453fa51ee1f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-acorn/src/graph.rs:85-93 | crates/ruvector-acorn/src/graph.rs:152-160 | crates/ruvector-acorn/src/search.rs:140-148 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-acorn/src/graph.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":"crates/ruvector-acorn/src/graph.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fd5765f0c67b0492b5d5e14e6cafc2d05f9fbbe3c76f66a333672527fb8d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:194-202 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:297-305 | crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:401-409 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/agenticdb_benchmark.rs:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/agenticdb_benchmark.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51042e0cefc7eaa982fc87ed72d6c7b5867fa373222402f24cfefa53d903515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:243-251 | crates/ruvector-core/src/simd_intrinsics.rs:307-314 | crates/ruvector-core/src/simd_intrinsics.rs:439-446 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac81ac9f96a952a327dd5f91f890ee7ff00ea54191b33d2821939ec7f50c2f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-delta-core/src/encoding.rs:127-135 | crates/ruvector-delta-core/src/encoding.rs:371-379 | crates/rvf/rvf-server/src/tcp.rs:217-225 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-core/src/encoding.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/encoding.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7c3a79664c179b74b8df8f25ec410fb39a4b5f9a6fcdb7cf1f2c0e48003cab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-entropy-ann/src/search.rs:170-178 | crates/ruvector-entropy-ann/src/search.rs:286-294 | crates/ruvector-entropy-ann/src/search.rs:450-458 \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":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"40411587f24f287266c47d844bc849ddebbaa27037e5d2b33aaaee5c29cba9a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/bench.rs:32-39 | crates/ruvector-hailo-cluster/src/bin/embed.rs:31-39 | crates/ruvector-hailo-cluster/src/bin/stats.rs:32-39 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1cc053decf18362e49c8eece86dd3c83707a8fc42968c921a579922a5004d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): crates/ruvector-math/src/information_geometry/fisher.rs:71-79 | crates/ruvector-math/src/information_geometry/kfac.rs:89-95 | crates/ruvector-math/src/information_geometry/kfac.rs:102-108 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/information_geometry/fisher.rs\u0060 and \u0060crates/ruvector-math/src/information_geometry/kfac.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/information_geometry/fisher.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/fisher.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8ece6cefec974eaeefcba67dc7d6430109a56b9995133d2c906bec90bf0795"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-memory-admission/src/policy.rs:141-149 | crates/ruvector-memory-admission/src/policy.rs:269-277 | crates/ruvector-memory-admission/src/policy.rs:430-438 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-memory-admission/src/policy.rs:430\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/policy.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e367816723e32dfb48c249e99cc806f7f5134b23c7b5f952534675b139d37677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/ruvector-mincut/src/subpolynomial/mod.rs:621-628 | crates/ruvector-mincut/src/subpolynomial/mod.rs:767-775 | crates/ruvector-mincut/src/subpolynomial/mod.rs:798-805 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5195adccb07889a788fa1d69c7cc1e9bdd95946ac770cae86de50f60d8b6d45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-postgres/src/distance/simd.rs:1505-1513 | crates/ruvector-postgres/src/distance/simd.rs:1571-1579 | crates/ruvector-postgres/src/distance/simd.rs:1597-1605 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1505\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:1515\u0060 calls \u0060vsubq_f32\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs:1581\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd604ee7740698b21013135f13844986c335b81dc96dd5332c7405e1d4b3e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-postgres/src/distance/simd.rs:1580-1588 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:298-306 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:325-333 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1580\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:1579\u0060 calls \u0060vld1q_f32\u0060, \u0060as_ptr\u0060, \u0060add\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:324\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abb819cacca1668ad67d98cd791421111eb9ab36498b8f86c09c3435142e100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-postgres/src/index/ivfflat_am.rs:743-751 | crates/ruvector-postgres/src/index/ivfflat_am.rs:950-959 | crates/ruvector-postgres/src/index/ivfflat_storage.rs:38-46 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs:743\u0060 it does not close everything it opens, so those exact 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 \u0060index\u0060 to \u0060Relation\u0060 in one and \u0060pg_sys::Relation\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb476e6659c23d2ea680d8c625f25b6d90b11da62d0f584bbe8e874674f1d97b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-rabitq/src/index.rs:760-768 | crates/ruvector-rabitq/src/index.rs:806-814 | crates/ruvector-rabitq/src/index.rs:884-892 \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":"crates/ruvector-rabitq/src/index.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ed3e546a369c2c5f007282d00f87a4c88b3c77ff10f9b515d4ff5755bdf9c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-rulake/src/backend.rs:269-277 | crates/ruvector-rulake/src/backend.rs:288-296 | crates/ruvector-rulake/src/backend.rs:313-321 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/backend.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f19770b1dc32455f5ce4aeb9c15860799bcea99cb6072d049e6396d235d8a2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): crates/ruvector-solver-wasm/src/lib.rs:483-491 | crates/ruvector-solver/src/cg.rs:325-332 | crates/ruvector-solver/src/neumann.rs:456-462 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver-wasm/src/lib.rs:483\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060matrix\u0060 to \u0060\u0026CsrMatrix\u003Cf64\u003E\u0060 in one and \u0060\u0026CsrMatrix\u003Cf32\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-wasm/src/lib.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c5f190684de7271dfb1e1d160ccbadaae8f742a310147c4f8ec43ea931eb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-solver/src/backward_push.rs:280-288 | crates/ruvector-solver/src/backward_push.rs:393-401 | crates/ruvector-solver/src/backward_push.rs:479-487 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/backward_push.rs:280\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/backward_push.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b44ea5ebe025d9fd16f969c22fefc750d58a01c65f8e341df6a982bd4727db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-temporal-coherence/src/search.rs:35-43 | crates/ruvector-temporal-coherence/src/search.rs:64-72 | crates/ruvector-temporal-coherence/src/search.rs:114-122 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-coherence/src/search.rs:35\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-temporal-coherence/src/search.rs:62\u0060 calls \u0060factor\u0060 and \u0060crates/ruvector-temporal-coherence/src/search.rs:34\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-coherence/src/search.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca8697c926e6703536d661a033842ac029aaaf83075578bab15e8d64449eafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-temporal-tensor/src/ffi.rs:161-169 | crates/ruvector-temporal-tensor/src/ffi.rs:185-193 | crates/ruvector-temporal-tensor/src/ffi.rs:217-225 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/ffi.rs:161\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/ffi.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3d83efd232f45cee54ffe92d25bccfcba3b53eebf47a67e37a166303725f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-temporal-tensor/src/persistence.rs:105-113 | crates/ruvector-temporal-tensor/src/persistence.rs:146-154 | crates/ruvector-temporal-tensor/src/persistence.rs:161-169 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-temporal-tensor/src/persistence.rs:105\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/persistence.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4e7f97ceaacadde3c7875443fdb6ef7553db32489a1d6c68786faee94e5359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvix/crates/cli/src/commands/dtb.rs:618-626 | crates/ruvix/crates/cli/src/commands/dtb.rs:739-747 | crates/ruvix/crates/cli/src/commands/dtb.rs:824-832 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:618\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b3faa48f9b97f08178533df0e78c42ec577b1201697e90dc2bcfef065630c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvllm-cli/src/commands/benchmark.rs:445-453 | crates/ruvllm-cli/src/commands/chat.rs:659-667 | crates/ruvllm-cli/src/commands/serve.rs:1054-1062 \u2014 before extracting anything, compare \u0060crates/ruvllm-cli/src/commands/benchmark.rs\u0060 and \u0060crates/ruvllm-cli/src/commands/chat.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm-cli/src/commands/benchmark.rs:445\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm-cli/src/commands/serve.rs:1063\u0060 calls \u0060contains\u0060 and \u0060crates/ruvllm-cli/src/commands/benchmark.rs:454\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/benchmark.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0fab25ae7a00a166ed91a1096764369f835bfbc0ed06dc0d073321effc205c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvllm/src/backends/recurrent_backend.rs:234-242 | crates/ruvllm/src/backends/recurrent_backend.rs:268-276 | crates/ruvllm/src/backends/recurrent_backend.rs:317-325 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/recurrent_backend.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"261dadb4450d46fdec2db6eeafe24748eb14c084aaca9e733cc1cf5e949a9fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvllm/src/bitnet/backend.rs:1383-1392 | crates/ruvllm/src/bitnet/backend.rs:1394-1402 | crates/ruvllm/src/bitnet/backend.rs:1404-1412 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:1383\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a3a2ff12848453caa905c8af4faa0801a97cab222006778e389cd2b03ccddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): crates/ruvllm/src/kv_cache.rs:614-620 | crates/ruvllm/src/lora/micro_lora.rs:399-407 | crates/ruvllm/src/lora/micro_lora.rs:544-549 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kv_cache.rs:614\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/lora/micro_lora.rs:542\u0060 calls \u0060vfmaq_f32\u0060 and \u0060crates/ruvllm/src/lora/micro_lora.rs:399\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17670eda358cfa730126694e3a734a8f0c46b795c492b9b8f81faf596c43ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rvf/rvf-cli/src/cmd/verify_attestation.rs:37-45 | crates/rvf/rvf-runtime/src/store.rs:4779-4787 | crates/rvf/rvf-wasm/src/segment.rs:35-43 \u2014 before extracting anything, compare \u0060crates/rvf/rvf-runtime/src/store.rs\u0060 and \u0060crates/rvf/rvf-wasm/src/segment.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-cli/src/cmd/verify_attestation.rs:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_attestation.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0576e6d7944608abe3eeb845d1052f76dd4281f6d6afdaa787d502a04aac81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rvf/rvf-runtime/src/store.rs:305-313 | crates/rvf/rvf-runtime/src/store.rs:394-402 | crates/rvf/rvf-runtime/src/store.rs:481-489 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ebb696ecc6b6884ee8bb8de77666f3522c1dc13208f494655c82c9248d7b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/sona/src/export/dataset.rs:31-39 | crates/sona/src/export/dataset.rs:87-95 | crates/sona/src/export/dataset.rs:163-171 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/export/dataset.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2cb0e214537489ee81e4fde69458801aabc098f84412674341f70a655353d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1951-1959 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:2006-2014 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:2061-2069 \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 \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1951\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"9333aecfc165dbbcf9dcfb8a2f61b332078d47f387a19b875a2650f845623637"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-brain-server/src/bin/ruvbrain_sse.rs:314-322 | crates/mcp-brain-server/src/main.rs:6-14 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/ruvbrain_sse.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f853e9cab746f712d25eb40df5613967bebd3086cb63ced3f3b1627c5aba2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-brain-server/src/bin/ruvbrain_sse.rs:385-393 | crates/mcp-brain-server/src/main.rs:266-274 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/bin/ruvbrain_sse.rs:385\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/ruvbrain_sse.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"767276f7fca24de37d594bb51caa29af932f4f0735f9cb9ee779e2220aba8842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/mcp-brain-server/src/bin/ruvbrain_worker.rs:172-179 | crates/mcp-brain-server/src/routes.rs:4191-4199 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/bin/ruvbrain_worker.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":"crates/mcp-brain-server/src/bin/ruvbrain_worker.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b7b2999e77568c34615c16cb1bab2e3145861a23e2dac4cd28662e9f43ab9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/mcp-brain-server/src/gist.rs:365-373 | crates/mcp-brain-server/src/optimizer.rs:342-349 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/gist.rs:365\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1095f38dad72deef592c74967195a9941b3760cc3b076be7fc8740567e4020d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-brain-server/src/graph.rs:744-752 | crates/mcp-brain-server/src/graph.rs:856-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"30124790155da181b465b603414c760cb472529215ac9bb49855e9f1694d3c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): crates/mcp-brain-server/src/graph.rs:1075-1091 | crates/mcp-brain-server/src/graph/rebuild.rs:162-172 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/graph.rs:1075\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec64ac7f447c44b8bd1db905ecf2686977e1b54643efdbfd61eb76fad2b3990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/prime-radiant/src/gpu/dispatch.rs:158-166 | crates/prime-radiant/src/gpu/dispatch.rs:313-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/gpu/dispatch.rs:313\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/dispatch.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5667335eba4606a35b8e45a21e8c214f8f54b74a2699e85e1fc8c4c97b2900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/prime-radiant/src/tiles/fabric.rs:171-179 | crates/prime-radiant/src/tiles/fabric.rs:190-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/tiles/fabric.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"465b227ada82e666bad5dc880765b9a9e6daad100335b7e6898ec29ac94ab205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-adaptive-ann/src/dataset.rs:89-97 | crates/ruvector-adaptive-ann/src/graph.rs:79-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 \u0060crates/ruvector-adaptive-ann/src/dataset.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-adaptive-ann/src/graph.rs:78\u0060 calls \u0060filter\u0060 and \u0060crates/ruvector-adaptive-ann/src/dataset.rs:88\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/dataset.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"497381e88b0e6c01514ccb00bde43252f73a480a2ac11c79e23883df59e75585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-attention/src/attention/flash.rs:258-266 | crates/ruvector-attention/src/attention/flash.rs:427-435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/flash.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb87a1b5bdf39fbcbfd3d77199682d827e3517d56e1b7038dab8ba4f5d4b6c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-attention/src/graph/dual_space.rs:216-224 | crates/ruvector-attention/src/moe/moe_attention.rs:152-160 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/dual_space.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2a946a7a779adbbb47d3004fd1d756556ab2581ee31adaf4bab6ec67d9aee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-attention/src/moe/expert.rs:161-169 | crates/ruvector-attention/src/sparse/linear.rs:50-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/moe/expert.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/moe/expert.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"30928e0cd3da0e537f6fb8631e58d8b7438af25f95b23d5f9dc9676e4d782421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-attention/src/training/loss.rs:249-257 | crates/ruvector-attention/src/training/loss.rs:264-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/training/loss.rs:249\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/training/loss.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3ac9c1dfe1c58001f57eae62e51ef64313c1598ef4f12bf3044df3a46d5779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-bench/src/bin/memory_benchmark.rs:97-105 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:135-143 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/profiling_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs:106\u0060 calls \u0060current_usage_mb\u0060 and \u0060crates/ruvector-bench/src/bin/profiling_benchmark.rs:144\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/memory_benchmark.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b2330b11104c3321c9355fa551cec4f23609d25c0f1e873d49bf92a9f4251b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-cli/src/cli/hooks.rs:1555-1563 | crates/ruvector-cli/src/cli/hooks.rs:1601-1609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"95102fe57ee03e9b850bb5a5cea5cb97a4b4bb5891a34c20a955c7478dda793e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-cnn/src/simd/avx2.rs:18-26 | crates/ruvector-sparse-inference/src/backend/cpu.rs:194-202 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9904dd77a0205600d9bdfed44fbb12fa27e251b2f90a8661b3730dacc24d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-cnn/src/simd/winograd.rs:146-157 | crates/ruvector-cnn/src/simd/winograd.rs:188-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/winograd.rs:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/winograd.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6532982a6c7aade9ea7b7e3699d8b7dc37543c559d80d39d203c72e22a4e4b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-coherence/src/spectral.rs:86-94 | crates/ruvector-solver/src/simd.rs:316-325 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-coherence/src/spectral.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence/src/spectral.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa7f2072cff8273187e571d3ca1b8e09ab25b0b579c19bf6734417b57d06e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-consciousness/src/bounds.rs:257-265 | crates/ruvector-consciousness/src/sparse_accel.rs:131-139 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/bounds.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ff4bed7aebb35604aae6df5cd264612aac58e5d6497d9915a2d1befcbce0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-consciousness/src/rsvd_emergence.rs:189-196 | crates/ruvector-consciousness/src/rsvd_emergence.rs:221-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/rsvd_emergence.rs:189\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/rsvd_emergence.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eba40fb339a91d39078881137f8d972311eed4af469d43b40dc7c55ea4745d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-context/src/index.rs:294-302 | crates/ruvector-context/src/index.rs:354-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-context/src/index.rs:294\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-context/src/index.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc22aeb513a76d94ccce1bb13975bccd5894d2fcf7e3f755f2f4c62992d9b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-core/src/quantization.rs:389-397 | crates/ruvector-postgres/src/quantization/binary.rs:11-19 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/quantization.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88e791ad2323f6c9cc3f659da05a80476b5c014c694eaaa49bc225815cf2825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:379-386 | crates/ruvector-postgres/src/distance/simd.rs:177-185 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:379\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea601acd1aeec9e0f14f864fa07900636e98679a82c58c4f00c5e888bf06b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:531-541 | crates/ruvllm/src/kernels/attention.rs:1274-1282 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvllm/src/kernels/attention.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"390817c4f664da9ebb47bfb1d90e89da6c636529e099610d17fe6a957b097004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:1375-1383 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:231-239 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:1375\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"221a46e396365d422e144b49b31081adac0ef4dbdc378efdbbceb1d9ca4576e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-dag/src/attention/causal_cone.rs:44-54 | crates/ruvector-dag/src/attention/critical_path.rs:97-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-dag/src/attention/causal_cone.rs:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-dag/src/attention/critical_path.rs:96\u0060 calls \u0060compute_critical_path\u0060 and \u0060crates/ruvector-dag/src/attention/causal_cone.rs:42\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/attention/causal_cone.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"75deae920abdb91600d8e66992f53f6169cb93779a97d0cc0338fdb7aefbdb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-delta-core/src/encoding.rs:376-384 | crates/rvf/rvf-runtime/src/qr_seed.rs:599-607 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-core/src/encoding.rs:376\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/encoding.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bdcba4a3ab39b95904bbfbca5a1725e080a20d4275d0acc670e2727834566c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-diverse-beam/src/search.rs:132-141 | crates/ruvector-diverse-beam/src/search.rs:306-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diverse-beam/src/search.rs:132\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/search.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5f89d14c492aee73bc01fd4b490151eaca932b68179c770d30edee000d97bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-edge-quant/src/query.rs:146-154 | crates/ruvector-edge-quant/src/shard.rs:304-312 \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":"crates/ruvector-edge-quant/src/query.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb56b0ab8f832affb56f6be60e590536f55a9c9cc045ee4cb8dee4210d9a5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-fpga-transformer/src/backend/fpga_pcie.rs:579-587 | crates/ruvector-fpga-transformer/src/backend/native_sim.rs:411-419 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/backend/fpga_pcie.rs:579\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-fpga-transformer/src/backend/fpga_pcie.rs:576\u0060 calls \u0060load\u0060 and \u0060crates/ruvector-fpga-transformer/src/backend/native_sim.rs:408\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/fpga_pcie.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04afbfc610ec79649c332a1a3d5f0464f963b0d516842c22e5dbb3759c07563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-gnn-node/src/lib.rs:226-234 | crates/ruvector-gnn-node/src/lib.rs:263-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-gnn-node/src/lib.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn-node/src/lib.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"012d522ab68be7b428f838b2eb2f94f4092306b93ee91b3db93588ca369f6dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-gnn/src/training.rs:286-294 | crates/ruvector-gnn/src/training.rs:333-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-gnn/src/training.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/training.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3b86217748370f805069678a7be8efbd7bf0111b44c1b93e8fbeec3d399b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-graph-condense/src/cutloss.rs:59-67 | crates/ruvector-graph-condense/src/gnn_eval.rs:40-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-condense/src/cutloss.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/cutloss.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"049d86f2ec30e9bdd2154ef67ef0e442423ce83e3642dccab483f56e09480fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:71-88 | crates/ruvector-py/src/graph/cypher_eval.rs:57-74 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3b8727ea22568430e55a40a44ce19bd7e4612b340b58d63ef547e35cbdc2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:61-69 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:71-79 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6fe5d60fcd48c79363fb21799257a5bb6d173077a99dc70831140355e2b319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-graph/src/cypher/semantic.rs:247-255 | crates/ruvector-graph/src/cypher/semantic.rs:297-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/semantic.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"81763f23fd160ef8000185a26f30571568793d8559146960637eec96649b44b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs:263-271 | crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs:283-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs:263\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw-wasm/src/lib.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a3e164ea80fe707dee329f4487cfca3a615bf1e4f4ea860e3f48b494712631"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-hyperbolic-hnsw/src/poincare.rs:151-159 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:328-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hyperbolic-hnsw/src/poincare.rs:151\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hyperbolic-hnsw/src/poincare.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6171e0d0f4498cf5699dc3d428fef76453599b2f5cf83726c9196114a2cee34b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-learning-wasm/src/lora.rs:105-113 | crates/ruvector-learning-wasm/src/lora.rs:130-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-learning-wasm/src/lora.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-learning-wasm/src/lora.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7aecb545f9a39c28dd9d23b46ee1b1bd4178ca3ff2540c8d9b7fd0072065ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-learning-wasm/src/lora.rs:165-173 | crates/ruvector-learning-wasm/src/lora.rs:208-216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-learning-wasm/src/lora.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-learning-wasm/src/lora.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7813e47bbe276732b2c631899eafe70eb97786c6b75f001c736d8173314e219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-math/src/optimal_transport/sinkhorn.rs:260-268 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:271-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/sinkhorn.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6219946525218918f6ea8c502a0a4cf9d088201f894e215ef8377e69dd010517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-math/src/product_manifold/manifold.rs:279-287 | crates/ruvector-math/src/product_manifold/manifold.rs:388-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/product_manifold/manifold.rs:279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2184233403469492182d4c39f34b7555d919767f3733d75e702e0f140f06c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-math/src/tensor_networks/cp_decomposition.rs:259-267 | crates/ruvector-math/src/tensor_networks/tucker.rs:125-133 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/tensor_networks/cp_decomposition.rs:259\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/cp_decomposition.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"117f2ddb77e386901d3ed385d2a852628c9ff4975cec2016533fccef86de10af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/attention/window.rs:318-326 | crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:264-272 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut-gated-transformer/src/attention/window.rs\u0060 and \u0060crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/attention/window.rs:318\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/window.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b7349ba701e4edf1cd34c3f97bd655d0f42cb7b0cc7ecf1fc9df48e47c0405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:251-266 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:412-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 \u0060crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:251\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, \u0060crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:431\u0060 calls \u0060all\u0060 and \u0060crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:274\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7f15dbab1b2f027967983a4df2852b413923d345d66d0be77239902d2543e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/ruvector-mincut-wasm/src/lib.rs:119-127 | crates/ruvector-mincut-wasm/src/lib.rs:317-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-wasm/src/lib.rs:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-wasm/src/lib.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"17973715bf30167bda381a1f212f1412e6e2ad41f2c4c710e998437949c149e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-mincut/src/algorithm/approximate.rs:273-281 | crates/ruvector-mincut/src/algorithm/approximate.rs:411-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/algorithm/approximate.rs:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/approximate.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f1d2d4fdb9d181e4eee1ae733d2acb3c6adfa79eacff9bb791ddd3d62da78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:444-452 | crates/ruvector-profiler/src/config_hash.rs:40-47 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-profiler/src/config_hash.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.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":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3ba1e208b25fb91cbc909635accaa74cd54ebe4dfeb9c83b93f2d8c974c508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:470-478 | crates/rvf/rvf-types/src/sha256.rs:156-164 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/rvf/rvf-types/src/sha256.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:470\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea4cddcb6608d22ab392a05e259518402413d524a1ec7242cf0b3815441b4cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-mincut/src/expander/mod.rs:316-324 | crates/ruvector-mincut/src/expander/mod.rs:500-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/expander/mod.rs:316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e83eb96674066abce29a015156c7c039911881791530d62c7030b256309ae56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-mincut/src/instance/bounded.rs:125-133 | crates/ruvector-mincut/src/instance/bounded.rs:142-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/instance/bounded.rs:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/instance/bounded.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a50a17e791fe365eb969f6af70ebf5fb3cb791c45a5b3ec515b688d15609246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-mincut/src/subpolynomial/mod.rs:689-697 | crates/ruvector-mincut/src/subpolynomial/mod.rs:730-738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/subpolynomial/mod.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"898eab290cbfecc0ebf6da4a51f7dc3ad67a800803a89244efb0859ed30ab654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/ruvector-postgres/src/distance/scalar.rs:39-47 | crates/rvf/rvf-index/src/distance.rs:31-37 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/scalar.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/scalar.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/scalar.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"24143b7403f327b36e77525473d19ed25bca3f830f2eda43ab59f439c2e30efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:521-529 | crates/ruvector-postgres/src/distance/simd.rs:580-587 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:521\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"610c54e5f0cdbf91906e63d6d659bd1a9c92aea19902314fe37f2c652e38a56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/graph/mod.rs:90-99 | crates/ruvector-postgres/src/graph/mod.rs:128-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/mod.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdf8a943885ac69aa3fa6430397b403cfc4a37d0aee12b7468e246e53466b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:312-320 | crates/rvlite/src/sparql/executor.rs:231-239 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8d57a3f22fb2a9726dff44514810a97ec790973e0a9c8dd6476b6f69f367ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1161-1172 | crates/rvlite/src/sparql/executor.rs:590-601 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88f1f2e2871f1938c57bd933c7ef9d6ceedd6bcc341de581b4807962625ccb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2281-2289 | crates/ruvector-postgres/src/graph/sparql/parser.rs:2304-2311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs:2281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7608a4495842672749b7c3350a7b02efc095846229eac92254ec65199f9cd00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw.rs:346-354 | crates/ruvector-postgres/src/index/hnsw_am.rs:1235-1242 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw.rs:346\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd598863ddddc6143206d6b60928de1f51beb86ae638215a46a38ead2fc30d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw_am.rs:507-515 | crates/ruvector-postgres/src/index/hnsw_am.rs:528-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0aef1b7a58c6b7856d5daa2337c2888f5c209cd55c7832dc2e5eeb9139850c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-postgres/src/index/ivfflat.rs:158-166 | crates/ruvector-postgres/src/index/ivfflat_am.rs:602-610 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/ivfflat.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b500adebe03fbf33de206eba3fd517634307921ff467c5a050a88b486f05c68a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-postgres/src/index/ivfflat_am.rs:737-745 | crates/ruvector-postgres/src/index/ivfflat_am.rs:791-799 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs:737\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs:747\u0060 calls \u0060BufferGetBlockNumber\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs:801\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"af39b3f360c857bfab8e0dfc67a7d3a05ec56ddabb742be6b057e51b0c08540f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-postgres/src/index/ivfflat_storage.rs:41-51 | crates/ruvector-postgres/src/index/ivfflat_storage.rs:153-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_storage.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee2918cda658511038713616d8e11af9992aeed29896eb8704c6c8bc71c7fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-postgres/src/types/halfvec.rs:379-387 | crates/ruvector-postgres/src/types/halfvec.rs:517-525 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.rs:379\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90ce0e5ede57708b425bc064bf12121bca995dd9afff4affb9a28c5ff11ec7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-query-cache/src/exact_cache.rs:95-103 | crates/ruvector-query-cache/src/semantic_cache.rs:110-118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-query-cache/src/exact_cache.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-query-cache/src/exact_cache.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52416da4c1c126132083214d5c1534e28f297f077a25e614e9fd478de16fa17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-retrieval-receipt/src/bin/benchmark.rs:252-260 | crates/ruvector-retrieval-receipt/src/bin/benchmark.rs:341-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-retrieval-receipt/src/bin/benchmark.rs:252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8485197d25a122bd88cb0d115dcedbdb40ae5d915d47fe2e1a3c787de2e4f565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-solver/src/true_solver.rs:184-192 | crates/ruvector-solver/src/true_solver.rs:224-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 \u0060crates/ruvector-solver/src/true_solver.rs:184\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/true_solver.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eb743027c0f1614ab73d80bfa15ac32d08d7a94bfb0a938a41498047f44193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvector-sparse-inference/src/backend/cpu.rs:427-435 | crates/ruvector-sparse-inference/src/backend/wasm.rs:190-197 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9cede3de2817ae6fed365956a5fef52b51b03ae20d74e32658b0289192769c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-sparse-inference/src/model/gguf.rs:108-116 | crates/ruvllm/src/gguf/quantization.rs:119-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94f9e31cc0f1b557212a57a14a51d68cef8e389f1dbf10e6ad93d00a8ae9613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-sparse-inference/src/model/gguf.rs:415-424 | crates/ruvector-sparse-inference/src/model/gguf.rs:453-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 \u0060crates/ruvector-sparse-inference/src/model/gguf.rs:415\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-sparse-inference/src/model/gguf.rs:450\u0060 calls \u0060from_bits\u0060, \u0060to_f32\u0060, \u0060from_le_bytes\u0060 and \u0060crates/ruvector-sparse-inference/src/model/gguf.rs:414\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9802f65b7ef26188e60d9ee04e19e26a6c95f4be36c9d1b0c22a0e362d6db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-turbovec/src/index.rs:232-240 | crates/ruvector-turbovec/src/index.rs:268-276 \u2014 both copies are in the same file, so extract the block 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":"crates/ruvector-turbovec/src/index.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47552350d4c454903f7e307d0b3bfc8d69f699b53e716075422140d97b18061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvix/crates/nucleus/src/checkpoint.rs:324-332 | crates/ruvix/crates/nucleus/src/checkpoint.rs:335-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/checkpoint.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06d713938b10e4c65abe6b2d24516d4eb26bae17635c842c949428d97f93cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvllm-wasm/src/sona_instant.rs:680-688 | crates/rvf/rvf-wasm/src/store.rs:302-309 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/sona_instant.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3f90090b098fe340b761aa42caca7807eb617e0d6e3027c284a40683a34d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/ruvllm/src/backends/gemma2.rs:401-409 | crates/ruvllm/src/models/ruvltra_medium.rs:581-587 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra_medium.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:401\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7a8fb52eaef908fdc10d54248fdbd8bac77fa6c61e214e07ff25c391c30dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:1211-1219 | crates/ruvllm/src/kernels/attention.rs:1347-1354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.rs:1211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58f2ac300c3f6c0db616329400cc7ce8834ec585db6b444f32a69707423b193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:825-828 | crates/ruvllm/src/kernels/attention.rs:1231-1239 | crates/ruvllm/src/kernels/attention.rs:1260-1267 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvllm/src/kernels/attention.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:829\u0060 calls \u0060vfmaq_f32\u0060 and \u0060crates/ruvllm/src/kernels/attention.rs:1269\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeafc14e45c2972cf0e56babe8cd8bc7d9c31863cf0677c2e57f101b5874186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/kernels/quantized.rs:728-740 | crates/ruvllm/src/kernels/quantized.rs:870-878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/quantized.rs:728\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/quantized.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ccfed5cd1cd1e47a16b8b2bccbe6df6e5aaab831793273e6298659a88de1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/metal/operations.rs:571-579 | crates/ruvllm/src/metal/operations.rs:681-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/operations.rs:571\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/operations.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfc59934b5567d07ec9b52f2283c338c7939dd0817c41ff708bcc6df96a13be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/models/openmythos/act_kernel.rs:264-272 | crates/ruvllm/src/models/openmythos/act_kernel.rs:293-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/act_kernel.rs:264\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/act_kernel.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7039bdc2c06c91c21ec4da0f716b85b1ebbb15294b2ff955131fb57afadde85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/ruvllm/src/models/openmythos/act_kernel.rs:388-396 | crates/ruvllm/src/models/openmythos/act_kernel.rs:416-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/act_kernel.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":"crates/ruvllm/src/models/openmythos/act_kernel.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ddf147eeeeb8c33437becd2e20d27981e0e89b9f898044f471390c48d220c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/models/openmythos/mod.rs:515-523 | crates/ruvllm/src/models/rdt.rs:890-898 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/openmythos/mod.rs\u0060 and \u0060crates/ruvllm/src/models/rdt.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/mod.rs:515\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"af62fe36d7e0c53666970975906c7939cefc821da036444200686764386fd509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/quality/coherence.rs:705-713 | crates/ruvllm/src/quality/scoring_engine.rs:775-783 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/quality/coherence.rs\u0060 and \u0060crates/ruvllm/src/quality/scoring_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"031711f85717b2c4022c38dba9d13081bffabdc3b0a58a4489e9ca1d2cb4b108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/quality/metrics.rs:187-195 | crates/ruvllm/src/quality/metrics.rs:385-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/metrics.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5f792eb4c09d88f83970f43319374e01cf90e1e6a90147e002481f75da5bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/speculative.rs:482-491 | crates/ruvllm/src/speculative.rs:755-763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/speculative.rs:482\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060\u0026GenerateParams\u0060 in one and \u0060GenerateParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/speculative.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d5cfe2e2dd3c2e51b1970e8f520d85cc38af2541f340bd3c5ac47ee3bf0725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/training/contrastive.rs:191-199 | crates/ruvllm/src/training/real_trainer.rs:200-208 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/training/contrastive.rs\u0060 and \u0060crates/ruvllm/src/training/real_trainer.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/training/contrastive.rs:191\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"822b3cae2110d996a029c428ca010d401334be5d8c6caffef675c3fe95c379f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvllm/src/witness_log.rs:380-388 | crates/ruvllm/src/witness_log.rs:807-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/witness_log.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f379a052e492f95320669287d13e6d73269bc41696c29f20d3524baff6e179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvAgent/rvagent-a2a/src/server/json_rpc.rs:389-397 | crates/rvAgent/rvagent-a2a/src/server/json_rpc.rs:482-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-a2a/src/server/json_rpc.rs:389\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/server/json_rpc.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fa1aa297a78a5a3ed0d9f052ef8227241d47fa2d778722cb726092d3880515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/rvAgent/rvagent-cli/src/app.rs:272-280 | crates/rvAgent/rvagent-cli/src/app.rs:314-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":"crates/rvAgent/rvagent-cli/src/app.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0e76ff7c73b46d3c8e35fb7028b517e6858c3dbf4ad9a135af64761b7b216d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvf/rvf-adapters/sona/src/pattern.rs:98-106 | crates/rvf/rvf-adapters/sona/src/trajectory.rs:91-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-adapters/sona/src/pattern.rs:98\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/sona/src/pattern.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6b959c52587f7c976094661ab8589edfa29284d55607871efd62b60557d833"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvf/rvf-node/src/lib.rs:726-734 | crates/rvf/rvf-node/src/lib.rs:1058-1066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/src/lib.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d03ca1670b029361c50eee1fbfc39d71cd0d868d55a4d53f82d561d0b5218b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvf/rvf-runtime/src/ffi.rs:196-204 | crates/rvf/rvf-runtime/src/ffi.rs:249-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/ffi.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a747c6950a3b8e0ef3e83ee3d81fd3560054418ad34f96b9a12250dd91725aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:751-759 | crates/rvf/rvf-runtime/src/store.rs:763-771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:751\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"c673d013a6a86e05cf2da374c5ca039543244ff6f13feeac5be474376a330227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvm/crates/rvm-checkpoint/src/note.rs:109-117 | crates/rvm/crates/rvm-checkpoint/src/note.rs:182-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-checkpoint/src/note.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb4948db818e9834c17e0ffc8ade427e74b01ebb93646a164480cdc924bd471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): edge/gateway/src/blob_r2.rs:117-125 | edge/gateway/src/blob_r2.rs:147-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/blob_r2.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f709d69a59750f2b40e67001c13ad225ab35dfc1818d46569da085d6a80a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:419-448 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:437-466 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1b031733f6b8fcc574f987b03b4425827d0852863e30db20f27a8e2c732d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:299-309 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:334-344 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8a01ef5254fee64b8b8b1edb811af3757043a15b00c35d05fc4731c157029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:568-576 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:686-694 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ec0243d46cb4b0f5104c0b01dfbb0848a0edcc25eff2642e5a87d606e3af7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:986-994 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1181-1189 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bd5f89944a9767801aaa8b3f7d1b4c7b2f62a24fa6f7506a0a1f21ef4c6096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/custom_op.rs:201-209 | patches/candle-core-0.9.2/src/custom_op.rs:201-209 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/custom_op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/custom_op.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5485e21029b5d72eace90ff43187bcf630274c2bc153d9d01a4a170201e4fefa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 4): patches/candle-core-0.8.4/src/display.rs:262-270 | patches/candle-core-0.8.4/src/display.rs:272-275 | patches/candle-core-0.9.2/src/display.rs:273-281 | patches/candle-core-0.9.2/src/display.rs:283-286 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/display.rs:262\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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, \u0060patches/candle-core-0.8.4/src/display.rs:262\u0060 calls \u0060Err\u0060 and \u0060patches/candle-core-0.8.4/src/display.rs:272\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":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fc2923702757861a639cfbab77a2c373dea343e480de962acdc1dad40a1f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1295-1303 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1406-1414 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1295\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"572e19dd820c24d296a1bf6b142cf873e8c088f6d210a462dac060d4e6e7403a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:574-582 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:606-614 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c603bdd6908580c9172201858f2a384d910e0bfe730cd8c7496c7d0a50b157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:605-613 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:637-645 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:605\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dffad55dd4193bcc5dd28f57a6805eb5c2f6cd290db41f5f9184bd276c1a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/metal.rs:43-51 | patches/candle-core-0.9.2/src/quantized/metal.rs:41-49 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/metal.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e84d583b856c7b3f4ac274b36ccc7fde4f1aad45010839da84136ea1c484c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:394-402 | patches/candle-core-0.9.2/src/safetensors.rs:549-557 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b91a14a165c4b7c196c6d712441814dca1fb497c6c7094dcc8929d9d04b5ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/sort.rs:235-243 | patches/candle-core-0.9.2/src/sort.rs:281-289 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/sort.rs\u0060 and \u0060patches/candle-core-0.9.2/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7cd41eee0f886e8b0391ae37fc0176d6c335d06001daf7c133057ff3197e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:355-363 | patches/candle-core-0.9.2/src/tensor.rs:414-422 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb95a141bd4a7c9313b43a425698fb5959f5544aeca050c6a0837498d12d59e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2131-2139 | patches/candle-core-0.9.2/src/tensor.rs:2454-2462 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"69763daf6c1b901a80c31be438e79c6c55bb01439ec225c6ff98530b06ebb133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:349-357 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:362-370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c9a9534e8490a0f1c996eebecac5cdcb64b28d934c5b6fd0a6f233948790d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/k_quants.rs:628-636 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:717-725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:628\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"608db7efcaf365b4dbc79a7c13208246d3f56be80b85eafb251912db383cd646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 21): crates/photonlayer-bench/src/privacy.rs:64-71 | crates/photonlayer-bench/src/privacy.rs:77-84 | crates/prime-radiant/src/simd/matrix.rs:316-323 | crates/ruvector-cnn/src/backbone/mobilenet.rs:366-373 | crates/ruvector-consciousness/src/rsvd_emergence.rs:123-130 | crates/ruvector-graph-condense/src/gnn_eval.rs:156-163 | crates/ruvllm-wasm/src/workers/mod.rs:318-325 | crates/ruvllm-wasm/src/workers/pool.rs:858-865 | crates/ruvllm/src/backends/gemma2.rs:527-534 | crates/ruvllm/src/backends/gemma2.rs:650-657 | crates/ruvllm/src/backends/phi3.rs:403-410 | crates/ruvllm/src/backends/phi3.rs:528-535 | crates/ruvllm/src/kernels/matmul.rs:846-853 | crates/ruvllm/src/kernels/matmul.rs:1166-1173 | crates/ruvllm/src/models/ruvltra.rs:655-662 | crates/ruvllm/src/models/ruvltra.rs:850-857 | crates/ruvllm/src/models/ruvltra_medium.rs:654-661 | crates/ruvllm/src/models/ruvltra_medium.rs:747-754 | crates/ruvllm/src/qat/lora_qat.rs:682-689 | crates/ruvllm/src/qat/lora_qat.rs:697-704 | crates/ruvllm/src/qat/lora_qat.rs:711-718 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/photonlayer-bench/src/privacy.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\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":"crates/photonlayer-bench/src/privacy.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e26de6db056f9e1ea1f94c59e1b56c3cd02dceac776b1a72ce03355b77c4787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): crates/ruvix/crates/boot/src/manifest.rs:663-670 | crates/ruvix/crates/boot/src/manifest.rs:674-681 | crates/rvf/rvf-cli/src/cmd/rebuild_refcounts.rs:47-54 | crates/rvf/rvf-cli/src/cmd/verify_attestation.rs:38-45 | crates/rvf/rvf-runtime/src/cow_map.rs:105-112 | crates/rvf/rvf-runtime/src/read_path.rs:572-579 | crates/rvf/rvf-runtime/src/read_path.rs:582-589 | crates/rvf/rvf-runtime/src/store.rs:4780-4787 | crates/rvf/rvf-runtime/src/store.rs:4790-4797 | crates/rvf/rvf-wasm/src/segment.rs:36-43 | crates/rvf/rvf-wasm/src/segment.rs:46-53 | crates/rvm/crates/rvm-proof/src/lib.rs:187-194 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/boot/src/manifest.rs\u0060 and \u0060crates/rvf/rvf-runtime/src/read_path.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/boot/src/manifest.rs:663\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/manifest.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc7b6c3d52e12027e5ad0e747610a6f4e09a9684ca836902a4642de86050cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 11): crates/photonlayer-bench/src/privacy.rs:63-69 | crates/photonlayer-bench/src/privacy.rs:76-82 | crates/ruvector-attn-mincut/src/gating.rs:13-19 | crates/ruvector-cnn/src/backbone/mobilenet.rs:364-371 | crates/ruvector-consciousness/src/rsvd_emergence.rs:122-128 | crates/ruvector-graph-condense/src/gnn_eval.rs:155-161 | crates/ruvllm-wasm/src/workers/mod.rs:316-323 | crates/ruvllm-wasm/src/workers/pool.rs:857-863 | crates/ruvllm/src/backends/gemma2.rs:525-532 | crates/ruvllm/src/backends/phi3.rs:401-408 | crates/ruvllm/src/models/ruvltra_medium.rs:745-752 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/photonlayer-bench/src/privacy.rs:63\u0060 it does not close everything it opens, so those exact 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 \u0060q\u0060 to \u0060\u0026[f32]\u0060 in one and \u0060usize\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-graph-condense/src/gnn_eval.rs:153\u0060 calls \u0060mm_bt\u0060 and \u0060crates/ruvector-consciousness/src/rsvd_emergence.rs:118\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/privacy.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15268bfb2c847f99103281ddec6fb9ce9c5a298d0a280e230d973f2d1136d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 9): crates/ruvector-cnn/src/simd/neon.rs:28-36 | crates/ruvector-core/src/simd_intrinsics.rs:662-671 | crates/ruvector-core/src/simd_intrinsics.rs:741-748 | crates/ruvector-core/src/simd_intrinsics.rs:812-819 | crates/ruvector-core/src/simd_intrinsics.rs:870-878 | crates/ruvllm/src/kernels/attention.rs:1208-1217 | crates/ruvllm/src/kernels/matmul.rs:208-217 | crates/ruvllm/src/kernels/matmul.rs:388-395 | crates/ruvllm/src/kernels/matmul.rs:1198-1205 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:673\u0060 calls \u0060vsubq_f32\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs:38\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5c4417e081921a3f0be592a856f41d68436ef72c384405b8b7908b5c8fb6a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): crates/prime-radiant/src/attention/adapter.rs:200-207 | crates/ruvector-attention/src/curvature/fused_attention.rs:326-333 | crates/ruvector-attention/src/graph/rope.rs:249-256 | crates/ruvector-attention/src/pde_attention/diffusion.rs:230-237 | crates/ruvector-attention/src/sheaf/attention.rs:478-485 | crates/ruvector-attention/src/topology/gated_attention.rs:288-295 | crates/ruvector-attention/src/transport/centroid_ot.rs:335-342 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:324-331 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/attention/adapter.rs\u0060 and \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/attention/adapter.rs:200\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe5cc6eaf09b9315c57c66f8ebf20cf6e1dc97f5699987faeb889cac8dd6785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/ruvector-graph-transformer-node/src/lib.rs:111-118 | crates/ruvector-graph-transformer-node/src/lib.rs:174-182 | crates/ruvector-graph-transformer-node/src/lib.rs:234-242 | crates/ruvector-graph-transformer-node/src/lib.rs:300-308 | crates/ruvector-graph-transformer-node/src/lib.rs:344-352 | crates/ruvector-graph-transformer-node/src/lib.rs:473-481 | crates/ruvector-graph-transformer-node/src/lib.rs:510-518 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-transformer-node/src/lib.rs:111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"00425123400185df9893a388a299b49a4984a0bc6a243bb3ee6fbf8044d3d6bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 7): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2225-2231 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2327-2333 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1373-1379 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1487-1493 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2749-2755 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1795-1802 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1978-1985 \u2014 \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 90 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2225\u0060 it begins part-way through the construct above it, so those exact 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"885fb26281d9ac24b1bbc52c7077f6ee2974bcfb34082e1c19e90ae3d1da47d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/ruvector-bench/src/bin/comparison_benchmark.rs:332-339 | crates/ruvector-bench/src/bin/latency_benchmark.rs:363-370 | crates/ruvector-bench/src/bin/memory_benchmark.rs:244-251 | crates/ruvector-bench/src/bin/memory_benchmark.rs:338-345 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:160-167 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:321-328 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"745b0330b7cd1888dd501a9d40f2d06b8e27f296b59b440dfa1f4f0419f7bde7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): patches/candle-core-0.8.4/src/quantized/k_quants.rs:998-1005 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1238-1245 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1435-1442 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1106-1113 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1440-1447 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1701-1708 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:998\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a63341ca9e6c78f78ea21e6251c04480e6f07bc28837fad7f91d805f3da3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/ruvector-cnn/src/kernels/int8_avx2.rs:124-133 | crates/ruvector-cnn/src/kernels/int8_avx2.rs:269-277 | crates/ruvector-cnn/src/kernels/int8_neon.rs:112-120 | crates/ruvector-cnn/src/kernels/int8_neon.rs:264-271 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:119-126 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6153411aad0c1d7d2558d81e10418e7dcf1af017fc6c8a8a58aa8c7351d8fbf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/ruvector-hailo-cluster/src/bin/bench.rs:218-225 | crates/ruvector-hailo-cluster/src/bin/embed.rs:219-226 | crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:196-203 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:256-263 | crates/ruvector-hailo-cluster/src/bin/stats.rs:169-176 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"363ad5c2c45669c7561705c906f6364e4102bc48ee44765200bbf76ce8d7feb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 5): crates/ruvix/crates/boot/src/attestation.rs:124-131 | crates/rvf/rvf-crypto/src/lineage.rs:34-39 | crates/rvf/rvf-types/src/agi_container.rs:441-446 | crates/rvf/rvf-types/src/lineage.rs:114-119 | crates/rvm/crates/rvm-types/src/witness.rs:380-385 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/attestation.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa49a300b08dae9c833e85d5a602103d36e16bd71d85fbe1987045b1fe7ab75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/ruvllm/src/backends/phi3.rs:322-329 | crates/ruvllm/src/kernels/attention.rs:1609-1616 | crates/ruvllm/src/kernels/attention.rs:1653-1660 | crates/ruvllm/src/models/ruvltra.rs:575-582 | crates/ruvllm/src/models/ruvltra_medium.rs:590-597 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/phi3.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/phi3.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e78165b80eea80166320dcd6c7e3c9f2f9233ab274281081582b8c251b23c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): patches/candle-core-0.8.4/src/quantized/k_quants.rs:638-645 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1775-1782 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:669-676 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:699-706 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2201-2208 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca01f1c3163216214f6c95eeae8f079af67af9cd30d6ed66e7c8f85f3582840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-cnn/src/contrastive/infonce.rs:364-373 | crates/ruvector-postgres/src/distance/scalar.rs:41-49 | crates/ruvector-recall-bounded/src/lib.rs:47-54 | crates/rvf/rvf-index/src/distance.rs:32-39 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/scalar.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060a\u0060 to \u0060\u0026[f64]\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/infonce.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2e52aeaf104eb4d8cd7ffe80a876995e3136b10a5920fe263b0c305a324b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-cnn/src/quantize/graph_rewrite.rs:143-150 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:226-233 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:413-420 | crates/ruvector-cnn/src/quantize/graph_rewrite.rs:447-454 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/quantize/graph_rewrite.rs:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fa353b08afc15ebd39e32dc8a53f3b9517e75f19cbfb1dd4ca6434a4d7c6a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-cnn/src/simd/avx2.rs:156-163 | crates/ruvector-cnn/src/simd/neon.rs:158-165 | crates/ruvector-cnn/src/simd/scalar.rs:79-86 | crates/ruvector-cnn/src/simd/wasm.rs:124-131 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4319cfdcade099a561a6f20b9911dc7313dcb901d56589989d62992144e75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-cnn/src/simd/neon.rs:46-53 | crates/ruvector-core/src/simd_intrinsics.rs:758-765 | crates/ruvllm/src/kernels/attention.rs:1787-1794 | crates/ruvllm/src/kernels/matmul.rs:1231-1238 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.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":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aa82eb221e707b47b81ebf616d46557295afb48ea1609d687a84903a21d83b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-core/src/advanced_features/matryoshka.rs:243-250 | crates/ruvector-core/src/advanced_features/matryoshka.rs:310-317 | crates/ruvector-core/src/advanced_features/matryoshka.rs:405-412 | crates/ruvector-core/src/advanced_features/multi_vector.rs:194-202 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/advanced_features/matryoshka.rs\u0060 and \u0060crates/ruvector-core/src/advanced_features/multi_vector.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/matryoshka.rs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/matryoshka.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed255cb9d65794acd52f1261981e2790e13fb6a6be2b866dfa9871441d981bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/ruvector-core/src/simd_intrinsics.rs:245-252 | crates/ruvector-core/src/simd_intrinsics.rs:309-315 | crates/ruvector-core/src/simd_intrinsics.rs:370-377 | crates/ruvector-core/src/simd_intrinsics.rs:441-447 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:254\u0060 calls \u0060_mm512_sub_ps\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:317\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"99116ec4224db4ab308031064341d9270e4ba5287b64c87f3d5fd24e7525c2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-filter/src/evaluator.rs:163-171 | crates/ruvector-filter/src/evaluator.rs:198-205 | crates/ruvector-filter/src/evaluator.rs:227-234 | crates/ruvector-filter/src/evaluator.rs:256-264 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-filter/src/evaluator.rs:163\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-filter/src/evaluator.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5185d749f8fdcb04539cbf4ada36ca1647b2a91a36b96ddfcabffd464d5ca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-mincut/src/graph/mod.rs:335-342 | crates/ruvector-mincut/src/instance/bounded.rs:182-189 | crates/ruvector-mincut/src/instance/bounded.rs:367-374 | crates/ruvector-mincut/src/instance/stub.rs:173-180 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/instance/bounded.rs\u0060 and \u0060crates/ruvector-mincut/src/instance/stub.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/graph/mod.rs:335\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/graph/mod.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"461255192c9391e801af62554de74494db4b5c201aced531b84fd45107210a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-postgres/src/attention/flash.rs:83-90 | crates/ruvector-postgres/src/attention/mod.rs:156-163 | crates/ruvector-postgres/src/attention/operators.rs:501-508 | crates/ruvector-postgres/src/attention/operators.rs:836-843 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/attention/flash.rs:83\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/flash.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2fad8f5c27aba4785d62057508daf48182fe9899d097d5af27d8a3b22d304b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-postgres/src/distance/simd.rs:990-997 | crates/ruvector-postgres/src/types/halfvec.rs:365-372 | crates/ruvector-postgres/src/types/halfvec.rs:415-422 | crates/ruvector-postgres/src/types/halfvec.rs:481-488 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:990\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-postgres/src/types/halfvec.rs:364\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvector-postgres/src/types/halfvec.rs:479\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da50321d85182b16d046b701ea66a2fab22896c6c77e919410224c6b93564b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-postgres/src/sparse/distance.rs:22-29 | crates/ruvector-postgres/src/sparse/distance.rs:85-92 | crates/ruvector-postgres/src/sparse/distance.rs:128-135 | crates/ruvector-postgres/src/sparse/distance.rs:185-192 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/sparse/distance.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec44680a2dae5f903bbc1b015221a1b9193409dbdff67b3fa9b51907799de343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/ruvector-solver-wasm/src/lib.rs:486-492 | crates/ruvector-solver/src/cg.rs:326-333 | crates/ruvector-solver/src/neumann.rs:457-463 | crates/ruvector-solver/src/true_solver.rs:314-320 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver-wasm/src/lib.rs:486\u0060 it does not close everything it opens, so those exact 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 \u0060matrix\u0060 to \u0060\u0026CsrMatrix\u003Cf64\u003E\u0060 in one and \u0060\u0026CsrMatrix\u003Cf32\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-wasm/src/lib.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e73bc287151eeb298db66ae12f9cf634da390ff8b6f1868b0f4edf69f76d8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvllm/src/lora/micro_lora.rs:339-346 | crates/ruvllm/src/lora/micro_lora.rs:435-442 | crates/ruvllm/src/lora/micro_lora.rs:444-451 | crates/ruvllm/src/lora/micro_lora.rs:453-460 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/lora/micro_lora.rs:339\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/micro_lora.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe49ce2a7acd11ccb1001c93c4ffea9e85ed74bc505281c33799c7973c2a467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvllm/src/metal/context.rs:543-550 | crates/ruvllm/src/metal/context.rs:725-732 | crates/ruvllm/src/metal/context.rs:884-891 | crates/ruvllm/src/metal/context.rs:957-964 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/metal/context.rs:542\u0060 calls \u0060create_buffer_with_data\u0060, \u0060from_ref\u0060 and \u0060crates/ruvllm/src/metal/context.rs:724\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1cc7d050b64e15ac7217d6cb495a0e1c908df12966e47fdb67ad48b1fcd0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:840-847 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:905-912 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1036-1043 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1101-1108 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:840\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"100ca5c1e6dbe77c4467002282be38e88d6f7801eb021896634c7ac6cb064629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/avx.rs:159-164 | patches/candle-core-0.8.4/src/quantized/avx.rs:181-186 | patches/candle-core-0.8.4/src/quantized/avx.rs:263-270 | patches/candle-core-0.8.4/src/quantized/avx.rs:390-395 \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. 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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd49deda93653697e37f8101c00bb9acf9d1dd0e1592b869396224c002de5124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:601-609 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:671-679 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:633-641 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:722-730 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:601\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fb7bf4481990992aa37a592e20527c3994be0c9b1a55412e0058a76d62b4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20138 lines \u00D7 6): patches/candle-core-0.8.4/src/quantized/k_quants.rs:781-781 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1255-1262 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1453-1460 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:832-832 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1457-1464 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1719-1726 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a130189e71d62a5f1b5fc4c5cea5de22ffbe7e8e4a0f80a7fe130f5bfbbb20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): patches/candle-core-0.8.4/src/tensor.rs:1649-1656 | patches/candle-core-0.8.4/src/tensor.rs:1690-1697 | patches/candle-core-0.9.2/src/tensor.rs:1973-1980 | patches/candle-core-0.9.2/src/tensor.rs:2014-2021 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1649\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, \u0060patches/candle-core-0.8.4/src/tensor.rs:1688\u0060 calls \u0060push\u0060 and \u0060patches/candle-core-0.8.4/src/tensor.rs:1647\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"a568113005df8fa8007df752db0711ab9fddd6571eb092d3ad9aa9a25f379bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/emergent-time/src/agentic_time.rs:540-547 | crates/emergent-time/src/structural_clock.rs:386-393 | crates/emergent-time/src/weight_learning.rs:97-104 \u2014 before extracting anything, compare \u0060crates/emergent-time/src/agentic_time.rs\u0060 and \u0060crates/emergent-time/src/weight_learning.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e750be55b8e51f14b6acb0d793db2bf0df249ef34065346d46c4f829b62ca98c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-attention/src/sheaf/attention.rs:251-258 | crates/ruvector-attention/src/sheaf/restriction.rs:318-325 | crates/ruvector-attention/src/sheaf/sparse.rs:283-290 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/sheaf/attention.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":"crates/ruvector-attention/src/sheaf/attention.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c26ca40a40843dfa506435e4dfbcea382cbc7b0349e325b1c5c5927a394c328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-cnn/src/kernels/int8_wasm.rs:312-319 | crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:226-233 | crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:517-524 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_wasm.rs:312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_wasm.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2044a92e2a69c6306e0d72fc225b60e68ad9b359fce91cff8fc0f09ea9138c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-cnn/src/layers/conv.rs:232-239 | crates/ruvector-cnn/src/layers/conv.rs:301-308 | crates/ruvector-cnn/src/layers/conv.rs:547-554 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/conv.rs:232\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0637d7356022a09c17d8dfda5258fc2d8dfdabe2be311d6656760d9cbc0889a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-cnn/src/simd/avx2.rs:178-185 | crates/ruvector-cnn/src/simd/neon.rs:193-200 | crates/ruvector-cnn/src/simd/wasm.rs:161-168 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7501a44ce8a2ad803b25558f6ae40f588aba074f798d1de4121aa6ff884a68b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-cnn/src/simd/avx2.rs:322-330 | crates/ruvector-cnn/src/simd/avx2.rs:474-481 | crates/ruvector-cnn/src/simd/avx2.rs:600-607 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:322\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5da0fdb1f4d8fd4404e96d650f83103f8f6b8e6992a595bc7dc738c509a83c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-consciousness/src/phi.rs:444-451 | crates/ruvector-consciousness/src/rsvd_emergence.rs:188-195 | crates/ruvector-consciousness/src/rsvd_emergence.rs:220-227 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"534386e2bef0453a000fed216f01fc721c8a6dd040c1b011933aa1677f757359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 4): crates/ruvector-delta-core/src/encoding.rs:118-125 | crates/ruvector-delta-core/src/encoding.rs:219-226 | crates/ruvector-delta-core/src/encoding.rs:362-369 | crates/rvf/rvf-server/src/tcp.rs:207-210 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-server/src/tcp.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. 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 before the matched lines, \u0060crates/ruvector-delta-core/src/encoding.rs:216\u0060 calls \u0060from_le_bytes\u0060 and \u0060crates/ruvector-delta-core/src/encoding.rs:114\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/encoding.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb3573cc26f901f0f4f172b660c52cd970e22911dd2e1a7b0fa138afbf67c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-entropy-ann/src/search.rs:97-106 | crates/ruvector-entropy-ann/src/search.rs:231-238 | crates/ruvector-entropy-ann/src/search.rs:409-416 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-entropy-ann/src/search.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":"crates/ruvector-entropy-ann/src/search.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"efea38481830d18813994bc49e8e2e4a3fee29be38d55262f05c67e74985529e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:220-227 | crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:315-322 | crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:355-362 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"07458cdbdca50191d472c077a480dd44d40271421c69bce6345fd286c22787f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:497-504 | crates/ruvector-fpga-transformer/src/backend/fpga_pcie.rs:577-584 | crates/ruvector-fpga-transformer/src/backend/native_sim.rs:409-416 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:497\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-fpga-transformer/src/backend/fpga_pcie.rs:576\u0060 calls \u0060load\u0060 and \u0060crates/ruvector-fpga-transformer/src/backend/native_sim.rs:408\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e28feec9c5f2bacf156db206456de73e6c8698a84b3fa7d372ba53f8df3febe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-graph-wasm/src/lib.rs:69-76 | crates/ruvector-wasm/src/lib.rs:218-225 | crates/ruvector-wasm/src/lib.rs:548-555 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-wasm/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9d62bfd52d8d7d66219636b50508fa77a6b7037f583b7f8dc96b9c75a20deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/bench.rs:442-449 | crates/ruvector-hailo-cluster/src/bin/embed.rs:451-458 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:246-253 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:442\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"201a319aaff86c172eb07f284963bd0c1fbf0af77d6262b03b5fff4810f55664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:397-404 | crates/ruvector-postgres/src/graph/sparql/parser.rs:2089-2096 | crates/rvlite/src/sparql/parser.rs:2128-2135 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc89af1543ad844812eb63e5cc71a08411be55bc1d357cd7c701616040625dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:77-84 | crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:92-99 | crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:107-114 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:77\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b75495f663e07be0d8403aa08021a237851a4bc7d5213337153eb85695fe3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-postgres/src/distance/simd.rs:1269-1277 | crates/ruvector-postgres/src/distance/simd.rs:1340-1348 | crates/ruvector-postgres/src/distance/simd.rs:1442-1449 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec78ff6627360cdbb708976bda2027fedcc6f97d1c0128ac8becb3715527e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-postgres/src/types/halfvec.rs:372-379 | crates/ruvector-postgres/src/types/halfvec.rs:436-443 | crates/ruvector-postgres/src/types/halfvec.rs:488-495 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.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":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c2d012b79b8fd8e3a436312724b8891bb9a6b7798ec527e1ce06945b4025b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/ruvector-rabitq/src/scan.rs:179-186 | crates/ruvector-rabitq/src/scan.rs:212-218 | crates/ruvector-rabitq/src/scan.rs:247-253 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rabitq/src/scan.rs:179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/scan.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceea954938d60ed97d094234cca42246887ef2f25a1c8bedd24a4586ef95fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-turboquant/src/codec.rs:88-95 | crates/ruvector-turboquant/src/codec.rs:104-111 | crates/ruvector-turboquant/src/codec.rs:138-145 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/codec.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3903a300556df3be6e3a39ca873247438199ef55e2caf3facc0db76e80cf35d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvllm/src/backends/gemma2.rs:865-873 | crates/ruvllm/src/backends/phi3.rs:735-743 | crates/ruvllm/src/models/ruvltra.rs:1045-1053 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:865\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026Gemma2Config\u0060 in one and \u0060\u0026Phi3Config\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/backends/gemma2.rs:864\u0060 calls \u0060sqrt\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs:732\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"e812a7d0ffdea6e25b683795ca95651bc5c001196f0770d68070ae12b75f4963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvllm/src/backends/mod.rs:690-697 | crates/ruvllm/src/backends/mod.rs:713-720 | crates/ruvllm/src/backends/mod.rs:739-746 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mod.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"129a5377b859aacc6e9e99199cff9c3d6c258daa594c9fd3114661893084623d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvllm/src/kernels/attention.rs:1239-1246 | crates/ruvllm/src/kernels/matmul.rs:668-675 | crates/ruvllm/src/kernels/matmul.rs:700-707 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/kernels/attention.rs\u0060 and \u0060crates/ruvllm/src/kernels/matmul.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.rs:1239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01db1a0c840c5550cda9107efa23b104fba7315c38f42ae495219553def2ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvllm/src/metal/context.rs:612-619 | crates/ruvllm/src/metal/context.rs:677-684 | crates/ruvllm/src/metal/context.rs:794-801 \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, \u0060crates/ruvllm/src/metal/context.rs:793\u0060 calls \u0060create_buffer\u0060 and \u0060crates/ruvllm/src/metal/context.rs:611\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df7142f9dce63f2a82a583199f6d20ccc15eeb3e38b34ad292b7092d0511bf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 3): crates/ruvllm/src/policy_store.rs:189-196 | crates/ruvllm/src/session_index.rs:138-142 | crates/ruvllm/src/witness_log.rs:351-358 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/policy_store.rs\u0060 and \u0060crates/ruvllm/src/witness_log.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/policy_store.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/policy_store.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6289345aa344428518a93afc6d9e33cbd70f126b6249823e320ff50a2e8da9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20138 lines \u00D7 4): crates/ruvllm-wasm/src/pi_quant_wasm.rs:466-468 | crates/ruvllm/src/quantize/pi_quant_simd.rs:498-505 | crates/ruvllm/src/quantize/pi_quant_simd.rs:515-522 | crates/ruvllm/src/quantize/pi_quant_simd.rs:771-778 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/pi_quant_wasm.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfcbb5dddda71722cacb41184c9795ce0c51c258ec2e2a5401bf82c25d897ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rvf/rvf-index/src/distance.rs:70-77 | crates/rvf/rvf-index/src/distance.rs:113-120 | crates/rvf/rvf-index/src/distance.rs:167-174 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/distance.rs:70\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-index/src/distance.rs:111\u0060 calls \u0060_mm256_setzero_ps\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs:68\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/distance.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0d6792518c3d01fd74f989c73f98fb133ba85bddf922be500844d27cb4a91a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rvf/rvf-index/src/distance.rs:208-215 | crates/rvf/rvf-index/src/distance.rs:241-248 | crates/rvf/rvf-index/src/distance.rs:282-289 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/distance.rs:208\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-index/src/distance.rs:239\u0060 calls \u0060vdupq_n_f32\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs:206\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/distance.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0c11aa2d63e62fc0f1efd2ff47c93c10d18eb7a4f74c275d9804621bdcf4fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1362-1368 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:883-890 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:929-936 \u2014 \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 59 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1362\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"4690ccf51508d2a6f9fcafe6d26b84a7c962467ec1c5368b3559f89487fb62c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1524-1531 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1551-1558 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1702-1709 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1524\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"983e028815b5d933c6d2b8ce9aef10442df4dc5fb164452f41239c161019a82e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/avx.rs:358-365 | patches/candle-core-0.8.4/src/quantized/avx.rs:366-373 | patches/candle-core-0.8.4/src/quantized/avx.rs:374-381 \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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b855fbc6b01d454845f33c8334fc2c1a0d2ce761e1517e9a952ec9671ae60a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1033-1040 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1141-1148 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1244-1251 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1033\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14a55f6a90fead93fa325840cd78df1585a71259b797c35c7af88423e79de13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): patches/candle-core-0.8.4/src/tensor.rs:1385-1392 | patches/candle-core-0.8.4/src/tensor.rs:1505-1512 | patches/candle-core-0.9.2/src/tensor.rs:1829-1836 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1385\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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd39b258371a01dace0b6195523dc1e8be33e0ee7e9d7a05f820362d83269b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 4): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:556-559 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:560-567 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:612-619 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:664-671 \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 \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:560\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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a83210bd609c0cee5a198fdac37e7a9cdffa3b585de0225c18cee1d0818ea12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/emergent-time/src/agentic_time.rs:585-590 | crates/emergent-time/src/weight_learning.rs:170-177 \u2014 before extracting anything, compare \u0060crates/emergent-time/src/agentic_time.rs\u0060 and \u0060crates/emergent-time/src/weight_learning.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2f0a14b6430a2d988602dcf446a8c1eceb229d3debd4b881a5aa3483687572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/emergent-time/src/agentic_time.rs:598-607 | crates/emergent-time/src/weight_learning.rs:156-165 \u2014 before extracting anything, compare \u0060crates/emergent-time/src/agentic_time.rs\u0060 and \u0060crates/emergent-time/src/weight_learning.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"f240e30117a4dbec564ce09093c6ecdce7a5fcc34fd7611b1c6e1104c68c2134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/mcp-brain-server/src/bin/local.rs:737-743 | crates/mcp-brain-server/src/bin/local.rs:1530-1537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91eb0879ad6b0abd924fc20107c0d9d747ac9f28709c9eaf5cf3dd2018b0d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:4947-4954 | crates/mcp-brain-server/src/routes.rs:5023-5030 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":4947}}}],"partialFingerprints":{"codehealthFindingId/v1":"956f6b5d4cdc6b45c7c2ff183269c5197dfbe9872e668a8f344795f1f67ee41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/prime-radiant/src/simd/vectors.rs:93-101 | crates/prime-radiant/src/simd/vectors.rs:330-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/vectors.rs:93\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/vectors.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"97611ebb09cd91929b75a12563343b94ec9c69e59a43e68aa09cb5e2a3231b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/dag.rs:155-161 | crates/ruvector-dag/src/attention/topological.rs:43-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-unified-wasm/src/dag.rs:155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/dag.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"86efff3f1b5ae75f3e6ccaf9152751ea5990ed439edad0a3201d7ddf0adff882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/lib.rs:273-280 | crates/ruvector-gnn-wasm/src/lib.rs:358-365 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-unified-wasm/src/lib.rs:273\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/lib.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2169cbcb9b7a760ccbe5d9e52384fff716d71d11b5106e340c7c7189e7be660c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-attention-wasm/src/utils.rs:62-71 | crates/ruvector-mincut-gated-transformer/src/kv_cache/manager.rs:319-326 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/src/utils.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38e7553fda9cca483b05af3f4dc20b026d832a51ef69303e764435ec4795259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-cnn/src/contrastive/infonce.rs:364-373 | crates/ruvector-retrieval-receipt/src/index.rs:105-112 \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 \u0060a\u0060 to \u0060\u0026[f64]\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/contrastive/infonce.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dfe365cc6bf52d883e5ff26537c8489b9376b683ad91ee2d26cced4b934bb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-cnn/src/layers/quantized_residual.rs:67-74 | crates/ruvector-cnn/src/layers/quantized_residual.rs:114-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_residual.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a9ebaef24634a74604197b1488f5b9d5433670ba6e793f1cb34dc9addfa24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-cnn/src/simd/avx2.rs:13-20 | crates/ruvector-cnn/src/simd/avx2.rs:44-51 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.rs:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4811a2e52eaa1f525bbceffaa8e6f5da8a8d07fd8aa723945b8ce7da8bf109c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-cnn/src/simd/wasm.rs:58-65 | crates/ruvector-cnn/src/simd/wasm.rs:84-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/wasm.rs:58\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/wasm.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4779a799fee250e228be2ccb8fac4c4dca48853f2f3a252b26f4c3e092056996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-cnn/src/simd/wasm.rs:199-206 | crates/ruvector-cnn/src/simd/wasm.rs:291-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/wasm.rs:199\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/wasm.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc4d2456bced449ded6b5fb8bb1eace26303a64781238c770a4f238466fbc98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20138 lines \u00D7 3): crates/ruvector-acorn/src/search.rs:56-58 | crates/ruvector-coherence-hnsw/src/search.rs:206-213 | crates/ruvector-coherence-hnsw/src/search.rs:308-315 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-coherence-hnsw/src/search.rs:206\u0060 calls \u0060with_capacity\u0060 and \u0060crates/ruvector-acorn/src/search.rs:56\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/search.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b63741f0e91b2ddff0fe54c598e888252ec0e82c9c2ce862d88632cd35ac9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-coherence/src/spectral.rs:243-250 | crates/ruvector-consciousness/src/simd.rs:226-235 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-coherence/src/spectral.rs:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-consciousness/src/simd.rs:224\u0060 calls \u0060vld1q_f64\u0060, \u0060as_ptr\u0060, \u0060add\u0060 and \u0060crates/ruvector-coherence/src/spectral.rs:242\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence/src/spectral.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6029f5a4d16c315bf299b9e21cfaf6fd90a0c4c6e211fbd93260f0d2623d70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-consciousness/src/simd.rs:288-295 | crates/ruvector-solver/src/simd.rs:217-224 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/simd.rs:288\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/simd.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0329b172a6efdb90500f0650bceef82a3cdc8df61f1b1c60f96cdac312814a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-core/src/encoding/codecs.rs:122-129 | crates/rvf/rvf-wasm/src/lib.rs:449-456 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/encoding/codecs.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01c7cddb29bd7b5ae7494ff806204f685857ed1170185fdecb5e3f79f25a191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 4): crates/ruvector-decompiler/src/model_decompiler.rs:323-326 | crates/ruvector-decompiler/src/model_decompiler.rs:360-367 | crates/ruvector-decompiler/src/model_decompiler.rs:385-392 | crates/ruvector-decompiler/src/model_decompiler.rs:427-430 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-decompiler/src/model_decompiler.rs:323\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_decompiler.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"046b90b15b43a47a113a0adf725d9ba7cbcfd756c15f98d5bfad81ba06844887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-decompiler/src/parser.rs:277-284 | crates/ruvector-decompiler/src/parser.rs:288-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-decompiler/src/parser.rs:277\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/parser.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e182439782492f060a1e88f1c4ba5389602770267168d48afcbbb803622b6092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-delta-core/src/window.rs:326-333 | crates/ruvector-delta-core/src/window.rs:409-416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-core/src/window.rs:326\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060results\u0060 to \u0060\u0026[WindowResult\u003CD\u003E]\u0060 in one and \u0060\u0026[WindowResult\u003CVectorDelta\u003E]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/window.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9478f4ac07fa23f075845619e26bd56a6c5c43d212ca7d80b26736a94cf58fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-delta-graph/src/lib.rs:438-445 | crates/ruvector-delta-graph/src/lib.rs:460-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-graph/src/lib.rs:438\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-graph/src/lib.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"631ac58b803883534730874f752ee47ef8ac3ef4e1c55a266ad82a056ef9f3d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-delta-wasm/src/simd.rs:91-98 | crates/ruvector-delta-wasm/src/simd.rs:252-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-wasm/src/simd.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-wasm/src/simd.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc1c93e3855b6c662342b99b8b55545f4e01ba946ccd3dafea969a3ed582c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-edge-store/src/shard/read.rs:138-145 | edge/gateway/src/quant_query.rs:46-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/read.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f841278ba73cd153c0a40b2358a0335d6bd805a4a37bb6755db448685e8ab81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-gnn/src/search.rs:30-37 | crates/ruvector-nervous-system/src/hopfield/retrieval.rs:38-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":"crates/ruvector-gnn/src/search.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a02cff0a33b0f3dbd4c1adf09162310760ea969928ac1c55db53706702560b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-graph-node/src/lib.rs:263-270 | crates/ruvector-graph-node/src/lib.rs:277-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/lib.rs:263\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"557d23f7e377e949010a27414df7a70299e5560f8d4733b6d1332e51e576511c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/lib.rs:335-342 | crates/ruvector-graph-transformer-node/src/lib.rs:741-745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-transformer-node/src/lib.rs:335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/lib.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e131cbcf8dac7de06bf7e9349b3bfcc79e472f91600bde811ec9acdae0ad9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:55-62 | crates/ruvector-hailo-cluster/src/bin/embed.rs:76-83 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde6a474814855240a00312cd287f62d9d6560aba611af583c93974e5c3c9a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-kalshi/src/normalize.rs:188-195 | crates/ruvector-kalshi/src/normalize.rs:252-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-kalshi/src/normalize.rs:260\u0060 calls \u0060Some\u0060, \u0060event_id_from_str\u0060 and \u0060crates/ruvector-kalshi/src/normalize.rs:196\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/normalize.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"92669e0dcea40a589ee84431f45f7a46fdb37d9a00a56119b3942042403c9299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:60-67 | crates/ruvector-kge-wasm/src/model.rs:60-67 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f10c8de3f0e22a692ee1a688703cfb4a49619b1f65e97b564219641d31efd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-kge/src/optimize/campaign.rs:407-414 | crates/ruvector-typesafe-core/src/loop_gate.rs:228-235 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-kge/src/optimize/campaign.rs:407\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/optimize/campaign.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc16b00ba8751506ba400635513057089fc039f6362ba2bb3c075b093f351313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-math/src/product_manifold/manifold.rs:262-270 | crates/ruvector-math/src/product_manifold/manifold.rs:371-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/product_manifold/manifold.rs:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"183579db501e4a9695c264b61352799a1a6921862907b3bd3775356ada4aad52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-math/src/product_manifold/manifold.rs:480-488 | crates/ruvector-math/src/spherical/mod.rs:255-263 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/product_manifold/manifold.rs\u0060 and \u0060crates/ruvector-math/src/spherical/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d45ef28b967b4ade39fc8dbde38537eaed41e6abea4cd30c8c2ac210d0a6512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:157-164 | crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:187-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs:157\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer-wasm/src/lib.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2644491b55bb5703d64ef90f52b128f11f6c637875d6650e0492a832d14800c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/early_exit.rs:310-317 | crates/ruvector-mincut-gated-transformer/src/early_exit.rs:346-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/early_exit.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5425521bc170d43de166cb3b3ecbdf4736d26d5f769766a22a6ba7a0af46381c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-mincut-node/src/routing.rs:78-85 | crates/ruvector-mincut-node/src/routing.rs:252-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-node/src/routing.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/routing.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"55af1bebd7a5b383f5fa4acd5ed06dee1a3a1f7dcbe92647cca06374b2fc262c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-mincut/src/canonical/mod.rs:891-898 | crates/ruvector-mincut/src/canonical/mod.rs:931-938 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"3870f91ebe1750e64784bbf795e75fe975fb325c676d38157cec16a582fd2489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:989-996 | crates/rvf/rvf-index/src/distance.rs:78-86 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:989\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6655b623e726052fcea9bd291a914b499eda86f9462ab027668a49ab87204c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1370-1377 | crates/ruvector-postgres/src/distance/simd.rs:1461-1468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"243bbad5ff24d1037ca85c6bdb7900f887d25a57b0f9f55e1f496d47cd930f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1545-1552 | crates/rvf/rvf-index/src/distance.rs:249-256 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1545\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e82a1b97a45849308e41e257a38a80ea3dd4df2fe9ab95d333c4ed8ed73dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/graph/cypher/parser.rs:42-49 | crates/ruvector-postgres/src/graph/cypher/parser.rs:80-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/cypher/parser.rs:42\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/parser.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"190245b4d3c8386110524fafd70b042c961791df13112a26c4ae9622ad37f895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/functions.rs:298-307 | crates/ruvector-postgres/src/graph/sparql/functions.rs:310-319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/functions.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7956c4c12f5f9b2a2ef9d6ddfc181fae20d672bcf05382df972acc16e00f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:2229-2236 | crates/rvlite/src/sparql/parser.rs:2268-2275 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be15810b611cb55ac8b65785b0744d25cef2bbf01fa1f7095077b800f7aca24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw_am.rs:1749-1756 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1606-1613 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw_am.rs:1749\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"691c6c21982dbbcbdd616afe5a9f1b5dc42ce4f0b1295095880b1094982b18ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/quantization/product.rs:171-178 | crates/ruvector-postgres/src/quantization/product.rs:227-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/quantization/product.rs:171\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/product.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0010cd0df66f5618a7a035507db01b28be1bbc313b35fbf51d0d5f9c5f853225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-postgres/src/types/binaryvec.rs:313-321 | crates/ruvector-postgres/src/types/scalarvec.rs:357-365 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/binaryvec.rs:313\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d35743e62e9a3ba32cf0c920df6ac05e0e2645c9299d54c923e156c31377bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/types/halfvec.rs:495-502 | crates/ruvector-postgres/src/types/halfvec.rs:565-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.rs:495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c3047f95d0c59cc0b64d62df8b1e5086b089c28f4e325159a6206793011306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/types/halfvec.rs:510-517 | crates/ruvector-postgres/src/types/halfvec.rs:558-565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.rs:510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d741707b4ec1f214580daab2fe6957165cd987cb4f43e81c488cb15fc2eef8c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ruvector-postgres/src/types/vector.rs:439-445 | crates/ruvector-postgres/src/types/vector.rs:518-525 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/vector.rs:439\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/vector.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f14496391a533519c6a7a1496562280c7fb0828fcd9b91fdcb16023835ef402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-rabitq/src/scan.rs:94-101 | crates/ruvector-rabitq/src/scan.rs:107-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rabitq/src/scan.rs:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-rabitq/src/scan.rs:115\u0060 calls \u0060get_unchecked\u0060, \u0060count_ones\u0060 and \u0060crates/ruvector-rabitq/src/scan.rs:102\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/scan.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"30716bbab25a27c91dd562a8d99749bb28ca6f49a490f7a633239c45b7b9cd46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-recall-bounded/src/lib.rs:196-203 | crates/ruvector-recall-bounded/src/lib.rs:358-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-recall-bounded/src/lib.rs:196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"58419072c9f67c6d659d0e075ad1ce23f88ccd7007224922424915c36782d9bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-robotics/src/bridge/gaussian.rs:103-110 | crates/ruvector-robotics/src/perception/mod.rs:492-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/bridge/gaussian.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"585fc45b20277b12524da8a96605f03d518bd58d5adbf397553659bbe554fdbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-solver/src/router.rs:925-932 | crates/ruvector-solver/src/router.rs:1010-1017 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e03757abfa785dc9ab66075f8e84fa669b80d0b181370e0759346cefaa000f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ruvector-streaming-qng/src/static_pq.rs:88-95 | crates/ruvector-streaming-qng/src/stream_pq.rs:159-165 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-streaming-qng/src/stream_pq.rs:157\u0060 calls \u0060iter\u0060, \u0060sum\u0060 and \u0060crates/ruvector-streaming-qng/src/static_pq.rs:87\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/static_pq.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9b9b052e44c14f290616b7043693887fa69c250a9a368f675513f30ac13f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-turboquant/src/simd.rs:161-168 | crates/ruvector-turboquant/src/simd.rs:247-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-turboquant/src/simd.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9597dafcd384582a0f49bd7badfbd12d5c31fa6c66c90b87c6a952a5304bca81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-typesafe-core/src/engine.rs:294-301 | crates/ruvector-typesafe-core/src/engine.rs:351-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-core/src/engine.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7934bcf9347f5b187f5e3450ee494d430f91d71d0995c64f286ba699e63ff1f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-weaver/src/semver.rs:110-117 | crates/ruvector-weaver/src/semver.rs:133-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-weaver/src/semver.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/semver.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ef09d2610cc7822168dbbf077cc954b568c855de6f3cad035ea373d4f8e5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvix/crates/cli/src/commands/dtb.rs:573-580 | crates/ruvix/crates/cli/src/commands/dtb.rs:672-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:573\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a845b6397c2ba682e0d5ceea05ad09011e5b4363c766a39b99e644e3526b511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvix/crates/nucleus/src/graph_store.rs:545-552 | crates/ruvix/crates/nucleus/src/vector_store.rs:415-422 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/nucleus/src/graph_store.rs:545\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/graph_store.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3066ab7b7874013b14786728da1493752c8bb9ad60a815afd4d14edf374fc96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ruvllm-cli/src/commands/download.rs:204-211 | crates/ruvllm-cli/src/commands/download.rs:239-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm-cli/src/commands/download.rs:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/download.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb19d5bf017498cd328714f1e3ea545d00477f501c50d523ef6845855f05357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm-wasm/src/micro_lora.rs:318-325 | crates/ruvllm-wasm/src/micro_lora.rs:343-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/micro_lora.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a0427c359e0553d948f428a0b9696a2c36ad2c89bebffa253123b1d2587af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:1763-1770 | crates/ruvllm/src/bitnet/backend.rs:1778-1784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:1763\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b99773438dd9af43721e4385bec3ac6294690756c06395204188b0e678b2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:1818-1825 | crates/ruvllm/src/bitnet/backend.rs:1909-1916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:1818\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd5b674446420b66a7b93bca002705a188c0905c282b8ebe59c3b95b6ba378f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvllm/src/bitnet/tl1_avx2.rs:34-48 | crates/ruvllm/src/bitnet/tl1_wasm.rs:36-50 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/bitnet/tl1_avx2.rs\u0060 and \u0060crates/ruvllm/src/bitnet/tl1_wasm.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/tl1_avx2.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dd29b93841657e81d5e01b2668937537558d0574e54e39301a7655e3240dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/claude_flow/agent_router.rs:138-145 | crates/ruvllm/src/claude_flow/hnsw_router.rs:545-552 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/claude_flow/agent_router.rs:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/agent_router.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28eef85c601f91217bdb10a413e73d83c7b9900339333d2c6106ec499a5237a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/kernels/activations.rs:322-329 | crates/ruvllm/src/kernels/ane_ops.rs:618-625 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/activations.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7080965700be396dcdae882a41c50ed3d128333594dcdfb3cae15c8198d0066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/kernels/matmul.rs:720-727 | crates/ruvllm/src/kernels/matmul.rs:760-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/matmul.rs:720\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7e7a5ffe1185a4009771b935551d1352afb448183566a41d3d744e3713bef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/lora/adapters/merge.rs:308-315 | crates/ruvllm/src/lora/adapters/merge.rs:413-420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/lora/adapters/merge.rs:308\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/lora/adapters/merge.rs:411\u0060 calls \u0060seed_from_u64\u0060 and \u0060crates/ruvllm/src/lora/adapters/merge.rs:307\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/lora/adapters/merge.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41a6dc9ad12d8724729738ae555e75aea898bbb48674232cefb3b2b62b981c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/ruvllm/src/metal/context.rs:214-221 | crates/ruvllm/src/metal/context.rs:270-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/context.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e5cd1666f63a4705237783e3045153604235a357c8338b2dd065bd49836117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/metal/context.rs:593-600 | crates/ruvllm/src/metal/context.rs:659-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/context.rs:593\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a064a3d4a48070f8a099b74676c3296537ce352d9b838e7ff9cab81dff032250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/models/openmythos/attention.rs:158-165 | crates/ruvllm/src/models/openmythos/attention.rs:364-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/attention.rs:158\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/attention.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"95429f56a5e9756cd549816974d169d501d53b49f7890e21edcd16525df102e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/models/openmythos/mod.rs:455-462 | crates/ruvllm/src/models/rdt.rs:846-853 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/openmythos/mod.rs\u0060 and \u0060crates/ruvllm/src/models/rdt.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/mod.rs:455\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb357843ab7e15413b06b6f8315f353501e71d6cb789e862be682bda5b4f05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/quantize/turbo_quant.rs:548-555 | crates/ruvllm/src/quantize/turbo_quant.rs:574-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d827c409965c7e656197c833c07ea3cb1f91441a465896559f7405435fead28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/training/contrastive.rs:423-430 | crates/ruvllm/src/training/real_trainer.rs:433-440 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/training/contrastive.rs\u0060 and \u0060crates/ruvllm/src/training/real_trainer.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe6f678f213e5a37efca23d09eb1d208ee4f1c9fb3ff6f2d7a2bbe42ac8f185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:880-887 | crates/ruvllm_sparse_attention/src/attention.rs:916-923 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm_sparse_attention/src/attention.rs:880\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abe7de51141520dd34cfdc8e339282788b585a7b8e550facf5691b8d2536df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:1087-1094 | crates/ruvllm_sparse_attention/src/attention.rs:1219-1226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"305785780ed945128e7c8d7d3520aca8b5d9a03492ae820a74bae3fed1acfcb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm_sparse_attention/src/attention.rs:1788-1795 | crates/ruvllm_sparse_attention/src/attention.rs:1811-1818 \u2014 both copies are in the same file, so extract the block 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":"crates/ruvllm_sparse_attention/src/attention.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7569c5d1efd215c02fcf897aedd87cda19c0b22c64a6a2308f91739fc803f5be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/state.rs:71-77 | crates/rvAgent/rvagent-backends/src/state.rs:93-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 \u0060crates/rvAgent/rvagent-backends/src/state.rs:93\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/state.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b742a032dd9aa577095646591639b05ec85270fbfdd97b63facf2b5c94933b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvAgent/rvagent-mcp/src/resources.rs:151-158 | crates/rvAgent/rvagent-mcp/src/resources.rs:240-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-mcp/src/resources.rs:151\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/resources.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf51433ff748c2d5dad20cfc02cc0cf17dbdcc946c236aba9294614572b055d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvf/rvf-runtime/src/locking.rs:86-93 | crates/rvf/rvf-runtime/src/locking.rs:113-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/locking.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"90064421c6d6c5c26a2d360273869489d712be19c35660893f8e20dad93e175f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvf/rvf-runtime/src/membership.rs:114-121 | crates/rvf/rvf-runtime/src/membership.rs:138-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/membership.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":"crates/rvf/rvf-runtime/src/membership.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebed33e3b474641475f383516a5579fdc4bc156d6687040e49f1f713005e161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvf/rvf-runtime/src/progressive_stream/layers.rs:110-117 | crates/rvf/rvf-runtime/src/progressive_stream/layers.rs:268-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/progressive_stream/layers.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/layers.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea396d999a98bdb0f9a19fe592e0a64028da8cf30d6735a73513764e37cf79b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:257-264 | crates/rvf/rvf-runtime/src/store.rs:3357-3364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf/rvf-runtime/src/store.rs:267\u0060 calls \u0060generate_file_id\u0060 and \u0060crates/rvf/rvf-runtime/src/store.rs:3367\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"090baa75fc06c4ee64128c83616d41a02de4c06dce1d5d9d04d7c43266c8e930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvf/rvf-runtime/src/write_path.rs:371-378 | crates/rvf/rvf-runtime/src/write_path.rs:417-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-runtime/src/write_path.rs:370\u0060 calls \u0060map_or\u0060 and \u0060crates/rvf/rvf-runtime/src/write_path.rs:415\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/write_path.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad03b999db931de6dbc1ccb51b8f1bc8c1bf4f4b3ecaed4d9e5d37a425a11c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvlite/src/cypher/mod.rs:206-213 | edge/gateway/src/graph_persist.rs:184-191 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvlite/src/cypher/mod.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/cypher/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d36b5573762853e1abb2d57a0528c6d9e226c449274221bd3d71f46ed9fccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvm/crates/rvm-proof/src/signer.rs:100-107 | crates/rvm/crates/rvm-proof/src/signer.rs:269-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/signer.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02b0ce02da82c0c6b35f9bb248c8b72d88f0ade2c50a58a4818108f5bcaed35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvm/crates/rvm-proof/src/tee_provider.rs:94-101 | crates/rvm/crates/rvm-proof/src/tee_verifier.rs:68-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/tee_provider.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"df20d86e2ca47bbeea6fb1fdbc55a6452a86660834f6ccaee8bf9e4e52da9ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): edge/gateway/src/backend.rs:99-106 | edge/gateway/src/quant_route.rs:38-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/backend.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"18821ded3f880b0de77abc3d8b820501b6c4b008172c91b752e487895251d6c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): edge/gateway/src/graph_persist.rs:132-139 | edge/gateway/src/graph_persist.rs:148-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060edge/gateway/src/graph_persist.rs:132\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":"edge/gateway/src/graph_persist.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04f322cb012d7a4e5d893520162ad104e84c6c85ccf1f42c90d346d1cd88d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/accelerate.rs:417-424 | patches/candle-core-0.8.4/src/mkl.rs:370-377 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/accelerate.rs\u0060 and \u0060patches/candle-core-0.8.4/src/mkl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cc3451a066e73d5318bc0f17e1f79930935749079b472932ba08dbf56d4f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/accelerate.rs:428-435 | patches/candle-core-0.8.4/src/mkl.rs:381-388 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/accelerate.rs\u0060 and \u0060patches/candle-core-0.8.4/src/mkl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c308bbe10ed74b87094dc05cad5c9cbd6953d80144175f6c30db21c140c5374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 3): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:566-569 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:627-634 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:817-824 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:566\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:625\u0060 calls \u0060zero\u0060, \u0060copy_strided_src_\u0060, \u0060contiguous_offsets\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:566\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1504f9a8da568074473ef6bd6a5a1753248c1b4b900da1cbc0daec79748b0055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:690-697 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:886-893 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7b84002900266fb529c45be153aa8889b9cb9a22ee2529cd821f5a872155c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:74-81 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:123-130 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs:74\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs:122\u0060 calls \u0060F8E4M3\u0060, \u0060Ok\u0060, \u0060U8\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs:73\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":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"81351cbcb263fdc1e77bb9fb5ade6268e2236ccd91d81a6a1334a9b9bfaac05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/device.rs:172-180 | patches/candle-core-0.8.4/src/cuda_backend/device.rs:188-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/device.rs:172\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":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d450c0347486b7e4d7b1d6a6da89bfbc9ffadc7ab2cfce4571505e93c68eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:945-952 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1137-1143 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:945\u0060 it does not close everything it opens, so those exact 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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e52e8616748f2326231f3e2ce507a7f19edd265c7884cf9ae57d294fd578f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:173-182 | patches/candle-core-0.9.2/src/display.rs:184-193 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91707f83fcb62a8854a8ebcc16781c88c5c84c48e599ea45140fb46570bb380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:118-125 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:128-135 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84caa144569069093dfd8a6ed63ef87cb9e44c94b85db0be05d006cc6117663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:247-254 | patches/candle-core-0.9.2/src/npy.rs:274-281 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3346d59f853f85223b2d574d6183d873ee9cf4b512375055e36532ca234e8e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:93-100 | patches/candle-core-0.9.2/src/pickle.rs:95-102 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"726fc31e19386eccd1267e632e38871d7468c0a876c54327ab128c1ebf422438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:728-735 | patches/candle-core-0.9.2/src/pickle.rs:752-759 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef15cf80fb58aebf8f76f4772e32f85ee23cda42e90ea674888946e316ff963d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:278-291 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:295-308 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3388049a4a69cbdf9778769e5e9258f1bf7332e1ecddf67d385719eb03023f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:371-388 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:395-412 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd0d3bb2ba5811fa02f7b6a753d6b375941ab96e1f6f847e3210223446696f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/mod.rs:454-461 | patches/candle-core-0.8.4/src/quantized/mod.rs:534-547 | patches/candle-core-0.9.2/src/quantized/mod.rs:754-761 | patches/candle-core-0.9.2/src/quantized/mod.rs:865-878 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:454\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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eef1e037bc28711d6d28bc76fccc104417b16bffadfe779d92ba10d1c18174b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:432-439 | patches/candle-core-0.9.2/src/safetensors.rs:587-594 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/safetensors.rs:432\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":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0016ebf8b1da6fe4237c9bf191045a5ca1d48f91dca355b67a35a6aa20b937a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1615-1625 | patches/candle-core-0.9.2/src/tensor.rs:1939-1949 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1615\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd4d39e336f6323bb32b175fd09f5ed09658b2b5bcfd93f5fad22e8063f0eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.9.2/src/cpu_backend/mod.rs:617-624 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:775-782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs:617\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"4745548da220bd79133f9c4676355fa8c871443013f498c6719589ac250144cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:708-715 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:751-758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:708\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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"efab7553cf93918b8e0380d3ef46aea5460f848195a3f8ad6dd2c8c4b0a19293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/k_quants.rs:1376-1383 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1630-1637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:1376\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5282969155fa3084c4dad46dac33b102a61b6f52a29a03c908297648fca9d81b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): patches/candle-core-0.8.4/src/tensor.rs:606-612 | patches/candle-core-0.8.4/src/tensor.rs:1622-1628 | patches/candle-core-0.8.4/src/tensor.rs:1653-1659 | patches/candle-core-0.8.4/src/tensor.rs:1694-1700 | patches/candle-core-0.9.2/src/tensor.rs:674-680 | patches/candle-core-0.9.2/src/tensor.rs:1946-1952 | patches/candle-core-0.9.2/src/tensor.rs:1977-1983 | patches/candle-core-0.9.2/src/tensor.rs:2018-2024 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:606\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc03e594a34265d7e00cc3c80bcf92a50792acfab6f77f6a0c35d82c4e5f16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1547-1553 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1558-1564 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1569-1575 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1580-1586 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1591-1597 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1602-1608 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1613-1619 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1624-1630 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cd9f271cb3d80f8e2305affd80d75babf7c0e2ef34229ba820bd06633e71f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): crates/prime-radiant/src/coherence/energy.rs:611-618 | crates/ruvector-acorn/src/dist.rs:22-28 | crates/ruvector-attention/src/transport/centroid_ot.rs:161-167 | crates/ruvector-diskann/src/distance.rs:231-237 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:101-107 | crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:192-198 | crates/ruvector-math/src/product_manifold/manifold.rs:176-182 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/transport/centroid_ot.rs\u0060 and \u0060crates/ruvector-math/src/optimal_transport/sinkhorn.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/coherence/energy.rs:611\u0060 it begins part-way through the construct above it, so those exact 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 \u0060a\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":"crates/prime-radiant/src/coherence/energy.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7e37a0e526db86862f8787efe3d9f7e0211bd09d521d873c8eec902dee1a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): crates/ruvector-cli/src/cli/hooks.rs:663-669 | crates/ruvector-core/src/advanced/neural_hash.rs:350-357 | crates/ruvector-dag/src/sona/reasoning_bank.rs:192-198 | crates/ruvector-embed-core/src/pooling.rs:70-76 | crates/ruvllm/src/context/working_memory.rs:566-573 | crates/ruvllm/src/reasoning_bank/pattern_store.rs:388-395 | crates/sona/src/types.rs:359-366 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cli/src/cli/hooks.rs:663\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"167e97016dfec8ff0bfcbba1404dcabbc5d82af664db01cb40a3e3c3717323cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 7): crates/ruvector-cnn/src/simd/avx2.rs:326-332 | crates/ruvector-cnn/src/simd/avx2.rs:478-483 | crates/ruvector-cnn/src/simd/avx2.rs:604-609 | crates/ruvector-cnn/src/simd/neon.rs:265-271 | crates/ruvector-cnn/src/simd/neon.rs:350-356 | crates/ruvector-cnn/src/simd/wasm.rs:241-246 | crates/ruvector-cnn/src/simd/wasm.rs:332-337 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/avx2.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/avx2.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"944bb81fcd74140718e72da07df6e0faf022d0c3e5ebcd57600893fd162c0dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/ruvllm/src/backends/gemma2.rs:685-691 | crates/ruvllm/src/backends/phi3.rs:564-571 | crates/ruvllm/src/kernels/matmul.rs:1123-1129 | crates/ruvllm/src/kernels/matmul.rs:1148-1154 | crates/ruvllm/src/models/ruvltra.rs:691-698 | crates/ruvllm/src/models/ruvltra.rs:831-837 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:685\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea88f37136c1fce5351884d721e1d3a50141fa2cbaa8069fe51a28bbd5f05521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:841-847 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:906-912 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:914-920 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1037-1043 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1102-1108 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1110-1116 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:841\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afd1ef379cd8219cd715ac50ddf4f5f9c61d6caa7c3f3b78a2dffd69c5550b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/ruvector-cnn/src/simd/neon.rs:22-29 | crates/ruvector-core/src/simd_intrinsics.rs:656-663 | crates/ruvector-core/src/simd_intrinsics.rs:736-742 | crates/ruvector-core/src/simd_intrinsics.rs:865-871 | crates/ruvllm/src/kernels/norm.rs:230-237 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76080014d791c0303c6ef8a547dd7bfffbec44af01ee6a209c017796eb1bd6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/ruvector-mincut/src/algorithm/approximate.rs:274-280 | crates/ruvector-mincut/src/algorithm/approximate.rs:412-418 | crates/ruvector-mincut/src/instance/bounded.rs:182-188 | crates/ruvector-mincut/src/instance/bounded.rs:367-373 | crates/ruvector-mincut/src/instance/stub.rs:173-179 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/instance/bounded.rs\u0060 and \u0060crates/ruvector-mincut/src/instance/stub.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/algorithm/approximate.rs:274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/approximate.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae767a869b9355bb957d8f4442f037e8eb5ea3575da8e20399f8b4b529d846e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 5): crates/ruvector-postgres/src/attention/flash.rs:83-89 | crates/ruvector-postgres/src/attention/flash.rs:138-142 | crates/ruvector-postgres/src/attention/mod.rs:156-162 | crates/ruvector-postgres/src/attention/operators.rs:501-507 | crates/ruvector-postgres/src/attention/operators.rs:836-842 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/flash.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddd1525f6708ad1a251a24e9f76ecc6b9a1f43b8eda68255a139990c7d9f38f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1176-1182 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1366-1372 | patches/candle-core-0.8.4/src/quantized/simd128.rs:184-190 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1378-1384 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1632-1638 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/simd128.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 83 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3b283c55e8dd85c3b9889a4ba32c1f022e92d09076920bf0df1f398212cb55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-attention/src/curvature/fused_attention.rs:364-370 | crates/ruvector-attention/src/pde_attention/diffusion.rs:267-273 | crates/ruvector-attention/src/topology/gated_attention.rs:327-333 | crates/ruvector-attention/src/transport/centroid_ot.rs:373-379 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 and \u0060crates/ruvector-attention/src/pde_attention/diffusion.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/curvature/fused_attention.rs:364\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/fused_attention.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b352efc6fd14c9dc7f467f475ded5e96c7966ad57f116046118250bad6615d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-bench/src/bin/memory_benchmark.rs:97-103 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:135-141 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:219-225 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:299-305 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/profiling_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-bench/src/bin/profiling_benchmark.rs:144\u0060 calls \u0060now\u0060 and \u0060crates/ruvector-bench/src/bin/profiling_benchmark.rs:227\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/memory_benchmark.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"019f24f832e1880158c56154182c4f073299633716a23ff724bdf911e0179961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 4): crates/ruvector-cnn/src/layers/conv.rs:641-647 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:213-217 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:70-74 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:165-169 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/quantized_depthwise.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/quantized_pooling.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/conv.rs:641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7c4a96a2e8f7db895928a240355829992cfa11e3fa61215f4c150871a7b38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20137 lines \u00D7 5): crates/ruvector-adaptive-ann/src/dataset.rs:47-47 | crates/ruvector-coherence-hnsw/src/dataset.rs:17-22 | crates/ruvector-coherence-hnsw/src/dataset.rs:50-56 | crates/ruvector-coherence-hnsw/src/dataset.rs:67-72 | crates/ruvector-coherence-hnsw/src/dataset.rs:110-116 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-adaptive-ann/src/dataset.rs:47\u0060 calls \u0060iter\u0060, \u0060sqrt\u0060, \u0060max\u0060 and \u0060crates/ruvector-coherence-hnsw/src/dataset.rs:56\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/dataset.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6801ad26068e84b140e046ea7508a76de8a24c213fa2b1ca1dc92abb6dcf83e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-core/src/simd_intrinsics.rs:1362-1369 | crates/ruvector-core/src/simd_intrinsics.rs:1403-1409 | crates/ruvector-postgres/src/quantization/scalar.rs:119-126 | crates/ruvector-postgres/src/types/scalarvec.rs:247-255 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/scalar.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:1362\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"60277ea5b2df375943367e8bd6bbf1cf0484cddd999c94c34c7f0db8dd90bf66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-graph-transformer-node/src/lib.rs:333-339 | crates/ruvector-graph-transformer-node/src/lib.rs:573-579 | crates/ruvector-graph-transformer-node/src/lib.rs:658-664 | crates/ruvector-graph-transformer-node/src/lib.rs:739-745 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/lib.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5543fb4d78d460e7cde75fc4583ac075e042c4b5967741da52765815acce16ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-math/src/information_geometry/fisher.rs:203-210 | crates/ruvector-math/src/information_geometry/kfac.rs:161-168 | crates/ruvector-math/src/information_geometry/kfac.rs:171-178 | crates/ruvector-math/src/information_geometry/kfac.rs:240-247 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/information_geometry/fisher.rs\u0060 and \u0060crates/ruvector-math/src/information_geometry/kfac.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/information_geometry/fisher.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f043213f88c6b5c2e6a40314345aab50624ee894084552b17b389cf67c2af523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-mincut/src/fragment/mod.rs:274-280 | crates/ruvector-mincut/src/instance/bounded.rs:182-188 | crates/ruvector-mincut/src/instance/bounded.rs:367-373 | crates/ruvector-mincut/src/instance/stub.rs:173-179 \u2014 before extracting anything, compare \u0060crates/ruvector-mincut/src/instance/bounded.rs\u0060 and \u0060crates/ruvector-mincut/src/instance/stub.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/fragment/mod.rs:274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/fragment/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8dca8d9d13d0c371bc3567eab7f96ee9c3b26d2a072bebf842972a9c1cdc3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-namespace-merge/src/lib.rs:73-79 | crates/ruvector-query-cache/src/lib.rs:122-128 | crates/ruvector-speculative-ann/src/lib.rs:64-70 | crates/ruvector-streaming-qng/src/lib.rs:91-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-namespace-merge/src/lib.rs:73\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-namespace-merge/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0095686935fc8c32f3ffff60b06e3d2f09dbea0bf5c0b6a92798491eca572fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-postgres/src/distance/simd.rs:1508-1514 | crates/ruvector-postgres/src/distance/simd.rs:1537-1543 | crates/ruvector-postgres/src/distance/simd.rs:1574-1580 | crates/ruvector-postgres/src/distance/simd.rs:1600-1606 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1508\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:1535\u0060 calls \u0060vdupq_n_f32\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs:1507\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"297e0b9864dba09f008b3231f882ed8ffb21c6fb5de894af4ecb1e235b9ad228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-postgres/src/types/binaryvec.rs:352-358 | crates/ruvector-postgres/src/types/productvec.rs:371-377 | crates/ruvector-postgres/src/types/scalarvec.rs:397-403 | crates/ruvector-postgres/src/types/sparsevec.rs:438-444 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/binaryvec.rs:352\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c96fb54cf84c3a6cbcbba8ef1bc1300a4a328308814f6d9df0f1e9c36f86d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-postgres/src/types/binaryvec.rs:375-381 | crates/ruvector-postgres/src/types/productvec.rs:394-400 | crates/ruvector-postgres/src/types/scalarvec.rs:420-426 | crates/ruvector-postgres/src/types/sparsevec.rs:461-467 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"5852c978478350a3f2c4cbb95097ad1e9bf49a27e88de2ac3a8f52becbd6414b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:298-304 | crates/rvf/rvf-adapters/sona/src/experience.rs:288-294 | crates/rvf/rvf-adapters/sona/src/pattern.rs:279-285 | crates/rvf/rvf-adapters/sona/src/trajectory.rs:279-285 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:298\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf/rvf-adapters/sona/src/pattern.rs:286\u0060 calls \u0060PatternNotFound\u0060 and \u0060crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:305\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ae41f8e36e6c1e8e8d3131f696fa97d5c1a5ca35249547b88324ca7acf5971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/rvf/rvf-runtime/src/store.rs:2493-2499 | crates/rvf/rvf-runtime/src/store.rs:2596-2602 | crates/rvf/rvf-runtime/src/store.rs:2708-2714 | crates/rvf/rvf-runtime/src/store/dir_growth.rs:198-204 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:2493\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c3a068113ab8d64e9d8598431a63e29ce092446a6f714a505545c757ac3fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:319-324 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:358-364 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:337-342 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:376-382 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:319\u0060 it does not close everything it opens, so those exact 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"610ac538af8324592ba633afb637e9344bd8c30558f7056c80f9ae3fa7627dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:479-485 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:588-594 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:616-622 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:774-780 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:479\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ad9e804a1b748892ec34cb938ecf94eae34a3077b00966de5118fcc87b9c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:186-195 | patches/candle-core-0.8.4/src/cpu_backend/utils.rs:227-236 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:235-244 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:276-285 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs:186\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e6cf50b5cb9dfee4214c1e3cd4649431ac565ababd6a3afee4e40b155d07f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): patches/candle-core-0.8.4/src/npy.rs:266-272 | patches/candle-core-0.8.4/src/npy.rs:290-296 | patches/candle-core-0.9.2/src/npy.rs:293-299 | patches/candle-core-0.9.2/src/npy.rs:317-323 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/npy.rs:266\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e39f81d46081f53229af91d39752880916d238dd124767314b88aebec4613ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): patches/candle-core-0.8.4/src/npy.rs:381-386 | patches/candle-core-0.8.4/src/npy.rs:394-400 | patches/candle-core-0.9.2/src/npy.rs:408-413 | patches/candle-core-0.9.2/src/npy.rs:421-427 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/npy.rs:381\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":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"999169741ded806c123d8d63111865c90be11c88c6a68e835985e33de8507d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:371-377 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:474-480 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:395-401 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:501-507 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:366\u0060 calls \u0060vec_dot_unopt\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:471\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1cc3d99155ef888192023087076f200710660e126c595af3f7839449a4cc2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1180-1191 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1370-1381 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1382-1393 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1636-1647 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fcf892f46acd2e1490d5c311544425d43286c352f31c5fbb973d6dc96bd4ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/prime-radiant/src/coherence/energy.rs:467-473 | crates/prime-radiant/src/simd/vectors.rs:429-435 | crates/prime-radiant/src/simd/vectors.rs:453-459 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/coherence/energy.rs:467\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/energy.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"538decb23ce128e156316688489f3a411baa2e6f2396217fb69228a1aaa687e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-acorn/src/search.rs:89-95 | crates/ruvector-coherence-hnsw/src/search.rs:250-256 | crates/ruvector-coherence-hnsw/src/search.rs:358-364 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-acorn/src/search.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-acorn/src/search.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"926823b60e922e802a23d7072133a32f508c56a1b3c7ac12d259443e2db85605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): crates/ruvector-attention-node/src/async_ops.rs:145-151 | crates/ruvector-attention-node/src/async_ops.rs:199-205 | crates/ruvector-attention-node/src/async_ops.rs:279-285 | crates/ruvector-gnn-node/src/lib.rs:387-390 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-node/src/async_ops.rs:145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/async_ops.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae15fbe6d4534cd0ae49a03d708d566a1cda191c13d3df33e534af8bac35990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-bench/src/bin/memory_benchmark.rs:124-130 | crates/ruvector-bench/src/bin/memory_benchmark.rs:243-249 | crates/ruvector-bench/src/bin/memory_benchmark.rs:337-343 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs:124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/memory_benchmark.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d01e461dca0c47e45aa93c9cc10973cd83d5e225c6c8c54defb903003b8091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-cluster-rag/src/lib.rs:63-69 | crates/ruvector-hybrid/src/main.rs:47-53 | crates/ruvector-nervous-system/src/integration/ruvector.rs:395-402 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cluster-rag/src/lib.rs:63\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/lib.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9291c764d2194596fb6bac3fbbbb468ac98404a9d18cf0b38f7c38a880c0b8ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/ruvector-cnn/src/int8/kernels/simd.rs:74-80 | crates/ruvector-core/src/simd_intrinsics.rs:1369-1374 | crates/ruvector-core/src/simd_intrinsics.rs:1409-1414 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/int8/kernels/simd.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4610e28ea94c5f16c8dad4fb1b929a8c29beb37825cc21040b38fdcaf7991d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-cnn/src/simd/neon.rs:324-330 | crates/ruvector-cnn/src/simd/neon.rs:356-362 | crates/ruvector-cnn/src/simd/scalar.rs:172-178 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/simd/neon.rs\u0060 and \u0060crates/ruvector-cnn/src/simd/scalar.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/neon.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/neon.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c23e2dbc8c3fc94a0d932f65a29f01a94420679c908d73100c0183f544b4d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-cnn/src/simd/winograd.rs:109-115 | crates/ruvector-cnn/src/simd/winograd.rs:151-157 | crates/ruvector-cnn/src/simd/winograd.rs:193-199 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/winograd.rs:109\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/winograd.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aadf9bc304e80303fefc2f36ffb527450ade861002a09e4cdf4d45590eed70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): crates/ruvector-core/src/agenticdb.rs:380-386 | crates/ruvector-core/src/agenticdb.rs:476-482 | crates/ruvector-core/src/agenticdb.rs:588-594 | crates/ruvector-core/src/agenticdb.rs:695-698 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/agenticdb.rs:380\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/agenticdb.rs:476\u0060 calls \u0060map_err\u0060, \u0060SerializationError\u0060, \u0060to_string\u0060 and \u0060crates/ruvector-core/src/agenticdb.rs:695\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b319ef5f48e503d333dea176a8d590baf9b8aa8425445a095a3f61fec8f6ddd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:528-536 | crates/ruvector-core/src/simd_intrinsics.rs:568-576 | crates/ruvector-core/src/simd_intrinsics.rs:815-821 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:528\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:579\u0060 calls \u0060vfmaq_f32\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:538\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e7ea24087005ae34692b088f7c27de4fab5936516a5e8430f947f5edd95969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/ruvector-core/src/storage.rs:102-108 | crates/ruvector-graph/src/storage.rs:117-122 | crates/ruvector-router-core/src/storage.rs:49-54 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/storage.rs\u0060 and \u0060crates/ruvector-graph/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/storage.rs:102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc73e8c05307d41fab85ccb6ee9355681a5e9965becaee7e2f94ef861b87d496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-decompiler/src/parser.rs:96-102 | crates/ruvector-decompiler/src/parser.rs:113-119 | crates/ruvector-decompiler/src/parser.rs:130-136 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-decompiler/src/parser.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":"crates/ruvector-decompiler/src/parser.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1c66bead1faacd61a7ac510dc1f8bebf9f58fb785ebee226259e4b65744222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-filter/src/evaluator.rs:207-213 | crates/ruvector-filter/src/evaluator.rs:236-242 | crates/ruvector-filter/src/evaluator.rs:266-275 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-filter/src/evaluator.rs:207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-filter/src/evaluator.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacb705ce32278a417c87c3ffaf5dfbe405ad00d45ba19f64a66e2dfff04caee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-graph/src/hybrid/vector_index.rs:220-226 | crates/ruvector-graph/src/hybrid/vector_index.rs:241-247 | crates/ruvector-graph/src/hybrid/vector_index.rs:261-267 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/hybrid/vector_index.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":"crates/ruvector-graph/src/hybrid/vector_index.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e88626266f5f895755d34d193ae2331e526d4f735e1652a33e88639175746aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/ruvector-nervous-system/src/separate/sparsification.rs:145-151 | crates/ruvector-nervous-system/src/separate/sparsification.rs:178-183 | crates/ruvector-nervous-system/src/separate/sparsification.rs:272-277 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system/src/separate/sparsification.rs:145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-nervous-system/src/separate/sparsification.rs:152\u0060 calls \u0060push\u0060 and \u0060crates/ruvector-nervous-system/src/separate/sparsification.rs:278\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/separate/sparsification.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a7deac9c367e3e67a5f8fffe5135dc5d4049d086a68dc252238dec2e510a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-postgres/src/index/hnsw_am.rs:467-474 | crates/ruvector-postgres/src/index/ivfflat_am.rs:746-752 | crates/ruvector-postgres/src/index/ivfflat_am.rs:954-960 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3796d6038c6a75e676ca8d5729154aee878f14b14432a4c31ebb5fdcff3215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/ruvector-postgres/src/index/hnsw_am.rs:954-960 | crates/ruvector-postgres/src/index/hnsw_am.rs:1080-1086 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1159-1164 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw_am.rs:954\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ab08ba3146534b4cdd7560a778e3712c642dc2afe3efb9bc06e1891ae8a407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-postgres/src/quantization/binary.rs:92-101 | crates/ruvector-turboquant/src/simd.rs:163-169 | crates/ruvector-turboquant/src/simd.rs:249-255 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/quantization/binary.rs:92\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/binary.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a735107decf79dd6d32fd44b087b57d8448be2a61d704e9d1a35717f29ff7e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-solver/src/bmssp.rs:379-385 | crates/ruvector-solver/src/true_solver.rs:168-174 | crates/ruvector-solver/src/true_solver.rs:210-216 \u2014 before extracting anything, compare \u0060crates/ruvector-solver/src/bmssp.rs\u0060 and \u0060crates/ruvector-solver/src/true_solver.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/bmssp.rs:379\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e5a7aa1213f91951a78a491aa493c02c490bc64abef340ed5ee0c74a0d3bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvix/crates/nucleus/src/checkpoint.rs:213-219 | crates/ruvix/crates/nucleus/src/checkpoint.rs:256-262 | crates/ruvix/crates/nucleus/src/witness_log.rs:567-573 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/nucleus/src/checkpoint.rs:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/checkpoint.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e15a13e40799f54b43e449485de8af45380e29304359cb347ff8210efe8328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvllm/src/backends/gemma2.rs:381-387 | crates/ruvllm/src/backends/phi3.rs:302-308 | crates/ruvllm/src/models/ruvltra.rs:552-558 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27423c447c955ca199659332658a8bfc6fae22ab114f136ca2cc233fca1853d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvllm/src/kernels/ane_ops.rs:452-458 | crates/ruvllm/src/kernels/matmul.rs:883-889 | crates/ruvllm/src/kernels/matmul.rs:1653-1659 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/ane_ops.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6ae5c568b1377c9c5ea983c0009a805359583e0f777e294dd089a36dd224cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvllm/src/kernels/matmul.rs:586-595 | crates/ruvllm/src/kernels/matmul.rs:614-623 | crates/ruvllm/src/kernels/matmul.rs:642-651 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ee26ef10480f75769b7fb78a378e22fde2f69f1e9de130d919eeff04fb1721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvllm/src/metal/context.rs:314-320 | crates/ruvllm/src/metal/context.rs:610-616 | crates/ruvllm/src/metal/context.rs:675-681 \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, \u0060crates/ruvllm/src/metal/context.rs:608\u0060 calls \u0060create_buffer_with_data\u0060 and \u0060crates/ruvllm/src/metal/context.rs:311\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0757c1e9819c96861120d5a51970d1553784509c0df289a58f8df0b3e598ae20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvllm/src/metal/operations.rs:442-449 | crates/ruvllm/src/metal/operations.rs:571-577 | crates/ruvllm/src/metal/operations.rs:681-687 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/operations.rs:442\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/operations.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad73b5358bb03aafb6d9803e2598fdde6c50c0be860de71901e76432404812a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/rvf/rvf-launch/src/lib.rs:467-473 | crates/rvf/rvf-launch/src/lib.rs:477-483 | crates/rvf/rvf-launch/src/lib.rs:497-503 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-launch/src/lib.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"1573ad689cc8064ff19a67053528e1bdb263774183fe50304194cad12859e23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/rvm/crates/rvm-types/src/witness.rs:152-157 | crates/rvm/crates/rvm-types/src/witness.rs:369-374 | crates/rvm/crates/rvm-witness/src/hash.rs:70-76 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-types/src/witness.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c07732c2831be7975041e5a7554bed45ca768a6c241b010e6695c9ee885d4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): edge/gateway/src/durable.rs:276-282 | edge/gateway/src/m3_transport.rs:31-37 | edge/gateway/src/registry_do.rs:226-232 \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 \u0060edge/gateway/src/durable.rs:276\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/durable.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"257a37dc83bb57e741a0d9d0b0e85b716a1a67b6a37d0067579685fb531cc1e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:614-620 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:679-685 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:728-734 \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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d20d96fe9ab15eccca21faace83cd7d5b41daadae04f70ba69d62e9e95b412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2321-2323 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1476-1482 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1075-1081 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1127-1133 \u2014 \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 90 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2321\u0060 it does not close everything it opens, so those exact 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, \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1482\u0060 calls \u0060is_contiguous\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2323\u0060 does not \u2014 after which the two agree again for 5 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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"544385c5e7bda3970f3c58317ed75cee53878faf4b353363a582e920ce582cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/metal.rs:160-166 | patches/candle-core-0.9.2/src/quantized/metal.rs:216-222 | patches/candle-core-0.9.2/src/quantized/metal.rs:278-284 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a3c389857a5fd1ef7629c0bc5bb7bcb58da2c60771ec9a420b6610aee9a31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:735-741 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:806-812 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:854-860 \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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"e901f44c009a31cb08ee5385fafb7c4d9375db8792c7fe1618cd47c5e4841f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 3): crates/emergent-time/src/real_matrix.rs:194-200 | crates/emergent-time/src/real_matrix.rs:201-207 | crates/emergent-time/src/real_matrix.rs:208-212 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/emergent-time/src/real_matrix.rs:194\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/real_matrix.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff5eb7c6f473f63e1cbfc40ba55fc4f51113ed5287cbe4de645296ba42ef8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:1587-1593 | crates/mcp-brain-server/src/routes.rs:3694-3700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4566bed7a8c11d688def707155c89c7bbf3f281213431e292effcc9655729e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mcp-brain-server/src/store.rs:790-796 | crates/mcp-brain-server/src/store.rs:832-838 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/store.rs:790\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734efcbbf502fa965dfe5e563665d19a3cc1462ecef76a4dc6123ca7829f2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/mcp-brain-server/src/types.rs:699-704 | crates/mcp-brain/src/embed.rs:63-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/types.rs:699\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b0829e4455dc26dccc743d94868d2b69491a8cecff5761c200093ad36f29a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp-brain-server/src/types.rs:1116-1123 | crates/mcp-brain-server/src/types.rs:1131-1138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/types.rs:1116\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"892bad5cf943f972f00bc39a72cf3ab929c14bbb95183cf418ca9cda300e31c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/prime-radiant/src/cohomology/diffusion.rs:327-337 | crates/prime-radiant/src/cohomology/obstruction.rs:321-331 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/diffusion.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fac38c2e7e19df788c9a106b269eefa067f9ff42633d144d55f257d9cb2487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/prime-radiant/src/distributed/adapter.rs:36-42 | crates/prime-radiant/src/distributed/adapter.rs:52-58 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/distributed/adapter.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f52703739e6ebe31862c3f3581e9a9c06c5cd5757ab5afc689d4f3500b02968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/prime-radiant/src/ruvllm_integration/pattern_bridge.rs:544-550 | crates/prime-radiant/src/ruvllm_integration/pattern_bridge.rs:558-565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/ruvllm_integration/pattern_bridge.rs:544\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/pattern_bridge.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7bbfb16ba1369513926eb8499399b8dd094c5aaef0718c4e7ce108d8676f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/prime-radiant/src/simd/matrix.rs:198-204 | crates/prime-radiant/src/simd/vectors.rs:370-376 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/matrix.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/matrix.rs:198\u0060 it does not close everything it opens, so those exact 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 \u0060c\u0060 to \u0060\u0026mut [f32]\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/matrix.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"390113f4a96c914370b55d9c17d1637628784127448ce20346aad41f4ddec2f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/prime-radiant/src/substrate/graph.rs:577-583 | crates/prime-radiant/src/substrate/graph.rs:616-622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/prime-radiant/src/substrate/graph.rs:574\u0060 calls \u0060compute_energy_incremental\u0060, \u0060has_dirty_edges\u0060 and \u0060crates/prime-radiant/src/substrate/graph.rs:613\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/graph.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf49f125069fac4b28d1ccd0e180ea92f8fdc08aace2dce9dd7e1a00e1f3a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/prime-radiant/src/types.rs:602-608 | crates/ruvector-decompiler/src/witness.rs:164-170 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-decompiler/src/witness.rs:164\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/types.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d00829d1cf14a3fa566df19ed5469ea1ff09cc7221da2587dbd1a3112a453a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/dag.rs:149-155 | crates/ruvector-attention-unified-wasm/src/dag.rs:462-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/dag.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f63ff61970fae64845726920bbdd83f81b22dc842e3506dd81551daf99dead3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20137 lines \u00D7 29): crates/mcp-brain/src/embed.rs:406-406 | crates/prime-radiant/src/attention/diffusion.rs:248-248 | crates/prime-radiant/src/attention/topology.rs:227-227 | crates/prime-radiant/src/ruvllm_integration/traits.rs:355-355 | crates/prime-radiant/src/storage/file.rs:560-560 | crates/prime-radiant/src/storage/memory.rs:201-201 | crates/prime-radiant/src/storage/postgres.rs:866-866 | crates/ruvector-attention-unified-wasm/src/lib.rs:265-271 | crates/ruvector-attention-wasm/src/utils.rs:23-23 | crates/ruvector-attention/src/training/loss.rs:43-43 | crates/ruvector-attention/src/training/mining.rs:65-65 | crates/ruvector-cli/src/cli/hooks.rs:661-661 | crates/ruvector-cluster-rag/src/lib.rs:61-61 | crates/ruvector-core/src/advanced/neural_hash.rs:348-348 | crates/ruvector-core/src/advanced_features/graph_rag.rs:494-494 | crates/ruvector-core/src/simd_intrinsics.rs:1192-1192 | crates/ruvector-dag/src/sona/reasoning_bank.rs:190-190 | crates/ruvector-diverse-beam/src/lib.rs:62-62 | crates/ruvector-gnn-wasm/src/lib.rs:350-356 | crates/ruvector-graph-transformer/src/biological.rs:91-91 | crates/ruvector-hybrid/src/main.rs:45-45 | crates/ruvector-mincut-gated-transformer/src/spectral.rs:767-767 | crates/ruvector-nervous-system/src/integration/ruvector.rs:393-393 | crates/ruvector-postgres/src/routing/router.rs:415-415 | crates/ruvector-spann/src/distance.rs:21-21 | crates/ruvllm-wasm/src/hnsw_router.rs:300-300 | crates/ruvllm/src/context/working_memory.rs:564-564 | crates/ruvllm/src/quality/coherence.rs:692-692 | crates/ruvllm/src/quality/diversity.rs:743-743 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 29 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 29 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-unified-wasm/src/lib.rs:265\u0060 it begins part-way through the construct above it, so those exact 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 \u0060a\u0060 to \u0060\u0026[f32]\u0060 in one and \u0060Vec\u003Cf32\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/prime-radiant/src/attention/topology.rs:226\u0060 calls \u0060cosine_similarity\u0060 and \u0060crates/ruvector-mincut-gated-transformer/src/spectral.rs:764\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/embed.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"119bcca20777072eee5a6c9abfa08e5f4c2abf102eb388b131794fe0313ce473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20137 lines \u00D7 4): crates/ruvector-attention-node/src/async_ops.rs:471-471 | crates/ruvector-attention-unified-wasm/src/neural.rs:50-56 | crates/ruvector-attention-wasm/src/attention.rs:30-36 | crates/ruvector-crv/src/stage_ii.rs:124-124 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/neural.rs\u0060 and \u0060crates/ruvector-attention-wasm/src/attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-unified-wasm/src/neural.rs:50\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/async_ops.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"17872e6d6e6a92ad694ca5f9efeeca45a98ed9c59010151a2611d8b528d6f8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-bench/src/bin/turbo4_ablation.rs:81-87 | crates/ruvector-bench/src/bin/turbo4_ablation.rs:278-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/turbo4_ablation.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4820b932a6b8775c79176b8fdb25610ad3c415268ea3df0e33ebbcc6e21b5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-bet4-ivf-bench/src/kernel.rs:78-84 | crates/ruvector-bet4-ivf-bench/src/pq.rs:89-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/kernel.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7104233654b9627ad69a5d1879359f046a3480c985b249960ba3851f9e5dd1a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-bounded-rag/src/lib.rs:272-278 | crates/ruvector-bounded-rag/src/lib.rs:580-587 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bounded-rag/src/lib.rs:272\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bounded-rag/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9888e2ce261f7735f929d1f138b72b2e4e5f8cf9b47b3675edd0a285fe2cdf03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-core/src/advanced_features/mmr.rs:202-209 | crates/ruvector-core/src/advanced_features/product_quantization.rs:299-305 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/mmr.rs:202\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/mmr.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e30408402ce369583fad214e4e0d64a3ce76a24b58ffd8b280942a24fc8955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/ruvector-core/src/advanced_features/product_quantization.rs:329-335 | crates/ruvector-core/src/advanced_features/product_quantization.rs:420-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/product_quantization.rs:329\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/product_quantization.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"5407d5e0e6a87376ef0c34a42ee63fdd0df269af25ef40aa91c5270c746f9af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-diskann/src/distance.rs:283-289 | crates/ruvector-diskann/src/distance.rs:384-390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diskann/src/distance.rs:283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diskann/src/distance.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f569fa9ea4f399d947e51b7feaaf2b990d94429537fcfe7cc9733d9cc23707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-edge-store/src/ops/vector.rs:104-110 | edge/gateway/src/vectors.rs:87-93 \u2014 before extracting anything, compare \u0060crates/ruvector-edge-store/src/ops/vector.rs\u0060 and \u0060edge/gateway/src/vectors.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/vector.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4949a25a486e8d38a7ee5f29eb16c3b24deee44b136ce3c5771420534499d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-graph-transformer/src/temporal.rs:241-250 | crates/ruvector-graph-transformer/src/temporal.rs:353-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-transformer/src/temporal.rs:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-graph-transformer/src/temporal.rs:252\u0060 calls \u0060clone\u0060 and \u0060crates/ruvector-graph-transformer/src/temporal.rs:364\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/temporal.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c243f1582d7cf119dd030536716c78005197ae7fd973d82d393dbec711f2785f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-graph/src/cypher/ast.rs:385-397 | crates/rvlite/src/cypher/ast.rs:385-397 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/ast.rs\u0060 and \u0060crates/rvlite/src/cypher/ast.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/ast.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c646ed06fde38da82bd108ea04ab39fa1974af8aa636562f8cc6de8a2d3a31db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:200-206 | crates/ruvector-hailo-cluster/src/bin/worker.rs:486-492 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/fakeworker.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0f85024053cdd719ee7b8c0c3e4bea3d8746b48d67de65495fb956679d32dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-hailo/src/cpu_embedder.rs:233-239 | crates/ruvector-hailo/src/hef_embedder.rs:126-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo/src/cpu_embedder.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eff673306a7da3b812a32796bbb8f21969e596a8b0b9938e551ff33df9e6204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:256-263 | crates/ruvector-kge-wasm/src/model.rs:256-263 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6a8eb691517e6563250032b6d52186f240699db365f7a753c227fd89d64608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-lsm-ann/src/lib.rs:96-102 | crates/ruvector-lsm-ann/src/memtable.rs:58-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-lsm-ann/src/lib.rs:96\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-lsm-ann/src/lib.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5610d1d01cec53526df3cc14c7c0408af4224ba89da2f0bf95c8589525c889f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs:103-109 | crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs:115-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ad0d9ddbb786023155f9bfd339b930d3022adb6fbc205871f91f5afa7a9737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-math/src/tensor_networks/cp_decomposition.rs:221-228 | crates/ruvector-math/src/tensor_networks/cp_decomposition.rs:243-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/cp_decomposition.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f927dce9078f2385f54aea2393987db864fc41517fa514ae1363931782921546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-maxsim/src/main.rs:98-104 | crates/ruvector-maxsim/src/main.rs:132-138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-maxsim/src/main.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e9e3ca9c6a5ea1ceb6e61ff6ef5479fec3843733d0c843185bc7970b7e28cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:305-311 | crates/ruvector-mincut-gated-transformer/src/flash_attention.rs:421-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/flash_attention.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecf7cd8f86e763efda1e93f68f42a031d43eac0acea1a54d2392bfcff022a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ruvector-mincut/src/canonical/mod.rs:546-552 | crates/ruvector-mincut/src/canonical/mod.rs:554-561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/canonical/mod.rs:554\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b085197f2cdd3cd8a82de7368ece3843e5ba29eb8cbfaf9e892b50385498a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-mincut/src/integration/mod.rs:228-234 | crates/ruvector-mincut/src/integration/mod.rs:309-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/integration/mod.rs:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/integration/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d32c13199a27fdda379105ac2b7355d267ffb52ccfe0e241a3952e1c57efa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-nervous-system/src/hdc/memory.rs:154-160 | crates/ruvector-nervous-system/src/hdc/similarity.rs:132-138 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system/src/hdc/memory.rs:154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/hdc/memory.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9390f8084130bdb114d23f3c111c744eb171ab4c2afff5e104de56b8f220be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:468-474 | crates/rvf/rvf-index/src/distance.rs:74-80 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"186527fedddfdb733b4d37cf6ce754c3e749954b554795a60ac213ecf444ac33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:465-471 | crates/ruvector-postgres/src/distance/simd.rs:521-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:465\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ec93e3946d7ec998bb0081166b81076344d33cea6069010c5a8cb3bcd124ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:524-530 | crates/rvf/rvf-index/src/distance.rs:117-122 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:524\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea77ab82d58799a87b7eb0e2000bdd097a1a503ce7184d37f22a5028fa8db240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1082-1088 | crates/ruvector-postgres/src/graph/sparql/executor.rs:1103-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 \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:1082\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"d728aa7b1033a6fb72f525a1fcdb94a57bee9f3675a3f38425e6992638380152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:1688-1694 | crates/ruvector-postgres/src/graph/sparql/executor.rs:1698-1704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea62de7c13722e53305075fdc031e71ffe4b2f65ad204046c10fa50abe19c7fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw_am.rs:1629-1637 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1500-1506 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw_am.rs:1629\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bce2dfd2fed7960512cd4c3bc597efae2c554a36fd58e7f16924c56194ca27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/integrity/mod.rs:139-145 | crates/ruvector-postgres/src/workers/integrity.rs:43-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b06278eacf87749958736ce639c5eecb1b889dcb90a4602503e1d49f9c925f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/math/operators.rs:147-153 | crates/ruvector-postgres/src/math/operators.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":"crates/ruvector-postgres/src/math/operators.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d644240af23e2ce58b19b3e7ba8d726c84395b95342b45d082fb414331931f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/math/operators.rs:209-216 | crates/ruvector-postgres/src/math/operators.rs:238-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/math/operators.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f797b3ca8b82b8c252cb07b2490bb5fce9f02113f31b4be9406545893fa34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/solver/operators.rs:77-83 | crates/ruvector-postgres/src/solver/operators.rs:115-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90e057317c23be0b3061ef553a2cd5cf0c41c913da89fa6642308f53fe01c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-rabitq/src/scan.rs:147-153 | crates/ruvector-rabitq/src/scan.rs:325-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-rabitq/src/scan.rs:338\u0060 calls \u0060_mm512_set1_epi64\u0060 and \u0060crates/ruvector-rabitq/src/scan.rs:155\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/scan.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc708df4b6279ce61cf8f28b160c517a0470fc9c8bab7636bd96b0f6c3d2365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-rabitq/src/scan.rs:200-209 | crates/ruvector-rabitq/src/scan.rs:230-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rabitq/src/scan.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/scan.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a351590d9f5ba66798024967325bc6a19e7a648d099d2d9f19af6f1fd72ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-rairs/src/main.rs:173-179 | crates/ruvector-rairs/src/main.rs:194-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/main.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"26afd8da1d10170de841fcce9cee8a0143d9764fc7d4872b5049df86a13b1b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-sparse-inference/src/backend/cpu.rs:326-332 | crates/ruvector-sparse-inference/src/backend/cpu.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 \u0060crates/ruvector-sparse-inference/src/backend/cpu.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c247dfe98bf31abbd376dbc450c4535414f8783a05be5e1e01839772e317e948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/ruvector-speculative-ann/src/bin/benchmark.rs:166-171 | crates/ruvector-speculative-ann/src/bin/benchmark.rs:264-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-speculative-ann/src/bin/benchmark.rs:166\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-speculative-ann/src/bin/benchmark.rs:271\u0060 calls \u0060current_mult\u0060, \u0060acceptance_rate\u0060 and \u0060crates/ruvector-speculative-ann/src/bin/benchmark.rs:173\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-speculative-ann/src/bin/benchmark.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"23938421b6696e4a294b9604b7377c0dae0b546eb8b6794a720bf81ae94ab365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-typesafe-ffi/src/lib.rs:237-243 | crates/ruvector-typesafe-wasm/src/lib.rs:155-161 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-typesafe-ffi/src/lib.rs:237\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-ffi/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac2bd17f92c98de4c0cc16584f1031d9f43674c60416400abbccf4485c96412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvix/crates/boot/src/attestation.rs:127-133 | crates/ruvix/crates/proof/src/attestation.rs:297-303 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/boot/src/attestation.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/attestation.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"61df5465d0ed8c0a1b374caa4a7d5aa695c0f69fa41f2dd70f5ca5808ec97455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvix/crates/cli/src/commands/dtb.rs:400-407 | crates/ruvix/crates/cli/src/commands/dtb.rs:532-538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21b04dc989c1746ada1f06d5823992e97753e5dbc9ff6ab175a411b6578f69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm-cli/src/commands/info.rs:139-145 | crates/ruvllm-cli/src/commands/list.rs:175-181 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm-cli/src/commands/info.rs:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/info.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"408fff80fb2f4a9c3713a15648c779c5c6bc8bc49fbde36a7a4ed4b56fe53570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/ruvllm/src/backends/candle_backend.rs:1670-1678 | crates/ruvllm/src/backends/lattice_backend.rs:856-863 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/candle_backend.rs:1670\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd839a56f864ca93b294240d62caa6ee253d12c350a0a92b62ab9fcde4ce74d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvllm/src/backends/mistral_backend.rs:532-540 | crates/ruvllm/src/backends/mistral_backend.rs:556-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7eef962e6944ebaf62d2f330d14d64a2c0b734faf2a2b065d14b78b6b080da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:2283-2289 | crates/ruvllm/src/bitnet/backend.rs:3394-3400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:2283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9eb1b44518317bfff4f1d4e5a040a62cb30b19e87ffa316c6343c3eb2cc5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/bitnet/trace.rs:125-131 | crates/rvf-forge-core/src/canonical.rs:141-147 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/trace.rs:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf-forge-core/src/canonical.rs:148\u0060 calls \u0060push_str\u0060 and \u0060crates/ruvllm/src/bitnet/trace.rs:132\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/trace.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed0df69aaea28485638b2eb717be5ac06bab889d854a37d7fe005e2661351bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/claude_flow/agent_router.rs:147-154 | crates/ruvllm/src/claude_flow/hnsw_router.rs:554-561 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/claude_flow/agent_router.rs:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/agent_router.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"15eb8d0a5bfba728f9d5e882bb6d8872a70fe97b0f904ec2399dbbf9b2dc202c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/ruvllm/src/context/episodic_memory.rs:524-529 | crates/ruvllm/src/context/episodic_memory.rs:532-538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/context/episodic_memory.rs:524\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/episodic_memory.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5eae4de8ad2839f85e93b4d6913bb10c918f4e03bc50a2439380ea5fa72f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/kernels/attention.rs:1222-1229 | crates/ruvllm/src/kernels/attention.rs:1255-1262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/attention.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d060273262f99f5a29002c477a5d3b981daf7d862dfc6f796cfb72163069978c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 6): crates/ruvector-postgres/src/operators.rs:369-370 | crates/ruvector-typesafe-train/src/train/eval.rs:30-31 | crates/ruvllm/src/backends/mistral_backend.rs:1443-1444 | crates/ruvllm/src/kernels/attention.rs:1425-1431 | crates/ruvllm/src/kv_cache.rs:968-975 | crates/ruvllm/src/paged_attention.rs:458-459 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/attention.rs:1425\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/kernels/attention.rs:1431\u0060 calls \u0060iter\u0060, \u0060cloned\u0060, \u0060fold\u0060 and \u0060crates/ruvector-postgres/src/operators.rs:370\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/operators.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc44a299a726a79ad70c325c1d236d3d990b54b6ebc9565db7b908a7125364ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/kernels/matmul.rs:730-736 | crates/ruvllm/src/kernels/matmul.rs:770-776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/matmul.rs:730\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82af678eae4b0849bc36afbd0d07225c0ac55d14fc219a7c6281e186d392fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/models/openmythos/attention.rs:327-333 | crates/ruvllm/src/models/openmythos/attention.rs:416-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/attention.rs:327\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/attention.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0126af35c589ea41707dddfd2d3974a4f09c070077d7f46814fee0003d228b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/models/openmythos/mod.rs:404-410 | crates/ruvllm/src/models/rdt.rs:805-811 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/openmythos/mod.rs\u0060 and \u0060crates/ruvllm/src/models/rdt.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/models/openmythos/mod.rs:404\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1734f6f0eb558ac4312800342afe3b50ac5963f33c2c95ecfbe9c3a10cea1ea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/store.rs:52-58 | crates/rvAgent/rvagent-backends/src/store.rs:69-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-backends/src/store.rs:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/store.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"828c76127e061e739638b20972d21b63447e18a96f547dce097f93cf7b19fb97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvAgent/rvagent-core/src/agi_container.rs:242-248 | crates/rvAgent/rvagent-wasm/src/rvf.rs:470-476 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/agi_container.rs\u0060 and \u0060crates/rvAgent/rvagent-wasm/src/rvf.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-core/src/agi_container.rs:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4634301cb2d7751454fd064504cd9faff42ce7b076c94fa57bfd6e50025cb983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvAgent/rvagent-core/src/agi_container.rs:253-259 | crates/rvAgent/rvagent-wasm/src/rvf.rs:487-493 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/agi_container.rs\u0060 and \u0060crates/rvAgent/rvagent-wasm/src/rvf.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/agi_container.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88032fe6c31e6c13130824109e4ce1123bf9dfd0e03ff107d52b9438c2826a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvf/rvf-cli/src/cmd/verify_attestation.rs:31-37 | crates/rvf/rvf-cli/src/cmd/verify_witness.rs:65-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-cli/src/cmd/verify_attestation.rs:31\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_attestation.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdd7104e5dee455bc444cc4a4886854ef56b613321327b2e7ea84b3ad40551b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:1103-1112 | crates/rvf/rvf-runtime/src/store/filtered_query.rs:332-338 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a2f05dc7d59f4981185cdc899a39d00318a38b7b864f2f0a6baf0393534e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvforge-reader/src/receipts.rs:126-133 | crates/rvforge-reader/src/witness_receipt.rs:161-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvforge-reader/src/receipts.rs:126\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/src/receipts.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca83250f419d1f9dd9d904739990ec78c61c661efcadddb47eb98a13f6a080b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvm/crates/rvm-hal/src/aarch64/mmu.rs:338-345 | crates/rvm/crates/rvm-hal/src/aarch64/mmu.rs:355-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/mmu.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"887285fbc0599dd4b48f76967d3282d2a33a59cbd04dbaa5c9201d020b23a2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvm/crates/rvm-security/src/gate.rs:213-219 | crates/rvm/crates/rvm-security/src/gate.rs:354-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-security/src/gate.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d652800c0254a7860ec60664bfafde4feb061cce1238506b87a76b8730174b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): edge/gateway/src/m3_ports.rs:100-106 | edge/gateway/src/m3_ports.rs:120-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060edge/gateway/src/m3_ports.rs:100\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":"edge/gateway/src/m3_ports.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adcf7034d379e73ee3f4d38e9ddb356d3c91ff27074f8e90bc6f6050400c8d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/accelerate.rs:355-361 | patches/candle-core-0.8.4/src/accelerate.rs:365-371 \u2014 both copies are in the same file, so extract the block 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 \u0060a\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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bff734dd9e33b4c869202471d39ee12fa88b97289967cc11db6a41784717783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:423-429 | patches/candle-core-0.9.2/src/backprop.rs:428-434 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8b040f21fb0d62eca61bf7e82ec854d9ae523e11d26614c537a0de6122fa4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1222-1243 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1330-1351 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9409314df13dcaea28814b213b48073142a40bdef06676d1401077bf23554626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1166-1172 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1508-1514 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0c644ae54c70ed83b05a36f3229bde1e7aa83f40585bbeea44385e54ea7a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1678-1685 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2203-2210 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1678\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e27d54583a747939b5aef8e071408844a60697b4a52314c7eb141421f5c8625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1687-1694 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2212-2219 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1687\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8774e0d0be34e2e2b66b702336f138bb9d6c732e958cdbb5712e03e6c99a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1696-1703 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2221-2228 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1696\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c6453119a6de16ce94d4368ca0343ac052e07b4b9e1599f998b58686df3338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:110-116 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:119-125 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae5c5533c0ca26180cb448bebef53724c4b916f6385de3e62370e548617686f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:165-171 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:180-186 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"104222deddf722e515c024f6cc68bc05b926a266a9ed1eca628b2d31b1a30d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:216-222 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:233-239 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11a6cd0e2ef7505d553b2c8abb95eac151fdb8c201ed1db966f304efced37c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1362-1368 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1482-1488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1362\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"601fc6a07565217042657b230855fabbb55b5f87b0a3075f1511d4063e269e7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2044-2050 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2043-2049 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e0573a03d9af06624b683110a9dc88509780aa8950ba92f11bbafe4155def6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2080-2086 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2080-2086 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bc13ebdfc8a4a5b8ebfc43931a96cd3aa227366b1627e576b94defb20d32e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:235-241 | patches/candle-core-0.9.2/src/npy.rs:252-258 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/npy.rs:235\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":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"843d18b4b2222d1c890ebb755c9dc772ea237f60b2043cff3519652d6fe9ed03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/op.rs:912-919 | patches/candle-core-0.9.2/src/op.rs:1077-1084 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"b514697ec5d337204dd812ec79daaccbd35f96ae2950a4764b5b5037d6921733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/avx.rs:231-237 | patches/candle-core-0.8.4/src/quantized/avx.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 \u0060patches/candle-core-0.8.4/src/quantized/avx.rs:231\u0060 it does not close everything it opens, so those exact 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 \u0060xs\u0060 to \u0060\u0026[BlockQ2K]\u0060 in one and \u0060\u0026[BlockQ3K]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/avx.rs:238\u0060 calls \u0060to_f32\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/avx.rs:326\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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"12452e8386f77cdc288ebe8906ca0f9698b2ddf843ff20c3f1b0264eac3d8bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:541-557 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:573-589 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:558\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:590\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d70e6f89212856919bd84e29a30af929329f0fde4b518c2e609ad7bc955d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1848-1854 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2323-2329 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13aa1dab25e46a29d2b3fb34674b48a6a128333d3f2127712296aad0f81ca69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:543-549 | patches/candle-core-0.9.2/src/quantized/mod.rs:874-880 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:543\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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"577b9315fbb05d1aacee062e7b3f6324e8ede12815d5b9df21deac225ee19680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/simd128.rs:130-141 | patches/candle-core-0.8.4/src/quantized/simd128.rs:142-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/simd128.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3944d3c0bf337e285cc46c14aa4674d3510a3fe370e8af98488f2232d5aeb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:220-236 | patches/candle-core-0.9.2/src/storage.rs:229-245 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b7311f7cfc5c639a25cd80c336d7367a9c6314760c1f430b9dc694575b60c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/streaming.rs:169-175 | patches/candle-core-0.9.2/src/streaming.rs:169-175 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/streaming.rs\u0060 and \u0060patches/candle-core-0.9.2/src/streaming.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"56441e39c7be9d35ccbbbce1966986ccecf82d1cb63d24771be57cbdf2e35900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1117-1123 | patches/candle-core-0.9.2/src/tensor.rs:1185-1191 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44105975a4eb74424ded6843c0f055d358665b8c6e6a040e44bbcb851038acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/cuda.rs:672-678 | patches/candle-core-0.9.2/src/quantized/cuda.rs:696-702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs:672\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/cuda.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f331408d922969892e88dff5e47f1a94b6dd0d099494fe81ac44740edd4eedf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/cuda.rs:667-674 | patches/candle-core-0.9.2/src/quantized/metal.rs:155-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060src\u0060 to \u0060\u0026CudaStorage\u0060 in one and \u0060\u0026MetalStorage\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":"patches/candle-core-0.9.2/src/quantized/cuda.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc60374ba28bf75f5ddd8f3eba1589bf191ffd217a91a8c9257805d5b4be113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/cuda.rs:691-698 | patches/candle-core-0.9.2/src/quantized/metal.rs:171-178 \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":"patches/candle-core-0.9.2/src/quantized/cuda.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"a357912fcc58760e83b0661b9ddfb1be149aeb2c965ad7680416bb5dbc88c70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:594-600 | scripts/patches/hnsw_rs/src/hnsw.rs:587-593 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:594\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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36b62095a008022542656dc3e213b03bccf70346992220bb4e9a35ce0e19fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:612-618 | scripts/patches/hnsw_rs/src/hnsw.rs:605-611 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:612\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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a96e0b87fc13fd88f17408343474213cc2cb7aeae203d62adbb02e0ff07c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): crates/ruvector-cnn/src/kernels/int8_avx2.rs:211-217 | crates/ruvector-cnn/src/kernels/int8_neon.rs:207-213 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:222-228 | crates/ruvector-cnn/src/simd/avx2.rs:332-338 | crates/ruvector-cnn/src/simd/avx2.rs:483-488 | crates/ruvector-cnn/src/simd/neon.rs:235-241 | crates/ruvector-cnn/src/simd/neon.rs:271-277 | crates/ruvector-cnn/src/simd/scalar.rs:123-129 | crates/ruvector-cnn/src/simd/wasm.rs:206-212 | crates/ruvector-cnn/src/simd/wasm.rs:246-251 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79fa10c57b95e8cb93efacf6c230a6bf9f9dd22ae8e886fd8eeb4c875f401c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:297-302 | crates/ruvector-fpga-transformer/src/quant/lut.rs:153-160 | crates/ruvector-mincut-gated-transformer/src/attention/window.rs:174-181 | crates/ruvector-mincut-gated-transformer/src/attention/window.rs:337-343 | crates/ruvector-mincut-gated-transformer/src/kv_cache/manager.rs:318-323 | crates/ruvector-mincut-gated-transformer/src/sparse_attention.rs:431-437 | crates/ruvllm/src/kernels/ane_ops.rs:640-646 | crates/ruvllm/src/kernels/attention.rs:1064-1070 \u2014 before extracting anything, compare \u0060crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs\u0060 and \u0060crates/ruvector-fpga-transformer/src/quant/lut.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb83de6d3cb3f09e55d709e43d3badcbd346da4f0a7cfdb208529d49210ef11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): crates/ruvllm/src/metal/context.rs:471-476 | crates/ruvllm/src/metal/context.rs:546-551 | crates/ruvllm/src/metal/context.rs:615-620 | crates/ruvllm/src/metal/context.rs:680-685 | crates/ruvllm/src/metal/context.rs:728-733 | crates/ruvllm/src/metal/context.rs:797-802 | crates/ruvllm/src/metal/context.rs:887-892 | crates/ruvllm/src/metal/context.rs:960-965 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/metal/context.rs:543\u0060 calls \u0060create_buffer\u0060 and \u0060crates/ruvllm/src/metal/context.rs:612\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2a2593ef1d4fbbaf299c4cef3f78269ffbd2d53bad726ada762e4958acb0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 9): crates/prime-radiant/src/ruvllm_integration/traits.rs:357-364 | crates/prime-radiant/src/storage/file.rs:562-567 | crates/prime-radiant/src/storage/memory.rs:203-210 | crates/prime-radiant/src/storage/postgres.rs:868-875 | crates/ruvector-attention-wasm/src/utils.rs:25-27 | crates/ruvector-core/src/advanced_features/graph_rag.rs:496-501 | crates/ruvector-postgres/src/routing/router.rs:417-421 | crates/ruvllm/src/quality/coherence.rs:694-701 | crates/ruvllm/src/quality/diversity.rs:745-752 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 9 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 9 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/ruvllm_integration/traits.rs:357\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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, \u0060crates/ruvector-postgres/src/routing/router.rs:423\u0060 calls \u0060max\u0060, \u0060min\u0060 and \u0060crates/prime-radiant/src/ruvllm_integration/traits.rs:367\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/traits.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59775c58fdc80c05e46062c359a22fac7ca4552fe68c044903fcf2eefa222f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/ruvector-coherence-hnsw/src/coherence.rs:23-28 | crates/ruvector-core/src/distance.rs:67-72 | crates/ruvector-core/src/integration.rs:299-304 | crates/ruvector-maxsim/src/score.rs:22-27 | crates/ruvector-maxsim/src/score.rs:95-100 | crates/ruvector-temporal-tensor/src/agentdb.rs:82-88 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-coherence-hnsw/src/coherence.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db9c3851c904eef290ebc2263bc053376d7ef192c60610ce9f09fa3863595c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/ruvector-core/src/simd_intrinsics.rs:1363-1369 | crates/ruvector-core/src/simd_intrinsics.rs:1404-1409 | crates/ruvector-postgres/src/quantization/binary.rs:95-101 | crates/ruvector-postgres/src/quantization/scalar.rs:120-126 | crates/ruvector-postgres/src/types/scalarvec.rs:248-255 | crates/ruvector-turboquant/src/simd.rs:250-255 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/scalar.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:1363\u0060 it does not close everything it opens, so those exact 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 \u0060a\u0060 to \u0060\u0026[i8]\u0060 in one and \u0060\u0026[u8]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a540bb8c1f72dee679d8d8255f6296625d4cfa3fb58613ce53b35aff446971a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/ruvector-postgres/src/distance/simd.rs:481-487 | crates/ruvector-postgres/src/distance/simd.rs:997-1002 | crates/ruvector-postgres/src/types/halfvec.rs:372-377 | crates/ruvector-postgres/src/types/halfvec.rs:436-441 | crates/ruvector-postgres/src/types/halfvec.rs:488-493 | crates/ruvector-postgres/src/types/productvec.rs:230-236 \u2014 there are 6 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:481\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e05a181d6f32453c85e5fe50891f6339d1217456538566371e363c1909fbc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): patches/candle-core-0.8.4/src/conv.rs:180-185 | patches/candle-core-0.8.4/src/conv.rs:246-251 | patches/candle-core-0.8.4/src/conv.rs:304-309 | patches/candle-core-0.9.2/src/conv.rs:195-200 | patches/candle-core-0.9.2/src/conv.rs:261-266 | patches/candle-core-0.9.2/src/conv.rs:331-336 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/conv.rs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"070bc8d82ab521a6838157248cd09acd7b6497196d8b559e5be2d91d161a571d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1264-1269 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1331-1336 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1422-1427 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1372-1377 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1448-1453 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1539-1544 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e621abd7a19d001923fe97b94a7a5c16f662e0b4cc23cd7418716ea4572af10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:84-89 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:116-121 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:241-246 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:110-115 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:141-146 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:272-277 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95201ed4cba23b58e155f6d3d4fdedb5928fbfbd4008c65ec45bb9ff068a91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/ruvector-attention/src/curvature/fused_attention.rs:319-324 | crates/ruvector-attention/src/pde_attention/diffusion.rs:223-228 | crates/ruvector-attention/src/topology/gated_attention.rs:281-286 | crates/ruvector-attention/src/transport/centroid_ot.rs:328-333 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:317-322 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 and \u0060crates/ruvector-attention/src/pde_attention/diffusion.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/fused_attention.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e72db499ba6472f38cc35a482481c0c25ca265d692734a74321e0020e7970e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/ruvllm/src/metal/context.rs:129-136 | crates/ruvllm/src/metal/context.rs:258-265 | crates/ruvllm/src/metal/context.rs:540-547 | crates/ruvllm/src/metal/context.rs:881-888 | crates/ruvllm/src/metal/context.rs:954-961 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"088a14d90ddc4f58efd2df20cef9178b2758998be318e34565b74210035bc05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:486-491 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:534-539 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:539-544 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:593-598 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:645-650 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:486\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f952c938053672c5cba1050760fde271af2828b8c8e3ce3ca06deab8a021b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:782-787 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:828-833 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:907-912 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:952-957 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:998-1003 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:782\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dd8a37e649579605144b250b7b64a88b80dede7b696ef64a11a0abc58d5a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1214-1219 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1411-1416 | patches/candle-core-0.8.4/src/quantized/simd128.rs:225-230 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1416-1421 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1677-1682 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/simd128.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 83 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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc278ec31af883eba1dd6f73729c99065380aa6a97a25bde12bdeb3b87e8055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ruvector-kge-ffi/src/ops.rs:62-67 | crates/ruvector-kge-wasm/src/ops.rs:62-67 | crates/ruvector-robotics/src/bridge/indexing.rs:105-110 | crates/ruvector-temporal-coherence/src/lib.rs:100-105 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/ops.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/ops.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 247 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed1d16a95a007f2436588678260fe3e267de2fb7edaecdeaba97c72f9e48acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ruvector-streaming-qng/src/dataset.rs:35-41 | crates/ruvector-streaming-qng/src/dataset.rs:53-58 | crates/ruvector-streaming-qng/src/dataset.rs:70-75 | crates/ruvector-streaming-qng/src/dataset.rs:87-92 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-streaming-qng/src/dataset.rs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/dataset.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2a80ab56be1f520e80cee39ce7a6b4afff7373a9d9c1441f95ef0c59a6cf4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ruvllm/src/backends/gemma2.rs:564-569 | crates/ruvllm/src/backends/phi3.rs:442-447 | crates/ruvllm/src/models/ruvltra.rs:738-743 | crates/ruvllm/src/models/ruvltra_medium.rs:718-723 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/backends/phi3.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 222 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/gemma2.rs:564\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026Gemma2Config\u0060 in one and \u0060\u0026Phi3Config\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/models/ruvltra.rs:744\u0060 calls \u0060uses_ane\u0060, \u0060is_ane_optimized\u0060 and \u0060crates/ruvllm/src/backends/gemma2.rs:570\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"876ae416c1d4517263f6ef213dcb3783ca7f52f604cf29e6690b97b89e67702e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ruvllm/src/kv_cache.rs:468-475 | crates/ruvllm/src/kv_cache.rs:540-545 | crates/ruvllm/src/kv_cache.rs:603-610 | crates/ruvllm/src/kv_cache.rs:709-715 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kv_cache.rs:468\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060values\u0060 to \u0060\u0026[f32]\u0060 in one and \u0060\u0026[f32]) -\u003E (f32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5459fa5d86a0d67a34eee6e232619aafadc601d0767b5cfe1fe32121f0e6fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ruvllm/src/quality/coherence.rs:743-748 | crates/ruvllm/src/quality/scoring_engine.rs:863-868 | crates/ruvllm/src/reasoning_bank/distillation.rs:196-201 | crates/ruvllm/src/reflection/error_recovery.rs:377-382 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/quality/coherence.rs\u0060 and \u0060crates/ruvllm/src/quality/scoring_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quality/coherence.rs:743\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/quality/scoring_engine.rs:860\u0060 calls \u0060to_lowercase\u0060 and \u0060crates/ruvllm/src/quality/coherence.rs:741\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9405fe319dc3c691d552faaf23e782a95d56213b446613e2185a87c12ba379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu/mod.rs:74-79 | patches/candle-core-0.8.4/src/cpu/mod.rs:116-121 | patches/candle-core-0.9.2/src/cpu/mod.rs:93-98 | patches/candle-core-0.9.2/src/cpu/mod.rs:135-140 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu/mod.rs:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc2b437a28a9a0841bb9433a03004ac0a64779ebf408b822e27ba314ef446a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:648-653 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:667-673 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:841-846 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:863-869 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd75a06efb018f6a1b90a405a8fdc3d95f8ecdf152573ff847e674e2f92ba338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1475-1480 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1073-1079 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1967-1972 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1125-1131 \u2014 \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 59 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:1073\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff8b4b0b361251c7f8a8a6baab3d21e2496098e77c29a2c4cfa7e2d35587d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:410-415 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:678-683 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:438-443 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:729-734 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:410\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"817e5427a5dff57e7cda54d63fc9a58f48116e213bc362a5d6fe268ace522a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1318-1328 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1536-1546 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1584-1594 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1882-1892 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1318\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1c0a380af2ed6162d722d811520e680d5d4995149a49c8dc446240493b5da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/candle-core-0.8.4/src/tensor.rs:1633-1638 | patches/candle-core-0.8.4/src/tensor.rs:1664-1669 | patches/candle-core-0.9.2/src/tensor.rs:1957-1962 | patches/candle-core-0.9.2/src/tensor.rs:1988-1993 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1633\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d581214fece859a016ac81d27a6c3afd91ec3977ca6fa2bc9101023b70788d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/hnsw_rs/src/hnsw.rs:590-595 | patches/hnsw_rs/src/hnsw.rs:608-613 | scripts/patches/hnsw_rs/src/hnsw.rs:583-588 | scripts/patches/hnsw_rs/src/hnsw.rs:601-606 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:590\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d106f372d95c2171fec26118d1460810f4576fd0638b4e0b8e0dea8f71d3d20e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/hnsw_rs/src/libext.rs:920-925 | patches/hnsw_rs/src/libext.rs:972-977 | scripts/patches/hnsw_rs/src/libext.rs:920-925 | scripts/patches/hnsw_rs/src/libext.rs:972-977 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/libext.rs:920\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25cd7c251aceb6f13a7534a1c9c653ece9c9b0e9d111bfb32509950ec0192c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-core/src/encoding/codecs.rs:271-276 | crates/ruvector-core/src/quantization.rs:48-55 | crates/ruvector-core/src/quantization.rs:300-307 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/encoding/codecs.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"04acb3e2a48d9ae6f8e7be4739aede328dd90e2b0adfcd32e2869790f7ccae64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-fpga-transformer/src/backend/native_sim.rs:464-469 | crates/ruvector-kge/src/train/loss.rs:35-40 | crates/ruvllm/src/kernels/activations.rs:603-609 \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":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8934172c798c41391d29fb71268415a8c06619bda5766d34c5ce734bf2d1508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:152-158 | crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:266-272 | crates/ruvector-mincut/src/canonical/tree_packing/mod.rs:132-138 \u2014 \u0060crates/ruvector-mincut/src/canonical/source_anchored/mod.rs\u0060 and \u0060crates/ruvector-mincut/src/canonical/tree_packing/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 119 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44b403642fc6eb5d07e3af593060b358c878a6764744e829bc1271eaa7dd08d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-postgres/src/attention/flash.rs:353-358 | crates/ruvector-postgres/src/attention/multi_head.rs:336-341 | crates/ruvector-postgres/src/attention/scaled_dot.rs:297-303 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/flash.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebe137568eeb681d6a753327e498bc126e63cb3b54a4a4317453afbab0a80ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-postgres/src/distance/simd.rs:526-532 | crates/ruvector-postgres/src/distance/simd.rs:1396-1401 | crates/rvf/rvf-index/src/distance.rs:119-124 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:526\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbc2f43edcd24a4172624f056eba22a6dc3cec875e1ab9822bd88ec7bbaa750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/ruvector-postgres/src/graph/sparql/executor.rs:332-337 | crates/ruvector-postgres/src/graph/sparql/executor.rs:926-932 | crates/rvlite/src/sparql/executor.rs:244-249 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"048bab58e7fe26ce8f00d91e5b715d44b1c9be8dd751487f34a932a42e1ef1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-postgres/src/graph/sparql/executor.rs:422-427 | crates/ruvector-postgres/src/graph/sparql/executor.rs:1740-1745 | crates/rvlite/src/sparql/executor.rs:366-371 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed9f89460bc0dc72b04b48138742d2afcfec99c8840f792dc049df3144152e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-postgres/src/index/hnsw_am.rs:511-516 | crates/ruvector-postgres/src/index/hnsw_am.rs:532-537 | crates/ruvector-postgres/src/index/hnsw_am.rs:577-582 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"166723fd36246565cb16a7dd40b95580ec55fa515244775f5b4a877b1bddb327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvix/crates/net/src/stack.rs:280-285 | crates/ruvix/crates/net/src/stack.rs:328-333 | crates/ruvix/crates/net/src/stack.rs:505-510 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/net/src/stack.rs:280\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/stack.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70771f27500a4256232c71daa6228517b1c7ff028d4decfbe77874296a1dd06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvllm/src/metal/context.rs:527-534 | crates/ruvllm/src/metal/context.rs:860-865 | crates/ruvllm/src/metal/context.rs:931-936 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d9cd1ee49aadd0408c82deec90ae92cedf61eed6786f72e397c3034c9d4ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvllm/src/metal/context.rs:536-541 | crates/ruvllm/src/metal/context.rs:876-882 | crates/ruvllm/src/metal/context.rs:949-955 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/metal/context.rs:876\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/context.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7263a9c90884ace05689ab3517592bae3a3b55634bc85d0f18b2eeafb5a16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:478-483 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:615-620 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:675-680 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:478\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6966d4272d750273b911322ac8b3a1939b76441ccb9b0bbb9117c2e8e46939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1528-1533 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1833-1838 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2018-2023 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1528\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f615a5f49df9e8de0ed193a56376a4493525951603d5a3b1a01661357a6a9c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1539-1544 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1844-1849 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2029-2034 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1539\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aafc59ae9b0a0263c510d19fcf86eb560a88acc2bfb92a539a29d7252bd1b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1547-1552 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1852-1857 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2037-2042 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1547\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e11873631d848d463cce29311761c29b0746faf4f19e5dd9b2c64c484ef35a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1555-1560 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1860-1865 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2045-2050 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1555\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45053f4ec6863b493c2f69debfbbcaef1b0b01dca735292ebe4f34b5dd702d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/emergent-time/src/agentic_time.rs:568-574 | crates/emergent-time/src/weight_learning.rs:127-132 \u2014 before extracting anything, compare \u0060crates/emergent-time/src/agentic_time.rs\u0060 and \u0060crates/emergent-time/src/weight_learning.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92813af43ccc3c4ec4cffbd4f8f392f21cfa137eb9a63e03f3aacc4317d0f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/emergent-time/src/complex_matrix.rs:188-193 | crates/emergent-time/src/complex_matrix.rs:197-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/emergent-time/src/complex_matrix.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":"crates/emergent-time/src/complex_matrix.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9269a7dd4ec1c7aa8e85dd4dbf116274ac9f3ec03049878b1dfca9bf8c5d30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:2467-2473 | crates/mcp-brain-server/src/routes.rs:2474-2480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57032ec36ae4976a02ee53f33c6463889d45344260aac23292dc6c2be03dd59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/mcp-brain/src/embed.rs:312-317 | crates/ruvector-attention/src/curvature/fused_attention.rs:269-274 | scripts/seed-brain.rs:255-258 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain/src/embed.rs:312\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/embed.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d1427c3de02116ac9ba6e607cf079f73d7311cf2d81842f665c7d7064cb57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 12): crates/mcp-brain/src/embed.rs:408-413 | crates/prime-radiant/src/attention/adapter.rs:166-166 | crates/prime-radiant/src/attention/diffusion.rs:250-250 | crates/prime-radiant/src/attention/topology.rs:229-229 | crates/ruvector-attention/src/topology/coherence.rs:266-266 | crates/ruvector-cnn-wasm/src/lib.rs:177-177 | crates/ruvector-crv/src/stage_ii.rs:172-177 | crates/ruvector-diverse-beam/src/lib.rs:64-64 | crates/ruvector-query-cache/src/lib.rs:110-110 | crates/ruvector-spann/src/distance.rs:23-23 | crates/ruvllm-wasm/src/hnsw_router.rs:302-302 | crates/ruvllm/src/qat/reasoning_loss.rs:396-396 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 12 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 12 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain/src/embed.rs:408\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/embed.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d27e008c9f7c660a0b3fe2a8af2ffd5942a914b82b5d43104882913c81c0a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 4): crates/prime-radiant/src/attention/adapter.rs:122-127 | crates/ruvector-attention/src/topology/gated_attention.rs:196-201 | crates/ruvector-gnn/src/search.rs:88-88 | crates/ruvllm/src/bitnet/backend.rs:2232-2232 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/attention/adapter.rs\u0060 and \u0060crates/ruvector-attention/src/topology/gated_attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4ac355d1f069888d8df8eda94d7ba2aca59818504923ecaf16967d55268828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/prime-radiant/src/coherence/energy.rs:526-531 | crates/prime-radiant/src/substrate/restriction.rs:549-554 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/coherence/energy.rs:526\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/coherence/energy.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf0e7df94292ef3017960baf69013f5f6c83b360b9b98158ba82e65c2d323fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/prime-radiant/src/simd/energy.rs:254-259 | crates/prime-radiant/src/simd/vectors.rs:90-95 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/simd/energy.rs:254\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e1bf43ca0e1858545a664a2505c9562cb46aef4ea94ed6bdc845f9e7c94950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/prime-radiant/src/substrate/graph.rs:643-649 | crates/prime-radiant/src/substrate/mod.rs:138-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/substrate/graph.rs:643\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/graph.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafbe8c2976081fefb2f22460e1ecdf132f2793d6b59a6167c57a7a3c53a1c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/prime-radiant/src/substrate/node.rs:53-58 | crates/ruvector-attention/src/transport/cached_projections.rs:29-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/transport/cached_projections.rs:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/node.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f0bc987e097d10d5aa6a7e2513873f0ba6c03a2267ca055dc7d58350ca5652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/prime-radiant/src/substrate/restriction.rs:67-73 | crates/ruvector-solver/src/types.rs:301-306 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/substrate/restriction.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/restriction.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbfd539e2e8ae9d3fefbf67da064253258dc9e4b7c33c0e4642267a44187b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruos-thermal/src/lib.rs:206-211 | crates/ruos-thermal/src/lib.rs:225-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruos-thermal/src/lib.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruos-thermal/src/lib.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8e44f9cc0e80cfa9ce4d7a0771d393246c0e8c1c5ce9b659008c29ff8c1bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/lorentz_cascade.rs:131-136 | crates/ruvector-graph-transformer/src/manifold.rs:1250-1255 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/hyperbolic/lorentz_cascade.rs:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/lorentz_cascade.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"417e4471d38693911a12579c492461ffc2a6386f2c2bf3e5a8228bf17adea228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/poincare.rs:48-53 | crates/ruvector-graph-transformer/src/manifold.rs:1174-1179 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb8489232405463c3d6e9d157f312f5b6cdfced63e706649ff259d80c8a6b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/poincare.rs:164-169 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:520-525 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/hyperbolic/poincare.rs\u0060 and \u0060crates/ruvector-hyperbolic-hnsw/src/poincare.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad93a4679e2a3cb30f95d8f68b3a0160f1a203ed6203323317a87be8c35cc73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-attention/src/moe/moe_attention.rs:126-131 | crates/ruvector-attention/src/moe/moe_attention.rs:168-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/moe/moe_attention.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb74949a3e118305be0593b73475410c169c8f9484e54beeabbb9d3c014a94a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-attention/src/utils.rs:189-194 | crates/ruvector-attention/src/utils.rs:260-265 \u2014 both copies are in the same file, so extract the block 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":"crates/ruvector-attention/src/utils.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"69130e0ed6cdf751755f678f1f59ab4803593e8c7eb221846c6363e176de67c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/ruvector-bet4-ivf-bench/src/kernel.rs:244-249 | crates/ruvector-bet4-ivf-bench/src/kernel.rs:294-299 | crates/ruvector-bet4-ivf-bench/src/pq.rs:229-231 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bet4-ivf-bench/src/kernel.rs:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/kernel.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb20cabf2ee1a05ea0e11fe46e8d1ada9283d7a8e265886a61c05e9142edc105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-cnn/src/layers/conv.rs:114-119 | crates/ruvector-cnn/src/layers/conv.rs:157-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db20bfae4b5def7c7b60b3fbbce232dd22e72a99147132fda45bd7f855ee49e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-cnn/src/layers/conv.rs:480-485 | crates/ruvector-cnn/src/layers/conv.rs:487-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f5f6ab0c34fe5ca397f66413e510b5572392de9ec632b14279abe35d393946"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 3): crates/ruvector-cnn/src/layers/quantized_conv2d.rs:156-161 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:142-147 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:148-148 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/quantized_depthwise.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs:156\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fdad2e0f1cb10ddc7cb611387aead89200ee6acb86b68a69359338db39fb01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-cnn/src/layers/quantized_conv2d.rs:253-258 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:207-212 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/quantized_depthwise.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs:253\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cfdaa2f59b30a973f448ce71e74a0a09779b22b9abc7bc40c6e36e56193ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-cnn/src/simd/scalar.rs:344-349 | crates/ruvector-cnn/src/simd/scalar.rs:383-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/scalar.rs:344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/scalar.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f234415971256f8f124a53d257c3ca2832af4381cad5a03c21712515b5b02479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-coherence-hnsw/src/dataset.rs:133-138 | crates/ruvector-coherence-hnsw/src/graph.rs:93-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-coherence-hnsw/src/dataset.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":"crates/ruvector-coherence-hnsw/src/dataset.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"910f3a0f2d8c915672fd167db07c12ef9d683626c33bf3345557415ee8d777c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-consciousness/src/bounds.rs:84-89 | crates/ruvector-consciousness/src/sparse_accel.rs:71-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/bounds.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5814ff26160b8a2ad3261a7d4983cce543d4fe2bd5494e7445f2329f6535bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-consciousness/src/phi.rs:406-411 | crates/ruvector-consciousness/src/phi.rs:439-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c04191d2a494ad3221803926ed8ca528fde966d38b409aa8aac9b67a9974400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-consciousness/src/rsvd_emergence.rs:160-165 | crates/ruvector-consciousness/src/rsvd_emergence.rs:204-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/rsvd_emergence.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d438a4c1de04263646841f041ff13a3dcb103137ee1039f67d01f8d4cfa437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-core/src/agenticdb.rs:1120-1125 | crates/ruvector-core/src/agenticdb.rs:1148-1154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b806f7921e81d23e0a8c0c063e2c7f7b318f7de3466e6f84906e6784502006b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-core/src/cache_optimized.rs:328-333 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:408-413 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/cache_optimized.rs:328\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/cache_optimized.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3247c1a54696817798813e3d55c1881115b34fa07fa668129280967070f58bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-core/src/embeddings.rs:758-763 | crates/ruvllm/src/backends/candle_backend.rs:290-295 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/embeddings.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"280a54334b527795fb34b8acfbc8ebd34631dca767a4796014091f841ea2c04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-core/src/index/flat.rs:48-53 | crates/ruvector-core/src/index/flat.rs:60-65 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/index/flat.rs:48\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/index/flat.rs:46\u0060 calls \u0060par_bridge\u0060 and \u0060crates/ruvector-core/src/index/flat.rs:58\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/flat.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"096da21e2983396d020ca0c33e78b3e35b7ad558a1cb7ab664294e7e03239292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-core/src/storage.rs:195-202 | crates/ruvector-graph/src/storage.rs:203-210 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/storage.rs\u0060 and \u0060crates/ruvector-graph/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc18d76dfad9d4d9c56b7deec7fd8b7b5d0a342b2841bd25432cee2c81d234fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-diverse-beam/src/lib.rs:65-70 | crates/ruvllm/src/qat/reasoning_loss.rs:398-403 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diverse-beam/src/lib.rs:65\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/lib.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b545ffd64348343db07a859b885a716fecb6336262252bb9104e1a3f614577b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-diverse-beam/src/search.rs:103-108 | crates/ruvector-diverse-beam/src/search.rs:260-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-diverse-beam/src/search.rs:267\u0060 calls \u0060with_capacity\u0060 and \u0060crates/ruvector-diverse-beam/src/search.rs:111\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/search.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e345de72e1080309b00983e02ac068856eb7d1f7f8d9bef4fcfba079f77520dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-fpga-transformer/src/artifact/pack.rs:134-139 | crates/ruvector-fpga-transformer/src/artifact/pack.rs:152-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/artifact/pack.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/artifact/pack.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69b860e04161cfc404586824b91ab426f1effdea85ab0348d64033ce4ccb9a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-gnn-rerank/src/main.rs:81-88 | crates/ruvector-rairs/src/main.rs:49-56 \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":"crates/ruvector-gnn-rerank/src/main.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2960b8cba8ec6829b728bea488d2cc0b658838f371b23135d8b54a86d66b0d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-gnn/src/cold_tier.rs:114-121 | crates/ruvector-gnn/src/cold_tier.rs:137-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-gnn/src/cold_tier.rs:114\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/cold_tier.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2501fb4df8c21867761166ffd862813a104eb73d735eca13c3800ea2c9e65227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-gnn/src/cold_tier.rs:312-318 | crates/ruvector-graph-transformer/src/self_organizing.rs:570-576 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/cold_tier.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"31279b7a5c1f8b1af41629f8f7a89f944b81a64b248a6631602516a9157c671f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 4): crates/ruvector-attention/src/attention/flash.rs:507-508 | crates/ruvector-gnn/src/layer.rs:201-206 | crates/ruvector-graph-transformer/src/economic.rs:149-154 | crates/ruvector-py/src/gnn.rs:426-429 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-gnn/src/layer.rs:201\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-graph-transformer/src/economic.rs:154\u0060 calls \u0060iter\u0060, \u0060copied\u0060, \u0060fold\u0060 and \u0060crates/ruvector-attention/src/attention/flash.rs:508\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/flash.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4673b267e02ddedbcc4df2d8db5aaaff61e19297e3e4dc8419b9feb3c8232eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-graph-condense/src/cutloss.rs:96-105 | crates/ruvector-graph-condense/src/gnn_eval.rs:276-285 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-condense/src/cutloss.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":"crates/ruvector-graph-condense/src/cutloss.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93bf224c95d8cac9170e9704d06793054d9735c113689ffd06926ad9741af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): crates/ruvector-graph-node/src/lib.rs:677-680 | crates/ruvector-graph-node/src/lib.rs:710-713 | crates/ruvector-graph-node/src/lib.rs:1024-1029 | crates/ruvector-graph-node/src/lib.rs:1084-1089 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/lib.rs:677\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d01493a04006b741807642b29c931b169858c2dd6452d1deff2aa48b2c568a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-graph-transformer/src/physics.rs:412-417 | crates/ruvector-graph-transformer/src/physics.rs:595-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer/src/physics.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa0a46a7c1c60e4107990a8dbd5ef48f9c3721e0d37c3813e7b56644c04df56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-graph/src/cypher/ast.rs:401-412 | crates/rvlite/src/cypher/ast.rs:401-412 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/ast.rs\u0060 and \u0060crates/rvlite/src/cypher/ast.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/ast.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d026b56839628eb97d6879a0983d752ce2ca1de2cde7dd4d695fe39e575acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-math/src/homology/filtration.rs:135-140 | crates/ruvector-math/src/homology/filtration.rs:220-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/homology/filtration.rs:135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/filtration.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74adb8cc74f0ba220e80c90c54e174975242c278654b5d5dfcbe9a13a101799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-math/src/optimization/sdp.rs:172-178 | crates/ruvector-math/src/optimization/sos.rs:243-249 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-math/src/optimization/sdp.rs:170\u0060 calls \u0060project_psd\u0060 and \u0060crates/ruvector-math/src/optimization/sos.rs:240\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/sdp.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea2b416dcee8d58067a53ed6f2231fcb3db8c5d3e51601dadf9a3c50e0241f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-math/src/product_manifold/manifold.rs:469-474 | crates/ruvector-math/src/spherical/mod.rs:243-248 \u2014 before extracting anything, compare \u0060crates/ruvector-math/src/product_manifold/manifold.rs\u0060 and \u0060crates/ruvector-math/src/spherical/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/product_manifold/manifold.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7c6a7feb039937b2fe2fff24be933c665deb1a2994cd95a51b489c043b394a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-math/src/utils/sorting.rs:5-10 | crates/ruvector-typesafe-train/src/train/eval.rs:58-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/utils/sorting.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"781c321c5a7563740938f4696861a4e2c264df7608d66d6b985d149943cec36d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs:229-235 | crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs:360-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs:229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/spike_driven.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961c8a20d963e96f8d4e256e04d16465aaf4e02fad13fc3ab2d5c97ba15fd34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:129-134 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:521-526 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs:129\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kernel/norm.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e03062c9af50f0d630b658b4e02fbd5df05cb3ab4a8e27f5115cbafa86dbcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:144-149 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:482-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.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":"crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a480d5aa050ff3eb0adcef6817c36910bd8fc3923f414d151cfb5b2eeca802a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs:66-71 | crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:154-159 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060HotBufferConfig\u0060 in one and \u0060QuantizedStoreConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/hot_buffer.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67499dc246f5b52bd955f687ad6f295bcb52b45cfc7a22b9487aba19808c1f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs:377-382 | crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs:415-420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs:377\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/legacy.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75a8e84ceff0aa205285449f13a222caa431a4717f30478e912132e6eb69328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut/src/algorithm/replacement.rs:104-109 | crates/ruvector-mincut/src/algorithm/replacement.rs:259-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/algorithm/replacement.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e6b7bc89ba6be29d4df8324f78d882739c0f975aa99603cb1dbbd7aec20a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-mincut/src/canonical/mod.rs:359-365 | crates/ruvector-mincut/src/canonical/mod.rs:375-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/canonical/mod.rs:359\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a30d8dfcaeae20567125ec15d33c6cdc629e16f7458f0d72aee53fae7efafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut/src/expander/mod.rs:443-448 | crates/ruvector-mincut/src/expander/mod.rs:471-476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/expander/mod.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":"crates/ruvector-mincut/src/expander/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15366b0ddaa62101ebe7a7b27d7e812aa4bea637c3a783cdab0abf8fdcae32d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-mincut/src/snn/optimizer.rs:209-215 | crates/ruvector-mincut/src/snn/optimizer.rs:252-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/snn/optimizer.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":"crates/ruvector-mincut/src/snn/optimizer.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d847d6a06a69e03800688ab019d9897c4f57bbefac2ff0cd515e54c277eb8f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-perception/src/coherence.rs:40-46 | crates/ruvector-perception/src/engine.rs:150-156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-perception/src/coherence.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfc880337282f703402e445eb2bd8568ff409215e83f48155c9184ceba0c2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/attention/operators.rs:677-682 | crates/ruvector-postgres/src/attention/operators.rs:788-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/attention/operators.rs:677\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a1f8637106423a5da99631084f54add2645c5f2d5bf5997791f4ddab6ae12c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:857-862 | crates/ruvector-postgres/src/distance/simd.rs:945-951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:857\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9207767e682e47a9c7eb71c41fb04f3ad887a129f69dc50115de14482612d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:879-884 | crates/ruvector-postgres/src/distance/simd.rs:965-971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:879\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a1848a08ba23cb3cd3436319ef8b6270b9327a5ed098238b0a4836b1d9e684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/distance/simd.rs:1061-1066 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:439-444 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"577a218c5ef0765df38e93f75aca2ff6852f82bf2252a11224421e2ac84acc4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/graph/cypher/parser.rs:156-162 | crates/ruvector-postgres/src/graph/cypher/parser.rs:234-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/cypher/parser.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf537f4fcaf29c80f60e3875b2f5e75b7f461556734fef73ae0ed57a5642e742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/graph/mod.rs:82-87 | crates/ruvector-postgres/src/graph/mod.rs:118-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/mod.rs:82\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7746f0465983219a376729cd99994432c671cd3fa406c89ddc6b2943e6db5d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/functions.rs:278-285 | crates/ruvector-postgres/src/graph/sparql/functions.rs:288-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/functions.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"037f475297c78d4fed5a01c65c0c15c298a03d4cd5a7de77d0dc248b0f793dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw_am.rs:1716-1721 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1578-1583 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw_am.rs:1716\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"153b97d1c4b063f240b8e61b3b8ee85bfd8f62479a5e13cf364ee202e9394076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/index/ivfflat_am.rs:701-706 | crates/ruvector-postgres/src/index/ivfflat_storage.rs:101-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs:701\u0060 it does not close everything it opens, so those exact 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 \u0060index\u0060 to \u0060Relation\u0060 in one and \u0060pg_sys::Relation\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee62a4905cc9fc0377ad22448f159b53bb0eeef48f6e36bd13562b94b3f4e318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/integrity/mincut.rs:307-312 | crates/ruvector-postgres/src/integrity/mincut.rs:339-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/mincut.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc83103fc9d1c0140b19391b23d90c1bd8fd5f883568e75e4a4972faa52f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/types/halfvec.rs:422-427 | crates/ruvector-postgres/src/types/halfvec.rs:429-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6742be2d9b735bd2fcccf9e7df56025767a5cd22fe83548a641c7b96436982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-recall-bounded/src/lib.rs:50-55 | crates/ruvector-robotics/src/bridge/indexing.rs:106-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9468b140a826ca200ced47b4ea5d8259f6f285b1e6307f9e1490a071a2e1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-router-core/src/storage.rs:184-189 | crates/ruvector-router-core/src/storage.rs:209-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-router-core/src/storage.rs:184\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/src/storage.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"767045d932a77e98fd9acdf664b6d66532b5cd5cac4682336d81ef28ab5cda7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-sota-bench/src/bin/sota_all.rs:219-224 | crates/ruvector-sota-bench/src/bin/sota_all.rs:233-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/bin/sota_all.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b69f3106ca6ee3fcad8fea76d409e605763287411283ed021d32f47c066aa6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-spann/src/index.rs:144-149 | crates/ruvector-spann/src/kmeans.rs:28-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-spann/src/index.rs:144\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-spann/src/index.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abbc64349d061ce589c9971e52f3b92152cf741a945ba3c4bd6cec1e3a0ff7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/ruvector-spann/src/index.rs:53-56 | crates/ruvector-spann/src/index.rs:229-234 | crates/ruvector-spann/src/index.rs:342-347 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-spann/src/index.rs:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-spann/src/index.rs:238\u0060 calls \u0060push\u0060, \u0060clone\u0060 and \u0060crates/ruvector-spann/src/index.rs:351\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-spann/src/index.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c23b94fd97b2165e675e485b7d854224eee484044f51da89bb341a2cf52cd15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-sparse-inference/src/integration/ruvllm.rs:272-279 | crates/ruvector-sparse-inference/src/integration/ruvllm.rs:388-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/integration/ruvllm.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d989f2fd37ec804bebd37bcd9990fdd20b86d6742117b63dd05ae881f9a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/ruvector-sparse-inference/src/precision/quantizers.rs:87-89 | crates/ruvector-sparse-inference/src/precision/quantizers.rs:211-216 | crates/ruvector-sparse-inference/src/precision/quantizers.rs:293-298 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/precision/quantizers.rs:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-sparse-inference/src/precision/quantizers.rs:216\u0060 calls \u0060chunks\u0060 and \u0060crates/ruvector-sparse-inference/src/precision/quantizers.rs:89\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/precision/quantizers.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc0bce7063f37081aa8ce6c2038bbb721703b9126370379217c897139fe645c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/ruvector-temporal-coherence/src/benchmark.rs:235-237 | crates/ruvector-temporal-coherence/src/benchmark.rs:240-245 | crates/ruvector-temporal-coherence/src/benchmark.rs:249-254 \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, \u0060crates/ruvector-temporal-coherence/src/benchmark.rs:248\u0060 calls \u0060mean_recency\u0060 and \u0060crates/ruvector-temporal-coherence/src/benchmark.rs:240\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-coherence/src/benchmark.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c82a684f3566fb86570bcb783fab698eb6c538d296741a8d751c37ee124b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-temporal-tensor/src/segment.rs:86-92 | crates/ruvector-temporal-tensor/src/segment.rs:142-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/segment.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdca816fb0ca027493558ba9ce0b970b326c28231775f4d202c7bef42d9c929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-tiny-dancer-core/src/training.rs:658-663 | crates/ruvector-tiny-dancer-core/src/training.rs:673-678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-tiny-dancer-core/src/training.rs:658\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/training.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f296e7263c633e9a5d475ceffdb10d9b996368a901a5f73098d3c991d7c18e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-turboquant/src/simd.rs:79-84 | crates/ruvector-turboquant/src/simd.rs:238-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-turboquant/src/simd.rs:79\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9762e7778c1dc17b15adb2f31ad193ea6a2b0e93081febfa6dedfa07c44ddad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-turboquant/src/simd.rs:101-108 | crates/ruvector-turboquant/src/simd.rs:267-274 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-turboquant/src/simd.rs:101\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae3d01a98f9f84d829e9e5590431a4a8ec04f132cb6d2696b485efeb2782ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-turboquant/src/simd.rs:179-185 | crates/ruvector-turboquant/src/simd.rs:262-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-turboquant/src/simd.rs:179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2d32e9261124f73ff7512a7901aeb24f3571e16307822ae3599ac09f105315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvix/crates/boot/src/witness_log.rs:397-402 | crates/ruvix/crates/proof/src/attestation.rs:284-293 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/boot/src/witness_log.rs:397\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/boot/src/witness_log.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"857eb95c3a63e998f133ed3d337dfc9568159fc5e03e7368a648f3892129cc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvix/crates/vecgraph/src/simd_distance.rs:204-209 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:293-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:204\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:202\u0060 calls \u0060vdupq_n_f32\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:292\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d74e47f1d1278ea47f5eb7244c41e2ab675779aba908d6dfada06794307e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvix/crates/vecgraph/src/simd_distance.rs:354-359 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:437-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:354\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:352\u0060 calls \u0060_mm256_setzero_ps\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:436\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/simd_distance.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"247427fa1fc4a205d14f7137f328af108e39b65ce77d08b043954c24af35f044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvllm/src/gguf/quantization.rs:722-734 | crates/ruvllm/src/gguf/quantization.rs:860-865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/gguf/quantization.rs:722\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e252b44c2476e324b605d3be5a476b6bd5ab9c242f575032a52d0607220c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvllm/src/metal/operations.rs:309-314 | crates/ruvllm/src/metal/operations.rs:316-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/metal/operations.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"821c5a5b81e0b9245a4cf60c53fdaecd39ed4a06eaaeb675ea5627de1f0484ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvllm/src/models/openmythos/recurrent.rs:350-355 | crates/ruvllm/src/models/rdt.rs:980-985 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/recurrent.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc00a5a9c7cc7b8650e24ca6f7eaa82a77934d6430f3ed016d719b674087491c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvllm/src/qat/ste.rs:179-185 | crates/ruvllm/src/qat/ste.rs:221-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/qat/ste.rs:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/qat/ste.rs:220\u0060 calls \u0060vnegq_f32\u0060 and \u0060crates/ruvllm/src/qat/ste.rs:178\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/ste.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c99cf4bcf32af2edd7cd3e279fe89b95dd97a4b24844c7867d2f93e83fa216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvllm/src/quantize/pi_quant.rs:920-926 | crates/ruvllm/src/quantize/pi_quant.rs:1155-1160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"359d8fc131c369d6f9355079ce5c5c01fcd0f25d6b54d6ad4876fdd6b3286dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20136 lines \u00D7 12): crates/ruvector-fpga-transformer/src/backend/native_sim.rs:283-283 | crates/ruvector-fpga-transformer/src/backend/native_sim.rs:284-284 | crates/ruvector-fpga-transformer/src/backend/native_sim.rs:450-450 | crates/ruvector-fpga-transformer/src/backend/native_sim.rs:451-451 | crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:287-287 | crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:288-288 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:458-459 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:469-470 | crates/ruvector-sparse-inference/src/ops.rs:204-204 | crates/ruvector-sparse-inference/src/ops.rs:205-205 | crates/ruvllm/src/training/grpo.rs:289-297 | crates/ruvllm/src/training/grpo.rs:461-466 \u2014 before extracting anything, compare \u0060crates/ruvector-fpga-transformer/src/backend/native_sim.rs\u0060 and \u0060crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-fpga-transformer/src/backend/native_sim.rs:283\u0060 calls \u0060iter\u0060 and \u0060crates/ruvector-fpga-transformer/src/backend/wasm_sim.rs:288\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/native_sim.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7918b4da9eb44026d55c7c06f99a93c1a30e86321859d6613cae5a86ac7e2bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf/rvf-cli/src/cmd/filter.rs:143-148 | crates/rvf/rvf-runtime/src/store.rs:4752-4758 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-cli/src/cmd/filter.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/filter.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff52891caa843df5aad42cdebe3cea226edf227c4e87bc69f51b6d2e1f3ebad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf/rvf-cli/src/cmd/freeze.rs:44-49 | crates/rvf/rvf-cli/src/cmd/rebuild_refcounts.rs:127-132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060FreezeArgs\u0060 in one and \u0060RebuildRefcountsArgs\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/freeze.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d970c2336bee50092516fe8e30f38ae413e8b926855586973149ec8330ae20c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf/rvf-cli/src/cmd/ingest.rs:54-59 | crates/rvf/rvf-import/src/lib.rs:50-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-cli/src/cmd/ingest.rs:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/ingest.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0393249a53519b2005ce3e1cb75402d830c51bb8342b1a022cc476245bfa69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf/rvf-runtime/src/adversarial.rs:29-35 | crates/rvf/rvf-runtime/src/adversarial.rs:62-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 \u0060crates/rvf/rvf-runtime/src/adversarial.rs:29\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/adversarial.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7733d640cc4c269b58b09148e7340d1264a8d400c69f7b74d5ff9015ec765a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf/rvf-runtime/src/store/custom_segments.rs:157-162 | crates/rvf/rvf-runtime/src/store/custom_segments.rs:175-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 \u0060crates/rvf/rvf-runtime/src/store/custom_segments.rs:157\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/custom_segments.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad537abb802281b69bd953d918b4f73c9b0cf4c596e41929bcafaeeaa561ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf/rvf-solver-wasm/src/policy.rs:208-213 | crates/rvf/rvf-solver-wasm/src/policy.rs:245-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-solver-wasm/src/policy.rs:208\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvf/rvf-solver-wasm/src/policy.rs:251\u0060 calls \u0060safety_variance\u0060 and \u0060crates/rvf/rvf-solver-wasm/src/policy.rs:214\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-solver-wasm/src/policy.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e5f413a8c4f7e3ed7aaa2c2395c0bff80644e7686ba6e8c47040ebcb793537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvm/crates/rvm-boot/src/measured.rs:76-82 | crates/rvm/crates/rvm-security/src/attestation.rs:123-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-boot/src/measured.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e488763f3ea2c8c680be7bf238f17376f3bfe880d3662cdc12e2e545cbb24916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvm/crates/rvm-proof/src/engine.rs:224-229 | crates/rvm/crates/rvm-proof/src/engine.rs:260-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/engine.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"815658a9bd6dc50c972c63f9621361baf166e578bb4ba795d25c86d10a9c561f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): edge/gateway/src/durable_m4.rs:74-79 | edge/gateway/src/durable_m4.rs:122-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/durable_m4.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36e4065fcdd0b40e87f7509d37b1f7c93f221cff8a96a594cfac34c55561bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:196-210 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:214-228 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f669a6ec260908e47d1d93a85c1eab222d1fcc4ae5e35cb863752b749617bef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/device.rs:62-67 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:184-189 \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":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5664cb6508cc25aee16e5a425db3ab917a483f0f28b1aabfeb77e53f10df3d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:794-799 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:829-834 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"028fdfbca2813305dffbdd220b90ee35458a0ca274c00aae7c3fc5f418fda6ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:103-108 | patches/candle-core-0.9.2/src/npy.rs:110-115 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"be52e5d0b4f41154e510fbb6d77037dea9f8527c2ada7cd7743cf16692ac7d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/npy.rs:332-341 | patches/candle-core-0.9.2/src/npy.rs:359-368 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/npy.rs\u0060 and \u0060patches/candle-core-0.9.2/src/npy.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 293 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca43a669f19eb0e3df8501539da2163367119a4b7d46b7dd73c1c959bf49222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:170-181 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:186-197 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9472ed58afe061f17a207648934e2dc822476c629ec292f5eb0b03dd443a1c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:311-324 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:334-347 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:311\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"10860c59876457b34581e59769d6b5e5de2bcb2c6d7d765f93d4241e4904ec90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/k_quants.rs:434-449 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:461-476 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:450\u0060 calls \u0060Ok\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:477\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":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fe7f23e5b85b6897f5bb37b24b8c4a23bfb7c07b1648832c6c62791735999a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/metal.rs:122-127 | patches/candle-core-0.9.2/src/quantized/metal.rs:124-129 | patches/candle-core-0.9.2/src/quantized/metal.rs:139-141 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/metal.rs:122\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/metal.rs:121\u0060 calls \u0060Cpu\u0060, \u0060F32\u0060, \u0060qzeros\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs:139\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":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6080a729166a201240244c5bd34580adbd792310b162c7f6c7d276007fccba0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:83-88 | patches/candle-core-0.9.2/src/quantized/mod.rs:141-146 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b6cb4e4a60a3fa591f772d7285130799b5d04d4dfe3e6a2027e812d61f28c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/neon.rs:170-175 | patches/candle-core-0.8.4/src/quantized/neon.rs:285-290 \u2014 both copies are in the same file, so extract the block 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, \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:168\u0060 calls \u0060add\u0060, \u0060vld1q_u8_x4\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:284\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":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"790351a8ef5416ab39fea4c653f75bde86ecbd06056abc3bdbb68f0da1d69f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 4): patches/candle-core-0.8.4/src/quantized/neon.rs:186-188 | patches/candle-core-0.8.4/src/quantized/neon.rs:189-194 | patches/candle-core-0.8.4/src/quantized/neon.rs:215-217 | patches/candle-core-0.8.4/src/quantized/neon.rs:218-223 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:187\u0060 calls \u0060vdotq_s32\u0060, \u0060add\u0060, \u0060vaddvq_s32\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:186\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":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3098b4afb8ce4a74890640659171467a352269c428d0beaf908545534ac03f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/neon.rs:579-584 | patches/candle-core-0.8.4/src/quantized/neon.rs:585-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d933bbe249de39399f7143341c274aaa2dc061102a683908c85773b85bf9924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:211-217 | patches/candle-core-0.9.2/src/safetensors.rs:287-293 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/safetensors.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce6ad9923c9e773b6e9bb2ac379553306366e791466dc846b86b7e08a2f3967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:31-36 | patches/candle-core-0.9.2/src/storage.rs:32-37 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eb5a458c1cb9d3942620e20cd2a9e84c66dbe9769a8b210259437ad9b313d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:248-264 | patches/candle-core-0.9.2/src/storage.rs:257-273 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/storage.rs:248\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8751c9d536a7341e766e557651b86e2aee03c2e9e3ba17cc57ad57664dc930ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:304-309 | patches/candle-core-0.9.2/src/storage.rs:313-318 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/storage.rs:304\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":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd7d77957156aea921b538d8ea5a2fedd44b2d65eee6845d7cc7d19fc921390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:659-676 | patches/candle-core-0.9.2/src/storage.rs:720-737 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7729f528b7f0484865dc9241d12cf46f16bb9d98d0543b8fdb27b7bd939c481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2334-2357 | patches/candle-core-0.9.2/src/tensor.rs:2657-2680 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"82347af495ea3b3e457b7858be732339380dfa5060cf047a11fca3c207d39797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:445-450 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1076-1081 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"092931499683b1d84d8e199a338afda39b97b180ae34563acefd87f700f1237b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.9.2/src/safetensors.rs:117-122 | patches/candle-core-0.9.2/src/safetensors.rs:147-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/safetensors.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6042aa9b89dea73a80501940d1202b7aa3d9c61def42cd59db4749fe4064ec5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.9.2/src/scalar.rs:29-34 | patches/candle-core-0.9.2/src/scalar.rs:47-52 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/scalar.rs:29\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/scalar.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cb2c8daeb1e833dfa4d3fb359a60c93dfc8340171620af8805571bd65b7b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 26): crates/ruvector-cnn/src/kernels/int8_avx2.rs:139-143 | crates/ruvector-cnn/src/kernels/int8_avx2.rs:211-215 | crates/ruvector-cnn/src/kernels/int8_avx2.rs:283-287 | crates/ruvector-cnn/src/kernels/int8_avx2.rs:323-327 | crates/ruvector-cnn/src/kernels/int8_neon.rs:126-130 | crates/ruvector-cnn/src/kernels/int8_neon.rs:207-211 | crates/ruvector-cnn/src/kernels/int8_neon.rs:277-281 | crates/ruvector-cnn/src/kernels/int8_neon.rs:308-312 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:132-136 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:222-226 | crates/ruvector-cnn/src/kernels/int8_wasm.rs:281-285 | crates/ruvector-cnn/src/simd/avx2.rs:240-244 | crates/ruvector-cnn/src/simd/avx2.rs:332-336 | crates/ruvector-cnn/src/simd/avx2.rs:395-399 | crates/ruvector-cnn/src/simd/avx2.rs:483-487 | crates/ruvector-cnn/src/simd/avx2.rs:609-613 | crates/ruvector-cnn/src/simd/neon.rs:235-239 | crates/ruvector-cnn/src/simd/neon.rs:271-275 | crates/ruvector-cnn/src/simd/neon.rs:324-328 | crates/ruvector-cnn/src/simd/neon.rs:356-360 | crates/ruvector-cnn/src/simd/scalar.rs:123-127 | crates/ruvector-cnn/src/simd/scalar.rs:172-176 | crates/ruvector-cnn/src/simd/wasm.rs:206-210 | crates/ruvector-cnn/src/simd/wasm.rs:246-250 | crates/ruvector-cnn/src/simd/wasm.rs:298-302 | crates/ruvector-cnn/src/simd/wasm.rs:337-341 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs\u0060 and \u0060crates/ruvector-cnn/src/kernels/int8_neon.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/kernels/int8_avx2.rs:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf4adfc4385549e3eba52035083822d6ac5db8ecc67aaba0ba03107569b6a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): crates/prime-radiant/src/attention/adapter.rs:200-204 | crates/ruvector-attention/src/curvature/fused_attention.rs:326-330 | crates/ruvector-attention/src/graph/dual_space.rs:257-261 | crates/ruvector-attention/src/graph/rope.rs:249-253 | crates/ruvector-attention/src/pde_attention/diffusion.rs:230-234 | crates/ruvector-attention/src/sheaf/attention.rs:356-360 | crates/ruvector-attention/src/sheaf/attention.rs:478-482 | crates/ruvector-attention/src/topology/gated_attention.rs:288-292 | crates/ruvector-attention/src/transport/centroid_ot.rs:335-339 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:324-328 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/attention/adapter.rs\u0060 and \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-attention/src/graph/dual_space.rs:265\u0060 calls \u0060Ok\u0060, \u0060project_output\u0060 and \u0060crates/prime-radiant/src/attention/adapter.rs:206\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae62d657eadeea207280f2386060e7be6d7f660431d104e338d0aadc5355fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): crates/ruvector-postgres/src/distance/simd.rs:478-482 | crates/ruvector-postgres/src/distance/simd.rs:994-998 | crates/ruvector-postgres/src/distance/simd.rs:1108-1112 | crates/ruvector-postgres/src/types/halfvec.rs:369-373 | crates/ruvector-postgres/src/types/halfvec.rs:419-423 | crates/ruvector-postgres/src/types/halfvec.rs:426-430 | crates/ruvector-postgres/src/types/halfvec.rs:433-437 | crates/ruvector-postgres/src/types/halfvec.rs:485-489 \u2014 there are 8 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 8 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-postgres/src/types/halfvec.rs:364\u0060 calls \u0060_mm256_sub_ps\u0060 and \u0060crates/ruvector-postgres/src/types/halfvec.rs:479\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"25161c3635885ab513d99887f50cccbe09a3d85864a543f5c3715a0ac1a9cd0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2403-2408 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2410-2415 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2417-2422 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2907-2912 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2914-2919 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2921-2926 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2928-2933 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2935-2940 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce52bd8c46652128a0bf5d3a8b2f2ebf29a9dc1ee4742badf849d22ec1b185f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:569-573 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:612-616 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:677-681 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:726-730 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:687-691 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:733-737 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:804-808 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:852-856 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:610\u0060 calls \u0060out_w\u0060, \u0060out_h\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:568\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebf2c6078f58e85ad5ee00ea0f4c2b7426ddbe6fc1108de03d9024709444d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): crates/ruvector-cnn/src/layers/conv.rs:235-240 | crates/ruvector-cnn/src/layers/conv.rs:304-309 | crates/ruvector-cnn/src/layers/conv.rs:550-555 | crates/ruvector-cnn/src/layers/pooling.rs:106-111 | crates/ruvector-cnn/src/layers/pooling.rs:208-213 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:52-57 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:143-148 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/conv.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/pooling.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d67e4496a27b93082925b9c7ce1c51cf7d38c64b3b1213be199873c95744a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/ruvector-cnn/src/layers/conv.rs:411-416 | crates/ruvector-cnn/src/layers/conv.rs:640-645 | crates/ruvector-cnn/src/layers/quantized_conv2d.rs:258-263 | crates/ruvector-cnn/src/layers/quantized_depthwise.rs:212-217 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:69-74 | crates/ruvector-cnn/src/layers/quantized_pooling.rs:164-169 \u2014 before extracting anything, compare \u0060crates/ruvector-cnn/src/layers/quantized_conv2d.rs\u0060 and \u0060crates/ruvector-cnn/src/layers/quantized_depthwise.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/conv.rs:411\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa0da7a2b04f14875d403d89eb4b9179d468c9c43b65b097eae038f67bdef3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/ruvix/crates/cli/src/commands/dtb.rs:641-645 | crates/ruvix/crates/cli/src/commands/dtb.rs:687-691 | crates/ruvix/crates/cli/src/commands/dtb.rs:762-766 | crates/ruvix/crates/cli/src/commands/dtb.rs:849-853 | crates/ruvix/crates/cli/src/commands/dtb.rs:938-942 | crates/ruvix/crates/cli/src/commands/dtb.rs:1041-1045 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:846\u0060 calls \u0060repeat\u0060, \u0060push_str\u0060 and \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:760\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"1297a748cefec1b1333d839a136a5a83d9800256f3a3f4487a28aeb8be25fbf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/ruvllm/src/kv_cache.rs:469-475 | crates/ruvllm/src/kv_cache.rs:541-545 | crates/ruvllm/src/kv_cache.rs:604-610 | crates/ruvllm/src/kv_cache.rs:710-715 | crates/ruvllm/src/speculative.rs:1003-1007 | crates/ruvllm/src/speculative.rs:1180-1184 \u2014 there are 6 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 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kv_cache.rs:469\u0060 it does not close everything it opens, so those exact 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 \u0060values\u0060 to \u0060\u0026[f32]\u0060 in one and \u0060\u0026[f32]) -\u003E (f32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/kv_cache.rs:548\u0060 calls \u0060vminq_f32\u0060 and \u0060crates/ruvllm/src/speculative.rs:1009\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"699751c9f2a31011a7d782b7a538704d3c82a1bd45faa1eba32b9b7d3e15e548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/ruvllm/src/models/openmythos/mod.rs:406-410 | crates/ruvllm/src/models/openmythos/mod.rs:458-462 | crates/ruvllm/src/models/openmythos/mod.rs:519-523 | crates/ruvllm/src/models/rdt.rs:807-811 | crates/ruvllm/src/models/rdt.rs:849-853 | crates/ruvllm/src/models/rdt.rs:894-898 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/openmythos/mod.rs\u0060 and \u0060crates/ruvllm/src/models/rdt.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/models/openmythos/mod.rs:457\u0060 calls \u0060push\u0060 and \u0060crates/ruvllm/src/models/openmythos/mod.rs:405\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4efbf953ea9d5b4a978eb58c754d1424ee65c3600daa42bd172ab17036d3496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:317-322 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:356-361 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:433-438 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:335-340 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:374-379 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:451-456 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:317\u0060 it does not close everything it opens, so those exact 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, \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:316\u0060 calls \u0060from_f64\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:355\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8de5c59eb7f684fed62864dec2a92acf7c6595b085d5816b12610c8c01038fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): patches/candle-core-0.8.4/src/quantized/k_quants.rs:1294-1299 | patches/candle-core-0.8.4/src/quantized/k_quants.rs:1491-1496 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1496-1501 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1561-1566 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1757-1762 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1838-1843 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs\u0060 as WHOLE FILES: this scan already matched 59 separate duplicated blocks between them, totalling at least 1204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/k_quants.rs:1294\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e044a7c0453d028761dce651d7b762698ae0acd71025bf4281b2171bd991db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): patches/candle-core-0.8.4/src/tensor.rs:1356-1360 | patches/candle-core-0.8.4/src/tensor.rs:1472-1476 | patches/candle-core-0.8.4/src/tensor.rs:1534-1538 | patches/candle-core-0.9.2/src/tensor.rs:1613-1617 | patches/candle-core-0.9.2/src/tensor.rs:1796-1800 | patches/candle-core-0.9.2/src/tensor.rs:1858-1862 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:1356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d599a41e76a0627e3b2d9a77a53724aafa23dd867d1884e6b6544279ad1dd67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/prime-radiant/src/attention/adapter.rs:168-173 | crates/prime-radiant/src/attention/diffusion.rs:252-257 | crates/prime-radiant/src/attention/topology.rs:231-236 | crates/ruvector-attention/src/topology/coherence.rs:268-273 | crates/ruvector-query-cache/src/lib.rs:111-115 | crates/ruvllm-wasm/src/hnsw_router.rs:302-306 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/attention/adapter.rs:168\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/attention/adapter.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"330b01330ba3aaab38e4f780de799ccd3f6f14162a6384b25ab3024be23a7bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/prime-radiant/src/coherence/energy.rs:605-610 | crates/ruvector-attention/src/transport/centroid_ot.rs:155-160 | crates/ruvector-core/src/distance.rs:39-43 | crates/ruvector-math/src/optimal_transport/sinkhorn.rs:95-100 | crates/ruvector-math/src/product_manifold/manifold.rs:169-175 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/transport/centroid_ot.rs\u0060 and \u0060crates/ruvector-math/src/optimal_transport/sinkhorn.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/coherence/energy.rs:605\u0060 it does not close everything it opens, so those exact 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 \u0060a\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":"crates/prime-radiant/src/coherence/energy.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e62594d15c679f32ffc2d15f133f44e83b8e754f7986215eed4f13424350800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/prime-radiant/src/substrate/edge.rs:218-222 | crates/prime-radiant/src/substrate/edge.rs:279-283 | crates/prime-radiant/src/substrate/edge.rs:339-343 | crates/prime-radiant/src/substrate/node.rs:94-98 | crates/prime-radiant/src/substrate/node.rs:128-132 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/substrate/edge.rs:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/edge.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc05e2a46d31e9e55be68241583aff1c531febf59d868e4e94812355d01eed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/ruvector-nervous-system-wasm/src/wta.rs:227-232 | crates/ruvector-nervous-system-wasm/src/wta.rs:267-271 | crates/ruvector-nervous-system-wasm/src/wta.rs:301-305 | crates/ruvector-nervous-system/src/compete/kwta.rs:83-88 | crates/ruvector-nervous-system/src/compete/kwta.rs:117-122 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/wta.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac92a6a6e4f2fcdc97094906748374e152d77376e2f7b00a85a7d3ce0c32f24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/ruvix/crates/smp/src/barriers.rs:93-98 | crates/ruvix/crates/smp/src/barriers.rs:117-121 | crates/ruvix/crates/smp/src/barriers.rs:186-190 | crates/ruvix/crates/smp/src/barriers.rs:207-211 | crates/ruvix/crates/smp/src/barriers.rs:249-254 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/smp/src/barriers.rs:93\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/smp/src/barriers.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ad15a4beb16d55ad76f507ee656079181773f737100881bde02c997a196cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 7): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2218-2222 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1366-1370 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:888-892 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1083-1086 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2742-2746 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:934-938 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1135-1138 \u2014 \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 90 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2216\u0060 calls \u0060l_out\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1364\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"69404768e218eaba59aad607036c1555928c05c1a5b794faa61038ef4ceb2929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 5): crates/ruvector-attention/src/curvature/fused_attention.rs:354-358 | crates/ruvector-attention/src/pde_attention/diffusion.rs:257-261 | crates/ruvector-attention/src/topology/gated_attention.rs:317-321 | crates/ruvector-attention/src/transport/centroid_ot.rs:363-367 | crates/ruvector-attention/src/transport/sliced_wasserstein.rs:361-364 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/curvature/fused_attention.rs\u0060 and \u0060crates/ruvector-attention/src/pde_attention/diffusion.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/curvature/fused_attention.rs:354\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-attention/src/transport/sliced_wasserstein.rs:361\u0060 calls \u0060iter\u0060 and \u0060crates/ruvector-attention/src/curvature/fused_attention.rs:354\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/fused_attention.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a996622b73cb9bd624c9641b82268cf5ed68c239d922a8257d79853cdc1ea20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:168-172 | crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs:225-229 | crates/ruvector-attention/src/sheaf/sparse.rs:432-436 | crates/ruvector-gnn/src/layer.rs:514-518 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/mixed_curvature.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f14681055f7903d3ad4e4a488fac2a769a7613a39c8decfb304636f741494fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ruvector-consciousness/src/bounds.rs:84-88 | crates/ruvector-consciousness/src/chebyshev_phi.rs:84-88 | crates/ruvector-consciousness/src/phi.rs:404-408 | crates/ruvector-consciousness/src/sparse_accel.rs:71-75 \u2014 before extracting anything, compare \u0060crates/ruvector-consciousness/src/chebyshev_phi.rs\u0060 and \u0060crates/ruvector-consciousness/src/phi.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/bounds.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"765893a000cd7bbe4a780111e1542c7244b6f271f980fc02ce16b88e3aea0518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ruvector-core/src/cache_optimized.rs:328-333 | crates/ruvector-core/src/simd_intrinsics.rs:93-101 | crates/ruvector-core/src/simd_intrinsics.rs:1127-1132 | crates/ruvector-postgres/src/distance/simd.rs:1086-1090 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/cache_optimized.rs:328\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/cache_optimized.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e99654624ad45fa559f39ab24f6b9042f1c638e4410b8837e4085256a7bf98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ruvector-postgres/src/distance/simd.rs:1020-1025 | crates/ruvector-postgres/src/distance/simd.rs:1061-1065 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:356-362 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:439-443 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1020\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:352\u0060 calls \u0060_mm256_setzero_ps\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs:436\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa62900d8e7489d04030a0df3f3d51e04e9b24f2221dba8716e5ca5c3c06686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ruvector-postgres/src/distance/simd.rs:1540-1545 | crates/ruvector-postgres/src/distance/simd.rs:1577-1581 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:206-212 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:295-299 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 and \u0060crates/ruvix/crates/vecgraph/src/simd_distance.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/distance/simd.rs:1540\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/distance/simd.rs:1546\u0060 calls \u0060vfmaq_f32\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs:1582\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/simd.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f610d309666a4c8ead58653648c1c1c3940b22a1e8e7c11411ca853cef07f664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ruvector-postgres/src/index/ivfflat_am.rs:639-643 | crates/ruvector-postgres/src/index/ivfflat_am.rs:848-852 | crates/ruvector-postgres/src/index/ivfflat_storage.rs:103-107 | crates/ruvector-postgres/src/index/ivfflat_storage.rs:200-204 \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":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"be489dcbb383bf1cbe024aef321e4353b95f7ad441c0908a2d2625246a746116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:478-482 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:533-537 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:615-619 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:675-679 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:478\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada23ac3f7343f28c113f63d0d7a602ede33548e1836fb7d0c6ea7a9986f3479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:746-750 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:970-975 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:942-946 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1166-1171 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1782a08d2eb28a916747d2e8975f8e280dfd73debe8c135291cf54d5e8e43f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/candle-core-0.8.4/src/metal_backend/mod.rs:325-330 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:380-385 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:344-349 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:400-405 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:325\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabbd070d4203275af0529c82c725f88282dce9bf8c6f594538da4bad24349a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): patches/candle-core-0.8.4/src/tensor.rs:2147-2153 | patches/candle-core-0.8.4/src/tensor.rs:2158-2164 | patches/candle-core-0.9.2/src/tensor.rs:2470-2476 | patches/candle-core-0.9.2/src/tensor.rs:2481-2487 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:2147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"918dd76125901e9ac048194c4b5268c3043c84b9fe7f2a083927857b4656d074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): patches/candle-core-0.9.2/src/quantized/k_quants.rs:895-902 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1211-1218 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1526-1533 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1803-1810 \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 \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:895\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbecc7bcdb6daf2a5e47f84c333e2ba00bc24e8f1fa2d9ad016835549cf63a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/hnsw_rs/src/hnswio.rs:1072-1077 | patches/hnsw_rs/src/hnswio.rs:1327-1332 | scripts/patches/hnsw_rs/src/hnswio.rs:1072-1077 | scripts/patches/hnsw_rs/src/hnswio.rs:1327-1332 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb8adce419dd6dea306a99e607c309d901410974191c57fe3d945c20ea6c7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ruvector-cli/src/cli/hooks.rs:711-715 | crates/ruvector-mincut/src/snn/optimizer.rs:655-659 | crates/ruvector-robotics/src/cognitive/memory_system.rs:120-124 | crates/ruvllm/src/context/working_memory.rs:368-375 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cli/src/cli/hooks.rs:711\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/hooks.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffecdd947680809c40ab769a1eafe162e6c090c1adb24ca0460845d139b907a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-cnn/src/simd/winograd.rs:122-126 | crates/ruvector-cnn/src/simd/winograd.rs:164-168 | crates/ruvector-cnn/src/simd/winograd.rs:206-210 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/simd/winograd.rs:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/winograd.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6083eab4d2c2668571d0293d3606425fedb8049a0c9f828be4a1016e849455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:138-144 | crates/ruvector-postgres/src/distance/simd.rs:985-989 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:408-413 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb9d883bde7116178a2f7733d9024b2b64b3b742dd0488d46b585befc0548fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:174-178 | crates/ruvector-postgres/src/distance/simd.rs:987-991 | crates/ruvix/crates/vecgraph/src/simd_distance.rs:410-415 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/simd_intrinsics.rs\u0060 and \u0060crates/ruvector-postgres/src/distance/simd.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.rs:174\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f8b94a104eb44d61e641c4aeb3852cd820cd37b9c2c892f2c9116b11f28b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-core/src/simd_intrinsics.rs:420-424 | crates/ruvector-core/src/simd_intrinsics.rs:425-429 | crates/ruvector-core/src/simd_intrinsics.rs:430-434 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"735bb6a84a6996bc37f0620c4fa3bed5c0f1e2050f76a55bc339f4f8325b4cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-delta-core/src/delta.rs:241-245 | crates/ruvector-delta-core/src/delta.rs:267-271 | crates/ruvector-delta-core/src/delta.rs:443-447 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-core/src/delta.rs:241\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/delta.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8e5c14d01df23a8bb571f864c36e68d4534ad3ecfecfeb5b2967e50bda79ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-delta-wasm/src/capture.rs:111-116 | crates/ruvector-delta-wasm/src/simd.rs:126-130 | crates/ruvector-delta-wasm/src/simd.rs:195-199 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-delta-wasm/src/capture.rs:111\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-delta-wasm/src/simd.rs:124\u0060 calls \u0060f32x4_splat\u0060 and \u0060crates/ruvector-delta-wasm/src/simd.rs:193\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-wasm/src/capture.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"331a4754da16c6b6f96c0a020009ad3d36f5ab99eeea13d795e81da4b267a197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-diverse-beam/src/dataset.rs:26-31 | crates/ruvector-gnn-rerank/src/main.rs:48-52 | crates/ruvector-rairs/src/main.rs:37-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-diverse-beam/src/dataset.rs:26\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-diverse-beam/src/dataset.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"655c200585d838d17cd210966656d48f9b502f4974806ebb430977f027f49041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-graph-transformer-node/src/transformer.rs:79-87 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:89-97 | crates/ruvector-verified/src/proof_store.rs:82-90 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-transformer-node/src/transformer.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4b899479f6231519dbf83c7ffa4ed477a870b0bd006728f3fa8c13fabd8fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-math/src/homology/filtration.rs:136-140 | crates/ruvector-math/src/homology/filtration.rs:155-159 | crates/ruvector-math/src/homology/filtration.rs:221-225 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/homology/filtration.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/homology/filtration.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"330abb909bb6a5328799fdfd4629818558e462ec86a2c1ed10b946948fa16d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-mincut-wasm/src/lib.rs:118-124 | crates/ruvector-mincut-wasm/src/lib.rs:316-320 | crates/ruvector-mincut-wasm/src/lib.rs:346-350 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-wasm/src/lib.rs:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-wasm/src/lib.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8b403577443342d71830e07959edc27e0bc60c0c25b1ed8b3a60b423aa9799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-postgres/src/index/ivfflat_am.rs:702-706 | crates/ruvector-postgres/src/index/ivfflat_am.rs:847-851 | crates/ruvector-postgres/src/index/ivfflat_storage.rs:102-106 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060index\u0060 to \u0060Relation\u0060 in one and \u0060pg_sys::Relation\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbe8776b94c6d2598d6020e250eddc3bba340a461c8ae1fa7482258a0622258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-postgres/src/types/halfvec.rs:514-518 | crates/ruvector-postgres/src/types/halfvec.rs:535-540 | crates/ruvector-postgres/src/types/halfvec.rs:562-566 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.rs:514\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ec6876c714f91b72f8870d8e970148920e7fd72594113c4e71061a07d431bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 6): crates/ruvector-sota-bench/src/runners/hybrid.rs:59-63 | crates/ruvector-sota-bench/src/runners/lsm_ann.rs:43-47 | crates/ruvector-sota-bench/src/runners/matryoshka.rs:73-77 | crates/ruvector-sota-bench/src/runners/mteb.rs:199-202 | crates/ruvector-sota-bench/src/runners/rabitq.rs:39-42 | crates/ruvector-sota-bench/src/runners/vdbbench.rs:98-101 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sota-bench/src/runners/hybrid.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-sota-bench/src/runners/lsm_ann.rs:47\u0060 calls \u0060iter\u0060 and \u0060crates/ruvector-sota-bench/src/runners/mteb.rs:202\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/runners/hybrid.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d99dd25a823f7c8146512baf06c94dc0c258a3e7e5eba7e5bc784adc2fde132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-wasm/kernels/rmsnorm.rs:200-204 | crates/ruvector-wasm/kernels/swiglu.rs:124-128 | crates/ruvector-wasm/kernels/swiglu.rs:179-184 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-wasm/kernels/rmsnorm.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rmsnorm.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"815d2fb986b7cf06820ce6a7cc1452e4842ab0653e236d654078106464b734f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvix/crates/cli/src/commands/dtb.rs:328-333 | crates/ruvix/crates/cli/src/commands/dtb.rs:400-405 | crates/ruvix/crates/cli/src/commands/dtb.rs:532-536 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae73e084b536d232b87ba009027e0bb6e7ae77f128e52abddad46aba19f8b38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvllm/src/bitnet/expert_cache.rs:554-558 | crates/ruvllm/src/bitnet/expert_cache.rs:575-579 | crates/ruvllm/src/bitnet/expert_cache.rs:640-644 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/expert_cache.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fb69cebe0679d04839f5937703534c610287912380964e1bd484e90866b1f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvllm/src/kernels/matmul.rs:602-607 | crates/ruvllm/src/kernels/matmul.rs:630-635 | crates/ruvllm/src/kernels/matmul.rs:658-663 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"90943caa54afe604383dfc5217e7f62c6c1660aff80dc8a12bbd95ac74d4ce0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvllm/src/kernels/matmul.rs:729-734 | crates/ruvllm/src/kernels/matmul.rs:769-774 | crates/ruvllm/src/kernels/matmul.rs:796-801 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kernels/matmul.rs:729\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aa32925eb69d733d0a0cbf5127217e4862b836ce076cfa217624c52c83d0f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvllm/src/quantize/pi_quant.rs:854-862 | crates/ruvllm/src/quantize/pi_quant.rs:1047-1051 | crates/ruvllm/src/quantize/pi_quant_simd.rs:694-699 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/quantize/pi_quant.rs:854\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa675eaeafcc04b347f089cf993b0ea311283688a9541c5389cf6630731b6aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvllm/src/reflection/perspectives.rs:389-393 | crates/ruvllm/src/reflection/perspectives.rs:602-606 | crates/ruvllm/src/reflection/perspectives.rs:809-813 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/reflection/perspectives.rs:389\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/perspectives.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acd5ee75d404858205a9ef557cbdb081f01a4a171cda12f87ae897a4c29418f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): edge/gateway/src/backend.rs:100-104 | edge/gateway/src/m3_transport.rs:91-95 | edge/gateway/src/quant_route.rs:39-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 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":"edge/gateway/src/backend.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"68954c9a49d9ac866dc1f20e67f3b71b2d71a83cb55294557eab5f0833bd6ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2340-2345 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1500-1505 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1990-1995 \u2014 \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 90 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cb7083b53c6e707ccb26eb551231dcc16db3ab3518c2d06571504930722cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1496-1501 | patches/candle-core-0.8.4/src/metal_backend/mod.rs:1092-1097 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1144-1149 \u2014 \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 7 separate duplicated blocks between them, totalling at least 59 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1496\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfe93407dd7a0a246da31e8f600587d47881b6ab5dae8ee273b00e955c6d677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/cuda.rs:454-458 | patches/candle-core-0.9.2/src/quantized/cuda.rs:613-617 | patches/candle-core-0.9.2/src/quantized/cuda.rs:641-645 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs:454\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":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"be13045ee10e17d635f477d7c977dd972a486e3bc2a8dc98c314dfe7ef5cf99a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): patches/candle-core-0.8.4/src/quantized/neon.rs:573-578 | patches/candle-core-0.8.4/src/quantized/neon.rs:580-584 | patches/candle-core-0.8.4/src/quantized/neon.rs:586-590 \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 \u0060patches/candle-core-0.8.4/src/quantized/neon.rs:573\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada6d7200c5f0de98503f32922d74ae4d3a0a44efcc6bebf45e2206d82efbf69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:118-122 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:149-153 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:280-284 \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, \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:154\u0060 calls \u0060from_f64\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:123\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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ec19f3f1dc815f0b5cb81d1d392bcc8710e3ab96850e7935f69b47e699b654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/emergent-time/src/entropic.rs:84-90 | crates/emergent-time/src/entropic.rs:97-103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/entropic.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba277d3b6a25374ebc413904375920fb4659bc301f85cef5ee88733dba28bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-brain-server/src/aggregate.rs:51-55 | crates/mcp-brain-server/src/aggregate.rs:114-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/aggregate.rs:51\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/aggregate.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e20a770cf0a7105e2c4a90cf699e160e933341bf3180c2f59b6caec58f9c20c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-brain-server/src/graph.rs:438-443 | crates/mcp-brain-server/src/graph.rs:724-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/graph.rs:438\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"289d2484ea25f70a2079de131c991c1d72ee4c810326dbfd170471be85f545c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-brain-server/src/graph.rs:1049-1054 | crates/mcp-brain-server/src/graph/rebuild.rs:184-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/graph.rs:1049\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cce49fe264ecada11cd4264d9ba4852b7d33b224abdc759558dea856cffb70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-brain-server/src/quantization.rs:113-117 | crates/ruvector-gnn/src/compress.rs:441-445 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/quantization.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":"crates/mcp-brain-server/src/quantization.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54fa458b5989714eb647ca1d87027a5b4606162ecf1233963e3222e6f3760e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:122-126 | crates/mcp-brain-server/src/routes.rs:140-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0a522bc1932bf225c052d1d1199d62309f9ca9cb4779e0e9369a897798218b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/photonlayer-bench/src/learn.rs:119-128 | crates/photonlayer-bench/src/mnist_bench.rs:236-245 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/learn.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a280afe5af30bf4b0fbdd6754593c2892517eaa652b42d68a56e9cde2200fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/prime-radiant/src/cohomology/cohomology_group.rs:432-437 | crates/prime-radiant/src/cohomology/cohomology_group.rs:442-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 \u0060crates/prime-radiant/src/cohomology/cohomology_group.rs:432\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/cohomology_group.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73d2215a56683d4dacc2b65cf9c85bdbced367107689ff99bb4202e1c623b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/prime-radiant/src/distributed/adapter.rs:83-91 | crates/prime-radiant/src/distributed/adapter.rs:105-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/distributed/adapter.rs:83\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/distributed/adapter.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6480642cff0f00616751cd6eb0f94a999feddb0d1c65139a2865e5601f1fa594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20135 lines \u00D7 4): crates/ruvector-attention-node/src/training.rs:62-66 | crates/ruvector-attention-node/src/training.rs:139-143 | crates/ruvector-attention-node/src/training.rs:200-200 | crates/ruvector-attention-node/src/training.rs:859-861 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-node/src/training.rs:62\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/training.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd516e3ec2a36b7e5c18c17cf51bbc5306ec438bd05794171a5ca188bd2c1d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/graph.rs:280-284 | crates/ruvector-gnn-wasm/src/lib.rs:320-326 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/graph.rs\u0060 and \u0060crates/ruvector-gnn-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-unified-wasm/src/graph.rs:280\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 \u0060gnn_layers\u0060 to \u0060Vec\u003CWasmGNNLayer\u003E\u0060 in one and \u0060Vec\u003CJsRuvectorLayer\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef021aaa40e2ab3810288c222226d5beb3e961f0d352be0e4cab751ef66ade0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-attention/src/graph/dual_space.rs:19-26 | crates/ruvector-attention/src/moe/expert.rs:108-115 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/graph/dual_space.rs:19\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/dual_space.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e6bf7aa8f9ed72ada072dfcbead69e3356bd92d8ab6ab319a775667b64d8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-attention/src/hyperbolic/poincare.rs:114-118 | crates/ruvector-hyperbolic-hnsw/src/poincare.rs:447-451 \u2014 before extracting anything, compare \u0060crates/ruvector-attention/src/hyperbolic/poincare.rs\u0060 and \u0060crates/ruvector-hyperbolic-hnsw/src/poincare.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/hyperbolic/poincare.rs:114\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/hyperbolic/poincare.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a67e7efde71a702d9edd9418f183bfef8b66b800a64212e0179062ac40b7b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-bench/src/bin/turbo4_ablation.rs:100-108 | crates/ruvector-bench/src/bin/turbo4_ablation.rs:302-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/turbo4_ablation.rs:100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/turbo4_ablation.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d81e43b8e663aecba872ad47730763f932df0b1cb4866cb7b10f3e82e2e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-bench/src/lib.rs:249-253 | crates/ruvector-bench/src/lib.rs:265-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/lib.rs:249\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/lib.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffa6a42ce091af87bd72e0e07207073e1f1f1d899902828bd6f0512c2e85d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-bounded-rag/src/lib.rs:264-270 | crates/ruvector-bounded-rag/src/lib.rs:574-578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bounded-rag/src/lib.rs:264\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bounded-rag/src/lib.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb73987d89a7abd6a99044f84605c517f79d4e1a5306e487a11dc7898f8e7d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-capgated/src/bin/benchmark.rs:156-160 | crates/ruvector-capgated/src/bin/benchmark.rs:166-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-capgated/src/bin/benchmark.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4066316e117c566e809f120ebd09c9067498929abe0bc1212ce329bde2674860"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-cluster-rag/src/search.rs:30-34 | crates/ruvector-cluster-rag/src/search.rs:73-77 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cluster-rag/src/search.rs:30\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/search.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba4e051e43b471cd7158d6112d14abc3c2d94265e0f5cc349051b5d1dcb8b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-cnn/src/layers/conv.rs:407-411 | crates/ruvector-cnn/src/layers/conv.rs:636-640 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-cnn/src/layers/conv.rs:407\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/conv.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cc5d23e91ae82412062e4651a33415a3037f283bfac21174b81c8ce0c18183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-core/src/advanced_features/hybrid_search.rs:317-321 | crates/ruvector-postgres/src/hybrid/bm25.rs:306-310 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/hybrid_search.rs:317\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/hybrid_search.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2ecd8b1f58d8a1ccaddb170c24b6d8f49420f0e115375b9da011e1f7c8a4d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-core/src/advanced_features/sparse_vector.rs:408-412 | crates/ruvector-hybrid/src/fusion.rs:250-257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/sparse_vector.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf0eb4b3a9c98d438fb3ec9a311d683bc0739daa2b91c36d42e8bd193c7eee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-core/src/embeddings.rs:1347-1352 | crates/ruvector-hailo/src/cpu_embedder.rs:241-246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/embeddings.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3befbc5ba26655d742baaec29c296197e05639ac8bc752f234782a87a399d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:172-176 | crates/ruvector-core/src/simd_intrinsics.rs:1148-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/simd_intrinsics.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":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"96567b19a17afa052a6a235b339cd4108a7bc84cf5820f73fe0cbdf01b691a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-core/src/simd_intrinsics.rs:292-296 | crates/ruvector-core/src/simd_intrinsics.rs:358-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-core/src/simd_intrinsics.rs:356\u0060 calls \u0060_mm512_fmadd_ps\u0060 and \u0060crates/ruvector-core/src/simd_intrinsics.rs:291\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/simd_intrinsics.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"589a353a0a32dadaf80d837070e3140e5909049205f51873dd5591694fd57cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-core/src/storage.rs:238-243 | crates/ruvector-core/src/storage.rs:279-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/storage.rs:238\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-core/src/storage.rs:244\u0060 calls \u0060open_table\u0060 and \u0060crates/ruvector-core/src/storage.rs:284\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e010d779c4aab21bc581c1eb650df5fa4df4925ce3646c8486a64664be0993c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-decompiler/src/model_gguf.rs:47-58 | crates/ruvllm/src/gguf/parser.rs:105-116 \u2014 before extracting anything, compare \u0060crates/ruvector-decompiler/src/model_gguf.rs\u0060 and \u0060crates/ruvllm/src/gguf/parser.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_gguf.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7670b670faf9e437035683246b5e26718bdc821037bf942fe254de6eb78f61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-edge-auth/src/claims.rs:474-478 | crates/ruvector-edge-authz/src/params.rs:109-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-edge-auth/src/claims.rs:474\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-auth/src/claims.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"21680c2302ab1bd022c3564620113d309b66b26af7ac1b8ade10830480e15378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-edge-snapshot/fuzz/fuzz_targets/m3_reader.rs:202-206 | crates/ruvector-edge-snapshot/src/rvf_format.rs:48-52 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/fuzz/fuzz_targets/m3_reader.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f95e085cf98f1be5df7d514db9d9715598c10b6559a5b785b93201782c036f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-edge-store/src/ops/types.rs:203-207 | edge/gateway/src/graph_cypher_dx.rs:296-300 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-edge-store/src/ops/types.rs:203\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/types.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8854f6d3c548bf186cde662a1940076f0acbf3f29ce246d8c8cf3048b80d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/ruvector-entropy-ann/src/dataset.rs:20-24 | crates/ruvector-entropy-ann/src/dataset.rs:44-47 | crates/ruvector-entropy-ann/src/dataset.rs:62-66 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-entropy-ann/src/dataset.rs:20\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-entropy-ann/src/dataset.rs:20\u0060 calls \u0060iter_mut\u0060, \u0060for_each\u0060 and \u0060crates/ruvector-entropy-ann/src/dataset.rs:44\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-entropy-ann/src/dataset.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75fe23ccaeaca768876f6fe70447b7c7b84aa6ea0e20ece6d43d0817b385576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-exotic-wasm/src/morphogenetic.rs:305-310 | crates/ruvector-exotic-wasm/src/morphogenetic.rs:361-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-exotic-wasm/src/morphogenetic.rs:305\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-exotic-wasm/src/morphogenetic.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd420541fb8e16aa6e3c7ea0308591fbfd5d149f735f3861670d95bd268ecbdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-graph/src/cypher/lexer.rs:115-122 | crates/rvlite/src/cypher/lexer.rs:108-115 \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":"crates/ruvector-graph/src/cypher/lexer.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13cd0adb30798ce678aafe6fff960891edb5744aae60dfaff39b3dc1a1bcf8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-kge-ffi/src/ops.rs:46-52 | crates/ruvector-kge-wasm/src/ops.rs:46-52 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/ops.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/ops.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 247 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"60140de8524da0c254ed97133fcdb13528c74f954adaba59146e21c001200f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-kge/src/scorer/fft.rs:114-118 | crates/ruvector-kge/src/scorer/fft.rs:128-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-kge/src/scorer/fft.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":"crates/ruvector-kge/src/scorer/fft.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cad7ad5f9887a9c4a4f2e2021151372dcc9de6e8a04412b99c24d9599d5313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs:125-131 | crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs:133-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/gromov_wasserstein.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfb5faa823bdb67ff275c7e2c1f38aeed355424edac84dbb6ee3ce79995750c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-math/src/optimization/sdp.rs:206-210 | crates/ruvector-math/src/optimization/sdp.rs:226-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-math/src/optimization/sdp.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimization/sdp.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e654bc067efd4a4fb5b39e0b9a7164b7947e138a277171529748a36ee720fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-math/src/spherical/mod.rs:107-111 | crates/ruvector-math/src/spherical/mod.rs:153-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/spherical/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2d4629c584aa3e5d21036e4ff5c075d030667abf40c601aaa4c2aac6db5859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-memory-admission/src/dataset.rs:168-173 | crates/ruvector-namespace-merge/src/dataset.rs:195-200 \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":"crates/ruvector-memory-admission/src/dataset.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa9aded4c037f9b16153ec788c46de115b609948c3c10839b64462db326444d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:456-464 | crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs:467-475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kvquant.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27558b6f78728fa65e64bb6efb21fe99f14817bcced0e8b090aa2617311dce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut/src/optimization/parallel.rs:517-522 | crates/ruvector-mincut/src/optimization/parallel.rs:541-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/optimization/parallel.rs:517\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/parallel.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f267565f0c1eb64fec2a9e0b6c285a8499948ce8a5730c3306b500ece355686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): crates/ruvector-nervous-system-wasm/src/wta.rs:242-246 | crates/ruvector-nervous-system-wasm/src/wta.rs:281-284 | crates/ruvector-nervous-system/src/compete/kwta.rs:99-103 | crates/ruvector-nervous-system/src/compete/kwta.rs:133-139 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system-wasm/src/wta.rs:242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/wta.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4732363476eccc6495e5788c1e7ce28a2fd432136fc483afcf017b5693522963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-nervous-system/src/integration/ruvector.rs:312-317 | crates/ruvector-robotics/src/cognitive/memory_system.rs:170-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-nervous-system/src/integration/ruvector.rs:312\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/integration/ruvector.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c36b35b9b0e4d2ee1922b5766039c7a556f141eb617c0e31727b54d3f39bce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/hybrid/fusion.rs:115-120 | crates/ruvector-postgres/src/hybrid/fusion.rs:123-128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/fusion.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b3109c9e62372502e1aca8823d9897bf9ea0b6d5a803768bee8befaaf2a261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/index/scan.rs:26-33 | crates/ruvector-postgres/src/index/scan.rs:63-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/scan.rs:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/scan.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f0af19554032be63bcaed144ff20ca78efad0d858737861e0428ca4afb0773"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-postgres/src/operators.rs:353-357 | crates/ruvector-postgres/src/operators.rs:405-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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/operators.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"408cde5efaa2f9a62fbe157414389e0f7a791b11e29fe342e6cbee06235c497a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-postgres/src/quantization/binary.rs:100-105 | crates/ruvector-postgres/src/types/binaryvec.rs:214-218 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/binary.rs\u0060 and \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/binary.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4d699c209956536f6d284bf30069b97dcfb6420ff938771ff15a2dd426a4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-rabitq/src/main.rs:140-144 | crates/ruvector-rulake/src/bin/rulake-demo.rs:50-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rabitq/src/main.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"955ab151486d7381fa15bb43cd2a5dd4a86cad631026680889672aaa291e9894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-recall-bounded/src/lib.rs:207-211 | crates/ruvector-recall-bounded/src/lib.rs:367-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-recall-bounded/src/lib.rs:207\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-recall-bounded/src/lib.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff0ad7e9cb754fed2d9604e81292342b7f49feef5659ad28befa701b6dc389f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-solver/src/bmssp.rs:571-576 | crates/ruvector-solver/src/router.rs:914-919 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/bmssp.rs:571\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"e132000f71e337276592c673bc7ed1db425b0b755ed5e6450d5ffb48c430fe7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-solver/src/random_walk.rs:514-519 | crates/ruvector-solver/src/random_walk.rs:544-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/random_walk.rs:514\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/random_walk.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6aca6b3e23270b9f1529edbb3a463a6b7894d90c79f161028e9653b6a3b557f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-solver/src/simd.rs:87-94 | crates/ruvector-solver/src/simd.rs:193-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060matrix\u0060 to \u0060\u0026CsrMatrix\u003Cf32\u003E\u0060 in one and \u0060\u0026CsrMatrix\u003Cf64\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"98992cdc37608f7ffa642efedfc09b9eacb2c82200476bcb43166d30154272ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-sota-bench/src/runners/lsm_ann.rs:35-39 | crates/ruvector-sota-bench/src/runners/vdbbench.rs:84-88 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sota-bench/src/runners/lsm_ann.rs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/runners/lsm_ann.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"959804bf1ea3418abd07bb2ae127206eabc7c44761a4ea1a56e0dd74580c5659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-sparse-inference/src/backend/wasm.rs:140-146 | crates/ruvector-sparse-inference/src/backend/wasm.rs:159-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/backend/wasm.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/wasm.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"540b2f45fab13154361f03190f281e25ca241686f2c5210f86c37cef64a79e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-sparse-inference/src/memory.rs:63-68 | crates/ruvector-sparse-inference/src/memory.rs:75-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sparse-inference/src/memory.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/memory.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe38658174b98b006f3195a35b35a0d893c594823f620b77dc3ea59ed56c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-speculative-ann/src/bin/benchmark.rs:159-163 | crates/ruvector-speculative-ann/src/bin/benchmark.rs:255-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-speculative-ann/src/bin/benchmark.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":"crates/ruvector-speculative-ann/src/bin/benchmark.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01c1ffb89d41369c45618ac389f3f3db7d81f21873d00e67f50a4f1c25efaa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-tiny-dancer-core/src/storage.rs:129-136 | crates/ruvector-tiny-dancer-core/src/storage.rs:164-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/storage.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"277de41acd2c36f0b6d7072a559e94ad069952db9c4c306f60bd45da0f8c546c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-turboquant/src/rotation.rs:34-39 | crates/sonic-ct/src/phantom.rs:53-58 \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":"crates/ruvector-turboquant/src/rotation.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc0b768688276f861d049cc887615a5cccdacf8a9413a79347ad07769bf1245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-turboquant/src/simd.rs:26-30 | crates/ruvector-turboquant/src/simd.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 \u0060crates/ruvector-turboquant/src/simd.rs:26\u0060 it does not close everything it opens, so those exact 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 \u0060q\u0060 to \u0060\u0026[u8]\u0060 in one and \u0060\u0026[f32]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2697ec2514aa8e1b70ae577bd0ff71db31496bb09a4268833873bced767309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-turboquant/src/simd.rs:90-95 | crates/ruvector-turboquant/src/simd.rs:185-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-turboquant/src/simd.rs:90\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-turboquant/src/simd.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07d8e2b1250c6588a7f5f2307fef1df416b6dce93e13ff1b4665cf38e936816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-typesafe-ffi/src/lib.rs:338-344 | crates/ruvector-typesafe-wasm/src/lib.rs:261-267 \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":"crates/ruvector-typesafe-ffi/src/lib.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"81891598cd7e1802d9299ca6de5b50b21d05789d23a05f9287703e652a05b7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): crates/ruvector-edge-index/src/persist/mod.rs:157-158 | crates/ruvix/crates/region/src/immutable.rs:232-236 | crates/rvm/crates/rvm-boot/src/entry.rs:227-231 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/region/src/immutable.rs:232\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/persist/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"86afb455b18a25d95236258e59d12e314759719790c493a2a4295237826218d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvix/qemu-swarm/src/monitor.rs:128-132 | crates/ruvix/qemu-swarm/src/monitor.rs:250-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/qemu-swarm/src/monitor.rs:128\u0060 it does not close everything it opens, so those exact 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 \u0060cli\u0060 to \u0060Cli\u0060 in one and \u0060\u0026Cli\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/monitor.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"035001985ad9155a5e044d8272854da427d6a38505e433bc72fb836d57553c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/bitnet/tl1_avx2.rs:145-149 | crates/ruvllm/src/bitnet/tl1_wasm.rs:154-160 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/bitnet/tl1_avx2.rs\u0060 and \u0060crates/ruvllm/src/bitnet/tl1_wasm.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/tl1_avx2.rs:145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/tl1_avx2.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28893f512edf4cc745eee96af39588abb8e5f87db09b2bfffb6f52127c90357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/gguf/quantization.rs:445-449 | crates/ruvllm/src/gguf/quantization.rs:455-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/gguf/quantization.rs:445\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/gguf/quantization.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9dfa5c9f4dd41add43822eb0a7fee221247cf078b6e1861d06013ab6182cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/hub/upload.rs:295-299 | crates/ruvllm/src/hub/upload.rs:319-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/upload.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adcb69d46bc2036df65ced977b3a9b122efd1fe6aa29747016dcd8cc0e56e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvllm/src/kernels/matmul.rs:563-579 | crates/ruvllm/src/kernels/matmul.rs:679-695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/matmul.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"832fafff94466ffc013e0e44e4eb17ea80ec4f43b2cd30b22ded1a14d9e05077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/kernels/quantized.rs:130-136 | crates/ruvllm/src/kernels/quantized.rs:536-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/quantized.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"056fe7d30db82de874989f70f5e3829cff6da1e707460fe07dafc368d948cf89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/kv_cache.rs:618-623 | crates/ruvllm/src/speculative.rs:1212-1216 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/kv_cache.rs:618\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"046e91b8b59e1360881ac2d0fa39c13a68fb90a317a4ed1c770d90b8ddc22d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/kv_cache.rs:882-886 | crates/ruvllm/src/kv_cache.rs:1522-1526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kv_cache.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c2ee3ce00d015c33eb6db2790cadc290dd793df4b89352f00337638ef904e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/quality/validators.rs:662-666 | crates/ruvllm/src/quality/validators.rs:675-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/validators.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2324a1b8b47fedcfd0cbe35b7980fdd942cca1d5aa376f0413ce118b698efeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): crates/ruvllm/src/quantize/turbo_quant.rs:361-365 | crates/ruvllm/src/quantize/turbo_quant.rs:434-438 | crates/ruvllm/src/quantize/turbo_quant.rs:608-611 \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 after the matched lines, \u0060crates/ruvllm/src/quantize/turbo_quant.rs:365\u0060 calls \u0060scalar_levels\u0060 and \u0060crates/ruvllm/src/quantize/turbo_quant.rs:611\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/turbo_quant.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a017dcb6b18d1d6b330cd38731ed7db4d04d46b85165d522b169cc9bbe6dd54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm_retrieval_diffusion/src/lib.rs:372-376 | crates/ruvllm_retrieval_diffusion/src/lib.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 \u0060crates/ruvllm_retrieval_diffusion/src/lib.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":"crates/ruvllm_retrieval_diffusion/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"555ef0477b8aeb4e5c16b6e0b98c852f8d7abd1b1ae8f3213905093f85e82644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvAgent/rvagent-core/src/rvf_bridge.rs:352-360 | crates/rvf/rvf-types/src/witness.rs:211-219 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/rvf_bridge.rs\u0060 and \u0060crates/rvf/rvf-types/src/witness.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-core/src/rvf_bridge.rs:352\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/rvf_bridge.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"05575e99421c0af636f547997eb439af6c37cdfbd33ca65bcc67f95735421980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvAgent/rvagent-wasm/src/mcp.rs:481-485 | crates/rvAgent/rvagent-wasm/src/mcp.rs:507-511 \u2014 both copies are in the same file, so extract the block 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":"crates/rvAgent/rvagent-wasm/src/mcp.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e822c315e8e7f9ef3181f4a7b3785fd8c6b87f25945b4404e560d129d802fa46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/rvf/rvf-crypto/src/sign.rs:46-61 | crates/rvf/rvf-runtime/src/write_path.rs:629-644 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-crypto/src/sign.rs:46\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-crypto/src/sign.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2681454a7a6c9095c215926f86a91679a4eff9c6f892cb2f87c4f5d000f87cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvf/rvf-runtime/src/store.rs:1072-1076 | crates/rvf/rvf-runtime/src/store.rs:1238-1243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-runtime/src/store.rs:1072\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fae75855ac40b06361571cc26aed30cf3db0e1ea146b1974339a6f6d9e8f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvforge-registry/src/log.rs:125-129 | crates/rvforge-registry/src/registry/witness.rs:158-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/log.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94defc3c22672ff4aa874da1570854e6bd937cae66fe6d418a946415b159efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvforge-registry/src/registry/mod.rs:491-497 | crates/rvforge-registry/src/store.rs:206-212 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/registry/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"46af63103402fe46aa630866cfa3b0a270190581d756f8295ff387ba6527e212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/sona/src/napi.rs:41-50 | crates/sona/src/napi_simple.rs:146-155 \u2014 before extracting anything, compare \u0060crates/sona/src/napi.rs\u0060 and \u0060crates/sona/src/napi_simple.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sona/src/napi.rs:41\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/napi.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e47a618f6a75f4a7dcb1c23d63a64dd1ccafdc4e128071e162acf04bcb9196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/sona/src/types.rs:95-99 | crates/sona/src/types.rs:121-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/types.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5c70f7a84baa11f7378541ae1f95873d2fde000674c608c16d395e9e53ca6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): edge/gateway/src/durable.rs:202-206 | edge/gateway/src/durable.rs:227-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060edge/gateway/src/durable.rs:202\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":"edge/gateway/src/durable.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d381b73f041ebefd185f157dbda74b042b34e1815445d8274e040a594ecddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/accelerate.rs:395-402 | patches/candle-core-0.8.4/src/mkl.rs:348-355 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/accelerate.rs\u0060 and \u0060patches/candle-core-0.8.4/src/mkl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb353efd7bd98b1c420c51885db29a0d34e7f55ed62c06a83e5b2b2444b81e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/accelerate.rs:406-413 | patches/candle-core-0.8.4/src/mkl.rs:359-366 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/accelerate.rs\u0060 and \u0060patches/candle-core-0.8.4/src/mkl.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"patches/candle-core-0.8.4/src/accelerate.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be0fe8f31af3faa4716a17b3def962fddacb4fa872752fc05c96196366c80c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/avx.rs:55-68 | patches/candle-core-0.9.2/src/cpu/avx.rs:55-68 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/avx.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/avx.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu/avx.rs:55\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/avx.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ede164208643f1670cc4eb63bb5f33341290853adb1bd22d2cd62d55814d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/neon.rs:66-73 | patches/candle-core-0.9.2/src/cpu/neon.rs:66-73 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/neon.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/neon.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu/neon.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":"patches/candle-core-0.8.4/src/cpu/neon.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"85854b66d5f5cb054d49ec68edb2ccf6ea41d288a82dd5979229c79294ba1787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/simd128.rs:50-63 | patches/candle-core-0.9.2/src/cpu/simd128.rs:50-63 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/simd128.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/simd128.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu/simd128.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/simd128.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dffc3097f4cba1bfae67b3e6c7be320531b6157cca146a3dfa56297982d7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2316-2321 | patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs:406-411 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0346f324f40f28d3ac28fc66019ca4b565ba5fca89b5414d1dce4f58d082c732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:124-129 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:249-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:124\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ce806ba353436c84d6936d37841be49fa834e85bac789af3826f0c0bcaacee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:580-586 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:698-704 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89042f12b2677cb5ec5bd8438160a5220fea58822a97e90aa5c5b0bd9228039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:622-626 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:743-747 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd37e98b1afa33b1b2c2b96fc61d718901b18d948beaa270f70a7f8ce5d286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:687-691 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:814-818 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"e517cd5e34b23cbf76d651723ec3ca088f1cf9be81c2a505207a62aec0ecfdcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:736-740 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:862-866 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e96af5a041392ad8e4fb0031a08d85d832e25e07693176f8408e7d1dd919e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:167-173 | patches/candle-core-0.9.2/src/device.rs:279-285 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d0ffc1e0eff19cea816036053efefd768ca1095e0b7e7f2f0112ce921d4ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/avx.rs:236-241 | patches/candle-core-0.8.4/src/quantized/neon.rs:532-537 \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 \u0060patches/candle-core-0.8.4/src/quantized/avx.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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b99058700dfa7ef4b6aa227781371dffc865309ba8711193eaa97e335d97a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:126-135 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:126-135 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8d06549a3ec88aab2ad4720996006ccf9e1ec05d9738c84315510eab910af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:217-231 | patches/candle-core-0.9.2/src/quantized/mod.rs:364-378 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:217\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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a598317660a1f16155599cac765277ccab77d8260800147759d0269c4a69d9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/sort.rs:72-76 | patches/candle-core-0.9.2/src/sort.rs:74-78 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/sort.rs\u0060 and \u0060patches/candle-core-0.9.2/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f63724440d6ea2de352407164d0f34c071509195e3e4faa8dc2604f3096b556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:443-447 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:498-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:449\u0060 calls \u0060arg\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:503\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":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c17618907936eb34f3a4c8b0f1a98e21b37055bfe980030f4a667c1a10a859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/metal.rs:290-295 | patches/candle-core-0.9.2/src/quantized/metal.rs:305-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/metal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3165a7ff77f6f7226ed1570b1a04bd86e4838bb4a6570fdd27f9e02615a3e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (731 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/ast.rs:21-751 | crates/rvlite/src/sparql/ast.rs:21-751 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/ast.rs\u0060 and \u0060crates/rvlite/src/sparql/ast.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/ast.rs:21\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/ast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c7469af7e459ea07dfaa32413e3c9884a27c0a6400b2d1d359c116f400c470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (259 lines \u00D7 2): patches/candle-core-0.8.4/src/dummy_cuda_backend.rs:20-278 | patches/candle-core-0.9.2/src/dummy_cuda_backend.rs:14-317 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/dummy_cuda_backend.rs\u0060 and \u0060patches/candle-core-0.9.2/src/dummy_cuda_backend.rs\u0060 as WHOLE FILES: 98% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/dummy_cuda_backend.rs:20\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/dummy_cuda_backend.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb94e578dd62f98c44a92ed616821063e9a23109fa2cc73ae9343b12b6394616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (234 lines \u00D7 2): patches/candle-core-0.8.4/src/dummy_metal_backend.rs:18-251 | patches/candle-core-0.9.2/src/dummy_metal_backend.rs:18-279 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/dummy_metal_backend.rs\u0060 and \u0060patches/candle-core-0.9.2/src/dummy_metal_backend.rs\u0060 as WHOLE FILES: 98% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/dummy_metal_backend.rs:18\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":"patches/candle-core-0.8.4/src/dummy_metal_backend.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"834548ada67eab54a2e28b528770ec5aa9e623fcfd5c093f8e5ee43edcef5e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/dummy_cuda.rs:11-54 | patches/candle-core-0.9.2/src/quantized/dummy_cuda.rs:11-95 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/dummy_cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/dummy_cuda.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/dummy_cuda.rs:11\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":"patches/candle-core-0.8.4/src/quantized/dummy_cuda.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"accf6c6ad03041fbf3c68909cc8f5b8a993c74f29836233258d35e203ec9bda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/dummy_metal.rs:11-50 | patches/candle-core-0.9.2/src/quantized/dummy_metal.rs:11-87 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/dummy_metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/dummy_metal.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/dummy_metal.rs:11\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":"patches/candle-core-0.8.4/src/quantized/dummy_metal.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b50a4d1c4fe32399704b4c33c0f1fbcfee7117271c7fcd64d4910be36a1569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/emergent-time/src/agentic_time.rs:30-36 | crates/emergent-time/src/structural_clock.rs:73-79 | crates/emergent-time/src/weight_learning.rs:65-71 \u2014 before extracting anything, compare \u0060crates/emergent-time/src/agentic_time.rs\u0060 and \u0060crates/emergent-time/src/weight_learning.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"27841b0c46f14f821143d9ccb50d7247256d39210c117a8395f5192559d4ab87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/emergent-time/src/agentic_time.rs:63-69 | crates/emergent-time/src/structural_clock.rs:103-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7d504f55167dcac4f9f4b3d07a69ec531196260c540089d50b94a5439e7800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/emergent-time/src/agentic_time.rs:523-528 | crates/emergent-time/src/structural_clock.rs:229-234 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/emergent-time/src/agentic_time.rs:523\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/agentic_time.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96e7d9717c93cb3e9a9207f0299eb819a09736eef10a093bbbf49a727b54975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/emergent-time/src/witness.rs:23-30 | crates/ruvector-agent-memory/src/ops.rs:244-251 | crates/ruvector-mincut-gated-transformer/src/spike.rs:215-223 | crates/ruvector-mincut-gated-transformer/src/spike.rs:226-233 | crates/ruvllm/src/bitnet/rlm_embedder.rs:533-540 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/witness.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5002bddb7f84f1bdc126f7bbff02e2f4c6d64f2135ba4b07c44e6195801e915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-brain-server/src/bin/local.rs:691-696 | crates/ruvector-hyperbolic-hnsw/src/shard.rs:154-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142f2def026c6380d3f1cd7dd4adf4657b95d9fc151a61f05b9fe92eee10d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp-brain/src/types.rs:169-180 | crates/mcp-gate/src/types.rs:312-323 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/types.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fd9db2c51cfb309a51409b24be95bcd3d856e82a9ecc2b8a985943fbf34981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/micro-hnsw-wasm/src/lib.rs:158-163 | crates/ruvector-learning-wasm/src/lora.rs:336-343 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af696b4bb3eb5b9d61bf948fc8c1acb0b538e25d86eb03f1e436e3e02bc89fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/photonlayer-bench/src/decoder.rs:39-46 | crates/prime-radiant/src/coherence/spectral.rs:561-568 | crates/ruvector-bench/src/lib.rs:125-132 | crates/ruvector-cnn/src/lib.rs:284-291 | crates/ruvector-memory-admission/src/dataset.rs:131-138 | crates/ruvector-namespace-merge/src/dataset.rs:166-173 | crates/ruvllm/src/qat/reasoning_loss.rs:412-419 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/decoder.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b781ae29cac6504bc823e05b760d713ae1d24d979d9d4d71267b73bff33d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): crates/prime-radiant/src/execution/action.rs:298-303 | crates/prime-radiant/src/execution/action.rs:515-520 | crates/prime-radiant/src/execution/ladder.rs:466-471 | crates/prime-radiant/src/learned_rho/training.rs:227-232 | crates/prime-radiant/src/neural_gate/decision.rs:215-220 | crates/prime-radiant/src/neural_gate/encoding.rs:327-332 | crates/prime-radiant/src/neural_gate/gate.rs:449-454 | crates/prime-radiant/src/sona_tuning/adjustment.rs:162-167 | crates/prime-radiant/src/sona_tuning/tuner.rs:422-427 \u2014 there are 9 copies across 8 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 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/execution/action.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7854eb09f6c0251a4575d16b4ba98fb4b026b19c890272354bc8d394804a98a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/prime-radiant/src/simd/energy.rs:470-474 | crates/prime-radiant/src/simd/vectors.rs:467-471 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b2aa2300a23e59be011c64d8480c5f33ae6c14d114eec7eb2e869f6450e175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/prime-radiant/src/simd/energy.rs:477-484 | crates/prime-radiant/src/simd/vectors.rs:481-488 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6deef3ad466536fe2ff5e6a4dbeabb69213efa556eff288dfd6b5305723acb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/prime-radiant/src/simd/energy.rs:512-517 | crates/prime-radiant/src/simd/matrix.rs:387-392 | crates/prime-radiant/src/simd/vectors.rs:496-501 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcff6d1282ac83f42b7b98e1b24fd0e7eb40ed050aecdc077bface6c13debe8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/prime-radiant/src/simd/energy.rs:520-524 | crates/prime-radiant/src/simd/matrix.rs:395-399 | crates/prime-radiant/src/simd/vectors.rs:505-509 \u2014 before extracting anything, compare \u0060crates/prime-radiant/src/simd/energy.rs\u0060 and \u0060crates/prime-radiant/src/simd/vectors.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/simd/energy.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d604cdfb9d18046c43b3b82e641df9e82d7f1324e7d2e9ec4e598f17f354f1be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/prime-radiant/src/simd/matrix.rs:328-337 | crates/ruvector-consciousness/src/simd.rs:244-253 \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 \u0060a\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":"crates/prime-radiant/src/simd/matrix.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda86be1022d97d5a47f8be6032510bb4d161b156301ef321b1b6038d2d82837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-agent-memory/src/arbitration.rs:581-587 | crates/ruvector-graph-condense/src/regions.rs:165-171 | crates/ruvector-sparsifier/src/backbone.rs:44-50 \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":"crates/ruvector-agent-memory/src/arbitration.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"019d5c03c0e8eb8fc93629d78404817d762f313a1048954a0f1e751c0ab60be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-agent-memory/src/ledger.rs:709-714 | crates/ruvector-staged-workspace/src/workspace.rs:359-364 | crates/rvf/rvf-runtime/src/locking.rs:254-259 \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":"crates/ruvector-agent-memory/src/ledger.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efeae6d5df500e0586859aa558b261b82a2cf62fd8d9c88a115da2d4d0b1532"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-agent-memory/src/scoring.rs:6-10 | crates/ruvector-lsm-ann/src/lib.rs:87-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/scoring.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d76e0f81fb1b50d934b5bb51628c7282cc3a99f480c85204aa1c6ff46ae4ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-attention-node/src/training.rs:908-912 | crates/ruvector-attention/src/training/mining.rs:259-263 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/training/mining.rs:259\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/training.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15b2a818bd3fef827a3359bc1543f0a5c2aaae31cd9ad0b2435f1405542846b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/graph.rs:185-197 | crates/ruvector-gnn-wasm/src/lib.rs:253-265 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/graph.rs\u0060 and \u0060crates/ruvector-gnn-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/graph.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8628b63ebdf1b9cfc3d7ca7b88edf82b4f3c32af3b389b7ef7fe32be6bea5fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/neural.rs:78-88 | crates/ruvector-attention-wasm/src/attention.rs:52-62 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/neural.rs\u0060 and \u0060crates/ruvector-attention-wasm/src/attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/neural.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ee09d7e8004e17e2455c723ef31d2578e77335041ae090ad99b94c6d38882b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/neural.rs:154-164 | crates/ruvector-attention-wasm/src/attention.rs:110-120 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/neural.rs\u0060 and \u0060crates/ruvector-attention-wasm/src/attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/neural.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ba7622ea3e62bacef691368da5725668a5d27510ded688d967bdcf2e06d453"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/neural.rs:352-361 | crates/ruvector-attention-wasm/src/attention.rs:280-289 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/neural.rs\u0060 and \u0060crates/ruvector-attention-wasm/src/attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/neural.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ab9189d53f0994612b79e7ab0d4f337f2072e66b5283be3a752075fb8f3320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-attention/src/attention/ssm.rs:87-95 | crates/ruvector-cnn/src/contrastive/triplet.rs:392-400 \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 \u0060x\u0060 to \u0060f32\u0060 in one and \u0060f64\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/ssm.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f466ad52246b020c61cf0ac16a73eb197a34126070d67665d3b68179ef7c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-attention/src/curvature/fused_attention.rs:74-80 | crates/ruvector-math/src/product_manifold/config.rs:168-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/curvature/fused_attention.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/fused_attention.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"324397110788ce9c33b5f300e71e262a8dd684aa95284e0ca785ee25bae96c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-attention/src/info_bottleneck/bottleneck.rs:126-137 | crates/ruvector-attention/src/unified_report/report.rs:319-330 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/info_bottleneck/bottleneck.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6146eae00c0f70c283aae3f874fd6202bf09ec6210cac19aa61fe9f29cf911d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-attention/src/topology/coherence.rs:117-122 | crates/ruvector-rabitq/src/index.rs:181-186 | crates/sona/src/reasoning_bank.rs:341-346 \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":"crates/ruvector-attention/src/topology/coherence.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4722e3146e03aec052c23df7e207de49ba4c648123f7f8ec8733a2d79e719c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): crates/ruvector-attention/src/training/loss.rs:155-161 | crates/ruvector-attention/src/training/mining.rs:56-62 | crates/ruvector-core/src/advanced/tda.rs:406-412 | crates/ruvector-core/src/agenticdb.rs:859-865 | crates/ruvector-dag/src/sona/reasoning_bank.rs:200-206 | crates/ruvector-gnn-rerank/src/reranker.rs:99-105 | crates/ruvector-nervous-system/src/integration/ruvector.rs:404-410 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/training/loss.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6172f4445fef22310987d9ceeefebe1e50b19732ac3b520dcc9a17ea2a6d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-bet4-ivf-bench/src/oracle.rs:9-18 | crates/ruvector-core/src/advanced_features/mmr.rs:188-197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/oracle.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"01de0502949a910ea11dafbe96ae5710dc17620f6be5c105abdd204b2334e30c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-bet4-ivf-bench/src/pq.rs:110-118 | crates/ruvector-core/src/advanced_features/product_quantization.rs:314-322 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/pq.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2da9c481b0d651446314d236e06ea006a46964d16b2c1866778157faebb606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/ruvector-capgated/src/bin/benchmark.rs:39-45 | crates/ruvector-diverse-beam/src/bin/benchmark.rs:63-69 | crates/ruvector-retrieval-receipt/src/bin/batch_latency.rs:44-50 | crates/ruvector-speculative-ann/src/bin/benchmark.rs:57-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060sorted\u0060 to \u0060\u0026[u128]\u0060 in one and \u0060\u0026[u64]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-capgated/src/bin/benchmark.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"837bc6f7c7dda2d90007d88fd2e1b78e1f99485d17629ed51ea490e81aa9ba67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-capgated/src/eager_mask.rs:30-37 | crates/ruvector-capgated/src/post_filter.rs:26-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-capgated/src/eager_mask.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d8cd18b9fdacedf6066844b8cc065da6c283ff39a1b09134fb6967e705996b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-cluster-rag/src/bench.rs:66-72 | crates/ruvector-matryoshka/src/bin/benchmark.rs:82-88 | crates/ruvector-pq-search/src/main.rs:235-241 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060sorted\u0060 to \u0060\u0026[f64]\u0060 in one and \u0060\u0026[u64]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/bench.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1911f0ab964b39e826b1a8a42e74bee4e72942e74355190a78045b742d610ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/ruvector-cluster-rag/src/bin/benchmark.rs:21-26 | crates/ruvector-cluster-rag/src/bin/benchmark.rs:28-33 | crates/ruvector-memory-admission/src/bin/benchmark.rs:39-44 | crates/ruvector-memory-admission/src/bin/benchmark.rs:45-50 | crates/ruvector-streaming-qng/src/bin/benchmark.rs:30-35 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060default\u0060 to \u0060usize\u0060 in one and \u0060f32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster-rag/src/bin/benchmark.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a91a6fc90ce26eaac117ed0b245da7e3cc47b3a647b0417d4f569ecb4197a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-consciousness/src/bounds.rs:267-277 | crates/ruvector-consciousness/src/phi.rs:472-483 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/bounds.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"286b1c5babfc7a3cb7746f8194674c5bebc8b2eb295c81de83097122128074ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-consciousness/src/iit4.rs:399-405 | crates/ruvector-consciousness/src/phi.rs:211-217 | crates/ruvector-consciousness/src/pid.rs:333-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/iit4.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8affc2b57568252a4c4c863502c545749486e7112db4e8ed83a891055c01985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-consciousness/src/phi_id.rs:163-171 | crates/ruvector-consciousness/src/simd.rs:158-166 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/phi_id.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"68294adcc9854114e2c01e63e5d22f18b9308b540813e8086e80f159f2d647b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-consciousness/src/types.rs:34-40 | crates/ruvector-core/src/advanced_features/opq.rs:220-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/types.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae88008797469e2e34bcfea91ac37ef4ca9cceb5fe30732c457d79d4ad316a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-core/src/advanced_features/compaction.rs:459-465 | crates/ruvector-nervous-system/src/hopfield/capacity.rs:126-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/compaction.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb8b5a99a59eb9ff4e4ebc9bea865b0c6119320b1c9b54cc8680921f4554edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs:209-216 | crates/ruvector-dag/src/qudag/crypto/ml_kem.rs:242-249 | crates/ruvix/crates/boot/src/signature.rs:173-181 | crates/ruvllm/src/quantize/security.rs:157-164 \u2014 before extracting anything, compare \u0060crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs\u0060 and \u0060crates/ruvector-dag/src/qudag/crypto/ml_kem.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/qudag/crypto/ml_dsa.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7ad3a6f94c5f52c2c44ce979d26ea0e551f56363023b88f9c05f935364dd63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-decompiler/src/model_gguf.rs:244-248 | crates/ruvllm/src/gguf/parser.rs:390-394 \u2014 before extracting anything, compare \u0060crates/ruvector-decompiler/src/model_gguf.rs\u0060 and \u0060crates/ruvllm/src/gguf/parser.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_gguf.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4e17b7c9844efb6dde39d0909956bf816c25ebd152eaa3efd46791e22eee4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-decompiler/src/model_gguf.rs:250-254 | crates/ruvllm/src/gguf/parser.rs:400-404 \u2014 before extracting anything, compare \u0060crates/ruvector-decompiler/src/model_gguf.rs\u0060 and \u0060crates/ruvllm/src/gguf/parser.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_gguf.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba583df69ee9c2fff78b32fa05619702e6de6c83723694fd305020f8bb7f9e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-decompiler/src/model_gguf.rs:256-260 | crates/ruvllm/src/gguf/parser.rs:412-416 \u2014 before extracting anything, compare \u0060crates/ruvector-decompiler/src/model_gguf.rs\u0060 and \u0060crates/ruvllm/src/gguf/parser.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_gguf.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9011ec840fda1a56139cd96d379bcb6da1e5ded6bd190d4c8f66a499f79a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-decompiler/src/model_gguf.rs:262-266 | crates/ruvllm/src/gguf/parser.rs:424-428 \u2014 before extracting anything, compare \u0060crates/ruvector-decompiler/src/model_gguf.rs\u0060 and \u0060crates/ruvllm/src/gguf/parser.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_gguf.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e038d295bf9c374ee767c758f619adc86b047b4296274c1a799c3c00af24f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-decompiler/src/model_gguf.rs:268-272 | crates/ruvllm/src/gguf/parser.rs:436-440 \u2014 before extracting anything, compare \u0060crates/ruvector-decompiler/src/model_gguf.rs\u0060 and \u0060crates/ruvllm/src/gguf/parser.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_gguf.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4194e5360a65d6753c95a0b5bf3f8c5018ffaa383319e5b6189f41bfb7c13d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-decompiler/src/model_gguf.rs:274-278 | crates/ruvllm/src/gguf/parser.rs:442-446 \u2014 before extracting anything, compare \u0060crates/ruvector-decompiler/src/model_gguf.rs\u0060 and \u0060crates/ruvllm/src/gguf/parser.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/model_gguf.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2b869bcd59f36d3e4dca309ac24ff7a3df08941562d7d0854a51c7362e0c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-decompiler/src/witness.rs:126-133 | crates/rvf/rvf-kernel/src/lib.rs:478-485 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/witness.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"998cde4d70abc7b39d90ee0dfc8f6fac6d3c47e4c1d7c3fee9559fb38da6040e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-delta-consensus/src/causal.rs:37-42 | crates/ruvector-replication/src/conflict.rs:40-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-consensus/src/causal.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88b4a1cce5855fb732bc4310eb8e4cbf9ef96be4d7c23e3f9dab6c7fb15f325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-delta-core/src/lib.rs:41-50 | crates/rvf/rvf-index/src/lib.rs:14-23 | crates/rvf/rvf-quant/src/lib.rs:24-33 \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":"crates/ruvector-delta-core/src/lib.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44dd35595a0e6c186d3aea6c8425fd95c573ed1f70589d68ee0c579e8b22334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-edge-analytics/src/job.rs:68-73 | crates/ruvector-edge-authz/src/federation.rs:339-343 | edge/gateway/src/graph_routes.rs:66-71 \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":"crates/ruvector-edge-analytics/src/job.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6047f0216e29575d76b076960de8ce351fa40f83c8bef1ebb548789d077bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-edge-index/src/metric.rs:32-39 | crates/ruvector-edge-store/src/distance.rs:41-48 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/metric.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4e0e0b96794eefb7bd32828a1a5a48c053543876d5639218f50d7c2e59c6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-edge-index/src/metric.rs:49-56 | crates/ruvector-edge-snapshot/src/types.rs:39-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/metric.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0fdeedddbaa4363e62ba7b25686406ebd059f117f6a6d3fe0b71c5af32c0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/ruvector-edge-index/src/persist/mod.rs:121-125 | crates/ruvector-edge-registry/src/validate/layout.rs:50-54 | crates/rvf/rvf-manifest/src/directory.rs:58-62 | crates/rvf/rvf-manifest/src/level0.rs:21-25 | crates/rvf/rvf-types/src/stream.rs:110-114 | crates/rvf/rvf-wire/src/stream/verifier.rs:161-165 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/persist/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5e6b4ebb7e159f15ff8d2ebe8129eaa7450bb6a3b6ced2915c149fc892d485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-edge-registry/src/validate/mod.rs:208-215 | crates/ruvector-edge-snapshot/src/types.rs:57-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-registry/src/validate/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6572bba3ce41fba76828595bfdb1e66ef7fdf834bc95773c34f6dcee79c80ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-edge-snapshot/src/types.rs:209-214 | edge/gateway/src/m3_shard.rs:68-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-snapshot/src/types.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea07d69ef3a4dacd2a87fec6ccf51c07dd1aee14f333bb859a09ab1fb881b3c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-edge-store/src/ledger/catalog.rs:146-154 | edge/gateway/src/wire.rs:104-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ledger/catalog.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac333df3fdc9b76226e100102937028a5340ea9a690cf530da0cb2fcee7081e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-embed-core/src/pooling.rs:57-64 | crates/ruvector-maxsim/src/main.rs:62-69 | crates/ruvector-typesafe-core/src/embedder.rs:42-49 \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":"crates/ruvector-embed-core/src/pooling.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe19cbad542797142a239cc44571b86eedd5a2d020a677310cb4d5cc6bf19804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-gnn/src/layer.rs:288-295 | crates/ruvector-tiny-dancer-core/src/model.rs:609-616 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/layer.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76fc939b28b7e2843df8fdd5225088a73c6d23953df045767dbc0af047422cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-gnn/src/mmap.rs:49-56 | crates/ruvector-gnn/src/mmap_fixed.rs:36-43 \u2014 before extracting anything, compare \u0060crates/ruvector-gnn/src/mmap.rs\u0060 and \u0060crates/ruvector-gnn/src/mmap_fixed.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4de8b02903cc6b5cf587b3cbdaedf08d9e0552bae833d1abe84c6e9adecde5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-gnn/src/mmap.rs:62-69 | crates/ruvector-gnn/src/mmap_fixed.rs:45-52 \u2014 before extracting anything, compare \u0060crates/ruvector-gnn/src/mmap.rs\u0060 and \u0060crates/ruvector-gnn/src/mmap_fixed.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79989fd0ced5c6f5973e74eec9efbfb9a74d5800ab974fd511d8c7b2da85156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-gnn/src/mmap.rs:78-86 | crates/ruvector-gnn/src/mmap_fixed.rs:54-62 \u2014 before extracting anything, compare \u0060crates/ruvector-gnn/src/mmap.rs\u0060 and \u0060crates/ruvector-gnn/src/mmap_fixed.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacfbe8afe156e5345652f8caa0d8a96d7d8b8d3e6d1ac57f5648bfd32b9dfa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ruvector-graph-condense/src/regions.rs:130-138 | crates/ruvector-robotics/src/bridge/indexing.rs:82-90 | crates/ruvector-speculative-ann/src/lib.rs:76-84 | crates/rvf/rvf-quant/src/product.rs:157-165 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-condense/src/regions.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6bb91918806ae1ba694611efececf883df3da4107b7db90c37ecb84c2bf15b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:53-59 | crates/ruvector-py/src/graph/cypher_eval.rs:39-45 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b70c70613db9f0c53ffe4497ac8d870ffe598b86fe36f4c0134652335b88f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:355-368 | crates/ruvector-py/src/graph/cypher_exec.rs:69-82 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d00daac501dc33b18c6a68b3c610f7ec7d7eed518fe3cc8927a0f86fcc23cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:417-425 | crates/ruvector-py/src/graph/cypher_exec.rs:131-139 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_exec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 149 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d0a6fd6294bffe38543d0367a13351905f620d3a9f56619d64da39232ddb88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-graph-node/src/types.rs:19-26 | crates/ruvector-node/src/lib.rs:40-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":"crates/ruvector-graph-node/src/types.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a63fe1ee6ab4cee7be2453f84bf62a5f6b325f746643724984accf23002124a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:244-252 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:264-272 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8365ba74ae1a072706692239d2e0d449feaa8478bd67f6491de9c869103c72d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:254-259 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:274-279 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"363006946f9ed3d684d6b32dedbd4af6781992df84eebe5afc812e947de6c1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:261-268 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:281-288 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f2a7a35588564ebac77f86885eba5353c26f20b2e3155492a777bce17a40a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:276-286 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:296-306 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fc65f6da81f814e91327dd8697c541b5ee39d75afe3c997e56391315429b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:1101-1107 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:1184-1190 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"98497fdff6383a705c53b80e1e33eb8a3b86411b6dccd5fcbcc1fc714e31f19b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-graph-transformer-node/src/transformer.rs:1114-1118 | crates/ruvector-graph-transformer-wasm/src/transformer.rs:1197-1201 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-transformer-node/src/transformer.rs\u0060 and \u0060crates/ruvector-graph-transformer-wasm/src/transformer.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 827 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"df67dc0b1e5fa3ddf3dd4dde78d53de6544c40ca6af10422d02997393e5813ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-graph/src/cypher/ast.rs:344-351 | crates/rvlite/src/cypher/ast.rs:344-351 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/ast.rs\u0060 and \u0060crates/rvlite/src/cypher/ast.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/ast.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc1a0cdb9ac1491ee7c8770b6f6cbe8e9905841b08d46f1dae7ce67eacce8e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-graph/src/cypher/ast.rs:372-379 | crates/rvlite/src/cypher/ast.rs:372-379 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/ast.rs\u0060 and \u0060crates/rvlite/src/cypher/ast.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/ast.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"55884980f359ad9c5a367fdc68ecb701ccdfb16967d1ac2291c2d7066c2e7a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:86-91 | crates/rvlite/src/cypher/parser.rs:82-87 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c3442557f38814f96bdd6f730ec68e1d616f6ef5b77dbc8a4a260e16eb044d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:184-192 | crates/rvlite/src/cypher/parser.rs:180-188 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f9b62240b5ed8cc3b616d5c02090184b8473bc6d6c05c7c0d989789efcad9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:457-462 | crates/rvlite/src/cypher/parser.rs:447-452 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdc7ef6ef70c0fcc2b5f877270416d04952578a09f68f6856bcbd47995241e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:560-564 | crates/rvlite/src/cypher/parser.rs:550-554 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcadd10084a3ac07f1bf5027b2d462c9b21722577d6dad529808de753b8bd4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:1008-1016 | crates/rvlite/src/cypher/parser.rs:912-920 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"5909e3ec4227e1b6a51e29d53824cc2cfdd331946ed897d794fa7f97ec0f9c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-graph/src/embed.rs:53-60 | crates/ruvector-typesafe-core/src/hash_embedder.rs:23-30 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/embed.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30b0b9c8efd79c5c218044ffeb3f6a763f140c459e88d839df5b38834eb4d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-graph/src/executor/cache.rs:271-278 | crates/ruvector-verified/src/cache.rs:32-39 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/executor/cache.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdec5d83ed80f2f4f2196b368b323d73eac86178933e379edff0522fe210683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:77-84 | crates/ruvector-kge-wasm/src/model.rs:77-84 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd262859d6370be410593bf92d89da60752ae24359e73f82d70f5870cf84527f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:155-163 | crates/ruvector-kge-wasm/src/model.rs:155-163 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e445fc0ac9a2b33a24213f9946cf7e6467f553e5caa31620f6299b251d96ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:245-249 | crates/ruvector-kge-wasm/src/model.rs:245-249 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76ff49dec6ead54091eed274dd2c866efb8be694fcd0321a2b769bebb1e70f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:318-325 | crates/ruvector-kge-wasm/src/model.rs:318-325 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3851514841c30d5cd6dc089efbe1312ce0da56930987545c8d9cdded775e7187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:403-409 | crates/ruvector-kge-wasm/src/model.rs:403-409 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5efcc28d07cc38651c5922903cbd151365c645b8a2ecc0d7dd43995ee7a01d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:411-418 | crates/ruvector-kge-wasm/src/model.rs:411-418 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c62639a793b6b2a3af8bf234478e061632c96eed3a190bbdc2f40dfbe74839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-kge-ffi/src/ops.rs:359-369 | crates/ruvector-kge-wasm/src/ops.rs:359-369 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/ops.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/ops.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 247 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/ops.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b404825307ecbba0cb12b8970845d4f5ba32c165c08bf53b4d2a3e3b93325ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-kge/src/adversarial.rs:47-54 | crates/ruvector-kge/src/tables.rs:14-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/adversarial.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2156101a2a3e82a7e641b308ffdc0f78c9ec31aeb6eedb4adacb288c2acd9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-kge/src/adversarial.rs:212-218 | crates/sonic-ct/src/bin/serve.rs:136-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/adversarial.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f802f044452578fec3ab1d1fc9ba2cf253f253c59b0f2ee4272c52ceab9883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-kge/src/data/rng.rs:4-9 | crates/rvf/rvf-quant/src/rabitq.rs:87-92 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge/src/data/rng.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"024eff33f798b92f7c0481c6325caabf823b21d5ed5fe43c5e69040a5dad8da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs:421-432 | crates/ruvector-math/src/utils/sorting.rs:43-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":"crates/ruvector-math/src/optimal_transport/sliced_wasserstein.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4371a1b25ac48f02243d3e296a6daab5d952303cd200795203f5ccb916b7707b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-math/src/tensor_networks/tensor_train.rs:473-480 | crates/ruvector-math/src/tensor_networks/tucker.rs:222-229 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/tensor_networks/tensor_train.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"889afef5f57528f57f2e42015250a44d921e4d735294994ec684612e06f15357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-memory-admission/src/bin/benchmark.rs:64-70 | crates/ruvector-namespace-merge/src/bin/benchmark.rs:59-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/bin/benchmark.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00af4b7eb19800a50749abcea473dce5b0cad1404d42da456785f6ebc119feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-memory-admission/src/bin/benchmark.rs:71-76 | crates/ruvector-namespace-merge/src/bin/benchmark.rs:67-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/bin/benchmark.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2705650b99093a99ae2a4a9c491af9e8553612c3141a367bc5806847ae576e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-memory-admission/src/dataset.rs:125-129 | crates/ruvector-namespace-merge/src/dataset.rs:160-164 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/dataset.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f889e9c15d94ce335eb75729c9edab4ae33a4e4962ca1b11790879a6fbc3739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/ffn.rs:501-508 | crates/ruvector-mincut-gated-transformer/src/kernel/qgemm.rs:530-537 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/ffn.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ce1a1b89c2180400d99e8e89f03a230587957825f5d6e672a6c93d7c241dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-mincut/src/cluster/hierarchy.rs:275-282 | crates/ruvector-mincut/src/fragmentation/mod.rs:154-161 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7a1ee5a99f06e016776b073f8e720d0ddc49effb3df81e8054462f83d708e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ruvector-mincut/src/cluster/hierarchy.rs:290-295 | crates/ruvector-mincut/src/fragmentation/mod.rs:169-174 | crates/ruvector-mincut/src/localkcut/deterministic.rs:457-462 | crates/ruvector-mincut/src/subpolynomial/mod.rs:993-998 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/cluster/hierarchy.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f5b15d72195b0411b194ab7b736118fe4adc1bab02b38fee080920560a394e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-mincut/src/parallel/mod.rs:26-36 | crates/ruvector-mincut/src/wasm/simd.rs:87-101 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/parallel/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9f292b6e77156bbba49b33fccfb3b1a348b6ed183ab39be7d1037b1cb9939e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut/src/snn/optimizer.rs:139-144 | crates/ruvector-nervous-system/src/routing/workspace.rs:192-197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/snn/optimizer.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef07d9699d67197027604556cf9cc0666f61fec0b1baaae51b29bbe8ddec2c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-namespace-merge/src/bin/benchmark.rs:28-33 | crates/ruvector-speculative-ann/src/bin/benchmark.rs:38-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-namespace-merge/src/bin/benchmark.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5579ff64c4be6f8965f81ecea2999fcc516722c346016c57c41f87f6a271ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-namespace-merge/src/bin/benchmark.rs:34-39 | crates/ruvector-speculative-ann/src/bin/benchmark.rs:32-37 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-namespace-merge/src/bin/benchmark.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"44719966ac84921bab52355d0b92edd9f73813d5f4673ba1cc25a266109c0769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/btsp.rs:246-257 | crates/ruvector-nervous-system/src/plasticity/btsp.rs:353-364 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/btsp.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c0c88310953e0847421e1d7a0a7c1c5616436b5adc8c50b44b304bbf3042b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-nervous-system-wasm/src/workspace.rs:305-311 | crates/ruvector-nervous-system/src/routing/workspace.rs:428-435 \u2014 before extracting anything, compare \u0060crates/ruvector-nervous-system-wasm/src/workspace.rs\u0060 and \u0060crates/ruvector-nervous-system/src/routing/workspace.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/workspace.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99d216e184ff93e4d6fd640b74835504edb6203e37948571ccce794572affc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-postgres/src/dag/functions/healing.rs:51-62 | crates/ruvector-postgres/src/dag/functions/status.rs:203-215 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/dag/functions/healing.rs:51\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/dag/functions/healing.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70d2ef144d616355f70c1b63118ce080ab978122df66525a85bc58937f0c7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-postgres/src/distance/scalar.rs:24-34 | crates/ruvector-spann/src/distance.rs:5-14 | crates/rvf/rvf-index/src/distance.rs:14-23 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/scalar.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/scalar.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2898cb3787baad555411cb0f2caae1fd9925ad7ec73839942e15ceb2ccf6e512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-postgres/src/distance/scalar.rs:69-75 | crates/rvf/rvf-index/src/distance.rs:52-56 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/distance/scalar.rs\u0060 and \u0060crates/rvf/rvf-index/src/distance.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/scalar.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec652c650e1e861aaeaf068fe1ed9ee093e36d3cd531b9f09def7f7fea39e246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:210-215 | crates/rvlite/src/sparql/executor.rs:184-189 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"821b52b784512eba31ac0121e95db196fb0d13bb0de2cc1803c558e4fe15ca3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:894-903 | crates/rvlite/src/sparql/executor.rs:517-526 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs:905\u0060 calls \u0060shares_variables\u0060, \u0060keys\u0060, \u0060any\u0060 and \u0060crates/rvlite/src/sparql/executor.rs:528\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"700d1913c7b51c811c0ec34645b7faaabaa32fcb10ad06f48da0131e8239f96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/executor.rs:909-919 | crates/rvlite/src/sparql/executor.rs:528-538 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0ce41d6ecb9b98535233d3d55539166c3cb5de68b4a2a3619234b7e68bcee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-postgres/src/graph/sparql/executor.rs:1526-1532 | crates/ruvector-postgres/src/graph/sparql/functions.rs:593-599 | crates/rvlite/src/sparql/executor.rs:803-809 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/executor.rs\u0060 and \u0060crates/rvlite/src/sparql/executor.rs\u0060 as WHOLE FILES: this scan already matched 31 separate duplicated blocks between them, totalling at least 580 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/executor.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd6ff1ceb69a139320c77466603f0a8d06449842a5392c53b5344b29c3542bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:35-49 | crates/rvlite/src/sparql/parser.rs:59-73 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a558d70c2d4680824d426dfd15f5426502e7c46e18d18663f7096ba4dbab8bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1169-1218 | crates/rvlite/src/sparql/parser.rs:1207-1256 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dd4a823e78a61d87dd8e0259d9d358092e6cfae9f7fe4bd0c81bcfed04c3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1355-1362 | crates/rvlite/src/sparql/parser.rs:1393-1400 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0375b413e1745faa44409442988e335f5f537518e15f79d4f4ca8df57a62467c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1851-1858 | crates/rvlite/src/sparql/parser.rs:1890-1897 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dd59a7ecff6549bb321868cd818919fad485e5b71c6747df78b6527bb150c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/parser.rs:1876-1883 | crates/rvlite/src/sparql/parser.rs:1915-1922 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/graph/sparql/parser.rs\u0060 and \u0060crates/rvlite/src/sparql/parser.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 2103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"85440b9d41a5e4715615996e8ace37cc5d482605a8a2b536660e162785c73285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/quantization/binary.rs:41-48 | crates/ruvector-postgres/src/types/binaryvec.rs:168-174 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/quantization/binary.rs\u0060 and \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/quantization/binary.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b538207122a086cbc8320de2cbeb3aa189256fa4bb1d823522e144ae04b08deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/ruvector-postgres/src/tenancy/isolation.rs:738-743 | crates/ruvector-postgres/src/tenancy/operations.rs:620-625 | crates/ruvector-postgres/src/tenancy/quotas.rs:585-590 | crates/ruvector-postgres/src/tenancy/registry.rs:597-602 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/isolation.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"306ba64893bd562970d8e83ae157a8053589825edb611d997e2e22788c6e77b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-postgres/src/tenancy/registry.rs:605-610 | crates/rvf/rvf-runtime/src/store.rs:4843-4848 | crates/rvforge-reader/src/install/flow.rs:296-301 \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":"crates/ruvector-postgres/src/tenancy/registry.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1264bed5518c3e806d6130056394132f1e76e2d2efc6167fd6a236ac247c17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): crates/ruvector-raft/src/rpc.rs:79-84 | crates/ruvector-raft/src/rpc.rs:138-143 | crates/ruvector-raft/src/rpc.rs:187-192 | crates/ruvector-raft/src/rpc.rs:229-234 | crates/ruvector-raft/src/rpc.rs:296-301 | crates/ruvector-raft/src/rpc.rs:343-348 | crates/ruvector-raft/src/rpc.rs:382-387 | crates/ruvector-raft/src/state.rs:102-107 \u2014 there are 8 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 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/rpc.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"939f8d182792512487a4771d147a1c4eafa48b9194c16ead9ab15b5e4bef4ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-rairs/src/rairs.rs:60-71 | crates/ruvector-rairs/src/seil.rs:72-83 \u2014 before extracting anything, compare \u0060crates/ruvector-rairs/src/rairs.rs\u0060 and \u0060crates/ruvector-rairs/src/seil.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/rairs.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"231ec03d414eea232910733b85c7f1047c9f30a21f96647eb56f998209b5698c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-retrieval-receipt/src/bin/batch_latency.rs:32-37 | crates/ruvector-retrieval-receipt/src/bin/benchmark.rs:43-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-retrieval-receipt/src/bin/batch_latency.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ffe392bc8a4c6148494cf505874aa50834ec5197c028d1884d553f7fa83240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/ruvector-sparse-inference/src/backend/cpu.rs:437-441 | crates/ruvector-sparse-inference/src/backend/wasm.rs:199-203 | crates/ruvllm/src/kernels/activations.rs:202-206 | crates/ruvllm/src/kernels/ane_ops.rs:628-632 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/backend/cpu.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf12d16edd8684e1dcb4a9c3dd952ed2733f725f2e322f02b90ab7972ec160ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-sparse-inference/src/integration/ruvector.rs:83-91 | crates/ruvector-sparse-inference/src/integration/ruvllm.rs:221-229 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/integration/ruvector.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b173528f5af7b2cc7a684554c68517477cb674abba6e5480485fe34cb5f5c406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-temporal-tensor/src/segment.rs:232-237 | crates/ruvector-temporal-tensor/src/store_ffi.rs:281-286 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/segment.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3272ce97a10740c2155d8676deb6ec8f39c093eb6e491124045a5f6381a7131d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-temporal-tensor/src/store.rs:191-204 | crates/rvf/rvf-runtime/src/locking.rs:362-375 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-temporal-tensor/src/store.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ae453b2e796586779af1eb77ca6693f66d50ee409cf00f7fb0d7276722c24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-typesafe-ffi/src/lib.rs:112-119 | crates/ruvector-typesafe-wasm/src/lib.rs:67-74 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-ffi/src/lib.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"06253891051e8128f163f385aae70a81992c3df440b7ac8d87f9eccb38059a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-verified/src/proof_store.rs:162-167 | crates/rvf/rvf-adapters/agentic-flow/src/coordination.rs:159-164 | crates/rvf/rvf-adapters/claude-flow/src/witness.rs:192-197 \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":"crates/ruvector-verified/src/proof_store.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a993307d19c7d3f9bdff6464b6c3bac478d3d71828feeaa1c11f289d5d45dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvix/crates/bcm2711/src/mini_uart.rs:552-557 | crates/ruvix/crates/drivers/src/pl011.rs:273-278 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mini_uart.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08e72c91a3ec0351d29e88e0794fb7d9ef8a0b9c47a6bdb7bf37300bccaaac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvix/crates/bcm2711/src/mmio.rs:218-225 | crates/ruvix/crates/drivers/src/mmio.rs:177-184 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/bcm2711/src/mmio.rs\u0060 and \u0060crates/ruvix/crates/drivers/src/mmio.rs\u0060 as WHOLE FILES: 93% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mmio.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0db5eff0ed13362a097eb016289ec8b5f939fd17f6e3bea469ea593d38a658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvix/crates/net/src/ethernet.rs:93-100 | crates/ruvix/crates/net/src/ipv4.rs:128-135 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/net/src/ethernet.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f33605c84e5200eb243e73c2400be1cb80da205acfa6a348f624bf5ebdce80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvix/crates/region/src/append_only.rs:218-225 | crates/ruvix/crates/region/src/immutable.rs:161-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/append_only.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"770bae234bac9433662ed89d713233e9b0a04a2c3dce3458ebc5bca1b6809b8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvix/crates/region/src/append_only.rs:228-235 | crates/ruvix/crates/region/src/immutable.rs:171-178 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/append_only.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f999b0a529185d3e3aa6779fe809860a0113b8848a0d9af808cb1ea534ed28eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvix/crates/region/src/slab.rs:361-367 | crates/ruvix/crates/region/src/slab_optimized.rs:368-374 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/region/src/slab.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf63501978697bafa3b8565509e326960d7ebe0b7f2f9dd079d0911cf907b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvix/crates/types/src/rvf.rs:120-129 | crates/rvAgent/rvagent-core/src/rvf_bridge.rs:121-130 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/types/src/rvf.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"910a3d5972f9959f4de87a729558097ad0efb8587a6743ed11fb566b24e3ffe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvix/crates/vecgraph/src/graph_store.rs:193-200 | crates/ruvix/crates/vecgraph/src/vector_store.rs:167-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/vecgraph/src/graph_store.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2031dc6c5f025cc7801dad53bbbbc7a9a5147edc31ca3b35c7a05b8dcfd889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvllm-cli/src/commands/benchmark.rs:460-467 | crates/ruvllm-cli/src/commands/chat.rs:674-681 | crates/ruvllm-cli/src/commands/serve.rs:1071-1078 \u2014 before extracting anything, compare \u0060crates/ruvllm-cli/src/commands/benchmark.rs\u0060 and \u0060crates/ruvllm-cli/src/commands/chat.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/benchmark.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bed26635ce37275f2cef3118c7f51676bd1c88a13381299da07213a01cb0af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvllm-wasm/src/bindings.rs:373-386 | crates/ruvllm/src/tokenizer.rs:175-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06f6ac639320f26940f58fbdbe5a113f72eadcd4aad7a04f4b26d174e004416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvllm-wasm/src/bindings.rs:438-451 | crates/ruvllm/src/tokenizer.rs:260-274 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3e0f0f261f5630f52da4fcb0d0195ab8880354b61327e3e755bd10e7356b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/backends/candle_backend.rs:165-171 | crates/ruvllm/src/backends/mistral_backend.rs:655-661 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d319f4cd234aa5ca8f9ff35f67da4cf06b56e259404a6627a09833e3571d0155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvllm/src/backends/candle_backend.rs:173-177 | crates/ruvllm/src/backends/mistral_backend.rs:663-667 | crates/ruvllm/src/tokenizer.rs:628-632 \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":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9230cba26d8248cae8f1c36943b42d70bfeda0e530db85e387bbe9a43802bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvllm/src/backends/gemma2.rs:175-184 | crates/ruvllm/src/models/ruvltra.rs:386-395 | crates/ruvllm/src/models/ruvltra_medium.rs:433-442 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/backends/gemma2.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 219 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvllm/src/models/ruvltra.rs:400\u0060 calls \u0060is_ane_optimized\u0060 and \u0060crates/ruvllm/src/models/ruvltra_medium.rs:445\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ba4052a7f30b73f64fe35b9a9915975dfba13d61033c89cb0bd21348f5b125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/models/ruvltra.rs:374-383 | crates/ruvllm/src/models/ruvltra_medium.rs:421-430 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/models/ruvltra.rs\u0060 and \u0060crates/ruvllm/src/models/ruvltra_medium.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90d8613d7dc2d29cdf775d8b4399e1b8fed2786ea7a29d0f53ff8ea9e8b7abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/training/claude_dataset.rs:286-290 | crates/ruvllm/src/training/tool_dataset.rs:370-374 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/claude_dataset.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01a4124d5670063fc56e49356c2870aca2c54bd774d2a07e5e5a683226320f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/training/contrastive.rs:558-564 | crates/ruvllm/src/training/real_trainer.rs:222-228 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/training/contrastive.rs\u0060 and \u0060crates/ruvllm/src/training/real_trainer.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ee1441de07bfbc1ae051d108f973608dee42f9c2d380420fd11382b0598e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/security.rs:296-301 | crates/rvAgent/rvagent-middleware/src/tool_sanitizer.rs:35-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/security.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba71086820beceb31a8a42d20a554501edb2b8265cf8671914509aa1880e415f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/security.rs:312-316 | crates/rvAgent/rvagent-subagents/src/validator.rs:62-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/security.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"374c1630c8a4411c5b89a0ec36e66c2f384b05f23d9f12f4eed182b784c4c109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvAgent/rvagent-core/src/masking.rs:80-86 | crates/rvAgent/rvagent-middleware/src/summarization.rs:15-21 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/masking.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85bd7ac2b9bd833480560413b74b1ba1b34e9274a684664e892e69e1a5c6b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvAgent/rvagent-core/src/rvf_bridge.rs:198-206 | crates/rvf/rvf-types/src/witness.rs:68-76 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/rvf_bridge.rs\u0060 and \u0060crates/rvf/rvf-types/src/witness.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/rvf_bridge.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dad4eee7bd7bad717d23a838b89139e1f293639e1de84fea3d6c33ccb3d500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvAgent/rvagent-core/src/rvf_bridge.rs:230-237 | crates/rvf/rvf-types/src/witness.rs:95-102 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/rvf_bridge.rs\u0060 and \u0060crates/rvf/rvf-types/src/witness.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/rvf_bridge.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed60924ed8cdcf5b3b31cdeefe29e7d48de5acb7637cf8373c2fe9bf69c244cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvAgent/rvagent-core/src/rvf_bridge.rs:261-268 | crates/rvf/rvf-types/src/witness.rs:121-128 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/rvf_bridge.rs\u0060 and \u0060crates/rvf/rvf-types/src/witness.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/rvf_bridge.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a39b8c58538594315dfd237ac3cbc58e00b26958913afd2c9cf45abe5f1acd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf-forge-core/src/error.rs:122-127 | crates/rvforge-registry/src/error.rs:186-191 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf-forge-core/src/error.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"232bb443de37a8911a5aa7d1644aec206040ce1cd9d7ecf1f443210df1dc3b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvf-forge-core/src/manifest.rs:286-293 | crates/rvf-forge-core/src/provenance.rs:205-212 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf-forge-core/src/manifest.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0793b31b85f9fbefb6ed6ccf5c122cee39426d57390bdf4a380d434b8863d3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/rvf/rvf-crypto/src/stream.rs:126-131 | crates/rvf/rvf-runtime/src/seed_crypto.rs:20-25 | crates/rvf/rvf-runtime/src/seed_crypto.rs:31-36 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-crypto/src/stream.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bbe285514582ed1e9feb1febb0e9135412ee7673a88cd43764c600bacf6acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvf/rvf-runtime/src/locking.rs:245-252 | crates/rvlite/src/storage/writer_lease.rs:291-298 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/locking.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6df7a562a51ee683afcfcddb08f8cce261228ba287bf7eb745decfb02d60bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rvf/rvf-wasm/src/lib.rs:432-445 | crates/rvf/rvf-wasm/src/segment.rs:146-159 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wasm/src/lib.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0660313bd4cc741a6cdb49c0d2518548670e95bc72d167db60e68d64ce4d392c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvf/rvf-wire/src/hot_seg_codec.rs:25-34 | crates/rvf/rvf-wire/src/vec_seg_codec.rs:93-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/hot_seg_codec.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9756cfe6e68354a8ea2f3235c4583416ee67b4aac4af4b2b1503a8c59a3dc22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvm/crates/rvm-witness/src/log.rs:206-215 | crates/rvm/crates/rvm-witness/src/v2.rs:516-525 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/log.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94b075671367438daaeed9a2df8100ab7aa905470330c78bcd13172aa6c3bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/sona/src/napi.rs:127-133 | crates/sona/src/napi_simple.rs:305-312 \u2014 before extracting anything, compare \u0060crates/sona/src/napi.rs\u0060 and \u0060crates/sona/src/napi_simple.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/napi.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"459b7885dfe5149f1444465f681d2c07f05efaeb34dc7249b9034c7430c4853d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/sona/src/training/federated.rs:177-183 | crates/sona/src/training/metrics.rs:45-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/training/federated.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee9d541b93388222d37df0c167ea3703a88f5162a7beef2f9bb3edbb9398ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): edge/gateway/src/durable.rs:109-113 | edge/gateway/src/durable_m4.rs:32-36 | edge/gateway/src/registry_do.rs:59-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/durable.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a06bb4cc55a6bc4946c8be1b8cf71f18a2aa0c7f0d1e07e280558d5ded70c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): edge/gateway/src/durable.rs:115-120 | edge/gateway/src/durable_m4.rs:38-43 | edge/gateway/src/registry_do.rs:65-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/durable.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c290fc50f0854a5b295b26af6b780bb60e95860348901ee4bd07fa36d5b3af68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): edge/gateway/src/graph_persist.rs:38-43 | edge/gateway/src/quant_store.rs:155-160 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/graph_persist.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa16f02547a7e3b9208c6398ddda01c6b89279b9e15a7bf510dfaed7dc26ca69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): edge/gateway/src/graph_persist.rs:73-78 | edge/gateway/src/mincut_job.rs:116-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/graph_persist.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db996c4d2ab045f0fcf67923b5c190736bec6287f788b84fb1b7b709000cd1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/backprop.rs:8-17 | patches/candle-core-0.9.2/src/backprop.rs:8-17 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/backprop.rs\u0060 and \u0060patches/candle-core-0.9.2/src/backprop.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 695 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backprop.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73a65cca4bc313bc759642243d0210bce4394ce740ade998917d9177946b6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/conv.rs:44-49 | patches/candle-core-0.9.2/src/conv.rs:45-50 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/conv.rs\u0060 and \u0060patches/candle-core-0.9.2/src/conv.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 191 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/conv.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f6cd2d7d070db2e4e73400326a9f10aa8f2f64aebe57c99e6ab248c3f1587f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): patches/candle-core-0.8.4/src/cpu/avx.rs:101-107 | patches/candle-core-0.9.2/src/cpu/avx.rs:101-107 | patches/candle-core-0.9.2/src/cpu/avx.rs:180-186 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/avx.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/avx.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060mem_addr\u0060 to \u0060*const f16\u0060 in one and \u0060*const bf16\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":"patches/candle-core-0.8.4/src/cpu/avx.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d2dd83e2042bcaaa7f0817ce38338b54cdac3c27ce6d15dc2c8d84e4645ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/avx.rs:123-129 | patches/candle-core-0.9.2/src/cpu/avx.rs:123-129 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/avx.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/avx.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/avx.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"596c6b871c3f5673247b59ef19f8b8979e02a5a4627d891762aab577730673ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/kernels.rs:12-17 | patches/candle-core-0.9.2/src/cpu/kernels.rs:12-17 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/kernels.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/kernels.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/kernels.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d01451125847ed33e22948969abc26469d6304fc551488ece6744d2bdd28a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/kernels.rs:40-45 | patches/candle-core-0.9.2/src/cpu/kernels.rs:40-45 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/kernels.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/kernels.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/kernels.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"adff2f7bc7da8c78a568a60c4e7445c92d5f141329ae9f1e04978b2478aeb965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/kernels.rs:54-59 | patches/candle-core-0.9.2/src/cpu/kernels.rs:54-59 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/kernels.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/kernels.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/kernels.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"860fd21a97f558ff1221cc020f35932b12108eaeb8aad219843b5620a83c58f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/kernels.rs:160-171 | patches/candle-core-0.9.2/src/cpu/kernels.rs:201-212 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/kernels.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/kernels.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/kernels.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"03463cb3dbb2cd52dd22aa1eb085b1e33f3801ea0ea2070276d288a4b36ab485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu/mod.rs:100-105 | patches/candle-core-0.9.2/src/cpu/mod.rs:119-124 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa2beffd97020361f104f796aa43431628c52de9d977496afd9252a94c0d363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): patches/candle-core-0.8.4/src/cpu/mod.rs:177-184 | patches/candle-core-0.9.2/src/cpu/mod.rs:224-231 | patches/candle-core-0.9.2/src/cpu/mod.rs:235-242 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060b_row\u0060 to \u0060*const f16\u0060 in one and \u0060*const bf16\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":"patches/candle-core-0.8.4/src/cpu/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"886cc5a820945b23a11c0cbb476c4552be74d5a91f4155f065ea83d83b7f2bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:294-298 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:312-316 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c63b0908ac9bb581de1651c65c77d10673f1641fb7ff23a1c04e3ca29d8d0f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:1211-1219 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:1319-1327 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4def1abdc84ceb9714e3315a735084f8352c41152e5e25a5a9d445f96dc03bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): patches/candle-core-0.8.4/src/cuda_backend/device.rs:16-21 | patches/candle-core-0.8.4/src/metal_backend/device.rs:15-20 | patches/candle-core-0.8.4/src/tensor.rs:15-20 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:18-23 | patches/candle-core-0.9.2/src/metal_backend/device.rs:25-30 | patches/candle-core-0.9.2/src/tensor.rs:15-20 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.8.4/src/cuda_backend/device.rs:24\u0060 calls \u0060CudaRng\u0060 and \u0060patches/candle-core-0.8.4/src/tensor.rs:23\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":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e487eef142842cb851a45b8f2f82dcae98bb09931b6b53bd015ba3c41f07edd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1143-1147 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1438-1442 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd68d4ffe8c885e7cefb14094e727414d2c44363944025f0da79844bdee8083"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1239-1243 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1648-1652 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4054670bba15eda9a32fc52cffb859617bc6b33dbc807f3195850f46df293fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1245-1249 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1654-1658 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8209338c537a2413da287f5809b5d01e8cea27ae8315617b0231b1ec15da30d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1251-1255 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1660-1664 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33e4e78632a02d94684711ba6fd9a9e379203b8fc4743a234748f7c6401a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1257-1261 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1666-1670 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b009d2f0687a307ca1d16e77ef5494eac6a75d87989d8c2d22a46e48175f505a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1263-1267 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1672-1676 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3725a738021f961997378219e0727f771da92fb033b3726863acdf3d5161868f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1269-1273 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1678-1682 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"685ab0fabe214c7e283cc37a12d4d2eba4951e022420c202bb543646388c15b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1280-1284 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1689-1693 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ffb6bf883af56ed97cdbff37081c37ac46684d92159c7c9d37fa19c5a42989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1333-1337 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1755-1759 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7cb6d06f6cd4cb232e0d48e224a648c264064dc5ab51193144b0afd4d308fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1579-1584 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2074-2079 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1579\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b892568ffd5334777dc6ceee77b7787853e6a6d60771c9efeba0aabe55eeab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1616-1620 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2111-2115 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e73c562f00903b540be013bb66057d262337c715a257e628328aed3e820f91a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1622-1626 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2138-2142 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"5532e4a7581f8f20009e5f3457f6d73b274ccd944b6179574ea2f9e3c053fb68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1627-1631 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2143-2147 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75e6f3fd0dd31dbad5c9504bc1c97fed30a563341b20e3ee01b82a818d67519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/custom_op.rs:162-167 | patches/candle-core-0.9.2/src/custom_op.rs:162-167 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/custom_op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/custom_op.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab31b751069d5588d52dc7a190a91d060d9a4d38c86ca949b4bddb0551c4fbfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/custom_op.rs:367-376 | patches/candle-core-0.9.2/src/custom_op.rs:367-376 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/custom_op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/custom_op.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d84e257e9cc5f7c0c5a30601f87083a2622b8cf8046393310d8d1cb1a1fdd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:134-140 | patches/candle-core-0.9.2/src/device.rs:238-244 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6410451ef3e328960664bf2fded07e65136f67c3b93b57d3ceb03b6060415328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:142-148 | patches/candle-core-0.9.2/src/device.rs:246-252 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfc913c62e691c71c2086486286eedbe8986a28c2eec57a322108c9a09202c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:158-164 | patches/candle-core-0.9.2/src/device.rs:262-268 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf63035bf7e697fbf005f1cb947153dc794fca2df59d360913b945de44345ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:175-181 | patches/candle-core-0.9.2/src/device.rs:287-293 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5775f74c5b52bcdf457a2675225b1e36a14c9f74f3b64e5973e4d6c986f721a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/device.rs:392-398 | patches/candle-core-0.9.2/src/device.rs:495-501 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/device.rs\u0060 and \u0060patches/candle-core-0.9.2/src/device.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9e54b75dc4eb10c284e9a4bd0f3dbe33912361badf22f799599a7e5609e241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:106-114 | patches/candle-core-0.9.2/src/display.rs:117-125 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6ce730a176a4a66c0c460d1ccbf9d37208742af8600b4567a695b59339c8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:116-124 | patches/candle-core-0.9.2/src/display.rs:127-135 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc9749bbcbabcbf0d8d324908e8e414acbb106ec902fcabcc6d6d170c6a1194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:184-190 | patches/candle-core-0.9.2/src/display.rs:195-201 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0504eaf0f56a90a68b8e4a7b5f404548cdb6c69bac36b24b9202ddc76516910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/error.rs:294-300 | patches/candle-core-0.9.2/src/error.rs:303-309 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/error.rs\u0060 and \u0060patches/candle-core-0.9.2/src/error.rs\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/error.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"940bf2448061a95b8d31187647b4e4156ee1cce9a1a49178d4c337f0125d7a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/indexer.rs:83-88 | patches/candle-core-0.9.2/src/indexer.rs:83-88 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/indexer.rs\u0060 and \u0060patches/candle-core-0.9.2/src/indexer.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/indexer.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b9623a6a670bb1cbeffcaf4d92087fdeb05b73d1e0924b4253325c0812531c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/indexer.rs:92-98 | patches/candle-core-0.9.2/src/indexer.rs:92-98 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/indexer.rs\u0060 and \u0060patches/candle-core-0.9.2/src/indexer.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/indexer.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe90097184dc2aced1dce606228f2381230010cf95deb56ee3ac6f55662e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/indexer.rs:246-254 | patches/candle-core-0.9.2/src/indexer.rs:246-254 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/indexer.rs\u0060 and \u0060patches/candle-core-0.9.2/src/indexer.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/indexer.rs:246\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":"patches/candle-core-0.8.4/src/indexer.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99770b0140aba6b9a8831893ba4cec635b27eed3ba5eb4201112b8322d8a477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/indexer.rs:246-255 | patches/candle-core-0.9.2/src/indexer.rs:246-255 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/indexer.rs\u0060 and \u0060patches/candle-core-0.9.2/src/indexer.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/indexer.rs:246\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":"patches/candle-core-0.8.4/src/indexer.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b204b9e51ecef5a497d9922d3d1bcf5cd433da037ed9c01f7a865c0fac8eeb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/indexer.rs:246-256 | patches/candle-core-0.9.2/src/indexer.rs:246-256 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/indexer.rs\u0060 and \u0060patches/candle-core-0.9.2/src/indexer.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/indexer.rs:246\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":"patches/candle-core-0.8.4/src/indexer.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"954a57c14c14d8c5d6f3e068a16aadc2236eb7df65aea6c63ffc001a1fcceb3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/indexer.rs:246-257 | patches/candle-core-0.9.2/src/indexer.rs:246-257 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/indexer.rs\u0060 and \u0060patches/candle-core-0.9.2/src/indexer.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/indexer.rs:246\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":"patches/candle-core-0.8.4/src/indexer.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15763ff28f292512749532c5ca66427b79d22e7a72a236d8e694030687c9459"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/layout.rs:59-66 | patches/candle-core-0.9.2/src/layout.rs:59-66 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/layout.rs\u0060 and \u0060patches/candle-core-0.9.2/src/layout.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 182 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/layout.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"89378f38bfd165f6b20329999671c7d0cb6f9daa16e5c3e20a63af2dad244106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:33-38 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:36-41 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7d9d30281bcb5bceeaa1ec25274bd91302465d7fb7a35786ea55cf71b1e25b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:404-414 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:425-435 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7469bc1b24c0b53c655e85bdc2511ea0ef7192db3846571b0212c1e0efd3174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1947-1955 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1962-1970 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbd95906c4c81aa7be7cca85190809e3ac04c397aa2ecb9a751b7bc7e5e2a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:1957-1966 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1972-1981 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"260b7100e7e939c8a3873f374e224a429644118617ad8f124822d8c012ffdb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2129-2134 | patches/candle-core-0.8.4/src/quantized/metal.rs:204-209 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2132-2137 | patches/candle-core-0.9.2/src/quantized/metal.rs:364-369 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf9b671edd8de79f695df2ef77c2e96c1a1dacbd358c6fd01cd7aff7d56ea57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/op.rs:28-36 | patches/candle-core-0.9.2/src/op.rs:29-37 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d960bdc426e09370afaba3976be71ef3e47ca360e98aa84185a4a4afcc093ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/op.rs:478-487 | patches/candle-core-0.9.2/src/op.rs:528-537 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d42c34b6dcd685eec440256a489508d396a71a726b9abd7d92ce23ae8e9bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/op.rs:489-498 | patches/candle-core-0.9.2/src/op.rs:539-548 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1e016198338f885c89c64e98feaad1e76c947c2add911ee55db8ee5c4c9639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/op.rs:879-886 | patches/candle-core-0.9.2/src/op.rs:1044-1051 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8ea59caea82a49d3b6410ebf4de94a30345a8ed1b6465862b442ea055dd653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/op.rs:888-895 | patches/candle-core-0.9.2/src/op.rs:1053-1060 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"520fd068aec45faf9ca2b3f8db20d31dd09b67b763c8c5bc0141ccb7ec2fe0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/op.rs:902-909 | patches/candle-core-0.9.2/src/op.rs:1067-1074 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/op.rs:902\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5ceafa0a70b2e283f91a11b59e52acd1ad41468efab5e302dd11add53b8b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:138-143 | patches/candle-core-0.9.2/src/pickle.rs:141-146 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5272d37a6467fba1495bf536758f975fb164130372ba68f5c7abbfd59b44f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:187-195 | patches/candle-core-0.9.2/src/pickle.rs:198-206 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf02b7b79667c0f9655026c0f9080573f49b72708c69331b9486fee0639fada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:319-324 | patches/candle-core-0.9.2/src/pickle.rs:330-335 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2974ae63e4a62f810dd9d79b04595797f6c7fab22d061ff4a25d0b9a5cafdbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:372-377 | patches/candle-core-0.9.2/src/pickle.rs:383-388 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82040da0c61889a83be3eacf3a1b8464c9f973364829d96c4cbc469ea4be43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:379-387 | patches/candle-core-0.9.2/src/pickle.rs:390-398 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0995a2fad5623153fcbd31fe2705540c09b457c90c1e3878dc2eea6b1ddb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/pickle.rs:389-393 | patches/candle-core-0.9.2/src/pickle.rs:400-404 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/pickle.rs\u0060 and \u0060patches/candle-core-0.9.2/src/pickle.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 506 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acb626f5d2094c3db238c98dcafad8749dc602df7565e61812a5a86efbe5fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:20-30 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:20-30 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35741bd46ff9fb998995247be064ef3330ff903e7b5cb527778f08ed0e2060e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:60-65 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:60-65 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6127f9a4874fe7bf8d8a9525f5e6e67cf1541deb6e91f32b2cbec3338009a838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/ggml_file.rs:259-264 | patches/candle-core-0.9.2/src/quantized/ggml_file.rs:260-265 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/ggml_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/ggml_file.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 165 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c15b23aa891d817f09dbbaae1d3d4f1c501bd1a2a5cd063d5a624a442684675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:18-24 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:19-25 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d914ef215ae743fdf64d5ff6be608250a4689e5d031dfed92969a539ecd6ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:474-480 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:475-481 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs:474\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"40153d7b890b15bee55d0fab418b9f369a7dfb162fc42da99b4acff350ccb505"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/gguf_file.rs:483-488 | patches/candle-core-0.9.2/src/quantized/gguf_file.rs:484-489 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/gguf_file.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/gguf_file.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 308 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c49156083b7e052db6e02bc9a36958952bdedeefb1bbe0f23a00fb04088b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/metal.rs:14-22 | patches/candle-core-0.9.2/src/quantized/metal.rs:14-22 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc40016ccd58c34bc1d88a1df474563a42b51c1acc69883f53e511af385c21a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/metal.rs:194-202 | patches/candle-core-0.9.2/src/quantized/metal.rs:354-362 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/metal.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/metal.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/metal.rs:194\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/metal.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0644d0a7a1b50764d27f3ccfdb05d4f846b088239b32f79f35481adac807fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:66-72 | patches/candle-core-0.9.2/src/quantized/mod.rs:124-130 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b0b103795c5fbe943a2cd28fa4a667c4e64e2368c14eb489b32c0cac7169fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:74-80 | patches/candle-core-0.9.2/src/quantized/mod.rs:132-138 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ec82c1277ec1372184c133847e5fd7b9f6718c39d86201939f7e349e8b81d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:90-96 | patches/candle-core-0.9.2/src/quantized/mod.rs:148-154 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a1b03ceedf7d843314d4b305e9054be900bbe5ca2bc18b2dc637298f5b25d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:319-323 | patches/candle-core-0.9.2/src/quantized/mod.rs:476-480 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab9cc4228a998e91913e9f4b9cf7bd3d5c0fcf92567129e8e2cf6a7a9f077ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:361-365 | patches/candle-core-0.9.2/src/quantized/mod.rs:624-628 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"50adf76bc95c090b09987e85446d6fea3844e9f575950bee5f563618169f2285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:444-450 | patches/candle-core-0.9.2/src/quantized/mod.rs:744-750 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb36b5a85219ebc8829dd936596037ca26b28f9db5317e746a6cfaa16815295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:506-512 | patches/candle-core-0.9.2/src/quantized/mod.rs:837-843 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:506\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb68f581ff3ce49b5efd5c007768157c18a4757ad28f6304d9a6a431ddced7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:518-524 | patches/candle-core-0.9.2/src/quantized/mod.rs:849-855 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:518\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f915198c118dd54275bac109bb7f6ade34b81a4b5ecce2100666b98f0a61fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:63-67 | patches/candle-core-0.9.2/src/safetensors.rs:80-84 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"61390aa4b4626022514e8c293f9764622db5cd0335fa3fcc6ff380e5690afb11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:84-88 | patches/candle-core-0.9.2/src/safetensors.rs:101-105 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"334f506c527b58514cf7ca1d2893f5bd60eef464e4e184e82bcdb8e75d6c6419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:250-256 | patches/candle-core-0.9.2/src/safetensors.rs:405-411 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"200056cdbe7d240ce679da7598e77e05d7b3c8c2a645129f1c611cd5eb796900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:338-344 | patches/candle-core-0.9.2/src/safetensors.rs:493-499 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f313dd1333dbfad6438447f0e8a29625c08048ab390518910c94471d11a9825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:441-445 | patches/candle-core-0.9.2/src/safetensors.rs:596-600 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3804097ed002210a016850e66a02b6a61725c65b4bfe5f1f413e4913cd380c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.8.4/src/shape.rs:49-61 | patches/candle-core-0.9.2/src/shape.rs:49-61 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/shape.rs\u0060 and \u0060patches/candle-core-0.9.2/src/shape.rs\u0060 as WHOLE FILES: 99% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/shape.rs:49\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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7702db04b1fa1eb198d85451b3f66eddbebc3598a11b4aa5bc5a468202ef588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:38-44 | patches/candle-core-0.9.2/src/storage.rs:39-45 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0567649c80b017061c591815d3f7d278035887f3ccb78c90e7a8b17be71f48fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:66-74 | patches/candle-core-0.9.2/src/storage.rs:67-75 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6fa7681f526449d1c6efc4d36e9c464d60b43d0088f8e778039acbfe2b350d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:266-272 | patches/candle-core-0.9.2/src/storage.rs:275-281 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"49052b41e0c8848e24ac3179b01a83bb203dda1b456f379e91c5e0209ce444c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/streaming.rs:14-19 | patches/candle-core-0.9.2/src/streaming.rs:14-19 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/streaming.rs\u0060 and \u0060patches/candle-core-0.9.2/src/streaming.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72614de4cce12830fb699ef8c720b84ca03f24cc400e2f5f9e4e091c10e978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/streaming.rs:120-125 | patches/candle-core-0.9.2/src/streaming.rs:120-125 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/streaming.rs\u0060 and \u0060patches/candle-core-0.9.2/src/streaming.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"75944a22168bb294ca953e869e63c5a2a4a99b519d0542c6b7d16716288ddd1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:225-230 | patches/candle-core-0.9.2/src/tensor.rs:239-244 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a352aaac0708bf6bf6c3c2a3095952ef6312b001f3dd686f37a7bb067bb1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:265-270 | patches/candle-core-0.9.2/src/tensor.rs:324-329 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:265\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"36796299f098b908add956cb8efe916cc79650d2e4ae857d4ddb8cfba0e07e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:279-284 | patches/candle-core-0.9.2/src/tensor.rs:338-343 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8236b279c7fa4f482a6f5b48af421daf3d18dccc94a4f8fde9d5d81066907927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:306-311 | patches/candle-core-0.9.2/src/tensor.rs:365-370 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:306\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"16361dbe8a62be10e14ec6f2f2ded39fc0ed9403717be189b0e817e76dec35b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:320-325 | patches/candle-core-0.9.2/src/tensor.rs:379-384 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:320\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"648aee141241873d15325c880822c9089fe783a30ec43a1fc89940016f95e5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:327-336 | patches/candle-core-0.9.2/src/tensor.rs:386-395 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"10620392a98ac4784f617caf456c7088ac4e110823fe50741809a510f99c2a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:401-405 | patches/candle-core-0.9.2/src/tensor.rs:464-468 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:401\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f9ead5220a2aadc3ee1bd07c3dec596ef786b374b2ff2a98d16c3f4eedadf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:745-756 | patches/candle-core-0.9.2/src/tensor.rs:813-824 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebbef777e860e0efc6f82f4cf49457e670c706573bf8a8a43049b9c31255def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1773-1779 | patches/candle-core-0.9.2/src/tensor.rs:2097-2103 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2e6285e1e092f17ffe550699d0146161276b46e1dfd548671a6967e6504aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1791-1797 | patches/candle-core-0.9.2/src/tensor.rs:2115-2121 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73ee45397ee7c65a4225a2c70b04d96305c73f358feff1f8735769fefb1b8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1889-1896 | patches/candle-core-0.9.2/src/tensor.rs:2213-2220 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa7728777d4e5d7313dfdf1850a78d88b84c35f6c4a21bf616a8fd28c8c15ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2088-2093 | patches/candle-core-0.9.2/src/tensor.rs:2411-2416 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a02038890da5c197900522ca33391f90c31e28099e1e0c86da2cf15d6976b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2432-2436 | patches/candle-core-0.9.2/src/tensor.rs:2755-2759 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce900792c03196175c41fb55d518863cee7b2604a2dab11ec68941aca2b52d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/variable.rs:38-45 | patches/candle-core-0.9.2/src/variable.rs:38-45 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/variable.rs\u0060 and \u0060patches/candle-core-0.9.2/src/variable.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/variable.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5a8d246fb0ba8450ec40c8fe52446781498d0e45f723bcf4a5ff1de6817845"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/variable.rs:91-95 | patches/candle-core-0.9.2/src/variable.rs:91-95 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/variable.rs\u0060 and \u0060patches/candle-core-0.9.2/src/variable.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/variable.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a04eaeef39cf5d468861d2da9ac56b9c7083946da8689237fe4bb3ecd13230c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/hnsw_rs/src/flatten.rs:36-42 | scripts/patches/hnsw_rs/src/flatten.rs:36-42 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/flatten.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/flatten.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/flatten.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59d7f2abc8eeb29b395f705701d5c12a4ef9d8edd30fcbedee4a18dd63c586f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:289-295 | scripts/patches/hnsw_rs/src/hnsw.rs:289-295 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a84c8de7f53b92d5d7aa79a4f99d87358fe0be1d8bf67d18f500e2c5b9957a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:325-333 | scripts/patches/hnsw_rs/src/hnsw.rs:325-333 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3720cdbf266d581cf87057847bce3074bdf7e87da13fc5ca4b452df9a6aa8bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:340-348 | scripts/patches/hnsw_rs/src/hnsw.rs:340-348 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnsw.rs:340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a5ab934ad8dd22dd5301aef1c972ac5290e8154a54a26d0fa6e015efd9956a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:469-475 | scripts/patches/hnsw_rs/src/hnsw.rs:469-475 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6aafe933dc759a623dceba893d4c3f69f59a0b51e81eefab9ae578f4dcbe52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:481-493 | scripts/patches/hnsw_rs/src/hnsw.rs:481-493 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8f0d5544882ec5bbc116c70af5d3b2421ce7f51682f65b858ba8e15e7642de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:567-574 | scripts/patches/hnsw_rs/src/hnsw.rs:560-567 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"57361b1ca36540c8df3df84bcab3d90d0d180891352b754d1d6b6c6ce28d20cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:577-583 | scripts/patches/hnsw_rs/src/hnsw.rs:570-576 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17ac016e7da57cfb21c5afd17c91cbbb0e4cb50474b622fc319aa242f22302e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:639-647 | scripts/patches/hnsw_rs/src/hnsw.rs:632-640 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a9c5534f7a7a900005f9059c36ea2ca2d4b72f912f1179606201f825a8252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:707-715 | scripts/patches/hnsw_rs/src/hnsw.rs:700-708 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"420c6db62679bd872a3b4d76da53bfaed03b040e5172439fdbfa189c7d9276e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:722-730 | scripts/patches/hnsw_rs/src/hnsw.rs:715-723 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f33b09267edcaad4c7f299c66f95873e9ebf52554b281c426b9e834dae5666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/hnsw_rs/src/hnsw.rs:1226-1232 | scripts/patches/hnsw_rs/src/hnsw.rs:1212-1218 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnsw.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnsw.rs\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 1041 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b785f9e72eb2cff8a2ba346a0f33628bfe50d145e95dfe916700f6b3114a944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:317-326 | scripts/patches/hnsw_rs/src/hnswio.rs:317-326 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8252d4360affe3d455f79d362512eae16dc08fb8d9b23843dcc32a15896cac88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:329-338 | scripts/patches/hnsw_rs/src/hnswio.rs:329-338 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1733f582f680e5c965450136620d286f96cf34c9d0e24f24dae1e406714425a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/hnsw_rs/src/hnswio.rs:351-364 | scripts/patches/hnsw_rs/src/hnswio.rs:351-364 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/hnsw_rs/src/hnswio.rs:351\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b53c81d0cc45419da3e5d503e63b082252572d406f9ff6aca9f7d3855889d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): patches/hnsw_rs/src/libext.rs:1150-1163 | scripts/patches/hnsw_rs/src/libext.rs:1150-1163 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0ff237071e141ec97780e800cf21fabae0ac3a98081c37b5d64095035367ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/prime-radiant/src/substrate/graph.rs:420-425 | crates/ruvector-graph/src/index.rs:48-53 | crates/ruvector-graph/src/index.rs:209-214 | crates/ruvector-graph/src/index.rs:280-285 | crates/ruvector-graph/src/index.rs:288-293 | crates/ruvector-graph/src/index.rs:383-388 \u2014 there are 6 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 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/substrate/graph.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"255efa0da5045c41da2d351d00b73c04afa7575538cd54986ece35b95b4af4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-core/src/storage.rs:413-421 | crates/ruvector-graph/src/storage.rs:476-484 \u2014 before extracting anything, compare \u0060crates/ruvector-core/src/storage.rs\u0060 and \u0060crates/ruvector-graph/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a626997eb45f08fd135fabfa5e9a069f76f5c48ececcaf377c9f8f428d75696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-edge-quant/src/query.rs:98-102 | crates/ruvector-edge-store/src/shard/read.rs:101-105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-quant/src/query.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed39cc32243bcff7e7018e944357cade73864e17b8448d17316eccd9ff86c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-edge-store/src/shard/ann.rs:36-42 | edge/gateway/src/m3_ctx.rs:81-87 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/ann.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed13e153c730d66354e6852e2a4b442bfdba87eddb9beda1de9f675046479c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ruvector-graph/src/distributed/federation.rs:129-135 | crates/ruvector-graph/src/distributed/gossip.rs:302-308 | crates/ruvector-postgres/src/tenancy/registry.rs:436-442 \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":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2443bf445154959bdee24befebb19fb82ad3007e04b1562cc159198d5886d4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-hailo/src/lib.rs:631-637 | crates/ruvector-hyperbolic-hnsw/src/hnsw.rs:308-314 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo/src/lib.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabc42baa6975a7671b1426fcc4f72d81c08e74cc40fbc5ec7f00a314d2cd8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut-node/src/routing.rs:8-13 | crates/ruvector-mincut-wasm/src/routing.rs:4-9 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/routing.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"77afd86b0f19eb6269ac2a7878c76d9ad9653ed2d8d83a50466241c79c3741c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-mincut-node/src/routing.rs:280-286 | crates/ruvector-mincut-wasm/src/routing.rs:221-227 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/routing.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4998bb37d393974eacf2c1d9256fd137f9b2652679cfd0fbcf24c2ce0d83a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-mincut/src/canonical/mod.rs:1213-1219 | crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:745-751 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ee1b737c9e6852645cc001261266544ad4557396ffb5d7feec293de7b150a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-mincut/src/canonical/mod.rs:1221-1227 | crates/ruvector-mincut/src/canonical/source_anchored/mod.rs:754-760 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"221f1e3b365b62e36ceb96706a1ad05a6665343e3283976a6bef3a984d972936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/distance/mod.rs:273-280 | crates/ruvector-router-core/src/distance.rs:151-158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-router-core/src/distance.rs:151\u0060 it begins part-way through the construct above it, so those exact 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 \u0060vectors\u0060 to \u0060\u0026[\u0026[f32]]\u0060 in one and \u0060\u0026[Vec\u003Cf32\u003E]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/distance/mod.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab31eec31a05e9a89b13135637e082590130f51c46ffce16f299c14162d080ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-postgres/src/healing/learning.rs:281-290 | crates/ruvector-postgres/src/healing/learning.rs:297-306 | crates/ruvector-replication/src/failover.rs:364-373 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/healing/learning.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":"crates/ruvector-postgres/src/healing/learning.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7569beda980250316491042de7c87ae3e7b46dd4cb01e633ffb235742a435bfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/integrity/gating.rs:27-34 | crates/ruvector-postgres/src/workers/integrity.rs:161-168 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/gating.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c75f9d01fe62ae23fe06b0875ae8f1d4f31f5fa5e4632e47cfdf75817089f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-wasm/kernels/swiglu.rs:287-299 | crates/ruvix/crates/sched/src/novelty.rs:33-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":"crates/ruvector-wasm/kernels/swiglu.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadd664abcc1cadcda6c38e97161e1c14258ccb4866aac53f3c73489ec4f076d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvix/crates/queue/src/ring.rs:218-222 | crates/ruvix/crates/queue/src/ring_optimized.rs:192-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/queue/src/ring.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e799bce4ae82d1da290c88f5586fce88835c8595fc2e212314d070b12f367b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/bitnet/expert_cache.rs:111-117 | crates/ruvllm/src/moe/metrics.rs:107-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/expert_cache.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ea6e7e1b1c670eaa26ad9f2dce0b168e5262357259c783eaf62824df189c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf/rvf-import/src/csv_import.rs:119-124 | crates/rvf/rvf-import/src/numpy.rs:191-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026CsvConfig\u0060 in one and \u0060\u0026NpyConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-import/src/csv_import.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"255ae1bb96fcc45f74e8e6c8d61e4edf0f1d9bd370d843759821240913fb2ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rvlite/src/cypher/parser.rs:50-61 | crates/rvlite/src/sparql/parser.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 \u0060crates/rvlite/src/sparql/parser.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":"crates/rvlite/src/cypher/parser.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f756529d3c4850a8705a5ae459ef048fd18fee8accc462c270572c381360046f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvm/crates/rvm-proof/src/signer.rs:112-117 | crates/rvm/crates/rvm-witness/src/seal.rs:92-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/signer.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2542fbaa36f92ae455e255d2ce58a14e3ddf04b6aa8cb2921239dca46efc059"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:370-393 | crates/ruvector-hailo-cluster/src/bin/embed.rs:368-396 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:370\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3beca4967d8fa60506feede14f6a2a59e66b44964d2043b0fb137951437c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/ruvllm/src/hub/registry.rs:157-174 | crates/ruvllm/src/hub/registry.rs:188-203 | crates/ruvllm/src/hub/registry.rs:217-234 | crates/ruvllm/src/hub/registry.rs:248-263 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/hub/registry.rs:157\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/registry.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f157b349b38ae5a7403484e9f9ac9133a1e59ccd602aff09e3220d1eb6d5b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ruvix/crates/drivers/src/timer.rs:70-86 | crates/ruvix/crates/drivers/src/timer.rs:91-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/drivers/src/timer.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"91869f18997bbfa49cdba29d44f0213eb7b893d459b634cadc9f1c045aa01fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/rvm/crates/rvm-hal/src/aarch64/boot.rs:99-114 | crates/rvm/crates/rvm-hal/src/aarch64/boot.rs:159-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvm/crates/rvm-hal/src/aarch64/boot.rs:99\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/boot.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"05445840bfd61e1deef98bc2e500d47a17357961d50ecab1f496e098a6f56d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/ruvllm/src/hub/download.rs:381-408 | crates/ruvllm/src/hub/download.rs:431-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 \u0060crates/ruvllm/src/hub/download.rs:381\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/hub/download.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d17fc6bc5c7d7632aad45d308d01e89742816801edb03adde56c94003a84ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-memory-admission/src/bin/benchmark.rs:324-338 | crates/ruvector-memory-admission/src/bin/benchmark.rs:342-355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-memory-admission/src/bin/benchmark.rs:324\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-memory-admission/src/bin/benchmark.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87876851e33527ee069b768cd34c13ce8a88e400df47eef27fa73388958387d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:307-320 | crates/ruvector-hailo-cluster/src/bin/embed.rs:298-311 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c952d384cbc7e5d1cfede7f76fa50ce5fe5f76b3dca053bd725fbf5980469536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-solver/src/neumann.rs:206-219 | crates/ruvector-solver/src/random_walk.rs:449-461 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/neumann.rs:206\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/neumann.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c126799a8ab9c2a8dab1930e8720595d8fe3f9b89f19c63d3c78621011d2e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/prime-radiant/src/storage/postgres.rs:734-747 | crates/prime-radiant/src/storage/postgres.rs:770-783 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/storage/postgres.rs:734\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, \u0060crates/prime-radiant/src/storage/postgres.rs:784\u0060 calls \u0060get_or_create_default_policy\u0060 and \u0060crates/prime-radiant/src/storage/postgres.rs:748\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/postgres.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"201aadca205bc454891d07e510da65e1f99d1fea753fcbb3db48c9398c40a006"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/agentic-robotics-mcp/src/lib.rs:173-186 | crates/agentic-robotics-mcp/src/lib.rs:189-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-mcp/src/lib.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"440545ad97b17bf35333d9a87e27c965e4bed2d823e3ea2bd8f9b4f0b1b6ad6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ruvix/qemu-swarm/src/consensus.rs:735-748 | crates/ruvix/qemu-swarm/src/consensus.rs:762-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 \u0060crates/ruvix/qemu-swarm/src/consensus.rs:735\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvix/qemu-swarm/src/consensus.rs:730\u0060 calls \u0060Ok\u0060, \u0060primary\u0060 and \u0060crates/ruvix/qemu-swarm/src/consensus.rs:761\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"31553bf1a8434c4353847eaa4387b9b3fe7c78c6e3fbd5405f18632dde533d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-mincut/src/optimization/wasm_batch.rs:275-287 | crates/ruvector-mincut/src/optimization/wasm_batch.rs:312-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/optimization/wasm_batch.rs:275\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/wasm_batch.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f0433ef8d129c99527cfd6fe2acc3823328f1e0011265047939a8bfb681896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvllm/src/autodetect.rs:768-780 | crates/ruvllm/src/autodetect.rs:781-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/autodetect.rs:768\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/autodetect.rs:779\u0060 calls \u0060contains\u0060 and \u0060crates/ruvllm/src/autodetect.rs:766\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ec6aee0bed426778587292ccb194b30f021bba8683ce3439a0edfcdb00c310"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-solver/src/router.rs:766-778 | crates/ruvector-solver/src/router.rs:1020-1032 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/router.rs:766\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b4b66931aade93e4e2e60699817bdb76ce59a5cc4048da5a3df212050b28f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:6873-6885 | crates/mcp-brain-server/src/routes.rs:6920-6932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:6873\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6873}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2042b5367078643b0ca4b4f67e66eb447a82bd51b066d2fa1bfd472b25f727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): patches/candle-core-0.9.2/src/cuda_backend/device.rs:633-645 | patches/candle-core-0.9.2/src/cuda_backend/device.rs:692-704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/cuda_backend/device.rs:633\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 \u0060storage\u0060 to \u0060\u0026CpuStorage\u0060 in one and \u0060CpuStorage\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":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"937db26ef798d8d0fbbd5ed362e4d9255c4be173730ea8a6757960731834bcda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-postgres/src/index/hnsw_am.rs:1690-1702 | crates/ruvector-postgres/src/index/ivfflat_am.rs:1556-1564 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/index/hnsw_am.rs\u0060 and \u0060crates/ruvector-postgres/src/index/ivfflat_am.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/index/hnsw_am.rs:1690\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9521ecc417a43e58f8b3ea29660cac4de6f4396ca5ac9561a038514c308531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-fpga-transformer/src/artifact/pack.rs:140-152 | crates/ruvector-fpga-transformer/src/artifact/pack.rs:158-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/artifact/pack.rs:140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/artifact/pack.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e225373fd3a7d1f049f7be68c0ad6c0ac36abfa4b4aad3492a0de96f561f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/bench.rs:406-418 | crates/ruvector-hailo-cluster/src/bin/embed.rs:407-417 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:406\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs:418\u0060 calls \u0060is_empty\u0060, \u0060join\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:419\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9834a21144dc3cc5efe883fd5f03a1b3b61770c391142cdd2cf6a5c9f4af5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-attention/src/config.rs:36-48 | crates/ruvector-attention/src/sheaf/attention.rs:101-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/config.rs:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/config.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e541165aca78a3a6f9cd03c4d7f980aff90990dbc21340b9629b5a988df9d9e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ruvector-bench/src/bin/latency_benchmark.rs:260-272 | crates/ruvector-bench/src/bin/latency_benchmark.rs:319-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs:260\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/latency_benchmark.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc35d0e1639a0563eaaa544ddbff099c76e99626e9d2b4caf7b4248c9de425b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/anthropic.rs:286-303 | crates/rvAgent/rvagent-backends/src/gemini.rs:340-356 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-backends/src/anthropic.rs\u0060 and \u0060crates/rvAgent/rvagent-backends/src/gemini.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-backends/src/anthropic.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request_body\u0060 to \u0060\u0026ApiRequest\u0060 in one and \u0060\u0026GeminiRequest\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/anthropic.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76d166474d3f4c6dcd26f5f30d07b030a6c9f06742289ae37ddb5ee6f16f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-solver/src/bmssp.rs:671-681 | crates/ruvector-solver/src/true_solver.rs:527-538 \u2014 before extracting anything, compare \u0060crates/ruvector-solver/src/bmssp.rs\u0060 and \u0060crates/ruvector-solver/src/true_solver.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-solver/src/bmssp.rs:671\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060matrix\u0060 to \u0060\u0026CsrMatrix\u003Cf64\u003E\u0060 in one and \u0060\u0026CsrMatrix\u003Cf32\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/bmssp.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1569ff2dfd9a375c9fb74f527492a390e95352f91f19833291e7a1324d0266d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-hailo/src/hef_pipeline.rs:191-202 | crates/ruvector-hailo/src/hef_pipeline.rs:227-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo/src/hef_pipeline.rs:191\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo/src/hef_pipeline.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6531eca810a0a7fddfc97efdd457f9142e41f28920ce92f4aead6f03248f081d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-py/src/cluster.rs:79-85 | crates/ruvector-py/src/gnn.rs:376-387 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-py/src/cluster.rs:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/cluster.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"098085b2a085d29abd118d5596a0f1b35c7427c2f17cb88d4c1199906d26e186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-adaptive-ann/src/bin/benchmark.rs:75-86 | crates/ruvector-coherence-hnsw/src/bin/benchmark.rs:80-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-adaptive-ann/src/bin/benchmark.rs:75\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-adaptive-ann/src/bin/benchmark.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaa34c49159000b38d6cbcb274a26ed400836ee37ee97906f613b8765096e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm-wasm/src/webgpu/compute.rs:705-716 | crates/ruvllm-wasm/src/webgpu/compute.rs:747-757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm-wasm/src/webgpu/compute.rs:705\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/webgpu/compute.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf81e12a2bc48c73771f62be282405d847e16e1fa8b41214db42b3f6995276b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvllm/src/reflection/perspectives.rs:273-284 | crates/ruvllm/src/reflection/perspectives.rs:289-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/reflection/perspectives.rs:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/perspectives.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"353cb68c6d11e70f6418d0dbc3d4126db861628efd3c8779456be3b80c296e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ruvector-domain-expansion/src/planning.rs:529-540 | crates/ruvector-domain-expansion/src/tool_orchestration.rs:600-611 | crates/ruvector-robotics/src/domain_expansion.rs:656-667 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-domain-expansion/src/planning.rs:529\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-domain-expansion/src/planning.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e11fbd447ffbec0f69959ef0f15093cf5640823601b62f3fbbabe7554e38cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ruvector-bench/src/bin/memory_benchmark.rs:111-122 | crates/ruvector-bench/src/bin/memory_benchmark.rs:324-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs:106\u0060 calls \u0060current_usage_mb\u0060 and \u0060crates/ruvector-bench/src/bin/memory_benchmark.rs:323\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/memory_benchmark.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8b4e10bda8cd678a7e7e69d5b1b93e4fa8ca65b14c34a6a074c5181f7fb0cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-attention/src/utils.rs:89-100 | crates/ruvector-attention/src/utils.rs:296-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/utils.rs:89\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/utils.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d53aabe44b6adb59ca5dc90fe3bf404e7a776162a646781655b5b066e0338c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-postgres/src/graph/mod.rs:64-74 | crates/ruvector-postgres/src/graph/sparql/mod.rs:73-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ad9e42dd48bb5f184f6f24851e2b375548b842dd53add7a324f0d3f707a17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-mincut/src/optimization/benchmark.rs:360-370 | crates/ruvector-mincut/src/optimization/benchmark.rs:481-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut/src/optimization/benchmark.rs:360\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/benchmark.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"089ca5fc51f0acfe2830038cfef449743bad8a54ac0b8b872984b50f170a9c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ruvector-agent-memory/src/ledger.rs:258-268 | crates/ruvector-agent-memory/src/ledger.rs:338-348 | crates/ruvector-agent-memory/src/ledger.rs:387-397 \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":"crates/ruvector-agent-memory/src/ledger.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c00e8f311e0b4a7279ed9e69e1027494a25d23dd2cc95d8f188113298ec5d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/anthropic.rs:307-327 | crates/rvAgent/rvagent-backends/src/gemini.rs:359-379 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-backends/src/anthropic.rs\u0060 and \u0060crates/rvAgent/rvagent-backends/src/gemini.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-backends/src/anthropic.rs:307\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/anthropic.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4f74f55b2a0f5eaf65678e708608e6955d38c758376d2b679cbe52ce7ddfda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/device.rs:257-267 | patches/candle-core-0.8.4/src/cuda_backend/device.rs:303-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/device.rs:257\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2018c8ddecf6b0112cab1521a8b33ed79a03a8994de87fa52a3de5d61114439b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvector-cnn/src/tensor.rs:245-255 | crates/ruvector-cnn/src/tensor.rs:264-274 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/tensor.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e47e7b76e12d50680c242f845c777ce9e8d5a21e2d480d9053c7cdbd9eb2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/autodetect.rs:381-391 | crates/ruvllm/src/autodetect.rs:395-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a792b4267399ebc8f781330024f32285eeb8c2819cfe68009a146fef8bed962d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:2510-2520 | crates/ruvllm/src/bitnet/backend.rs:2522-2532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:2510\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d993044a207d1c3bbf0756af73faaa7db8606a8ee9c2b7600063e8a3e77df37c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/mcp-brain-server/src/bin/local.rs:562-570 | crates/mcp-brain-server/src/main.rs:261-271 | crates/ruvllm-cli/src/commands/serve.rs:1030-1040 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/bin/local.rs:562\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"9365353c74ad456491865a7c90010b8793f4c08f651b33b77bf49ea1cd2273af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-core/src/agenticdb.rs:412-422 | crates/ruvector-core/src/agenticdb.rs:502-511 | crates/ruvector-core/src/agenticdb.rs:1347-1356 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/agenticdb.rs:412\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, \u0060crates/ruvector-core/src/agenticdb.rs:423\u0060 calls \u0060begin_read\u0060, \u0060open_table\u0060 and \u0060crates/ruvector-core/src/agenticdb.rs:1357\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1f4bde7b032f00eac5d9dbbb1d836f18db2496242f06e3ddbaf89633a57c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-postgres/src/graph/mod.rs:263-272 | crates/ruvector-postgres/src/graph/sparql/mod.rs:193-202 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6523e6577afd5136016bb477482df812725e19fd36379d1f32854e23467649bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-core/src/agenticdb.rs:975-984 | crates/ruvector-core/src/agenticdb.rs:1347-1356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/agenticdb.rs:975\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f494eb61a997336b780f0d4d37cc46955ea2428fb5decb5aaa2341d8d39604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ruvector-mincut/src/optimization/benchmark.rs:323-332 | crates/ruvector-mincut/src/optimization/benchmark.rs:360-369 | crates/ruvector-mincut/src/optimization/benchmark.rs:481-490 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/optimization/benchmark.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c225824c613da850d769115195511ac7c7e234082f7c669e16e7914f69f0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/training/contrastive.rs:393-402 | crates/ruvllm/src/training/real_trainer.rs:399-408 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/training/contrastive.rs\u0060 and \u0060crates/ruvllm/src/training/real_trainer.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvllm/src/training/real_trainer.rs:396\u0060 calls \u0060map_err\u0060 and \u0060crates/ruvllm/src/training/contrastive.rs:390\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09d12a5b938a15add66d44173d7828502118a00f7dfef28fc0df0feeebff090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/context/claude_flow_bridge.rs:248-257 | crates/ruvllm/src/context/claude_flow_bridge.rs:279-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/claude_flow_bridge.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c570ccd2ce8d584fd38a780825c461d3076c249176440bbb421cc31fd1bb7e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.9.2/src/quantized/k_quants.rs:1990-1999 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:2062-2071 \u2014 both copies are in the same file, so extract the block 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, \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:2073\u0060 calls \u0060as_ptr\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:2001\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":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bb0679eb4d5e1584162bd01185f3ca7368703ed20ec58ea1e652e06a292b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-bench/src/bin/comparison_benchmark.rs:348-357 | crates/ruvector-bench/src/bin/latency_benchmark.rs:380-389 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e7a85314f88c79af5e77673161d0c09f6471a83ebb9d42ada974ee1515c6dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/ruvector-core/src/agenticdb.rs:626-635 | crates/ruvector-core/src/agenticdb.rs:977-985 | crates/ruvector-core/src/agenticdb.rs:1349-1357 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/agenticdb.rs:626\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"877828c0aaad9c075e53275fe144ae92d16ff033a3d1ca9b29a5d842c3077e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rvAgent/rvagent-wasm/src/backends.rs:158-167 | crates/rvAgent/rvagent-wasm/src/backends.rs:186-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-wasm/src/backends.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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/backends.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35394f18b82a7922f13095e82d3c9e758bcda65232a698161c13e78d9bbeedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/training/contrastive.rs:313-322 | crates/ruvllm/src/training/real_trainer.rs:286-295 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/training/contrastive.rs\u0060 and \u0060crates/ruvllm/src/training/real_trainer.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/training/contrastive.rs:313\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d887d33a9d99bb0f4fa58531446e7c6052472e208a6f90d7c2fc501ba3c2da58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvllm/src/backends/coreml_backend.rs:447-456 | crates/ruvllm/src/backends/coreml_backend.rs:541-550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/coreml_backend.rs:447\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7b5ee915a96a34d8c525c319839559aad1ce407accafa49aacfa769a2b4a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/rvAgent/rvagent-wasm/src/gallery.rs:286-295 | crates/rvAgent/rvagent-wasm/src/gallery.rs:426-435 | crates/rvAgent/rvagent-wasm/src/gallery.rs:487-496 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-wasm/src/gallery.rs:286\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/gallery.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"22195bc908b636d0dfd360b501900a7c7268b04c8305c4544a256233b277dfff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/ruvix/crates/bcm2711/src/mmio.rs:74-83 | crates/ruvix/crates/bcm2711/src/mmio.rs:98-107 | crates/ruvix/crates/bcm2711/src/mmio.rs:123-132 | crates/ruvix/crates/rpi-boot/src/early_uart.rs:119-127 | crates/ruvix/crates/rpi-boot/src/lib.rs:234-242 | crates/ruvix/crates/rpi-boot/src/lib.rs:248-256 \u2014 before extracting anything, compare \u0060crates/ruvix/crates/bcm2711/src/mmio.rs\u0060 and \u0060crates/ruvix/crates/rpi-boot/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/bcm2711/src/mmio.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8ce2bfe3564172e463a4f4f464354b66b50928f02206617eacc53243248237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ruvector-bench/src/bin/comparison_benchmark.rs:130-139 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:177-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:130\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"17707ef6c15b259e207681f12e2495149c58795a7a3ba2dd24b206143f969dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rvAgent/rvagent-a2a/src/server/push.rs:538-546 | crates/rvAgent/rvagent-a2a/src/server/push.rs:557-565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-a2a/src/server/push.rs:538\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/server/push.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d204eb7e2e7aeafbf349ac861a0e6476efc2fc35dee6975445ee831a8b9dce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:331-339 | crates/ruvector-hailo-cluster/src/bin/worker.rs:829-837 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/worker.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/fakeworker.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040a736b53c1041da205d2b6b43ccc4447123ae5f20c1be20d5f4838925c256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-rulake/src/fs_backend.rs:240-244 | crates/ruvector-rulake/src/fs_backend.rs:327-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/fs_backend.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6771af42864727b803a95fd9237809880a223c5c7c02dd3137429874fb6e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-consciousness/src/arena.rs:30-37 | crates/ruvector-solver/src/arena.rs:67-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-consciousness/src/arena.rs:30\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/arena.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdc0bb1c51b8bd6eefa21f690c7b85f9ab9e2d31f02df7d9629680041c5e0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:371-379 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:876-884 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:423-431 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1059-1067 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:371\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb835207143aff9f8bf7089ad9e479bd8400b0396a61ff5d864a0399ddfcf54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-brain-server/src/types.rs:689-697 | crates/mcp-brain/src/embed.rs:53-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/types.rs:689\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a99a03fc66bda4a29e923a05d679bb8e348853026e94577dde75c9ead4314a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-sota-bench/src/runners/core_hnsw.rs:32-38 | crates/ruvector-sota-bench/src/runners/vdbbench.rs:61-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-sota-bench/src/runners/core_hnsw.rs:32\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/runners/core_hnsw.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b1d1b3db128291842be016cd850a00ca405a7d34edc0a89a3bd4ed36027da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvix/crates/smp/src/barriers.rs:349-357 | crates/ruvix/crates/smp/src/barriers.rs:392-400 | crates/ruvix/crates/smp/src/barriers.rs:416-423 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/smp/src/barriers.rs:349\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/smp/src/barriers.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60cf8282e0c4e1ebed40add3c0636a9831040ef2d5d658affc81340c7c4b578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-postgres/src/hybrid/registry.rs:466-474 | crates/ruvector-postgres/src/hybrid/registry.rs:477-485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/hybrid/registry.rs:466\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/hybrid/registry.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd80319bdae715c1ebfea5c0a8dfcb48f6eca91ce30eeeb3311ddef58ef38190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-speculative-ann/src/bin/benchmark.rs:175-183 | crates/ruvector-speculative-ann/src/bin/benchmark.rs:276-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-speculative-ann/src/bin/benchmark.rs:175\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-speculative-ann/src/bin/benchmark.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5a8e9c55f878b21d88dd03498c698f3b63b82a57503e3536956a26492ea14e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/ruvector-hailo-cluster/src/bin/bench.rs:113-119 | crates/ruvector-hailo-cluster/src/bin/bench.rs:122-127 | crates/ruvector-hailo-cluster/src/bin/bench.rs:162-167 | crates/ruvector-hailo-cluster/src/bin/embed.rs:112-118 | crates/ruvector-hailo-cluster/src/bin/embed.rs:125-130 | crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:107-115 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:113\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"672bcdb5751d58bd9a40c5d483624fa61dd8e636ca19a64a49c9d7fd95631330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvix/crates/cli/src/commands/dtb.rs:223-231 | crates/ruvix/crates/cli/src/commands/dtb.rs:328-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:223\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:221\u0060 calls \u0060cyan\u0060 and \u0060crates/ruvix/crates/cli/src/commands/dtb.rs:326\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c9e9aa1ec54d48385190de3d03769e018c96d9489396bf7a38157b30d7f3db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/ruvector-py/src/cluster.rs:75-83 | crates/ruvector-py/src/gnn.rs:149-157 | crates/ruvector-py/src/gnn.rs:372-380 | crates/ruvector-py/src/hnsw.rs:256-264 | crates/ruvector-py/src/rabitq.rs:422-430 \u2014 before extracting anything, compare \u0060crates/ruvector-py/src/hnsw.rs\u0060 and \u0060crates/ruvector-py/src/rabitq.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-py/src/cluster.rs:75\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/cluster.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef352bfffdfeb281c2520a07509df1c19f83d2eaa83aaaa3014586c70cc3194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rvf/rvf-kernel/src/initramfs.rs:322-330 | crates/rvf/rvf-kernel/src/initramfs.rs:384-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-kernel/src/initramfs.rs:322\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-kernel/src/initramfs.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e775291dd56f7ebd0ef7156e2ed096e6ef098f6f4799c9298c165e2105ad2320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-spann/src/bin/benchmark.rs:178-185 | crates/ruvector-spann/src/bin/benchmark.rs:195-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-spann/src/bin/benchmark.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-spann/src/bin/benchmark.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d408088d3213e0b98a0fa811f4e9510356e2191b0b9c36cab5dfcee7423e16fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/types/halfvec.rs:581-588 | crates/ruvector-postgres/src/types/vector.rs:298-305 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/halfvec.rs:581\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/halfvec.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"342136bb248a9ce5fd55c92d0c021e8b9f31e5182aade07dad0af58852035755"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/prime-radiant/src/gpu/engine.rs:386-393 | crates/prime-radiant/src/gpu/engine.rs:404-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 \u0060crates/prime-radiant/src/gpu/engine.rs:386\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d45f39bda49172e690c197339ce0830f5bd2d4b7b876ef27395c2abc718c33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/rope.rs:206-213 | crates/ruvector-mincut-gated-transformer/src/rope.rs:259-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/rope.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/rope.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae422972cda0f4ace188f80b0157a4efc9fb30a815f1fd086c4a4fe94615560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-bench/src/bin/latency_benchmark.rs:68-74 | crates/ruvector-bench/src/bin/memory_benchmark.rs:51-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs:68\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/latency_benchmark.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e553fb2487ddf7e6b3f557f57fec8ea8c598761723ab1b06b8e245e8cc249063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): patches/hnsw_rs/src/hnswio.rs:441-447 | patches/hnsw_rs/src/hnswio.rs:540-547 | scripts/patches/hnsw_rs/src/hnswio.rs:441-447 | scripts/patches/hnsw_rs/src/hnswio.rs:540-547 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/hnswio.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/hnswio.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 935 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"acca8444e6d6961eef8becced166aa4063cf5582a11b847ce2795ab8c3aed1eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-gnn/src/mmap.rs:165-172 | crates/ruvector-gnn/src/mmap.rs:426-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 \u0060crates/ruvector-gnn/src/mmap.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/mmap.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fde6e39931acd9e288dd154c40a10d8af25d96a3064f8f3c7fbe354cc0ecb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-attention/src/attention/flash.rs:178-185 | crates/ruvector-attention/src/attention/mla.rs:290-297 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/attention/flash.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/flash.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"26103c5fc5061f3e87e5c8e60f3a7fbfb3626cc1a7fb2bd3389baf699283459b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-postgres/src/math/operators.rs:119-126 | crates/ruvector-postgres/src/math/operators.rs:170-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/math/operators.rs:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/math/operators.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9080dd24ae82f61eaa79326b4590f6a1df69daedda8e0bece22b85ffc068505"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2482-2489 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2529-2536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2482\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec20730981e16804755e90c5e2ac8024c8499de57e97a6a745c4513b9a735a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ruvector-hailo/src/cpu_embedder.rs:117-124 | crates/ruvector-hailo/src/hef_embedder.rs:68-75 | crates/ruvector-hailo/src/host_embeddings.rs:62-69 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo/src/cpu_embedder.rs\u0060 and \u0060crates/ruvector-hailo/src/host_embeddings.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo/src/cpu_embedder.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo/src/cpu_embedder.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"17393ee76625d75adbb15d3e0796afc06f1252ec11a36c5b580e5035f6dde93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvix/crates/smp/src/barriers.rs:285-292 | crates/ruvix/crates/smp/src/barriers.rs:307-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/smp/src/barriers.rs:285\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/smp/src/barriers.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0ecb46845bf753bfe6068faaddd1431f65aa29375a6601c8fc1a7ae743c9bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-bench/src/bin/latency_benchmark.rs:241-248 | crates/ruvector-bench/src/bin/latency_benchmark.rs:300-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs:238\u0060 calls \u0060Some\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs:297\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/latency_benchmark.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"60156dde19dcbbd885cc062d488528d8a8f43c779b61fa2c06f1a10598f933a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/mcp-brain/src/tools.rs:377-384 | crates/mcp-brain/src/tools.rs:706-713 | crates/ruvllm/src/policy_store.rs:398-405 | crates/ruvllm/src/quality/validators.rs:181-188 | crates/ruvllm/src/witness_log.rs:639-646 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/policy_store.rs\u0060 and \u0060crates/ruvllm/src/witness_log.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain/src/tools.rs:377\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/mcp-brain/src/tools.rs:714\u0060 calls \u0060get\u0060, \u0060and_then\u0060, \u0060as_str\u0060 and \u0060crates/mcp-brain/src/tools.rs:385\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"193d0810afb6ac4a134e6a3952a3af266f9501e7df841395020d66225eac2450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-robotics/src/mcp/executor.rs:200-207 | crates/ruvector-robotics/src/mcp/executor.rs:232-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-robotics/src/mcp/executor.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-robotics/src/mcp/executor.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf9683018bb4609efd69990b5d82b289852ba7c4f2bcebf98573881e22ee3c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.9.2/src/sort.rs:189-195 | patches/candle-core-0.9.2/src/sort.rs:207-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.9.2/src/sort.rs:189\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/sort.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eec2b74c998ebce6b46f37caaa7e3b3ef90e9d691f93a4c9e2c96f742fe01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/ruvector-bench/src/bin/comparison_benchmark.rs:118-125 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:165-172 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:218-225 | crates/ruvector-bench/src/bin/comparison_benchmark.rs:276-283 | crates/ruvector-bench/src/bin/latency_benchmark.rs:133-140 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"73aafaa80747cc9796cca1a26610f8042c0c8ae66d1e76089a43077524f4c602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/bitnet/backend.rs:1271-1278 | crates/ruvllm/src/bitnet/backend.rs:1298-1305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/bitnet/backend.rs:1271\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc96ec35f63a3b3919b72370fdd8514474a122423b63bc3b35803245436543c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-brain-server/src/types.rs:712-717 | crates/mcp-brain/src/embed.rs:75-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/types.rs:712\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea811649580d1712a0462201e0d1e142263700ab3a7fd6f4b0fa6dbe5a9ca3b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1800-1807 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1812-1819 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1824-1831 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1836-1843 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1848-1855 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1860-1867 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1800\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"df914e4bc4b3ef3b45520ec529678bfc98cbc6306e628fe2300b9a11fd9383b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvllm/src/training/real_trainer.rs:347-353 | crates/ruvllm/src/training/real_trainer.rs:356-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/training/real_trainer.rs:347\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/training/real_trainer.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53923c29fa5b83087920745bcfa3e8a43ad9a9163c9956b2ab9be8351f205ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:898-904 | crates/mcp-brain-server/src/routes.rs:1093-1099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:898\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a8ce59a606d9dde1ed77bc762d47b0c641ad0325f0cf32977b73d55c1d6297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/prime-radiant/src/storage/postgres.rs:811-817 | crates/prime-radiant/src/storage/postgres.rs:821-827 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/storage/postgres.rs:811\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/postgres.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf3d59bdc48f10102728c73f5b562fbb59d6aee39c60c4327945c0109e11d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvAgent/rvagent-backends/src/anthropic.rs:445-451 | crates/rvAgent/rvagent-backends/src/gemini.rs:668-672 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-backends/src/anthropic.rs\u0060 and \u0060crates/rvAgent/rvagent-backends/src/gemini.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-backends/src/anthropic.rs:445\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/anthropic.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c027c4cd92173d416640970a54b27550c1093e5ae88cb3794e23c9e9168a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/graph/sparql/functions.rs:341-347 | crates/ruvector-postgres/src/graph/sparql/functions.rs:366-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/sparql/functions.rs:341\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/functions.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b5d860902f100995b26d75a868a2b53e95186a5c0bd7e867f6a8ee28ca2f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/rvf/rvf-server/src/tcp.rs:200-206 | crates/rvf/rvf-server/src/tcp.rs:253-259 | crates/rvf/rvf-server/src/tcp.rs:328-334 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-server/src/tcp.rs:200\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/tcp.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a0ca5fdf60b0707d40a792b2a2c9b60311545e19c8ec26ad3e646a3ec9776f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): crates/ruvector-bench/src/bin/comparison_benchmark.rs:307-313 | crates/ruvector-bench/src/bin/latency_benchmark.rs:337-343 | crates/ruvector-bench/src/bin/memory_benchmark.rs:94-100 | crates/ruvector-bench/src/bin/memory_benchmark.rs:218-224 | crates/ruvector-bench/src/bin/memory_benchmark.rs:307-313 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:132-138 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:216-222 | crates/ruvector-bench/src/bin/profiling_benchmark.rs:296-302 \u2014 before extracting anything, compare \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs\u0060 and \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 116 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/comparison_benchmark.rs:307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/comparison_benchmark.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c16d211d88e24d967198be9cd78c2150abd828bb049365a32263e9480f5a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:274-280 | crates/ruvector-hailo-cluster/src/grpc_transport.rs:66-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:274\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/fakeworker.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d62a293e66a84f4b1e897e0f421ed9a2b7289b4927b8d1e7a98d9bf1f160f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvAgent/rvagent-tools/src/grep.rs:54-60 | crates/rvAgent/rvagent-tools/src/ls.rs:39-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvAgent/rvagent-tools/src/grep.rs:54\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-tools/src/grep.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0cadd6d716874f5d23490b1c3e5f00cbb11eef4fbaebeb7b5c3588cd5a8cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-bench/src/bin/latency_benchmark.rs:231-237 | crates/ruvector-bench/src/bin/latency_benchmark.rs:290-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-bench/src/bin/latency_benchmark.rs:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/latency_benchmark.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0451005fb7c31d69e690d08a33710838431ec34cb92e674fac96e0de28529f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-postgres/src/types/binaryvec.rs:305-311 | crates/ruvector-postgres/src/types/scalarvec.rs:347-353 \u2014 before extracting anything, compare \u0060crates/ruvector-postgres/src/types/binaryvec.rs\u0060 and \u0060crates/ruvector-postgres/src/types/scalarvec.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/types/binaryvec.rs:305\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b92d56719a11374f4cb2809b44e9a87fcb9a2c660e6932563efc5d2d615f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvix/qemu-swarm/src/consensus.rs:51-57 | crates/ruvix/qemu-swarm/src/consensus.rs:87-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/qemu-swarm/src/consensus.rs:51\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6214eb0f49457ee521499ef128abdafd6ffcf7774c7f206d8888af00d103fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mcp-brain-server/src/pubmed.rs:204-210 | crates/mcp-brain-server/src/pubmed.rs:286-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/pubmed.rs:204\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pubmed.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"627e8b7c26938315b31271bb705209776d88151e02053755c1ed1ce7bc12a4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:300-306 | crates/rvf/rvf-adapters/claude-flow/src/memory_store.rs:285-291 | crates/rvf/rvf-adapters/sona/src/experience.rs:290-296 | crates/rvf/rvf-adapters/sona/src/trajectory.rs:281-287 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:300\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rvf/rvf-adapters/claude-flow/src/memory_store.rs:284\u0060 calls \u0060Witness\u0060 and \u0060crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs:299\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"883663f7c9fe8369f65a6684ad04e24528f77d46428a66c871252e43d3db787c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/avx.rs:52-58 | patches/candle-core-0.8.4/src/quantized/avx.rs:73-79 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/avx.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060xs\u0060 to \u0060\u0026[BlockQ4_0]\u0060 in one and \u0060\u0026[BlockQ8_0]\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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2613986a30bf007448d18bf9ff9351fe1eced764ba43bfffa8c51aaf34012dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-streaming-qng/src/bin/benchmark.rs:299-307 | crates/ruvector-streaming-qng/src/bin/benchmark.rs:314-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/bin/benchmark.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e671d30eda6349148abc11c31368763203a62705f02627505ec59e28bbe3185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-graph-node/src/lib.rs:326-332 | crates/ruvector-graph-node/src/lib.rs:592-598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/lib.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"278bea5240351d1d1c2b66b94a3cd00c0c1170a4bdb84fc62557d7b61b91f24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-postgres/src/graph/cypher/parser.rs:96-102 | crates/ruvector-postgres/src/graph/cypher/parser.rs:112-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/graph/cypher/parser.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":"crates/ruvector-postgres/src/graph/cypher/parser.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8623fa80232ab47f355bf9a22a02eb129b58ddb66955b783fa59e3ba4248011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:159-164 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:211-216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"28897d4aec8e30332918c6abe73d3160628816190daaebbb0e25b206a4008bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:472-477 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:527-532 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:581-586 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:633-638 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0b9b262752f0e9c7a60323ee72f4b79cd7f127bb977e32743c0fab22e65873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-lsm-ann/src/bin/benchmark.rs:25-30 | crates/ruvector-lsm-ann/src/bin/benchmark.rs:33-38 | crates/ruvector-recall-bounded/src/bin/benchmark.rs:74-79 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-lsm-ann/src/bin/benchmark.rs:25\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-lsm-ann/src/bin/benchmark.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"52df00343ac8872b31e5cf6f652f0c8aa2d21174104989a42b7c15b643ac2f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvllm/src/session_index.rs:255-260 | crates/ruvllm/src/witness_log.rs:623-628 \u2014 before extracting anything, compare \u0060crates/ruvllm/src/session_index.rs\u0060 and \u0060crates/ruvllm/src/witness_log.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/session_index.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"203daf618cfbed0bf377e9cc2ab3e092e710edb33880994b03bcdead7ddd1df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rvf/rvf-quant/src/rabitq.rs:216-221 | crates/rvf/rvf-quant/src/rabitq.rs:252-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-quant/src/rabitq.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca496adad0f253e9460b47980b4c4a005a37528031022a7f522a8008df0046c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-streaming-qng/src/bin/diagnose.rs:48-53 | crates/ruvector-streaming-qng/src/bin/diagnose.rs:61-66 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-streaming-qng/src/bin/diagnose.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38b9f1cb97de96a72698fb70c4f472f857e5b5ba3ed74a9a74f60d9e67e3b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:274-279 | crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:284-288 | crates/ruvector-hailo-cluster/src/grpc_transport.rs:66-71 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/fakeworker.rs:274\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/fakeworker.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9488e993545a278b5d97245dfbf89cffb54efcec86d239a27a2e57b054e44d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/ruvector-hailo-cluster/src/bin/bench.rs:170-175 | crates/ruvector-hailo-cluster/src/bin/embed.rs:117-122 | crates/ruvector-hailo-cluster/src/bin/mmwave-bridge.rs:126-131 | crates/ruvector-hailo-cluster/src/bin/ruview-csi-bridge.rs:183-188 | crates/ruvector-hailo-cluster/src/bin/ruvllm-bridge.rs:98-103 \u2014 before extracting anything, compare \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs\u0060 and \u0060crates/ruvector-hailo-cluster/src/bin/embed.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 326 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/src/bin/bench.rs:170\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/bench.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47c37a178718adf9020329d5fbd46f2bc10b47afb3be2cc41228b92288328ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): edge/gateway/src/durable.rs:256-261 | edge/gateway/src/durable_m4.rs:51-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060edge/gateway/src/durable.rs:256\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":"edge/gateway/src/durable.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c572cd9e5dc55adf374f5ff0e5b8de033a33acd5433adacc557e78ce6271d8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:421-426 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:474-479 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:522-527 \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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbd57d22bf7e19cc01c455953944aa3b59d04f7b9fcae4099c2f413fe4b7e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-cnn/src/layers/batchnorm.rs:65-70 | crates/ruvector-cnn/src/layers/batchnorm.rs:78-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/batchnorm.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"994ffba5dff4e2b50f426c0945bd238072e09f14c2fafb6dc862c5d39ab7ec43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:128-133 | crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:154-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/src/backend/fpga_daemon.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdeeab4c372edb4966737d95b4fc75b73dd885842edf143227a315656b68662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-brain-server/src/auth.rs:60-65 | scripts/seed-brain.rs:241-246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/auth.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"295df97bf6d417690c31a0362db359d5c4312be9c08d28050ccde936b91f6f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-graph-node/src/lib.rs:521-525 | crates/ruvector-graph-node/src/lib.rs:578-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/lib.rs:578\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e01b56870b8658e8a1ccc0c26032cb164d49327519dd2566be360808297f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/ruvix/crates/smp/src/barriers.rs:90-94 | crates/ruvix/crates/smp/src/barriers.rs:114-118 | crates/ruvix/crates/smp/src/barriers.rs:136-140 | crates/ruvix/crates/smp/src/barriers.rs:183-187 | crates/ruvix/crates/smp/src/barriers.rs:204-208 | crates/ruvix/crates/smp/src/barriers.rs:246-250 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/crates/smp/src/barriers.rs:90\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/smp/src/barriers.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c73926685c3e55ef468c28fa8bc8c0f7aadb905b56f2cba8f5c35e778a3fe0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-postgres/src/solver/operators.rs:135-139 | crates/ruvector-postgres/src/solver/operators.rs:171-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 \u0060crates/ruvector-postgres/src/solver/operators.rs:135\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d1833521f06cef2a316788ab0249583d8fafd76cff2b4ee3d7bd3b44c92c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/models/openmythos/act_kernel.rs:204-208 | crates/ruvllm/src/models/openmythos/act_kernel.rs:210-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/openmythos/act_kernel.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7073807fee5c3e99f2efb2bacdffde84ab606187610a800ec19ce0c488ee629d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvix/crates/cli/src/commands/dtb.rs:807-811 | crates/ruvix/crates/cli/src/commands/dtb.rs:898-902 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"8096822b3b84633b9b4eaf1638cfb69fae10abb248f97ef924f28be20e2fa5a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-typesafe-train/src/export/transplant.rs:64-68 | crates/ruvector-typesafe-train/src/model.rs:279-283 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-typesafe-train/src/export/transplant.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/export/transplant.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd1bc7cb50e1ed008edb089953a5f6d2d82addceadf210dc29c14487bc86ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-postgres/src/solver/operators.rs:134-138 | crates/ruvector-postgres/src/solver/operators.rs:170-174 | crates/ruvector-postgres/src/solver/operators.rs:407-411 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-postgres/src/solver/operators.rs:134\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/solver/operators.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"597db63e4eb42368d6ecb50fd525755ff49549dbcdd6354a2c0e2344bd25fa39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/prime-radiant/src/storage/postgres.rs:813-817 | crates/prime-radiant/src/storage/postgres.rs:818-822 | crates/prime-radiant/src/storage/postgres.rs:823-827 | crates/prime-radiant/src/storage/postgres.rs:828-832 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prime-radiant/src/storage/postgres.rs:813\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/storage/postgres.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"c387674039945d1c4d4b2b110414003c0635f22ea37ac2a17128df7a21d970cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:104-108 | patches/candle-core-0.9.2/src/quantized/mod.rs:162-166 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:104\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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d221df1e1282cc9f24e30db015a77ba384668e8cff5dfe209ecc431909db50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:6155-6159 | crates/mcp-brain-server/src/routes.rs:6226-6230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:6155\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/mcp-brain-server/src/routes.rs:6160\u0060 calls \u0060Some\u0060, \u0060get\u0060, \u0060and_then\u0060 and \u0060crates/mcp-brain-server/src/routes.rs:6231\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6155}}}],"partialFingerprints":{"codehealthFindingId/v1":"df46c9a04287a482a0242cb66c5d92707ce9c80a25eccc97d25006609efc43e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvix/crates/cli/src/commands/dtb.rs:237-241 | crates/ruvix/crates/cli/src/commands/dtb.rs:403-407 | crates/ruvix/crates/cli/src/commands/dtb.rs:534-538 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/cli/src/commands/dtb.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e9c903e16dfe048bd36818b972c031567194afd5ac28cdf12e4d30dab9a5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1797-1801 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1809-1813 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1821-1825 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1833-1837 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1845-1849 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1857-1861 | patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1869-1873 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1797\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b7d52d4d4bfc3adc95eab07b3ef3f75e675cc94a0099193eed35337f5f7e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-py/src/graph/convert.rs:77-81 | crates/ruvector-py/src/hnsw.rs:119-123 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-py/src/graph/convert.rs:77\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/graph/convert.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e13fd7dfe699463248fe619ad8a1bbc62f27fd0be7b76c8124c4bfca575c5e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/training/contrastive.rs:352-356 | crates/ruvllm/src/training/contrastive.rs:358-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/training/contrastive.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":"crates/ruvllm/src/training/contrastive.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bc3c1e624d86dcbc34d459e9dc0f8db1fa179a88dfa76b0d3cd9dbf24c1f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-brain-server/src/trainer.rs:375-379 | crates/mcp-brain-server/src/trainer.rs:384-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/trainer.rs:375\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/mcp-brain-server/src/trainer.rs:381\u0060 calls \u0060and_then\u0060, \u0060as_array\u0060, \u0060first\u0060 and \u0060crates/mcp-brain-server/src/trainer.rs:390\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac0793cca0d6cf3f3cfa8fd43b238f904c9f425fdd98e77add021db60ea53b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:5652-5656 | crates/mcp-brain-server/src/routes.rs:5776-5780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:5652\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":5652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d886df8d8c66addc38169bc7560954dcd3a1cb10421d3175efe728a0aa987db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-brain-server/src/trainer.rs:514-518 | crates/mcp-brain-server/src/trainer.rs:785-789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/trainer.rs:514\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d325f4316481f9a39524fd7b71d47a508774b9ed075742a5975fc115e9f1089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-core/src/agenticdb.rs:426-430 | crates/ruvector-core/src/agenticdb.rs:515-519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/agenticdb.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/agenticdb.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70b571a0aa4ca1969113c66558a7843dc5654c4ea72309c1691a1de7c3cec7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:6228-6232 | crates/mcp-brain-server/src/routes.rs:6505-6509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:6228\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-brain-server/src/routes.rs:6225\u0060 calls \u0060Some\u0060, \u0060get\u0060, \u0060and_then\u0060 and \u0060crates/mcp-brain-server/src/routes.rs:6504\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6228}}}],"partialFingerprints":{"codehealthFindingId/v1":"de49c3fb2293e62b32d7b3796ff22d1d0bf2361e1ee3df9afc2e6366a4d44ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): patches/candle-core-0.9.2/src/cuda_backend/mod.rs:546-550 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:600-604 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:652-656 \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 \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs:546\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"558e4ea172c03ab218e0665fe4d40e5df8478a96c1f65468898e92c6ad4e70df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvforge-registry/src/log.rs:226-230 | crates/rvforge-registry/src/registry/witness.rs:181-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-registry/src/log.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa852fe1816ef5e18e4d7c64d61c0ac9c69cd16202cd53abc53796f7ee1ea00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-weaver/src/prs.rs:356-360 | crates/ruvector-weaver/src/saturation.rs:182-186 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-weaver/src/prs.rs:356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/prs.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbdf51bdb6b1fe0f812a0f54cd504dcd49c6dc9a4433459d84736effa83148d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm-cli/src/commands/benchmark.rs:66-70 | crates/ruvllm-cli/src/commands/chat.rs:227-231 \u2014 before extracting anything, compare \u0060crates/ruvllm-cli/src/commands/benchmark.rs\u0060 and \u0060crates/ruvllm-cli/src/commands/chat.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/benchmark.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e4dca11b4f3a5d3fb660ed4c2baa217a8a1647b213b353d43f22520956017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): edge/gateway/src/m3_shard.rs:237-241 | edge/gateway/src/m3_wire.rs:60-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060edge/gateway/src/m3_shard.rs:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/gateway/src/m3_shard.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa491957814dea04ce28cd59bb4aeaec5e6db33fe2662215ef28ecc5fb0c276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:2352-2357 | crates/mcp-brain-server/src/routes.rs:5301-5306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:2352\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1241f89fe3d4fe0ed301322bb58ead264b0e7ad6cfd49a07bd58888a5df46b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-brain-server/src/routes.rs:6134-6139 | crates/mcp-brain-server/src/routes.rs:6292-6297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-brain-server/src/routes.rs:6134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ae01546c309aa967cf70cbd91d798b7210d4616e3e4138cee2c4e1a1b851c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/photonlayer-bench/src/mnist_bench.rs:266-270 | crates/photonlayer-bench/src/mnist_bench.rs:328-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/mnist_bench.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"952a2882d18d2d4e96c26b7843e663db4b9ed2695f5d430dfe1eff5a80950893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/photonlayer-bench/src/mnist_bench.rs:273-277 | crates/photonlayer-bench/src/mnist_bench.rs:356-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/photonlayer-bench/src/mnist_bench.rs:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-bench/src/mnist_bench.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"28312a3e3b3f7adac8cbb10cd10af507fb799695d5b83f23402a314dfc4ffa32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/photonlayer-cli/src/main.rs:395-399 | crates/photonlayer-cli/src/main.rs:455-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-cli/src/main.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c506b8ef707c167c71406233474933d014e790f26e8cc4c9f07be10a27498bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/prime-radiant/src/cohomology/sheaf.rs:180-184 | crates/prime-radiant/src/cohomology/sheaf.rs:187-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/sheaf.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"36246a55a309beea01cad4f2929f42409acd8eed31fc75866d96b3724ae3f80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvector-agent-memory/src/ops.rs:309-313 | crates/rvm/crates/rvm-types/src/witness.rs:104-108 | crates/rvm/crates/rvm-types/src/witness.rs:344-348 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/ops.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"304b95f96994d7e0d7275331fd53d826042ffdf4b2960dbe1f1f804ac4a3c2bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-attention-unified-wasm/src/neural.rs:44-49 | crates/ruvector-attention-wasm/src/attention.rs:24-29 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/neural.rs\u0060 and \u0060crates/ruvector-attention-wasm/src/attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/neural.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3cd4551ccf789339da8356e1de8f65b508089896c4e3f26ee9dd4cbf01c1b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 12): crates/ruvector-attention-unified-wasm/src/neural.rs:106-111 | crates/ruvector-attention-unified-wasm/src/neural.rs:177-182 | crates/ruvector-attention-unified-wasm/src/neural.rs:229-234 | crates/ruvector-attention-unified-wasm/src/neural.rs:275-280 | crates/ruvector-attention-unified-wasm/src/neural.rs:322-327 | crates/ruvector-attention-unified-wasm/src/neural.rs:374-379 | crates/ruvector-attention-wasm/src/attention.rs:75-80 | crates/ruvector-attention-wasm/src/attention.rs:133-138 | crates/ruvector-attention-wasm/src/attention.rs:178-183 | crates/ruvector-attention-wasm/src/attention.rs:217-222 | crates/ruvector-attention-wasm/src/attention.rs:257-262 | crates/ruvector-attention-wasm/src/attention.rs:302-307 \u2014 before extracting anything, compare \u0060crates/ruvector-attention-unified-wasm/src/neural.rs\u0060 and \u0060crates/ruvector-attention-wasm/src/attention.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention-unified-wasm/src/neural.rs:106\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, \u0060crates/ruvector-attention-unified-wasm/src/neural.rs:186\u0060 calls \u0060curvature\u0060 and \u0060crates/ruvector-attention-unified-wasm/src/neural.rs:235\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/src/neural.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92800bcf59ef11c417b492e32fe70ad5535161aa54a10cfc355bbed69043f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-attention/src/attention/ssm.rs:282-288 | crates/ruvector-attention/src/attention/ssm.rs:329-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-attention/src/attention/ssm.rs:282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/attention/ssm.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a850db5005137e8e88747c73a34742c1df8224cdef053f704096e500ef767253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-bench/src/bin/turbo4_ablation.rs:218-223 | crates/ruvector-bench/src/bin/turbo4_ablation.rs:272-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/src/bin/turbo4_ablation.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"db42533d67243753273096989f57c4a9d13d18f3146e2cfb99d0ee4a6d38f020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-cnn/src/backbone/layer.rs:37-41 | crates/ruvector-cnn/src/backbone/layer.rs:76-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/layer.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"161a077106f89872c432a553021117aa774201a0ef92acaa7af8f54964cb695d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-core/src/advanced_features/diskann.rs:282-287 | crates/ruvector-core/src/advanced_features/diskann.rs:339-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-core/src/advanced_features/diskann.rs:282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/diskann.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a4f3d370f8d10d0bfe1a1073314038824d71d78aa72fbb1e325a14a07c6ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-core/src/index/flat_graph.rs:470-475 | crates/ruvector-core/src/index/flat_graph/filtered.rs:49-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":"crates/ruvector-core/src/index/flat_graph.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e383c39b83d6bed2d8c9a2142f140020959d20dc7b4c4f01199e808b31ccec19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/ruvector-edge-index/src/metric.rs:61-66 | crates/ruvector-edge-index/src/quant.rs:320-325 | crates/ruvector-edge-store/src/distance.rs:52-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-edge-index/src/metric.rs:61\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/metric.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ab41040ede0826a5a32367be01d3d723066d3217ac9e41a518fac26108e37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-edge-quant/fuzz/fuzz_targets/rbqx_decode.rs:100-105 | crates/ruvector-edge-quant/src/persist/write.rs:41-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-quant/fuzz/fuzz_targets/rbqx_decode.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"556e229fb7875247d8c4197bec85948aeeba3b7071045f70fb05b897b8623f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-edge-store/src/ops/vector.rs:247-251 | crates/ruvector-edge-store/src/ops/vector.rs:299-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ruvector-edge-store/src/ops/vector.rs:246\u0060 calls \u0060into_iter\u0060, \u0060filter\u0060, \u0060insert\u0060 and \u0060crates/ruvector-edge-store/src/ops/vector.rs:298\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/vector.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"529432b6615224851af189ff6a5c64ac31b31377a09c17360bae4eaabd5fb80a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-edge-store/src/ops/vector.rs:261-266 | edge/gateway/src/vectors.rs:284-289 \u2014 before extracting anything, compare \u0060crates/ruvector-edge-store/src/ops/vector.rs\u0060 and \u0060edge/gateway/src/vectors.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/ops/vector.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a8ce15b4ea1dd85532a8a5be5f336e8f4021931de2a288c739dabb34a69208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ruvector-graph-node/src/cypher_exec.rs:251-257 | crates/ruvector-py/src/graph/cypher_eval.rs:264-270 \u2014 before extracting anything, compare \u0060crates/ruvector-graph-node/src/cypher_exec.rs\u0060 and \u0060crates/ruvector-py/src/graph/cypher_eval.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 186 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/cypher_exec.rs:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"718b27c061c4b3cb8064153c745c61c452753766822c33a8fa8b4f838e662acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-graph-node/src/lib.rs:393-398 | crates/ruvector-graph-node/src/lib.rs:418-423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph-node/src/lib.rs:393\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"b205c04afcf4ea09c2046e4a769db9e9798d99b93c563cd86321bc27453a4d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-graph-node/src/lib.rs:469-473 | crates/ruvector-graph-node/src/lib.rs:798-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 \u0060crates/ruvector-graph-node/src/lib.rs:469\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"759a3359b04941289c6a733e520c0705b99a1b53f8434af9c5faf0b3dd010255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-graph/src/cypher/parser.rs:196-200 | crates/rvlite/src/cypher/parser.rs:192-196 \u2014 before extracting anything, compare \u0060crates/ruvector-graph/src/cypher/parser.rs\u0060 and \u0060crates/rvlite/src/cypher/parser.rs\u0060 as WHOLE FILES: this scan already matched 32 separate duplicated blocks between them, totalling at least 777 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-graph/src/cypher/parser.rs:196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"91503e73dcef77220577d3a17ec6f6b8fd4967b05c26b0d72158713f321f729d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-hybrid/src/main.rs:182-187 | crates/ruvector-hybrid/src/main.rs:200-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hybrid/src/main.rs:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hybrid/src/main.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1faffde031540f1bfe4eaa47b1627aadf0710823d9ca0367162cda40561326d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-kge-ffi/src/model.rs:283-288 | crates/ruvector-kge-wasm/src/model.rs:283-288 \u2014 before extracting anything, compare \u0060crates/ruvector-kge-ffi/src/model.rs\u0060 and \u0060crates/ruvector-kge-wasm/src/model.rs\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 192 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"379c7ddedebc891c4e6653fa33d2748242296a52e6ff0fe8a33fe4181a282eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-matryoshka/src/lib.rs:162-167 | crates/ruvector-matryoshka/src/lib.rs:235-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-matryoshka/src/lib.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf0ca966a87ceee9bc030a79c7960646e5b8c6398c89fea4b138eecc104eab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:342-349 | crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:361-368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:342\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c52f7c2df1c344f368a3c73704b8c5586b121483cf9545993b76fb75f9eeb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:380-387 | crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:399-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs:380\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/quantized_store.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94be9dc87e6be16a5e5e8774407329b9ba0fe7ba9ac0a007000c99aaaa1b252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-mincut-gated-transformer/src/rope.rs:289-294 | crates/ruvector-mincut-gated-transformer/src/rope.rs:297-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/rope.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19b627d0c0d12949d7c14a45a6253b711b41143cad50085fc3608a0a281a48b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-postgres/src/attention/operators.rs:46-50 | crates/ruvector-postgres/src/attention/operators.rs:317-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/attention/operators.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"180cbe2683bb74b68bad210c849132734e4bc4679747a9d3ac158faa8af3fcc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-postgres/src/index/ivfflat_am.rs:865-870 | crates/ruvector-postgres/src/index/ivfflat_am.rs:930-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f46e95334b231b99140ec9ea793c9dd454c54416c32fb96f79f31f8d11aea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-rairs/src/index.rs:55-60 | crates/ruvector-rairs/src/index.rs:76-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-rairs/src/index.rs:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rairs/src/index.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7702348193bf95f9bca19b8a243855c01b2569a08c84bc44160f02065c090303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ruvector-solver/src/simd.rs:262-267 | crates/ruvector-solver/src/simd.rs:331-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060matrix\u0060 to \u0060\u0026CsrMatrix\u003Cf32\u003E\u0060 in one and \u0060\u0026CsrMatrix\u003Cf64\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/simd.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bf85bba7b3fb59464656501d65970c5880bb28c157ed2a5b4bb6759fabdf65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-spann/src/index.rs:134-138 | crates/ruvector-spann/src/index.rs:223-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-spann/src/index.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-spann/src/index.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"755d1f8d48182d94fede7f1f1a3ef23b3c2960db97be4a3879a889525c0a1daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-sparse-inference/src/predictor/lowrank.rs:62-66 | crates/ruvector-sparse-inference/src/predictor/lowrank.rs:68-72 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/predictor/lowrank.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bae960e8d2098f0720a48c7c70efc01394300fc38301d9f66be5b78a24eae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvector-tiny-dancer-core/src/training.rs:213-217 | crates/ruvector-tiny-dancer-core/src/training.rs:219-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/training.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f673fb35db573b9a59cdb11f12e2cc8d274b100e5b9702c553d3cdbe5d6b772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvix/qemu-swarm/src/monitor.rs:146-150 | crates/ruvix/qemu-swarm/src/monitor.rs:258-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvix/qemu-swarm/src/monitor.rs:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/monitor.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cf017326887379229da34b4c0726f423433fd63bec058bf26f9f280565ed47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvllm/src/backends/coreml_backend.rs:714-721 | crates/ruvllm/src/backends/coreml_backend.rs:1134-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvllm/src/backends/coreml_backend.rs:714\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a38197ed8257b7e43c36c4c18e21514735349817ce9c2efd795ff735a2a6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/evaluation/diff_quality.rs:374-378 | crates/ruvllm/src/evaluation/diff_quality.rs:380-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":"crates/ruvllm/src/evaluation/diff_quality.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee57bd63c250202e3efa5f41c68f3b099f4ad5305c63e0aab472f32f6fc02a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ruvllm/src/kernels/norm.rs:294-298 | crates/ruvllm/src/kernels/norm.rs:324-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/norm.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa62a0e1298fdf11002bd86ce73acc9fa825d60c96c78472caa0b60c2796fb27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ruvllm/src/kernels/norm.rs:300-304 | crates/ruvllm/src/kernels/norm.rs:306-310 | crates/ruvllm/src/kernels/norm.rs:312-316 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/kernels/norm.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e102ed59f67ac6b01cfae1f9af1011a30311022061a11ead8edbf0d0b9a990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvAgent/rvagent-core/src/rvf_bridge.rs:345-349 | crates/rvf/rvf-types/src/witness.rs:204-208 \u2014 before extracting anything, compare \u0060crates/rvAgent/rvagent-core/src/rvf_bridge.rs\u0060 and \u0060crates/rvf/rvf-types/src/witness.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-core/src/rvf_bridge.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cce237d929a24fd37b97bbea459d48d9e808b0650095fbf93af02090d1295d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rvf/rvf-index/src/hnsw.rs:584-590 | crates/rvf/rvf-runtime/src/rabitq_path.rs:228-234 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rvf/rvf-index/src/hnsw.rs:584\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf9701c670b547c41dbf9b6047c6b656155373bf9afbb3ee56e19a88cb0f388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvf/rvf-quant/src/product.rs:74-78 | crates/rvf/rvf-quant/src/product.rs:100-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 \u0060crates/rvf/rvf-quant/src/product.rs:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-quant/src/product.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d923b836af9b6967f7ac29f44678a87d90c235b03c156675b5546bc7f3b93fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvf/rvf-runtime/src/agi_container.rs:394-398 | crates/rvf/rvf-runtime/src/witness.rs:482-486 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/agi_container.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9608222f786fc26d832cc9b9c5c765f92d6e97113c2f6f60a92a54437c0ac4b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rvm/crates/rvm-witness/src/seal.rs:135-139 | crates/rvm/crates/rvm-witness/src/seal.rs:159-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rvm/crates/rvm-witness/src/seal.rs:164\u0060 calls \u0060copy_from_slice\u0060 and \u0060crates/rvm/crates/rvm-witness/src/seal.rs:140\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/seal.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2f76b368c282b84f3b0d53da2e822d6694902eaf073ca2da93fc9ccf04c947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): edge/gateway/src/restore.rs:387-391 | edge/gateway/src/snapshots.rs:164-168 \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":"edge/gateway/src/restore.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcce05808dc68fc4aa7cbdb7c6ff38ece162b86911fdf3ce1e63c0dcd20ef10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): edge/gateway/src/vectors.rs:261-265 | edge/gateway/src/vectors.rs:315-319 \u2014 both copies are in the same file, so extract the block 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, \u0060edge/gateway/src/vectors.rs:260\u0060 calls \u0060into_iter\u0060, \u0060filter\u0060, \u0060insert\u0060 and \u0060edge/gateway/src/vectors.rs:314\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":"edge/gateway/src/vectors.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83c78399670453aadcaf13a35439571f3f287cee52d32e683c1332bf2f4d356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:55-64 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:73-82 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a272eb0284ea2e3210e24e05b8bf7f1274141c8d186dd51d0b9a4da6bcbada4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2163-2167 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2672-2676 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2670\u0060 calls \u0060I16\u0060, \u0060copy_strided_src_\u0060, \u0060I32\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2162\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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7d70a4647bb1bd18c5cf9cfa8ef5fb527b3f2b9a10a56ff899654028ad5b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2358-2364 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2843-2849 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a7b7d21b7d31792ae3591ccacacdcf812d753a5b17fdbfb6317be94f2d5d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2367-2373 | patches/candle-core-0.9.2/src/cpu_backend/mod.rs:2852-2858 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 77 separate duplicated blocks between them, totalling at least 1846 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9681abd4d66f5deccb6ef5f4f62f2881e6b34e6c7284eb2a342063188bba11af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2623-2627 | patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2637-2641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cpu_backend/mod.rs:2623\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73450f05d712b0f556c6783e278bb9c329af6366f7ed536bcb2fb7a6fad3c3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:13-17 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:15-19 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs:13\u0060 calls \u0060I16\u0060, \u0060Ok\u0060, \u0060f\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs:12\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":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a209eeb4761bc625506733a25563654028b568e79c75dce29ccafc675a7955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cpu_backend/utils.rs:29-33 | patches/candle-core-0.9.2/src/cpu_backend/utils.rs:39-43 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 291 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/cpu_backend/utils.rs:37\u0060 calls \u0060I16\u0060, \u0060Ok\u0060, \u0060f\u0060 and \u0060patches/candle-core-0.8.4/src/cpu_backend/utils.rs:28\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":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd7d6bedbf68f6f59f3f9be284756b4d3bf76ddeb4bce995df9abd62831f6f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:204-208 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:236-240 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c5dc98448dcc5db3a8c226cb817703dca54ce1f5f9f60927e3fcc657883fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:381-390 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:433-442 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f4eba13dca0b7115316f4c3bc236d8250fc6576f518bf25a7fd76f1b35ee3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1384-1388 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:1805-1809 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1384\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4327eadd23c3ffb5bab688cf5d2b24e25045921f142569d62f894367a5527ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1515-1524 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2005-2014 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1515\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b30f2a04aef90b355e51a5c03f9ba577fb0aef1a44c77ea32723a0b3f03b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1562-1566 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2052-2056 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1562\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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3f2d57ac991de8e3a60993f11a97ffe195afc6d9bc0e3d12a9fadb0a282362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1670-1676 | patches/candle-core-0.9.2/src/cuda_backend/mod.rs:2195-2201 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 63 separate duplicated blocks between them, totalling at least 679 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/cuda_backend/mod.rs:1670\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c50a4254e1e5559a44266e9de675cd043f18e6b8d8b9852dfffe36e210c329"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/utils.rs:22-26 | patches/candle-core-0.9.2/src/cuda_backend/utils.rs:24-28 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/utils.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/cuda_backend/utils.rs:22\u0060 calls \u0060I16\u0060, \u0060f\u0060, \u0060I32\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/utils.rs:21\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":"patches/candle-core-0.8.4/src/cuda_backend/utils.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bda211e4d44356e308931f2c9c879fb8cf2f4f96a83ea49202672de1ddad7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/cuda_backend/utils.rs:139-143 | patches/candle-core-0.9.2/src/cuda_backend/utils.rs:156-160 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/cuda_backend/utils.rs\u0060 and \u0060patches/candle-core-0.9.2/src/cuda_backend/utils.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/cuda_backend/utils.rs:154\u0060 calls \u0060I16\u0060, \u0060f\u0060, \u0060I32\u0060 and \u0060patches/candle-core-0.8.4/src/cuda_backend/utils.rs:138\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":"patches/candle-core-0.8.4/src/cuda_backend/utils.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"064db7d8ffbb3d24ba6147e695a82d5d42c4fd985deb5b7ebd5f410fb5f63dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/custom_op.rs:184-189 | patches/candle-core-0.9.2/src/custom_op.rs:184-189 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/custom_op.rs\u0060 and \u0060patches/candle-core-0.9.2/src/custom_op.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f1b21cd9a05590e985650010882288694b57b7ebbccf6d9948b181458b51c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/display.rs:59-63 | patches/candle-core-0.9.2/src/display.rs:61-65 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/display.rs\u0060 and \u0060patches/candle-core-0.9.2/src/display.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe08169ba7ee5985bc2401bddba6721abed42e31f95cf865168d2376169488c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:101-105 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:106-110 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd6479d5434967a0ad97144d6dd85a5c2903174e20d65aba5934f76162a85d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2006-2010 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:1989-1993 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:1987\u0060 calls \u0060I16\u0060, \u0060new_buffer_with_data\u0060, \u0060I32\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:2005\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"362c391ef550a5f93f58431a41ac892b3ebb1d75358ab0a8b804e0d924fd8e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/metal_backend/mod.rs:2019-2023 | patches/candle-core-0.9.2/src/metal_backend/mod.rs:2011-2015 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs\u0060 as WHOLE FILES: this scan already matched 68 separate duplicated blocks between them, totalling at least 1279 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/metal_backend/mod.rs:2009\u0060 calls \u0060I16\u0060, \u0060new_buffer_with_data\u0060, \u0060I32\u0060 and \u0060patches/candle-core-0.8.4/src/metal_backend/mod.rs:2018\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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b864615f761bad256888e678f3469cd743372ff6cf72d3c54d07a425fdee57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/avx.rs:457-463 | patches/candle-core-0.8.4/src/quantized/avx.rs:543-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/avx.rs:457\u0060 it does not close everything it opens, so those exact 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 \u0060xs\u0060 to \u0060\u0026[BlockQ4K]\u0060 in one and \u0060\u0026[BlockQ5K]\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":"patches/candle-core-0.8.4/src/quantized/avx.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9bb7dbb020126c2c76b166afb3b69e64887b388c3059a0d107e1f50b66efee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/cuda.rs:595-599 | patches/candle-core-0.9.2/src/quantized/cuda.rs:846-850 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/cuda.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/cuda.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 253 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/cuda.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a63c8f2fa6150e47b2026ed69befd6765a61ff12a76a95f355c50d167cb256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:111-116 | patches/candle-core-0.9.2/src/quantized/mod.rs:223-228 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5212d6a60558f656fe7dbc036cd6e4d1a8f7c6be7fdb3cf8bcf8da93a314df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): patches/candle-core-0.8.4/src/quantized/mod.rs:194-208 | patches/candle-core-0.9.2/src/quantized/mod.rs:319-333 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/quantized/mod.rs\u0060 and \u0060patches/candle-core-0.9.2/src/quantized/mod.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 211 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:194\u0060 it does not close everything it opens, so those exact 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, \u0060patches/candle-core-0.9.2/src/quantized/mod.rs:334\u0060 calls \u0060zeros\u0060 and \u0060patches/candle-core-0.8.4/src/quantized/mod.rs:209\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":"patches/candle-core-0.8.4/src/quantized/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"809b4ae1b9b504439bac4eeb06220e0a5b2ecf9fe53dcba6bb76430c74d01921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:39-43 | patches/candle-core-0.9.2/src/safetensors.rs:51-55 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"341e33a84c391edfe2951681e323880c242fd5fb45e76f1a4662fec318814aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:201-205 | patches/candle-core-0.9.2/src/safetensors.rs:220-224 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83490cf1d2ddea78fd51b74eb4dd2aa924f9e7083ce08ce27406c65cce71991"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:222-226 | patches/candle-core-0.9.2/src/safetensors.rs:296-300 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b8253d96852c5b8be5a8fb504f114aa354ccb68c9d6117eb060ac0373121fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/safetensors.rs:237-241 | patches/candle-core-0.9.2/src/safetensors.rs:388-392 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/safetensors.rs\u0060 and \u0060patches/candle-core-0.9.2/src/safetensors.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 176 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060patches/candle-core-0.9.2/src/safetensors.rs:393\u0060 calls \u0060Ok\u0060, \u0060to_vec1\u0060, \u0060Err\u0060 and \u0060patches/candle-core-0.8.4/src/safetensors.rs:242\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":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ad65392e2b302d631f14cfc4aa578c69d13ee5011c88fc260116463e91b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/sort.rs:111-115 | patches/candle-core-0.9.2/src/sort.rs:121-125 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/sort.rs\u0060 and \u0060patches/candle-core-0.9.2/src/sort.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 107 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060patches/candle-core-0.9.2/src/sort.rs:119\u0060 calls \u0060I16\u0060, \u0060asort\u0060, \u0060I32\u0060 and \u0060patches/candle-core-0.8.4/src/sort.rs:110\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":"patches/candle-core-0.8.4/src/sort.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b961d0aaec1aa20b8ebe8462d8739988c17f7a732d1f94711c604872cc6c172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): patches/candle-core-0.8.4/src/storage.rs:281-288 | patches/candle-core-0.9.2/src/storage.rs:290-297 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/storage.rs\u0060 and \u0060patches/candle-core-0.9.2/src/storage.rs\u0060 as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 552 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/storage.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e1733843aa82a612399960ee6984fc14c4e975306651d820c4eaed0614a9d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:717-723 | patches/candle-core-0.9.2/src/tensor.rs:785-791 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"2874d6ef03766d0b4e8cf34f36b0974bf169bee6a55adc003532a6fc41ca68b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:727-733 | patches/candle-core-0.9.2/src/tensor.rs:795-801 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcf2758168e65ccda47b52713481d76edf620ad8bcedf6dfb3055c23369c7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:737-743 | patches/candle-core-0.9.2/src/tensor.rs:805-811 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"859712544d5b0db79ca64d02893ad8776151a998790ef040b88d08be01d585cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:983-987 | patches/candle-core-0.9.2/src/tensor.rs:1051-1055 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f2db9d1340fd86a701afcbf7190c3849621c603979f9d9bb447413cefa5e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:993-997 | patches/candle-core-0.9.2/src/tensor.rs:1061-1065 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d4a00b3bb7f763e4120cecb6648c19cb29e35e7042ff6b2aac6726d7692e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:1001-1005 | patches/candle-core-0.9.2/src/tensor.rs:1069-1073 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a676d4fb5ab064658400be89ea294b8305ce63c794577a5fab113cd8d3aa51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2169-2174 | patches/candle-core-0.9.2/src/tensor.rs:2492-2497 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"881bc9ada1a368e0136b3e9f9d4cb70d7d9185b6d5f12bffbad00365396b015b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/candle-core-0.8.4/src/tensor.rs:2247-2251 | patches/candle-core-0.9.2/src/tensor.rs:2570-2574 \u2014 before extracting anything, compare \u0060patches/candle-core-0.8.4/src/tensor.rs\u0060 and \u0060patches/candle-core-0.9.2/src/tensor.rs\u0060 as WHOLE FILES: this scan already matched 83 separate duplicated blocks between them, totalling at least 1206 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060patches/candle-core-0.8.4/src/tensor.rs:2247\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb2f3b28662cb7a0097df3b12e6cf180feb2bb69a41ec32605340676eafa7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): patches/candle-core-0.9.2/src/quantized/k_quants.rs:885-893 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1515-1523 | patches/candle-core-0.9.2/src/quantized/k_quants.rs:1792-1800 \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 \u0060patches/candle-core-0.9.2/src/quantized/k_quants.rs:885\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc38c570d6f44fe88ef20cb6ef83010629e8a144e01991e77eb997e493cbd4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): patches/candle-core-0.9.2/src/tensor.rs:1646-1651 | patches/candle-core-0.9.2/src/tensor.rs:1685-1690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd21653290a6d6c5ac5839ae308dfba803310ffb294530ea5c1ab333c0cea0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): patches/hnsw_rs/src/libext.rs:29-33 | scripts/patches/hnsw_rs/src/libext.rs:29-33 \u2014 before extracting anything, compare \u0060patches/hnsw_rs/src/libext.rs\u0060 and \u0060scripts/patches/hnsw_rs/src/libext.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 1160 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/libext.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"47918a09f2ef958dbb00f26ddbc707880b72c5394113f78f47fe140ed4c155c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ruvector-hailo-cluster/deploy/compile-encoder-hef.py:67-78 | crates/ruvector-hailo-cluster/deploy/compile-hef.py:32-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ruvector-hailo-cluster/deploy/compile-encoder-hef.py:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/deploy/compile-encoder-hef.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6dbd9e81a2211053bf56cd7f138ee2a684ae690c0d5c72c06c7d540762d72b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): python/portfolio/ruvector-attention/src/ruvector_attention/__init__.py:12-17 | python/portfolio/ruvector-gnn/src/ruvector_gnn/__init__.py:12-17 | python/portfolio/ruvector-sona/src/ruvector_sona/__init__.py:12-17 \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. 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":"python/portfolio/ruvector-attention/src/ruvector_attention/__init__.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b5df6a2ea0507623f640abe7c0f22bcc4462afea41bcd7b196169655287e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): scripts/train-lora.py:46-57 | scripts/train-lora.py:61-73 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/train-lora.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabecd3d1e37ebb8c40b81216d68798b0ae4eb43431a65c2a6f41c9d25835b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (133 corresponding lines): scripts/training/train-deobfuscator-v2.py:154-318 | scripts/training/train-deobfuscator.py:190-322 \u2014 These two members are one piece of code written twice and then edited apart: 133 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/train-deobfuscator-v2.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"563dd93fe12197ff7986f954e7d242caed22a8392a91be9b5c06f5c5ea591dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): examples/esp32-decision/tools/production_check.py:43-80 | examples/esp32-decision/tools/workspace_check.py:59-100 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/esp32-decision/tools/production_check.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c0978b5f8d5816f127a2cd4e2e203e9654f44b997cb8b1dd72a22d8dda5863"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): scripts/seed-brain-all.py:29-51 | scripts/seed-specialized.py:36-62 \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":"scripts/seed-brain-all.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"781d6fcdf5af250d8299859d12d9817d1c3087ecb9c390def3b349c6ea2d8e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rvf/rvf-runtime/fuzz/fuzz_targets/stream_ingest_feed.rs:20-36 | crates/rvf/rvf-runtime/fuzz/fuzz_targets/stream_query_interleave.rs:22-34 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/fuzz/fuzz_targets/stream_ingest_feed.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b9028ae4df187bc65ca44320f14510c30e1fa0a38aca6c3ce2c7b9fd057cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): scripts/training/export-to-rvf.py:83-117 | scripts/training/export-to-rvf.py:121-147 \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":"scripts/training/export-to-rvf.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba6afb035eef5b21fe9bbd98ef60be80607c04e2b2310d780fa1b5e9f7f5cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): scripts/training/build-optimal-dataset-v2.py:114-137 | scripts/training/build-optimal-dataset.py:95-113 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/build-optimal-dataset-v2.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"973322cc493ebb51153daa63102e64a2df9fb68dc2fec757147c5057b6545d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): scripts/training/evaluate-model.py:47-66 | scripts/training/train-deobfuscator-v2.py:91-114 | scripts/training/train-deobfuscator.py:117-137 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"scripts/training/evaluate-model.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb04defa97ecfe829c6bcb6ad0031dc56361e15e029e90a63bddef31dd425d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): scripts/training/evaluate-model.py:69-78 | scripts/training/train-deobfuscator-v2.py:122-134 | scripts/training/train-deobfuscator.py:146-169 \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":"scripts/training/evaluate-model.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"caefb84f01b8f4c7b595014319abe6b7debbcfdb4091a0d3131b400686a0428f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/training/train-deobfuscator-v2.py:58-67 | scripts/training/train-deobfuscator.py:64-81 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/train-deobfuscator-v2.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d246e23b7828170f22a25c7d93d12e2c446b9cd7da0c6864c2d8fc4afc2b9370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): scripts/training/train-deobfuscator-v2.py:327-340 | scripts/training/train-deobfuscator.py:331-350 \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":"scripts/training/train-deobfuscator-v2.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6955a0f6927fd7337bfc63479130f15676caa360a696bfd5a1779a07a5e0a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): patches/candle-core-0.8.4/src/test_utils.rs:40-48 | patches/candle-core-0.8.4/src/test_utils.rs:50-62 \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":"patches/candle-core-0.8.4/src/test_utils.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ec5d553539ae50a2bae531cc20f1e82c58761861911afbddecf7fb0e6e4ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): examples/wasm/ios/swift/RuvectorWasm.swift:378-390 | examples/wasm/ios/swift/RuvectorWasm.swift:393-404 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0f423ffde29778e7c1ddb93c1e50fa6a84f6f25a9aac774b405621f65b7f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): scripts/training/evaluate-model.py:89-93 | scripts/training/train-deobfuscator-v2.py:77-80 | scripts/training/train-deobfuscator.py:92-96 \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":"scripts/training/evaluate-model.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d7634025af5dc021a7ed364e3b34926d7f3e4f5e445a7d5cbd99c2111aaa4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): examples/esp32-decision/tools/benchmark_qemu.py:52-56 | examples/esp32-decision/tools/transport.py:65-70 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/esp32-decision/tools/benchmark_qemu.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8117f64acd8cab5aa2ddfd7c045c283643b04ef68bd237f12e365eeab9f15b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): scripts/seed-brain-all.py:54-59 | scripts/seed-specialized.py:66-73 \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":"scripts/seed-brain-all.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"37788f810717fd041c76779092cb250765b5f5a3574ecd3f676f4ecb76805f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): scripts/training/evaluate-model.py:82-85 | scripts/training/train-deobfuscator-v2.py:71-73 | scripts/training/train-deobfuscator.py:85-88 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/evaluate-model.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3167b4ba58093e9e34e10c368aea9d7fbe39ed0e2f72aaf1a28be3063b9c6cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/seed-brain.rs:89-101 | scripts/seed-brain.rs:168-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 \u0060scripts/seed-brain.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":"scripts/seed-brain.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f23b3e5bb6b8c4a721f864b8344b2b6f2b2e3d4992f60646aa85696f1dc257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ruvector-edge-index/fuzz/fuzz_targets/index_chunks.rs:164-171 | crates/ruvector-edge-index/fuzz/fuzz_targets/index_chunks.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 \u0060crates/ruvector-edge-index/fuzz/fuzz_targets/index_chunks.rs:164\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/fuzz/fuzz_targets/index_chunks.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7265f8438a3b2e5fe98dbfcbb7c5a07e2ee2d3a42211770ec44edbe6059eb637"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): scripts/training/export-to-rvf.py:83-109 | scripts/training/export-to-rvf.py:121-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/export-to-rvf.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b41f209409334a372293f2495df39fe07f97c5b3bc7db1afa52336815e7d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): scripts/training/train-deobfuscator-v2.py:243-258 | scripts/training/train-deobfuscator.py:261-276 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/train-deobfuscator-v2.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7365ab1cd91827c3220b3037c9b4a5bcc38f76095e9aa35a44f948e7826bc657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 3): scripts/training/evaluate-model.py:69-76 | scripts/training/train-deobfuscator-v2.py:122-132 | scripts/training/train-deobfuscator.py:153-166 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/evaluate-model.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fac0d2955acef176612b4ea54219e1849508eb40b818f4d9d220717bbf99a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): scripts/training/train-deobfuscator-v2.py:222-233 | scripts/training/train-deobfuscator.py:239-252 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/training/train-deobfuscator.py:255\u0060 calls \u0060step\u0060 and \u0060scripts/training/train-deobfuscator-v2.py:236\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":"scripts/training/train-deobfuscator-v2.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac9946d06b3b08034941169b4d287e3d0f654a712eb80fa1e6a5adee7f3cb6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): scripts/training/train-deobfuscator-v2.py:327-335 | scripts/training/train-deobfuscator.py:331-344 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/training/train-deobfuscator-v2.py:327\u0060 it does not close everything it opens, so those exact 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":"scripts/training/train-deobfuscator-v2.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e87a79d09cddb97d427d7f0f04ea15cd2d2b0f1031c8c2a4929491d83be7a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): scripts/training/build-optimal-dataset-v2.py:119-130 | scripts/training/build-optimal-dataset.py:100-112 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/training/build-optimal-dataset-v2.py:119\u0060 it does not close everything it opens, so those exact 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":"scripts/training/build-optimal-dataset-v2.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"853e18ec19071bd80eb8a25acb2e783fbeaea775ce22bf9c457f36790ef5cf51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): scripts/seed-brain-all.py:29-38 | scripts/seed-specialized.py:36-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/seed-brain-all.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"876f8545265b4556087008de70512f34b1a4b85ba438cfe91e7d3a7d1bba607c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/training/build-optimal-dataset-v2.py:52-63 | scripts/training/build-optimal-dataset.py:55-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/build-optimal-dataset-v2.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7038eab2da58cf30c2935ce62e35d7bc716e7309570d57494554c1e20237ce0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/training/evaluate-model.py:53-64 | scripts/training/train-deobfuscator.py:123-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/evaluate-model.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d682d2e337eb2f702e0772762a24bccecd9644b19917bbf03a9440fe82a46777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/train-lora.py:49-57 | scripts/train-lora.py:65-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/train-lora.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0742e20408555ef63eb9bd41c28ca638177b06fcb0a0d7e6ed98926e37fcc994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/training/train-deobfuscator-v2.py:231-237 | scripts/training/train-deobfuscator.py:274-280 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/train-deobfuscator-v2.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce583fad8cd27955de39178d0c1ba9f19503c2830c24aaaa8a50cc0c76b8de14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/seed-brain-all.py:41-45 | scripts/seed-specialized.py:50-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/seed-brain-all.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca35de9d472e48bae4a7b6de39ccaf2959f18706f540a17bd8f14e446c74d17"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project @ruvector/router: @ruvector/router has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dd9d5ea2cfba7122994c782b2df47a0c8fc9c280edae311cffde0b9655b7e790"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ruvector-edge-registry: ruvector-edge-registry has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f6b01c1d839eabbebb1e3a0f8fd4cfc3edafa303c2520a5bf5d87038a7b136cf"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ruvix-nucleus: ruvix-nucleus has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cee324a2bfd94010b95a4a39cbb8eff4193049d101c3a415fbbf9f1bbccb7764"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rvm-boot: rvm-boot has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8486b9675b2d0ae273da25c8f943772d4425d806a031c5e291749facd3f66aab"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: cognitum-gate-tilezero: cognitum-gate-tilezero: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f0708394137f6255d4ef1d44e4898a173cf85da48a829218a99b64e798295e99"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-cognitive-container: ruvector-cognitive-container: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"67b230e0376e8b618e8b1f922cddf95d18e9ceecae652b6a4929e162bcab8697"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-coherence: ruvector-coherence: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f3285f552c89358cb88119c253f3d205c603d80afa47879e9f898e019d466635"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-diskann: ruvector-diskann: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c5239b597ac3d5a8e03a3da6177215bcd1769ea9f21ffe13e972cae84aab3de2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-e-means: ruvector-e-means: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"08b82b887c77a80de713f78b6ed9099929eb8f0bc0a18c71a2706fe33ec205a2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-hyperbolic-hnsw: ruvector-hyperbolic-hnsw: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fa5d383798abc88d7aabc3e76835b6cd1029df3070c1b99e08764bd05b65826e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-metrics: ruvector-metrics: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5bd5e118f79f005c1e7f34362f64aa243377715bf9b13f56c9f2749c5137056d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-mincut-gated-transformer: ruvector-mincut-gated-transformer: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"73fdfb63a611a5ff55fac4780b2080b858b93c5638132bf828cd34d66a1a732b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-mmwave: ruvector-mmwave: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"840d1c709209cc355039a721f35379c56b3cd8de7eb9df914d72b25ab625df54"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-router-core: ruvector-router-core: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8c181473a40bc5980e0bb835ffddedb84f7e6cb791db6e2102a7fd5ba80e7df2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-turboquant: ruvector-turboquant: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"24c2aa6a6b04a8ac1c0cb0bd5bb198debd1d9509e89495aaf28ce9aa39313762"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-voi: ruvector-voi: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ebd58e1ff0e4f90e38c344bb6c5561cda74ce2bd36046075b23bab04a77433f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvix-types: ruvix-types: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 21 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f4ac55a1c5d52e8e43735442b5e5c4150bafd478b3f07d50b5ac3397c493b0d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvf-federation: rvf-federation: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5a09ba2fa114ea0b7a75fc1543e54b88d7b88e99cd24046c8a6be38b0f629a6d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvf-types: rvf-types: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 29 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ac2a6126a337b8d9140c23cc96a1c24095baaafc82d35661b2c8f63532ca32e2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvm-types: rvm-types: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"98c76fea51348a549e92d96ec91428147b1a5f9c40469c1f51e7df60ac5f8d2e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-nervous-system: ruvector-nervous-system: abstractness 0.02, instability 0.00, distance 0.98 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cb321e0ece486a96363f880ea598a62755e16288d2a85c05e4241e84b0365bb6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-typesafe-core: ruvector-typesafe-core: abstractness 0.02, instability 0.00, distance 0.98 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9608a274c239f7c022a9c609e9385a734219c81f50a76f631929e83c5de8d5ae"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-math: ruvector-math: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6ed8b25337c05b40e423ae6424b729705360c342e6eff7b65db6082d9ce2c501"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: sonic_ct: sonic_ct: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"014d7453df4f278f616d066b6dd953950102ff356c6d9c24b58735aeceb6cd3f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-sona (Cargo): ruvector-sona (Cargo): abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0bc808685f02d607b6ec33f89101a0344988b16898d008d2df2a40800105ce39"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: emergent-time: emergent-time: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"628a721ec1c0eff388fc55dd0d63ea7921ce0ba5e571cd5b59f6a1bedaffa2a9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvf-index: rvf-index: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a34812dfb470169d656cab1a5544876bb624cd380ea116f672cc6223cb531e0a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvagent-core: rvagent-core: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf171ec19c6e897a47d3ea17a3912b9352f0787228d70bbe62e41abda0424fed"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: photonlayer-core: photonlayer-core: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ad03c995c71b629df8b851cca2edce01fa844f28a9c7b8b609403c428dec859e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-fpga-transformer: ruvector-fpga-transformer: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ba34333f8dc75b1b75ab8c6b66ae4da9adb0d5db8c71b2c00519a1ca8d85f01"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: agentic-robotics-core: agentic-robotics-core: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"21dee9c8c0ff1a4f883e7c0315dc75e1473764ed52421bd1733e04a3ea8e29a9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-sparse-inference: ruvector-sparse-inference: abstractness 0.09, instability 0.00, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bb9d9f9ee1d69425b20a6a5b02fd19669df90276602c1ea0dc534920221aa0b6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-matryoshka: ruvector-matryoshka: abstractness 0.09, instability 0.00, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2d0c40c497cedf30005087773e5ec58dcaab1468fe67abce96dd61fadf728595"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-cnn: ruvector-cnn: abstractness 0.09, instability 0.00, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"de3c6022d7a284ba0af183e3ada658c9a7545fa68393cf2c033c9b28641c04e0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-gnn (Cargo): ruvector-gnn (Cargo): abstractness 0.00, instability 0.10, distance 0.90 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9dd9661ec6f284cdfefac14ac19ab0d7c19a5654b98710b37c77111414b61950"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-hnsw-repair: ruvector-hnsw-repair: abstractness 0.10, instability 0.00, distance 0.90 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6b9a1a9c363853672a0d8aaa5151017d5ebe2540bd21b6ff12ed6434bd805fac"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: hnsw_rs (patches/hnsw_rs): hnsw_rs (patches/hnsw_rs): abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"51f5d5c22eeef4cb63db8cfb6ba72612d9b8c6ae7401a9cafad1f785afc1ca48"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-cluster-rag: ruvector-cluster-rag: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"52b7f561e0d96f632827d4bbc5c3fde4bd77913ada93b90a4b4ad3177f49f46e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-lsm-ann: ruvector-lsm-ann: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"79d8327d86fdf3cc2a972b6a6741659129c533d020a3d46a5e1782c3c50b076f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-solver: ruvector-solver: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"28b592b56b50265854745de46991d2e836a7331c6904e568d5964f4ef861f375"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-delta-core: ruvector-delta-core: abstractness 0.12, instability 0.00, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f4514e6fa662df0ab05d42c5847a0bc16416687c414b407a25f6c2eea2b36510"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-edge-auth: ruvector-edge-auth: abstractness 0.13, instability 0.00, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3749f4ef474677befb84dd879a98b3096cc047ba8574cc17ef93411e3d479b05"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-rabitq: ruvector-rabitq: abstractness 0.13, instability 0.00, distance 0.87 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d3afc72adbe3be064c57379704122607a1762dc766bbe5f293b995fdd3560fac"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-temporal-tensor: ruvector-temporal-tensor: abstractness 0.13, instability 0.00, distance 0.87 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"318918c954798947c959c7d23eb22f1b45250fb7f99f9b4ceeb4696ab2d51a13"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-mincut: ruvector-mincut: abstractness 0.03, instability 0.11, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"793ce610a1e8b9a6c17dc578044e373bcb7ea04e02c37adf0dc343234ed0df8e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-core (Cargo): ruvector-core (Cargo): abstractness 0.05, instability 0.10, distance 0.85 \u2014 zone of pain \u2014 concrete and depended on by 26 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b67c14707d0aa851ed2eec82af7901b631113cfd09101841ee751aa3dda3d66d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-acorn: ruvector-acorn: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6ede9a05a32818142d6f6d205354dbdf49867704ed0b38262954666c3f661172"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-proof-gate: ruvector-proof-gate: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"911372685f35760adc4960aa5a1a2fa6e6b7a0711c03684bde140424ae7e9e8e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvllm_sparse_attention: ruvllm_sparse_attention: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1e394957ab90e607b2dde5d3919077709f71b35bfb3306124b0dab9804f570d7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-attention (Cargo): ruvector-attention (Cargo): abstractness 0.09, instability 0.08, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"786875dfb092c6987a97b4b3f71c7d733ac94117244cc1acdf5a6350605e4532"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-edge-index: ruvector-edge-index: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c6dc375f25b9f267cca7080acef54b22efaf47ca480d6331a067719f11391728"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-sparsifier: ruvector-sparsifier: abstractness 0.20, instability 0.00, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1ef2ff99774801882059d36f6f8967bcd90920bb94f6d591a58cc7adfbda4817"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvix-cap: ruvix-cap: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"92f826fcfd2065cfc885996a8b4781fed186726334591033227ea24ac96156e1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvm-cap: rvm-cap: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"426c28c82eb759dc351b7477a7e2ebd7ad9b96c7adb79696e2e08259973ac7be"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvagent-backends: rvagent-backends: abstractness 0.06, instability 0.17, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a31bc7e9de3aa1dbffe3d1f91832551d4bc0031d54cf0ecda70c6b10ec7a059a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvf-wire: rvf-wire: abstractness 0.04, instability 0.20, distance 0.76 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b7b00fab0685e59257c0c60209aaf1ae8564b84b328503dcadc20db3c5722837"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: candle-core (patches/candle-core-0.9.2): candle-core (patches/candle-core-0.9.2): abstractness 0.24, instability 0.00, distance 0.76 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c04ac9a596ae0004eda0be05e2ebe20ced85462d6142734baede586edf8fdcb4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: neural-trader-coherence: neural-trader-coherence: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a4fee54e15ded974cd6829277efa3d0480c1af4d77755115f6b679aa7c4f727"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-embed-core: ruvector-embed-core: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7bc6651c974f0d472a4dc10c41810bf21981e235979f1d44b66adc3b7f8ff550"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvector-hybrid: ruvector-hybrid: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"66faf9544d54f201d5487e0981030af5ad00a4cd85950f30bdab39ac8f579bc7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvf-crypto: rvf-crypto: abstractness 0.17, instability 0.08, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"22dd2b295f50581317f48698c35f260430c3826827f54d142b48caf068a4ea0b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvm-witness: rvm-witness: abstractness 0.14, instability 0.11, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b47962e158931017a7e1baa116b0b46de8c9f4008884c2f25c9266507b5b7afd"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rvf-runtime: rvf-runtime: abstractness 0.01, instability 0.25, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"093f7d8592b5e5cdf196dea294b9d2d9cad361d05c0bdbfa9b6f8da08669a35c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ruvix-region: ruvix-region: abstractness 0.06, instability 0.20, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cc80c4693083ab995a0e3ffc20f83dcc386061f0b1e6b80a5477e7d3b8ad85fc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Tensor (LCOM4 14): Tensor\u0027s methods fall into 14 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 14 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":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cc6de234ed523cd2111796ec5b14a0f4430157eb68b9474a203af982bc8199"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FilesystemBackend (LCOM4 9): FilesystemBackend\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e222e89120541cbba53140ba5ed2a4b62908bdeb1fedf9b9e51a35c650d481f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CudaDevice (LCOM4 9): CudaDevice\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad52000c0d41c7442ba6df833ababf303db932c2fa9337463462de3003c0d63e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HailoClusterEmbedder (LCOM4 6): HailoClusterEmbedder\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":"crates/ruvector-hailo-cluster/src/lib.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"11acf151b29466e86155790971479ffacb0bde671f4ada5e810bc546c61ea2a8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PerceptionPipeline (LCOM4 6): PerceptionPipeline\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":"crates/ruvector-robotics/src/perception/mod.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e774f4c0c7d13d90ed4e3995ba5b0fffff2d4ea4e233541988143e58a5d49e95"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MetricsCollector (LCOM4 6): MetricsCollector\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":"crates/ruvector-tiny-dancer-core/src/metrics.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e916cf37eec1c0eb3ab599fbc1759b4bd2332fb0945a2b947488016038cef3b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Mmu (LCOM4 6): Mmu\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":"crates/ruvix/crates/aarch64/src/mmu.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa88524ae64e8608d90adcaa2e227bbf310dfcbb4f07ba492792b6bc8c6761b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: QatConfig (LCOM4 6): QatConfig\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":"crates/ruvllm/src/qat/config.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea884536c728582235cc66189e663acb4f3bc3c96b04d10f6199828e3d23baa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TrainingTemplate (LCOM4 6): TrainingTemplate\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":"crates/sona/src/training/templates.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"411270989d9745dab1684f775de7368d4fef94522f5af62d1ce7dd6b88819a82"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ValidationContext (LCOM4 5): ValidationContext\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/ruvllm_integration/coherence_validator.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"80366d60ccfdf119bcdf33b3e10dcd06125848588a46ad09040e66e663f2b8c3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IsolationManager (LCOM4 5): IsolationManager\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/tenancy/isolation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f566bad149c1ed2b7e1290141e0e47790fb54eee60f6c29f12fcad654e46326"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Task (LCOM4 5): Task\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/workers/queue.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc6dd9ec4588bada655dab13d4bf163b9c79d50d4e2650cdfc60916117794c0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RuLakeBundle (LCOM4 5): RuLakeBundle\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-rulake/src/bundle.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3c866bbf6f6bc366a185211861e177fbe7391c6a8b0cabd200e0f5e3746b79"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DmaConfig (LCOM4 5): DmaConfig\u0027s methods fall into 5 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 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/dma/src/config.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99d5be07812c357f8c820cf1b7860961f7986fa40d57dfedd31afc60360f8ed"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Verifier (LCOM4 4): Verifier\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/verify.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5c5aa8f0aff8a9e1b52aabb1d3009763f3bdbb539ca5c1bf59178130f88cfb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Obstruction (LCOM4 4): Obstruction\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/cohomology/obstruction.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb33cb6d09cf54ef76a20480381c434f5609f467935dd943ec30447100740369"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ComponentQuantizer (LCOM4 4): ComponentQuantizer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/curvature/component_quantizer.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e26dfd3548e38f53690d1ef9c39b3d24e9a16a401a4175f3766c25709255efa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SparseResidualConfig (LCOM4 4): SparseResidualConfig\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/sheaf/sparse.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea5a4098664892adb19802365f1208ee58a6b77e5d5ef5909fafab31eb78384"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StageVEngine (LCOM4 4): StageVEngine\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-crv/src/stage_v.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef29c09e5705503504d1f219866759ae288b53d29a663c8c5053f6645d2e9c0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: QuDagIdentity (LCOM4 4): QuDagIdentity\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/qudag/crypto/identity.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5585bd7db57738f9388aa04f533b64ba009578b72a92a663382a7ab4fbbfcdc4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RagEngine (LCOM4 4): RagEngine\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/hybrid/rag_integration.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0771a1ed627975ca5e7891afb8ee8525023492426f9661ad7f76bdee172714cd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WassersteinConfig (LCOM4 4): WassersteinConfig\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/src/optimal_transport/config.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1207e625c9d4d9d45f62092feebb2a8e177ca39ef6d3687b527bc7c3aec2579c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GCNLayer (LCOM4 4): GCNLayer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/gnn/gcn.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45134e73f4ac94f790dc8727059e637d14f2eb973df34252e01f56b5904b3b1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RuvLtraConfig (LCOM4 4): RuvLtraConfig\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/ruvltra.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f625986420cdd4abbdf2b063f5cb6160204ca085bd39ff7576676e56a3e1ed5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RouterConfig (LCOM4 4): RouterConfig\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/router.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06770cde7603da58581d74bb8d5378af1b0db943a9f199a1ca3fcc9add492fe"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WebGpuInference (LCOM4 4): WebGpuInference\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/webgpu/compute.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbe541244e2576314d919f5419d607c1db4167aca084791e7d28bdf478c7bc1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StdioTransport (LCOM4 4): StdioTransport\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/transport.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c59ce2414014189503d2cb17297d227c0a8ca448df78ef1387fbf21a1038a4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RvLite (LCOM4 4): RvLite\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/src/lib.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a476f365e14190de2e995e879a894c0603eb3bf98d908f7c51225e19313faa43"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProofEngine (LCOM4 4): ProofEngine\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/engine.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95e7ee40706e7ea34bf11e4dfd1d0286dd9f7856c0cdbb719ed48e48282bca7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should add training data: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/test/advanced-features.test.js"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"6603e25a15382e15935e88293ccaa80958784301d464473c2c6e2fc5a1a52954"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: DatabasePersistence - Save and Load: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/tests/persistence.test.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3624817a2974fd3a5d4a4674952a88d814cccf6931eb2f01f348032fddf29e47"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: DatabasePersistence - Compressed Save: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/tests/persistence.test.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"587a724f2bbd422eb839e255caf33e485211ca7e720efb318f72d8031671a09e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: DatabasePersistence - Snapshot Management: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/tests/persistence.test.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19945b4b588a26ee8db6846cf786b0517ff6dae7f9fcbbdbcf25b5145248f3a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: DatabasePersistence - Export and Import: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/tests/persistence.test.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1684c0fd8fd9449b49f13daae481bc8a25368ca52521e014bf2275de9f6fccd9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: DatabasePersistence - Progress Callbacks: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/tests/persistence.test.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"398573fbf87003a009a3ef6e18f021e4d508b66ceb9206904711107c212689d1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: DatabasePersistence - Checksum Verification: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/tests/persistence.test.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7934b97632434bda6bcd2560ef51710bdc38caa82dea045e49112bd033ad6aeb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Utility Functions: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/tests/persistence.test.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd319a859761bbc48e1143929b386fcf7120c24538e5dfefc541ed5707aebd18"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: DatabasePersistence - Snapshot Cleanup: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/tests/persistence.test.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11c2b0caeb0add177078c6d8029d73b102c479ffddc81c88175e9c3b4004637"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should stop the coordinator: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/integration/core/swarm-coordinator.test.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65f30375742621970c0d30fc38dde560aa6d2f047f7edbfd9d0d0e99cfd2259"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should handle multiple stop calls gracefully: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/integration/core/swarm-coordinator.test.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3c595d6d34cdeed45a62a9cc3ac1297c295c2e69f6ed89ec280de239b91291"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: createVectorTable accepts a 63-char table name (index name is derived safely): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/tests/review.test.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"670eef3feea195f9c232d3753e1c9fb60c2e2ff0c3f6a764c87fab786dfea2c7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ordinary nesting still parses: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-node/test/cypher-nesting.test.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e5cc9d02b9e34098bbb869d7d9413a45fefb29f5a1ac5d31bbb2d87cfb089f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should generate bullish trends: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/tests/generators/stock-market.test.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6834051f67cd5f4ef1c4b08c6e7c5268c771598ba2209aa459369bfdfdf9bd24"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should respect timeout: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/tests/unit/api/client.test.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6113603cf76e083717d87b863d89dada25c324f8b436713250912e41eec52162"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: Multi-Head Attention can be instantiated: No conventional assertion call was detected, and 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fdf9ae4c49a4eaa81d14cf4c97fe77573b80b84e92f344494a8e413d8e9152"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: Hyperbolic Attention can be instantiated: No conventional assertion call was detected, and 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d019a2f57c42098267b30af8aa8cf3dd6b609a390cd17781b77634f619889a78"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: Flash Attention can be instantiated: No conventional assertion call was detected, and 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"094a8b96b75d5667c0538d53a2aead30ec9e16301b5aca217ec6c37735e4dd0a"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: Linear Attention can be instantiated: No conventional assertion call was detected, and 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0299b8d40078f826cd886f9599f9be0ab22770cae62354b67c1e3c2b14e6800d"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: MoE Attention can be instantiated: No conventional assertion call was detected, and 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5624537064e88d00b4f8593cbbf12c27b0b60d341a86181970f7d64f088750c"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: VectorDB can be instantiated: No conventional assertion call was detected, and 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"141dbb2d22aaa6a6134ac022ca439be45d6d22a371cf051d4fa78a7c5171d712"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: VectorDB can add and search vectors: No conventional assertion call was detected, and 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc55e1832ede01f534e98b9afc0271a2b0a1d39228524231a2613a770448f481"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: Multi-Head Attention forward pass: No conventional assertion call was detected, and 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f178b051baf121c903c4c0356950463734e36120b0e543cc15c329049f0b266b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: returns unsubscribe function: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/dashboard/src/tests/debug.test.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e86ab4de6785e86477853c98653f2f14a773281c8e06ab64c802d31f02e662"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Vector multiple inserts work: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/examples/dashboard/scripts/e2e-wasm-test.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d28de66f8e5d8a75a663b2e5511f571809b65e6cc8ccc0bef14e1456147c6a0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: SPARQL: SELECT with specific predicate: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/examples/dashboard/scripts/e2e-wasm-test.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fce4ee1fe5db5ceb4bfcb1d8d62fe3128afa6562e0d8e33176d183e9762b64"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: SPARQL: ASK query (true case): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/examples/dashboard/scripts/e2e-wasm-test.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68ef60c945d8b6602deb1d538ac5500ce3364c02356b6bf9866d945f88680f4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: SPARQL: ASK query (false case): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/examples/dashboard/scripts/e2e-wasm-test.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1031cdf100679610bdc272543501b11fe301b1992c05772dc4a4464c9a229e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: SPARQL: SELECT with LIMIT: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/examples/dashboard/scripts/e2e-wasm-test.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f32e82bdb549c15a7f5f76bd07e6ca620b0ac98fb4d4f03ffc0a07f0f3d1e67"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: SPARQL: SELECT with literal values: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/examples/dashboard/scripts/e2e-wasm-test.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"031ea4b8e54de1e63d467a2edaaa89165f4b01c1764412988c2f8e3810f39bc7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: SPARQL: Empty result for non-existent data: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/examples/dashboard/scripts/e2e-wasm-test.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9351fb365c5ed4c4ef4396378638dd4f73f08fee846b1fc4e6cc26cd3c8306c"}},{"ruleId":"D10","level":"note","message":{"text":"Test project verifies nothing: examples/meta-cognition-spiking-neural-network: No conventional assertion call was detected in 8 of 8 tests in \u0060examples/meta-cognition-spiking-neural-network\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":"examples/meta-cognition-spiking-neural-network/verification/functional-test.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"767619ff3d088aff0a7cc1a2ab98d4e045519731a7e51bc2220deb6914898d2c"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should re-queue running task when agent goes offline: This test starts work it did not wait for (\u0060fastCoordinator\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(resolve =\u003E setTimeout(resolve, 50))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/integration/core/swarm-coordinator.test.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"2371db898efc16b1fe2f2c47b2bdde37302f14bc2c45d0eb615fad1544cd31ac"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should only assign tasks to matching agent types: This test starts work it did not wait for (\u0060specializedCoordinator\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(resolve =\u003E setTimeout(resolve, 50))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/integration/core/swarm-coordinator.test.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73108cac53dea094aba718dd42f41a141854d475906737e459e395557a74b53"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: should assign tasks to any available agent: This test starts work it did not wait for (\u0060balancedCoordinator\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(resolve =\u003E setTimeout(resolve, 50))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/integration/core/swarm-coordinator.test.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"28360254a7bea19b32f33597e5d2884931c20059a180c47fdf90bd914a5b915c"}},{"ruleId":"D12","level":"warning","message":{"text":"Yanked release: spin: \u0060spin\u0060 resolves to 0.9.8 in the committed Cargo.lock, and crates.io reports that release as YANKED. A yanked release is one the publisher has withdrawn and asked you to stop using; it keeps resolving only so existing locks do not break. The current stable release is 0.12.3. Run \u0060cargo update -p spin\u0060 and commit the updated lock."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6812b513cb6ea4ce4de580a7f38d5e9ff8f840c1e7c6f1b5d2cc649f59c825fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-runtime/src/store.rs: crates/rvf/rvf-runtime/src/store.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in RvfStore::ingest_batch_internal at line 526. 12 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-runtime/src/store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb92e6acd486f0ce52d2d2e8236c85c06d6ff3b97545420b014c858836544ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-wire/src/stream/verifier.rs: crates/rvf/rvf-wire/src/stream/verifier.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in StreamVerifier::on_chunk at line 431. 4 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-wire/src/stream/verifier.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/verifier.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec919bce2a633ac59b2707e84869d5bbb11fae2f53fc0cc4a5363fb233f6f6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-runtime/src/read_path.rs: crates/rvf/rvf-runtime/src/read_path.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rvf_runtime::read_path::scan_blocks at line 386. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-runtime/src/read_path.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"43734291aa1b34357a2417e5ce23702509d69d0c932cb7a627b5c5efd6bd685a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/packages/rvf/src/backend.ts: npm/packages/rvf/src/backend.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in loadSnapshot at line 897. 1 of those changes was a fix/bug commit, 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/rvf/src/backend.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/backend.ts"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacb1212012d184b05d9ae1b61293c3dc7c0dfc4fd2eb9ddeb1e5c1fb8f77f18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-runtime/src/progressive_stream/ingest.rs: crates/rvf/rvf-runtime/src/progressive_stream/ingest.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in StreamIngest::feed at line 271. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-runtime/src/progressive_stream/ingest.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/ingest.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccec9f6e4f68e7937896774aa6f7510fb52227255be233b50727179f8c912bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-runtime/src/progressive_stream/ingest/query.rs: crates/rvf/rvf-runtime/src/progressive_stream/ingest/query.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in StreamIngest::query_with at line 127. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-runtime/src/progressive_stream/ingest/query.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/ingest/query.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7cfa7c024c17f062b5841c53a24973df819ea38b2fda7c2bb523f242fe4238"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/packages/ruvector/src/core/intelligence-engine.ts: npm/packages/ruvector/src/core/intelligence-engine.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in constructor at line 211. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/ruvector/src/core/intelligence-engine.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"800c405991c644dda53843d2c7f78800c175c9710cde35f50847fffeb69de52d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/packages/typesafe/bench/run.mjs: npm/packages/typesafe/bench/run.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in main at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/typesafe/bench/run.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/bench/run.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ae83b872addf2be6697ab5910152c778a129ae8347556a54b30ebf44ede7aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-index/src/hnsw.rs: crates/rvf/rvf-index/src/hnsw.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in HnswGraph::relink at line 340. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-index/src/hnsw.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/hnsw.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7d6201c5c1144b36a5790a32a27c7bcb305431f1e5c6d25d8e514f367187c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-cli/src/cmd/verify_witness.rs: crates/rvf/rvf-cli/src/cmd/verify_witness.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rvf_cli::cmd::verify_witness::run at line 149. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-cli/src/cmd/verify_witness.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/verify_witness.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"526244415b65a7a31f8f2ff32539a0802a6b22c2e8564932619d2d64a9dba9c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruvector-core/src/vector_db.rs: crates/ruvector-core/src/vector_db.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in VectorDB::open at line 259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-core/src/vector_db.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d03df454a53240095ad09afc950ff01ae53071d7cd36e6bf88040d74f7f6d86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-server/src/stream.rs: crates/rvf/rvf-server/src/stream.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rvf_server::stream::body at line 440. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-server/src/stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/stream.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"475b599638291459c61b3484a30ad25da9b934731e965f2cd89abb344ab1a4da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-brain-server/src/routes.rs: crates/mcp-brain-server/src/routes.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in mcp_brain_server::routes::create_router at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp-brain-server/src/routes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2093c4ac2b369b9cf70c44f6ae260be8b296e3c275935690c3ee7168f345dae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-gate/src/monitor/mod.rs: crates/mcp-gate/src/monitor/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in EscalationLadder::run at line 285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp-gate/src/monitor/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/monitor/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"200a62db665814e3bb28b329ec08f527617fda6903e215a7c15d9feb2e28b299"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruvector-weaver/src/cli/seo_apply.rs: crates/ruvector-weaver/src/cli/seo_apply.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ruvector_weaver::cli::seo_apply::apply at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-weaver/src/cli/seo_apply.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo_apply.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ef12e2ef2678672eed23678cd72e9383724c9d09b655b34b040af2dd2a9d7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-runtime/src/progressive_stream/client.rs: crates/rvf/rvf-runtime/src/progressive_stream/client.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in StreamClient::run at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-runtime/src/progressive_stream/client.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/client.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc07e2d4fd4ef7c4a89ebaff163e760bdcee4788b9bdf4390ada78292c0a6541"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruvector-py/python/ruvector/collection.py: crates/ruvector-py/python/ruvector/collection.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Collection.from_vectors at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-py/python/ruvector/collection.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":"crates/ruvector-py/python/ruvector/collection.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23a274084704eb3a1d51522bbd3070751b6370c7a4489a837e461a270c27f29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-runtime/src/store/policy_api.rs: crates/rvf/rvf-runtime/src/store/policy_api.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RvfStore::apply_open_policy at line 205. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-runtime/src/store/policy_api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/policy_api.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"924d61003a5f7036755af995f7773c333397dadfb71dc9273bd604ddc2504a74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/packages/kge/bench/run.mjs: npm/packages/kge/bench/run.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in main at line 329. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/kge/bench/run.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bench/run.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebdbe048d7d411d9f0561fe4c65d0c4391127b664cef2c50a3efa01b48badac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-runtime/src/progressive_stream/vectors.rs: crates/rvf/rvf-runtime/src/progressive_stream/vectors.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in VecParse::feed at line 219. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-runtime/src/progressive_stream/vectors.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/progressive_stream/vectors.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"259c56834d3a7fa93ef510abeebfa0aba7ad1a2232a2804f888b1a08fc86f379"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruvector-retrieval-receipt/src/bin/benchmark.rs: crates/ruvector-retrieval-receipt/src/bin/benchmark.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ruvector_retrieval_receipt::bin::benchmark::main at line 535. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-retrieval-receipt/src/bin/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":"crates/ruvector-retrieval-receipt/src/bin/benchmark.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c19d5a406bc096992b3d3e045d9ed1c4bae6da17aa8d3981227683e655cfaac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/packages/rvf-mcp-server/src/cli.ts: npm/packages/rvf-mcp-server/src/cli.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in parseArgs at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/rvf-mcp-server/src/cli.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/cli.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d85fbc6980e988cbe067c7acd20982649bb42294aa45544867957dcf5002671"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruvector-weaver/src/queue.rs: crates/ruvector-weaver/src/queue.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ruvector_weaver::queue::build at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-weaver/src/queue.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/queue.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a347d98450aa6b132e602e3672efc22d02a5555be314f7752e4f3e6792dc86b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ruvector-agent-memory/src/arbitration.rs: crates/ruvector-agent-memory/src/arbitration.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ruvector_agent_memory::arbitration::arbitrate at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-agent-memory/src/arbitration.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-agent-memory/src/arbitration.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5436a4a1312b1bf74881812bdef362224c27e02eb5edbfe1a89c3c8620718b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/packages/ruvector/src/decompiler/index.js: npm/packages/ruvector/src/decompiler/index.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in isPrivateAddress at line 363. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/ruvector/src/decompiler/index.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa323773f1f2d65421da9c5438bda1924eafbfd96fb9e465af36e0055eaf458"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/packages/typesafe/bench/lib/receipt.mjs: npm/packages/typesafe/bench/lib/receipt.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in scoreRecords at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/typesafe/bench/lib/receipt.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/bench/lib/receipt.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"38149e99cee726044b1b3a72254e63defb7ab136286d0e2c9eb9b0044f35f6e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rvf/rvf-wire/src/stream/descriptor.rs: crates/rvf/rvf-wire/src/stream/descriptor.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rvf_wire::stream::descriptor::decode_descriptor at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-wire/src/stream/descriptor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/stream/descriptor.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe8bcf751952df0a15cd6e9e17f8765a012a720dd9cb434d34444947d0d803b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-brain-server/src/main.rs: crates/mcp-brain-server/src/main.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in mcp_brain_server::main at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp-brain-server/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":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"300bbac7bb8f63eb65da200f67bdfa8e8bab463b602384546949da075e10cc3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvllm-cli/src/commands/serve.rs: crates/ruvllm-cli/src/commands/serve.rs changed 6 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 ruvllm_cli::commands::serve::run at line 60), 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(ruvllm-cli): single bind in serve with contextual bind error after merging main\u201D; \u201Cfix(python): resume missing immutable portfolio artifacts safely (#1205)\u201D; \u201Cfix: stabilize decision reloads, server readiness and CI gates\u201D; \u201Cfix(ruvllm): real Qwen2/Qwen3 GGUF inference, honest strict serve, no fake npm output (#1125)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvllm-cli/src/commands/serve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/serve.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c9ee556f4d8279980df696d811eb1793915c2f7e4e256223722eea8392dec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rvf/rvf-runtime/src/store/security.rs: crates/rvf/rvf-runtime/src/store/security.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 15 (its worst body is rvf_runtime::store::security::check_signed_root at line 204), 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(rvf): address adversarial review of #1284\u201D; \u201Cfix(rvf): round-4 F4-01..F4-06 (bounded vector reserve, required freshness, fail-closed client caps, budgeted centroid scan, Unverified late duplicates)\u201D; \u201Cfix: round-2 review F2-01..F2-11 (bounded layer decode, range-safe query, scan mode, slot timeouts, manifest header pin, log append, checked framing)\u201D; \u201Cfix(rvf-runtime): review findings F-01/02/03/12/14/16 - signed compaction, bounded manifest scan, header pinning\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-runtime/src/store/security.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/store/security.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c7bb0db0df072a586c6ff6f01fa97da3eee133d32df0f0427651387a2a6980"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rvf/rvf-types/src/error.rs: crates/rvf/rvf-types/src/error.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 7 (its worst body is RvfError::fmt at line 369), 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(rvf): address adversarial review of #1284\u201D; \u201Cfix(rvf): reject truncated stores, non-finite queries, no epoch bump on rejected ingest, name error codes (#1276)\u201D; \u201Cfix(rvf-types): make ErrorCode/StreamClass non_exhaustive; bump rvf-types 0.3.0 and dependents (#1274)\u201D; \u201Cfix(rvf): round-4 F4-01..F4-06 (bounded vector reserve, required freshness, fail-closed client caps, budgeted centroid scan, Unverified late duplicates)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-types/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":"crates/rvf/rvf-types/src/error.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9c24d1fc2a8fdc20d6131c56b4dc0b912cea1f344429c21da3516e6f2c011d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-core/src/index/hnsw.rs: crates/ruvector-core/src/index/hnsw.rs changed 7 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 7 (its worst body is HnswIndex::search_ef_filtered at line 411), 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): retain live HNSW identities across replacement and restore\u201D; \u201Cfix(core,delta-core): upsert without HNSW ghosts, reject non-finite vectors, real no_std delta-core\u201D; \u201Cfix: @ruvector/core 0.1.30 HNSW misses results on very small graphs (#1299)\u201D; \u201Cfix(hnsw): stop search() silently dropping stored points (#773) (#944)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-core/src/index/hnsw.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/index/hnsw.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5b9e9c21fff3c0fe04040a35af7677e162d0405cd991355a29805bc02dbfe7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-py/python/ruvector/mcp_server.py: crates/ruvector-py/python/ruvector/mcp_server.py 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 7 (its worst body is mcp_server._check_batch at line 339), 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(python): discover persisted collections using sidecars\u201D; \u201Cfix(python): preserve orphaned indexes during MCP collection creation\u201D; \u201Cfix(python): evict MCP collection state after failed writes\u201D; \u201Cfix(ruvector-py): input validation and clearer errors, release 0.1.1 (#1135)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-py/python/ruvector/mcp_server.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":"crates/ruvector-py/python/ruvector/mcp_server.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78e881a41e5a4382c53e34b945174ce7f3d224cf4bf4f0cfbe4876f81083c6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-tiny-dancer-core/src/router.rs: crates/ruvector-tiny-dancer-core/src/router.rs changed 5 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 Router::route at line 66), 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(tiny-dancer): harden model loading and routing against untrusted input (0.1.23) (#1321)\u201D; \u201CCleanup/hardening: fix five open correctness/security defects, adopt ADR-341 invariants (#933)\u201D; \u201Cfix(tiny-dancer): record circuit-breaker failure when the VoI gate rejects non-finite model output (PIR WP28, ADR-331)\u201D; \u201Cfix(tiny-dancer): make the VoI gate escalate-only instead of fail-open (PIR WP28, ADR-331)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-tiny-dancer-core/src/router.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/router.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1456a289e8f4f6231d04408e8b3d929324036babf69abb9bfddd5079c11967d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-gnn/src/layer.rs: crates/ruvector-gnn/src/layer.rs changed 4 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 6 (its worst body is RuvectorLayer::validate_dimensions at line 382), 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(python): validate GNN checkpoint layout without replacing learned weights\u201D; \u201Cfix(msrv): validate workspace on Rust 1.88 and retain SIMD fallbacks\u201D; \u201Cfix(gnn): reject malformed layer state before native execution\u201D; \u201Cfix(gnn): reject invalid Node vector dimensions and zero heads\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-gnn/src/layer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/layer.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb817850d1ff021cadf45f1a040701b46cf62f2f845c93a7968609ad3a2c5489"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-context/src/index.rs: crates/ruvector-context/src/index.rs changed 4 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 ScopedContextIndex::open at line 87), 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(context): make the index root private and enforce it\u201D; \u201Cfix(context): build shards in private staging; trust inodes, not paths\u201D; \u201Cfix(context): close symlink-redirected shard creation and quarantine denial\u201D; \u201Cfix(context,core): close three HIGH findings in the scope-sharded 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-context/src/index.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-context/src/index.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40e87be99c3983cecf9bc5da22d5f01df433a4b1ca743778bd7e5ecc5caa2b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: npm/packages/ruvector/src/core/learning-engine.ts: npm/packages/ruvector/src/core/learning-engine.ts changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is update at line 186), 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(ruvector): LearningEngine.import() accepts state without \u0060neural\u0060 (0.3.23)\u201D; \u201Cruvector 0.3.4: MCP security hardening, self-learning fixes, perf cleanups (#1296)\u201D; \u201Cfix(hooks): pretrain learning bootstrap, learn on unconfigured tasks, stats error count (#1254)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/ruvector/src/core/learning-engine.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/learning-engine.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc4ceb915ddef523b4f8f44ec45547ad734f69baba0589e0994f2b47ac1573f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-py/python/ruvector/cli.py: crates/ruvector-py/python/ruvector/cli.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is cli.serve at line 469), 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(python): report nearest-rank benchmark p99 latency\u201D; \u201Cfix(python): preserve source collection files during CLI export\u201D; \u201Cfix(python-cli): report empty batch inserts without an ID range\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-py/python/ruvector/cli.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":"crates/ruvector-py/python/ruvector/cli.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b38a233b2756dfdc4edbe430f3ccbd46967bc7d3461fa6d6556337e254476a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-cli/src/cli/commands.rs: crates/ruvector-cli/src/cli/commands.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 8 (its worst body is ruvector_cli::cli::commands::insert_vectors at line 37), 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(deps): backport ZIP 9 and support approved Rust 1.88 minimum\u201D; \u201Cfix(core,node): keep VectorDB::new adopting; check metric only when passed (#1063)\u201D; \u201Cfix(core,node): in-memory VectorDb by default; fail fast on stored dimension/metric mismatch (#1063)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-cli/src/cli/commands.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/commands.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bebb0c18dad139a62bfe073e8cf841f21fb7dd8a67dc583bd487ebe27cf97a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-graph/src/graph.rs: crates/ruvector-graph/src/graph.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 GraphDB::load_from_storage at line 72), 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(sona,ruvector-graph): reject non-finite LoRA weights; disk-first edge deletes\u201D; \u201Cfix(graph): refresh index memberships when replacing graph objects\u201D; \u201Cfix(graph-node): execute Cypher MATCH properly and defer hydration (#879, #826)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-graph/src/graph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/graph.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf996cf704b968ad4eb36f240ced8b77e9ee5e9ea176c2ca8c817360a615a2bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/sona/src/lora.rs: crates/sona/src/lora.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 MicroLoRA::forward_simd at line 125), 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(sona,ruvector-graph): reject non-finite LoRA weights; disk-first edge deletes\u201D; \u201Cfix(sona): stop JS input from aborting Node or poisoning learned state (@ruvector/sona 0.1.9, ruvector-sona 0.2.2) (#1322)\u201D; \u201Cfix(sona): make MicroLoRA learn from feedback and make EWC\u002B\u002B take effect (#1258)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/sona/src/lora.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/src/lora.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"38516069f878825490164955b1f5e25d88a0000ae1b9541d01ad4c3467f4c52a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-cli/src/mcp/handlers.rs: crates/ruvector-cli/src/mcp/handlers.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 15 (its worst body is McpHandler::handle_tools_call at line 339), 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(mcp): handle resources/templates/list in both MCP servers\u201D; \u201Cfix(core,node): keep VectorDB::new adopting; check metric only when passed (#1063)\u201D; \u201Cfix(core,node): in-memory VectorDb by default; fail fast on stored dimension/metric mismatch (#1063)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-cli/src/mcp/handlers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/mcp/handlers.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd25eafc88a9e85d02da1fcfd2431099bb895f800aa042b0a46a2c4b0460ffe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: npm/packages/rvforge/src/registry.ts: npm/packages/rvforge/src/registry.ts 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 assertObjectIdentity at line 239), 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(rvforge): verify registry object content addresses\u201D; \u201Cfix(rvforge): preserve unreadable registry history errors\u201D; \u201Cfix(rvforge): reject malformed inclusion proof inputs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- npm/packages/rvforge/src/registry.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/registry.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"86def17c5b3876ceada9c1ccbe3334bcee4d51f4c875f9d0bd84c31e0d3bad95"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp-gate/src/monitor/classes.rs: crates/mcp-gate/src/monitor/classes.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 MandatoryClass::as_str 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(mcp-gate): validate live monitor uncertainty and count time once\u201D; \u201Cfix(mcp-gate): actually add the plain-ASCII destructive and privilege verbs\u201D; \u201Cfix(mcp-gate): close the calibration guard, and correct the overhead claim\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/mcp-gate/src/monitor/classes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/monitor/classes.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c076b3be4fa4986e7bae625b4470ab38ef447552660169df6a8ed3b7bdd6e14"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-gnn-node/src/lib.rs: crates/ruvector-gnn-node/src/lib.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 CompressionLevelConfig::to_rust at line 147), 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(node,gnn): ESM import of @ruvector/node resolves; TensorCompress input no longer aborts Node (@ruvector/node 0.1.25) (#1335)\u201D; \u201Cfix(gnn): reject malformed layer state before native execution\u201D; \u201Cfix(gnn): reject invalid Node vector dimensions and zero heads\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-gnn-node/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn-node/src/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd0622582a3a7cbdf1905361a78ed15ff874963a032acf42d3ce86dd399d664"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rvf/rvf-crypto/src/witness.rs: crates/rvf/rvf-crypto/src/witness.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 rvf_crypto::witness::verify_witness_chain_from at line 177), 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(rvf): address adversarial review of #1284\u201D; \u201Cchore(rvf): clippy fixes; update version reqs of out-of-workspace rvf dependents (#1274)\u201D; \u201Cfix(rvf): runtime writes verifiable 73-byte witness chain entries; verify-witness chains segments, flags legacy, exits non-zero (#1275)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/rvf/rvf-crypto/src/witness.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-crypto/src/witness.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63d567b1e629fe550ee6f6e1094f6ce3c12f2542b503fe39916e880fb28e31d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-embed-core/src/ort_backend.rs: crates/ruvector-embed-core/src/ort_backend.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 ruvector_embed_core::ort_backend::pool_outputs 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(typesafe): distinguish singleton embedding policy in model identity\u201D; \u201Cfix: stabilize decision reloads, server readiness and CI gates\u201D; \u201Cfix(embed-core): embed in bounded batches in the ORT backend\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-embed-core/src/ort_backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-embed-core/src/ort_backend.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0accec1cc498b5dc874ffde69f9fe8b1918e7e7bae98248ef48c4e8069ef232e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-embed-core/src/lib.rs: crates/ruvector-embed-core/src/lib.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 ruvector_embed_core::embed_in_chunks at line 48), 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: stabilize decision reloads, server readiness and CI gates\u201D; \u201Cfix: review follow-ups for mondweep PRs #1036-#1055\u201D; \u201Cfix(embed-core): embed in bounded batches in the ORT backend\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-embed-core/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-embed-core/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"669233d882c32a1e50b4e323a33bb6af15b2400aeb6a50e5989f9ecc984ee489"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvllm-cli/src/commands/download.rs: crates/ruvllm-cli/src/commands/download.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 ruvllm_cli::commands::download::run at line 18), 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(ruvllm): real Qwen2/Qwen3 GGUF inference, honest strict serve, no fake npm output (#1125)\u201D; \u201Cfix(ruvllm-cli): keep HF_TOKEN off curl argv \u002B guard remote paths (PR #860 security review)\u201D; \u201Cfix(ruvllm-cli): resolve GGUF globs via HF file listing \u002B alias routing (PIR WP0b, #846)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvllm-cli/src/commands/download.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/download.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d11c3f72fbaef97b2e9a6f36ad92ecbf3093c6cc27cbb4f1e7d538a7d5defd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvllm-cli/src/main.rs: crates/ruvllm-cli/src/main.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 ruvllm_cli::main at line 258), 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(ruvllm): real Qwen2/Qwen3 GGUF inference, honest strict serve, no fake npm output (#1125)\u201D; \u201Cfix(ruvllm-cli): make serve\u0027s mock mode visible, and add --strict to fail instead\u201D; \u201Cfix: #995 #984 #968 #988 \u002B publish hardening; ruvector 0.3.3, graph-node 2.1.1 (#1014)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvllm-cli/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":"crates/ruvllm-cli/src/main.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"096acf3593d805604e3a600fe9a0837d1afc91a2c4f9fd3e4e14228ec78a0c1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ruvector-context/src/shard.rs: crates/ruvector-context/src/shard.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 ruvector_context::shard::create_shard 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(context): make the index root private and enforce it\u201D; \u201Cfix(context): build shards in private staging; trust inodes, not paths\u201D; \u201Cfix(context): close symlink-redirected shard creation and quarantine denial\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:11:35 \u002B00:00\u0027 --until=\u00272026-11-13 21:11:35 \u002B00:00\u0027 --full-history --no-merges -- crates/ruvector-context/src/shard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-context/src/shard.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2ab4dbb77f01665ff302ebe651b5d0a42585159947a3f97db5c5b6aaf4d05d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: make configurable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"30726f8f1899065de63479bbdc761d4a3108304a649d7f21b86076fde827ba19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: maybe we should wait for the message to be saved before ending the response - in case of errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e576db2aacdee44e892f1d8c4698a556f4e5e6a8b9f7c6e315d560fd10f88c90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo list for task tracking \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/index.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"234bbd440547e56ae820816f403011312ab210b7e23d764adf161e93220329c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo list for task tracking \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f937fb0031aa382e4405abfc9ff6ef743e570fa10aa5e694aeded594cceecf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This behaviour should be fixed, we do not need to fail on the root message. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/tree/addSibling.spec.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2041b33d2c29dcc60f585f4f93b4eb7e125e47682392a0d1d64df0b4cf08776e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move this to a constant file along with other constants \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/types/Settings.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"249d38ac9fa8d3ee6323a20cc9f8b3987626f640f7f054f45c7160546ba854e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle errors if provider is not responding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/auth.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee8314e4a1b5598bba10032176ba5f2c93b31d3c7d3a453f615f1a686e8c622"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: detect if the conversation is new \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/title.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7549822bc1bba62e9110d871ecd189862940614e67cadfcf4fcea3f878489eca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: blocking heif may be incorrect considering it also supports av1, so we should instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/images.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a0c3ef8155fab46ad73209028015b413fc9f4787c94b532e9df3e1e1457df8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider what to do about animated formats: apng, gif, animated webp, ... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/images.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6719073ea04b7f0005df83a8369068dffd44c5c2ea1d51fdfe40c17c5a6841"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once the graph API is exposed, test: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82f1493d0c050a1f34eccd42af63ba9553d8eef28230acb2fda0f8981239941"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test Cypher queries: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee24c8c8d35e4809be49e97ea62ef200138d2e537f93ea874e2c45058c648f77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test hybrid search: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8523e005f8ea2ddb73082f106988fb8a4669f1d2dcaf4dc90e354b06bb5b936"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test distributed features: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"045eced3a74edd3d7121751543b549a5f0002f9bbb5b530e3863191c0be1167e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Run actual performance tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8add0202a13cd30c7913adb09a7f27e3600b37bf954fb146b6e5f28db6af1bdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify Neo4j compatibility: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1c75f361c4eaa95c07ede140063549e29e057a323a6aa25fbab5cdfc695b8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test integration between vector and graph: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"796fd4e96854e113217af2aa5a8d45285bd2057e920f4c7c8f48e9c39ddd6bbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test CLI functionality: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f85d3df15dbdbb33f6a8c51cdec9e909ec6df9f9591d99899f48c5c4e0bf4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test persistence: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"47af7348102185336024e3f7ee07eba0b30ec2323692e73e211756e01a722008"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test concurrency: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cf746568d4078ae922f84d1b38a045a0b94767931142a5f3c472b4a18a15f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test memory constraints: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2f1db2eb84c03e2c2d97b3a0a06d2393ac171dfb7452da62156bb901de070b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test error scenarios: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"085053069ce601f0bdb124de2d7755e8ec660b664176ffd5d6d4844dce3935cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement Bolt protocol tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8830991642166fe268cf6f365cd0c7b5610951465f398841d701d3f471035b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test standard Cypher queries \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5804faec0a7d14a6d0767c7fd7a8cbbc5ac3753eb8618a3de7bf5f491f2858dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify property graph semantics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadaeec1b373b0b2ba37bdeee6d35b293728208a623a5d0f7a5463029c1003a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement benchmark \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e740d1031067f0477ef037c066bd29c5fa07867e5487c56c3854b803c18146a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement benchmark \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f8d58cdb845bc6f4d47932353dbef5427c84905e1c70575b4fc644b0427c4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement benchmark \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64f90e79133576bdb5c81ccb72d27333b627562234b0d6a2fa6710cb1591654"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement benchmark \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_full_integration.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef231a68a848c8d0d9ae36486c3cb4a027f2bb6c8e15806d1f0880389b1b6660"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should fail with error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_integration.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63aa89f609a0818614bcc6cb5c83a0b0677d53b29b1f89d057f46a3cd3496e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add methods to get counts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/graph_integration.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40eece14958640b739b7347345d83e6927ada2c80c01829d1d23d8db3060cbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When ruvector-attention-unified-wasm is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b82d9073805437bae6d5e47c69b1f006330147fbab91cf74abb662e4195be5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify output shape matches (seq_len, dim) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f3a3b2c89f7877b2163b48aae7b3457ac941deedacaf4659bdfcd79fc1ef38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify causal attention doesn\u0027t attend to future tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe63e7d0121218b7ec960c035e34ab64e2f71b58c89e0ad5edf1f1c6ec3f227"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When Mamba SSM is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddd3f092798b871ae4efc46610cb1359c18cc5b7a15826492642a38b8933415"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify selective scan produces valid outputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"afad8695e9745f527a04301eed5a71822293a4d603c53159685f2dc81f96fd24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Create a simple pattern and verify state carries information \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dc0bbb5601b47927aae1feb45ccddebba39ae9d2bbc7611dc4a43316a8deaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test RWKV linear attention \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52fc4fb99dfba44e198eb28ceea69eec56f64b6bc54dbca48d97cdf07ba6171"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify linear complexity \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa857a637b154b23df9dfc168c20cff131d5db0dc470d6f70b51ad87b9086d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Compare flash attention to standard attention \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"81294723b0afe1846f7b40dc636bb02bd53d6c56eb77add8a9239e0cb214a625"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify memory usage is O(n) not O(n^2) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c0aa712bb99231ff84665adb7f68ce0013cd20d03788bc015f44c5680934f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test hyperbolic attention \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eebe63450a1824286d9880ff773bb45fd664c1d8ac64df4d1d7dbf4023fbaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify metric properties \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"641717fc99d490e2487db1c4bb0b880a8ef4aa3a87ac382b63c20933a185da94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test mechanism registry \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"65483b5eb0073c36a7853dfff34d68dd00b9ec60beb8d5e62a10b61dc935a906"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test factory pattern \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"267ba4b51632295baa70a0287156e8baa891c4042b16961f0a42ba551ac63f67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should not overflow or produce NaN \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9614eb94d7097dbf6cea601494355116d129ac88a632a2662bc5cf52874169a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should not underflow or produce NaN \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c0504daf040ebe1688085965427469a3906b1ee5f0cdb3ef300e27c15bec18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Measure latency when implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/attention_unified_tests.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ba04ed5b078b19fcb4079d9a0a692ce40affb98a46d782b764cb66c598549a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When economy crate is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90b4e2153c98ffba4d4f5c6ca41d0c2e272ab374bddf52e5ca084318d142811"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test token transfer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c196297a0e1a9a7d5a57ea11128cc4bf8d8e4511126ae43d87bf08fc092ee3d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test insufficient balance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f89812aa8e7cb72d2d2818da9197644f2a6c4fc72a55fc1d0e2db3201e5a935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test staking \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"985ad69380fdb2decfef3052fcdf30791c9b66a4f0cb65587f6faad50374ed15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test first-price auction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f591066143f392a29db4fcea8dd7b09af03bf8ac01a1ce49b5a9f8dac90a2f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test second-price auction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f644823f8b699d4e6a95768555f8550feb1c80b8848ecfa76b2996099da471"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test Dutch auction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7b5acc85c51784d64451d143ddea810bf888295c85d142066281f542126c48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test multi-item auction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0835aceb5090ead71abbe66f2d3a0d34ed1b8fe99671cdd79035f9b3971ef5c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test order book \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b95501479065d9dc703b5d90986684215f9bd0f20a4ef3aff5488b9be2c631"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test AMM \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa157b9e41772d4a022e4e0c8927983d766e3ef0300308e3afaf4fb657497c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test dynamic pricing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"399b24f0b651a0d4043d64e9a3f9629d7021a99af196be3cd601afe3d34c6002"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test reputation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d2f494739acabfc69380ba1916db979727b5815401ec76d83451e263b06c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test slashing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a569791b15151b3443e449b21202a1fe10b12cf8bc550f82e5e5ab70f567956b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test reward distribution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f8ed15568325568894931d4535efd9dd5d3f530793ef485567a7116611c43b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test quadratic funding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f72a54eb77c77368540530bc0f0a62bb624cf0deed8335de3501d61b114581"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test task assignment game \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab726f8ccd5803f436c13aadcd631b2954938a0f464c552a7acc90bc0a86980a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test coalition formation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1be0a1883857d96b7bcef4f16b5133f195b6f7102c9e098aa02a833639337be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test equilibrium \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5da8d38e3a022a37dd9fa2035e5cf4981511a4987e61ee48195ce95d89eec37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test exploitation resistance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9902666575e0437eb7633d7470b7f8c4665af3ed0e0a1611bf569c667dc85c9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test WASM init \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17cfe8bda8f9265fc08b6cccd11b995c2f600f1447fe4c842fe03ff94e1efba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test WASM init \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c0dfa9a95adc800ef3051c8319ae483a7e71fa16f387c911c41155ed215878"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test JS interop \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/economy_tests.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"1353ba8ebb389ad9440b4fa6cd41b4d87958da9e473464ebe1c6f07de5779811"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When NAO is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe3ea8ace563187c7db797ab6bab11e8767f761e1300d434be4bf45c7b04785"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test voting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"414021264bad8526b40f56f61489ed224dcef4cd5e98ae2ac1a890739874eb55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test neural consensus \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bdf0eeba5377cab3a73b180fa6ec5c7bf39fe7342683e6a4bff40958e4141a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test delegation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d721428a65d568f87b8bcbb1d5bb1d5ec1494304a45ee036a407fa6f9c22c767"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test treasury \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae88a38a8c321a873b19bde3a4953b8ee3787193eee93e10633ab7e58efdd07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test morphogenetic field \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de827def78b324030a1b9fcc9614ced4fad7b71d73a75e45478c8c7a4107e9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test diffusion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"357dc8ed4b9fa130d6f15060d1c13bf6ff3c0b923bdcf7a419c67959f833230b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test pattern formation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"72750c611b6dda4683db775d3c777006a7793891bdef5109f32fbd371b18bf9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test network growth \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2e03767c6b1c268fc67fca60c672854ea8e8ae222bd33bdd645c490f6f7d45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test differentiation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b126aac464b79cf97837e018f41170e004750b2330ca67f5df6e8debda060c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test time crystal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d548ad20d8ece78259a3803b057b9b09c205e26720fbbb316c62df2dc47845a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test oscillation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea852b2971ed38fd5f6477515c32d86b5d5b980d9fa20ceeb2fca1326478154"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test stability \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b0198eacd437ccffffd5abc02433c56be778257a9fc868b4dabec38bc79993"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test synchronization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e53d159be2e79bbbb9f6adf37c7b6969056c328363088345750435aa1485b4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test coordination \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafcab171b79467ee13ba82b8da43fa798d18595bfd51843357af81f201c70ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test coordination \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaad62d6d0536e2fd5c56d48c3d4f8978a40b6da0684769d37c536e63b4886a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test swarm emergence \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a489a4bcfd26ef91f63064bff32f2b513c52653181b5f4f8a4b130d55522ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test self-organization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78550baf8d09dc659ed5be83635ec1349398c88d28d9dbccaf18dec0c20108a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test collective computation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab005f466e5ae4d20d5ddd756ee87974a962ea44c39e281508157443844884"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test integration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a05cf1ac7116fa8d2d844bf04976de6e205ccf4b999ec99bc17daf8881f2bce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test serialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fced7e8ddb615d810bbe220239a9c050ea930dd6ef61b8e895f415164e94de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test serialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdf2aa431876840dc373afe577acf2a98163950a58c4e03fc8ed303cc10610b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify module loads \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09dba4deba2c074fdacd4e73b34dce0b7df644940c26f6b44dbce6cefe7ddf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test scalability \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed0b5cc99f0872dbf43ad46b34ac2efecd96148d9b5a3876983d1374810a3c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test field scalability \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/exotic_tests.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0865e9231a1cb2f9de1fca8556975b733a1afd38bd86e62fe8928bdc8b950b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When MicroLoRA is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa4662b32a083a40212a1db3a7439955d430600817c44af7e22f866bbf6f077"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When MicroLoRA is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/learning_performance.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02d0b2eb9087a848a3fcb90aaeeff44137ebd80d0e155129237861d685ec2de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test forward pass through LoRA adapter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"559f3c480460cabf191d94acc2c4c8839f2a82a4a70779be1e0791b98aa138cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test rank constraint \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8b59fb3b2462554d6bc8d386f1e81f4c09359a85d029ee0638b4353eae76fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify parameter count \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a842dbf964c3d23947000e52c8875913cba1285b512dc856c478b3e4cee1b0b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test gradient-based update \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c8f17cf12a25ebea8b5bc66aa17070d59c1d8bf00ad47a78dbf6d092ac1fd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test SONA initialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"48edfedb318a839e82ca24546fba1da5e3af953bac5ca10e84115c64fbd8ad0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test SONA forward pass \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dec9c0193e64accd3e5f0a633f95e0e68839f69f56ef485bbd3d91ca5c63e89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test architecture adaptation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c779c003e41d5dcf2cd83210e0483f9465bb2e34eea30944cb8f3ca6a6fedf89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test neuron pruning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bd5e1a57c1c1aae48b33f478ce84129d1b9bf27be92ce8ea5f6678c7a9cf0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test connection growth \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"03af12f81888b94bce2c2d3842a53948e3dbc83197989c86164c9c55f99fc487"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test single-sample update \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62604c820232445b6ab208c923bc4744382651c310836c1f4da3d2df2d87c9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test catastrophic forgetting mitigation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7df15ac9add788945a9b83b4fd0e3cd9c70a2dba0a11f7b55f8a2b7d6e40e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test replay buffer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f626a89c9f2a1c29528802d775e696efefe3b5c5bb95774107228eba64dd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test fast adaptation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"475a8ca01ba27df214066bfda74194c90d0a6f289b69fd13cd97808778097e69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test learned learning rate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa92582dab2d5f1a6b52b1b8484c30d613e23cc1418c7366c6b72324228b47d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check memory footprint \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d7449467e6c2e0157cee0e6e1cd545544fae9b6d85339e9cf1496de638406d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify module loads correctly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4db18c0d4007db6d7e63e5d35513004cc37f70b9cfe930849918087f8b2d97d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test gradient clipping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"69be736ccb6d0734cc0c68ed6ff2f46b9e30a4db2c2d0c27576298889c84fbc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test long training stability \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/learning_tests.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"796b2a9160f054eb16cccf69bb72a768f72a10c21a0044600c6c4dbf774ed980"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When HDC is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bce1eec2a11b50f387d1237e1960fe486608d75b8525e764cb7e942fd68439b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test bundling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84566c76809f27e9507515c5cc6492db002846a15756ef29eabdb7d0b08e360"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test binding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6002473f5d949a7a98af5e5fa5798f71297ff2f7aee9a89b9f8f46402cd1d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test permutation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0972814c49d1943ab35c1ee456713727c60ed99d6dd2ba80f7deff74db4535c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test associative memory \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"15aa4fd8eee290f1e4a8058377a7c2b882c517f8618c0785eb7bf9a4d8ec6231"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When BTSP is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8040142b751b9325f24ea9dc6af849a438f2b5dcd239748d4cfba948eb0c5243"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test eligibility trace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2398e94e5f1fcad839a07fba0822b66316e351ce8c7f40bea918ba436f13267"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test one-shot learning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a41b5031303d559c1dcab84ff5297b961aa0d608bd55fb8a042ae6f8da839c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When SNN is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"313ed4cc4e861cff02740fc94e61fcb37eba69e4560a7a081a4f8c6ad17d6ccf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test spike propagation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4364ed430478205d3ee2c451f2c7a83775a4d66af19b00b7c89ef322be36885"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test STDP \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3694354cfd78968169815434004490befdada13f61e031acee9ca407d7ebe8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test temporal coding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc370fce0d16f1a2c3dfe9b8364e86d32999684854163d9d900508f7568844b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test neuromorphic attention \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4261d062e01809e4240544a5ff0434ae64939d09bacc227267caacaf6a92c12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test reservoir \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b682c152017bd0d13135d498732dc148df64193cda570df520c5a9eeaa4ec0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test HDC \u002B SNN integration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca5779f7354bbc0826fe26169187cf6dc9de4a4dca32a76667db4f0fc7e3d7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Compare operation counts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6ddaa8be488356d6d63018a0510ca67fe5087144497c85cb522fdf0ea9fe04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify init \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/wasm-integration/nervous_system_tests.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec21c097d3249d065b5feb9b45012d6214bf60fa54cb63d4da4405e9078fe18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: specifiy mmap option \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2485edffa927c1b3f044e3fd841acf576b5d562bbafdef3bbb7dd05da3f1c8a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: specifiy mmap option \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e4b2e1bcc07d55256d930bc8c85f758b9a3130dc6b01db48a15f1681befb9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf406da1d2d654eec13eeb6600d1d2c743de35d82cc809ce336abeb3bb0c5244"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ccf6fc879d9aa9590550baf6301e9d6076e8a99c2b86a8fe5b8d38870ec701"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: redump  and care about mmapped file, so we do not overwrite \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a6cf149027fee5cf7c8e3f7eb86f0380692f3b43d8b756721fc5cd0c8e5a14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: redump  and care about mmapped file, so we do not overwrite \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc8717ca42adbfce5104c350985f51dc35a8584284642deab85e6c5feb2c6d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //ggml_matmul_error_test::\u003Chalf::bf16\u003E()?; TODO: Fails on ubuntu and windows. Check CpuBF16 impl \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/tests/quantized_tests.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"76351688b94948127f47510fa42407560c8b60b718184ff126913f7e0770316d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Switch to generating the two last arguments automatically once concat_idents is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/tests/quantized_tests.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf68b315380e6a4d1e06fa8aefe56e0c3eeea2bd6143a4da0ca5e5084524165"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Switch to generating the two last arguments automatically once concat_idents is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/test_utils.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9728db6d6a0806456a3d6a703e1c3ae0beb4a8824dcd92b7bf2d97657781dc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Switch to generating the two last arguments automatically once concat_idents is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/tests/quantized_tests.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9cc661bbf95ef3cf3764fa43788d2e1d5046954eafe648c84d55896551d779"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Switch to generating the two last arguments automatically once concat_idents is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/test_utils.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"357868264df7d9bf9b3033db4698abf669cf4e6aeb4d34220a74337144e5444c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make the usize generic and part of a generic DeviceLocation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/backend.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"009c62eb215d9bbcb73e8744bfb393703c99d5d6475d78fb5e417e7a62ca3d8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make the usize generic and part of a generic DeviceLocation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/backend.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3022455180ccc02929a3f6d931ff1b410dfcab894b593ded30b4424e234899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid using a buffer when data is already on the CPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/convert.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ba0f7797c2fe0d610c458208c31ad4aadb42fa28bb6e27344c4d8981584190"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid using a buffer when data is already on the CPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/convert.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b78daa0941551b91e9678308f00d687fff528b85e4f4ace3868ecb511df94d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support more dtypes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/custom_op.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5a847edea6e78c9d7a806062145c06ea402e1a39b069ddc554bed7a68f52a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support more dtypes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/custom_op.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fd060cf97bd374c871f08b74ae5331b732d1e674cd1d26c1f2a87aa8bebed7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support more dtypes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1219a2b1352b8c16d136f80fab70eb2e5e29a41feabc623147f0bd8d600a0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support more dtypes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/custom_op.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80f3a369ba3065c9ae842f7ed9c05e62fd1b34651f289bf0bda6cb5a50a045a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the special case if we start supporting generating f16/bf16 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":"patches/candle-core-0.9.2/src/device.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6deaf3dcebf95bfc9c100d84550b7307f9028dd9cf01dc0da9539c60ee76c62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the special case if we start supporting generating f16/bf16 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":"patches/candle-core-0.9.2/src/device.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e7aa458f31ceac132bb1f2ea0c6cdfd4bb567f3ba984330c85ec47a4b76b17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the special case if we start supporting generating f16/bf16 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":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae64b2cdab9e6ffffe87b8f3a4a2859c3caffdb809258ed8d547fb4df21619b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the special case if we start supporting generating f16/bf16 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":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"52272c16b27529b6f879153ad60a4e5a85ad4cf83cd9b96a2a7eee1cfb3a4dda"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hacky parser for the npy header, a typical example would be: \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/npy.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f22c6fa7be44340347525bbe5050608854d9e535cde8a288f60639bf1a287c2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hacky parser for the npy header, a typical example would be: \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"349bcc443406641a06774445ef57a7c92caca36053ab36c32fbf8ecbfe3eacc4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add the possibility to read directly to a device? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/npy.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0f4990a3ce0c6f8a38b1a3f8e64211fa84c4d013efa6103bec76f29eeb9def"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add the possibility to read directly to a device? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/npy.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"577641958094bb75b59b956809d1d27134816799cb964b57fd0b46fab13f4e37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: have a separate ordered dict and a separate default dict. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/pickle.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6daaf26576281060c96df29b6fea3dbe4280b4852300d312cfce106d1072b21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: have a separate ordered dict and a separate default dict. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0a4fab3b44feab3ef80f5fd3ac3b43507f08b6820c185cd5f51f6bf46e0573"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid the unwrap here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f299ba615cd8d97f040fc257a92319ab6b18799e3ffe1695aa4698054c1ea607"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid the unwrap here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e598d037ca3c7e97420f7a0eb9fa390eefba1c9346f811e6ad7cad6b3dddf284"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid the unwrap here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79cce8252b737ebe38e1ee685319091689143abc7168138774db738f2601096"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid the unwrap here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e571c962137abd11c873fc784d0d2c32ec1c9d7bed9ca14ecaf75a6999ea8648"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: We need to specify \u0060T\u0060 here, otherwise the compiler will infer u8 because of the following cast \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c6fd408cd294e9496d8e6fb91f2e50436a830f2dbcdc42dee1531a4576feb2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: We need to specify \u0060T\u0060 here, otherwise the compiler will infer u8 because of the following cast \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"671275fa7ca7b2d3284b6bce2de73b951f54560780a32d01127c220fa66752c5"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: We need to specify \u0060T\u0060 here, otherwise the compiler will infer u8 because of the following cast \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5a29c8901c5a27ccd241266d2b3d660d1f71be540fc2590094224f0cbb46f8"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: We need to specify \u0060T\u0060 here, otherwise the compiler will infer u8 because of the following cast \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cbdf86398568cbf7caf32c40797ca9d1b6452c7c97c2dbbd4540e97ca3b9d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This makes an unnecessary copy when the tensor is on the cpu. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/safetensors.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"35554bce3c68a76fac5b6640dd8b3ff98030640bf510b81e84350956ef343fcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This makes an unnecessary copy when the tensor is on the cpu. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/safetensors.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f7525b50dc74d6694a9d1e353fdecd7bb3fce237e24542705d66fcfcf72353"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we also have a flush method? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/streaming.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cc6effd6b7a8652e33ea4748b849ed9ac6cd8b34598e2eaae2c175b8a25538"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we also have a flush method? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/streaming.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"209a08a425d3cc2fcd4fa16cd1fff2710ad80ed16c35d1df87a3033e29db284a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Also make an inplace version or a pre-allocated? This could be tricky \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f8a7b0b207eeb66777a2c8fe068b78784ee295b4feda572283577348d32f9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Also make an inplace version or a pre-allocated? This could be tricky \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb7fada42ef4ca3fbf8e03efce81f9c034dba76db14a8e11d1a1aa3a94a355f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid concretising the broadcasted matrixes via contiguous. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f710e10f02557933076cb3f324c865c4e58847d9e934ef5a282ae975e2565"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid concretising the broadcasted matrixes via contiguous. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e177e96ab00d1425e9b12468cf9cdd7bbf75b85cdf8c4d638764b04355122388"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we want to add a more efficient implementation at some point. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/tensor.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd7113dc8d6a5071836a483a64fb6049f0e78aa4879cd0dafbd50bfafc9fcce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we want to add a more efficient implementation at some point. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"6933a3e61356ce42017b2ead950372aaf4da3d1a9c71ff10b1b553638418f8fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Mmap version to avoid copying the data around? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/ggml_file.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d4479ffb861a22743e522ac13d4e087fcb59a7140f27bc818351b78525240d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Mmap version to avoid copying the data around? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b231425afa12978f9319bcafd6a01f36b9e1eedbc743e167e45c3e1d694e3488"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Pre-allocate this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/k_quants.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8e25cc35d7c5a514db13f081086833463b0bcb9f691921339510d5ec857adf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Pre-allocate this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"999964fedc93c1052540a56d5073a21431bef57967f2667f8f1bc39b4c671582"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dotprod \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/neon.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcb1c502de2b1133e1561a4ef996f1dfe8bf9e74b7ca1a4bd31950b3a6f2a68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dotprod \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/neon.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0235c011c5446ffc498231ac76f21e3665fc0d6355bb7136906508eada88211"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dotprod \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b09e9b862e09add874f6277f92ff00377c35172aac4076a852a553cbc2cda7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dotprod \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/neon.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cafe6765c1c09127105e0ceed1406fdb950b207ad8d64494bd6b564a996154"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for F16 and BF16 though this is likely to require some upstream \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f26d23924095db8e503d522ab820031b88df20483ea5d3c6c453dfc9c671dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for F16 and BF16 though this is likely to require some upstream \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/device.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f06a52ffb8b2933790b5c2c44b1ad1632ed7182f8b3343ad4c4fc3c2537b147"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for F16 and BF16 though this is likely to require some upstream \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"902cc98444dc2dd972c1fc997ca079d911ede1418955dbe565b93c31605fb9a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for F16 and BF16 though this is likely to require some upstream \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/device.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f7e1a460431c8824c43a17b6a9d289829366a77d53925c08f54e82da666a33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe use grid_y if the output is too large? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cba21f59aabc556ae9f59d83ec72155751ff4e256d03a70988c75e703f8e9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe use grid_y if the output is too large? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6b4fbb1c225d797df07e9d741bf040012c8a6432489235ab3ae61d3f826b53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Specialized implementation when reducing on no or all dimensions or when \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cuda_backend/mod.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a9c7b914f9a2201385ebf2ebc8ef3de5efcc668c163f8ec0c83638e8860826"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Specialized implementation when reducing on no or all dimensions or when \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bdddaf58c2ec5d11bfbeeef70239e9ba25f75948c17c38265951b74f5688b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO other cases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/conv2d.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45ec7e19d04823b03e5e6db40bcf4eb07af8db6427909523af83314fb685356"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we should not implement [Clone] here and instead have an explicit allocator \u002B \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcb806b7cd1e99b2f6bc8a65e1b75c84ef668a9182c66b0af92b07d323c0488"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we should not implement [Clone] here and instead have an explicit allocator \u002B \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a566f48f49aa6964a64dece3f4b91ebad1dd2b647c337fe24487d5f15971b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Specialized implementation for the case 2*sz? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd142ac72ff523e4003fe666e948b331027082db1085319ee168d9f68032127"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Specialized implementation for the case 2*sz? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1475f906bb3e898db033c530b34706db0226bdface1abf79dab1b485d6eb888f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Specialized implementation for the case 2*h, 2*w? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8de9b7ddd668ea1fb058eacd510e7171081c55b79e4471e8240536cccae3e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Specialized implementation for the case 2*h, 2*w? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da78a4bc8fb0e8e6245c61dad0a3a574f0bb0af408e651ba3019ffd9b88d5b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid making this copy if \u0060inp\u0060 already has the appropriate layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"d067e3e68193bab6f54776176763a713e29baec190eaed677676e9c1973fb3a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid making this copy if \u0060inp\u0060 already has the appropriate layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1379d7b320dbd0057ab873bf69ab546fe8b24f672aeebe17b8f2b23043843072"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid making this copy if \u0060inp\u0060 already has the appropriate layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"736ffb560248f1af330ff13d3608914b33b7003bd03e45d909a6ae178e077f16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid making this copy if \u0060inp\u0060 already has the appropriate layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0255c408e713fd861e4213a3d308a64d5dbe341487bb94374fb89ec904a1495"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid making this copy if \u0060inp\u0060 already has the appropriate layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14c26680398528a5bb81ec0b1df9d26c27a48d6d61044ca4a6ec1d8be4ae867"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid making this copy if \u0060inp\u0060 already has the appropriate layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"f757ef663a931b1a111a4fab3ff5ecd20c71859c0fa079b35da63a702e38ff00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid making this copy if \u0060inp\u0060 already has the appropriate layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e52c37918a597f566aff3d721d5557c7a45019da3107332008de48674dba1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: provide specialized kernels for the common use cases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c70f78bf95fa5788005c1e3d0e412e980d9c5832bb58b7027529ecc7924594"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: provide specialized kernels for the common use cases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6235a112ed5ef10a301a76ee0f6c199912c25602e945520858b2867e12b27f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: provide specialized kernels for the common use cases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df1c9b22f9a013e7bcad43a2859fbfcdd0f652941f0b518a3c4d7e037a048c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: provide specialized kernels for the common use cases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"c035aea3858c59035c2e590c4c5a4cee9e6bbf25f62207db6b3bf88b074609c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way around the quadratic number of cases below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe7a41dbd71237d33b2cec641d6b0d437a4dda415b744feaedfb8c32bf23f28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way around the quadratic number of cases below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdef359e31fb6f89c12734d9f3ace27cca68285b680d097d579aaf73f2eb5ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Have some generic map for functions that apply on num_traits::Float elements. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3e5e444e91b2f3d8359609aa5e48ff749f6225745976a0b9d992621bb8b107"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Have some generic map for functions that apply on num_traits::Float elements. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4dae2bb2e2e6bd04a0cd50b02ec63a514f04c11749b740d45d2db752e62436"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Have some generic map for functions that apply on num_traits::Float elements. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"94110f59d1aa52686396c6b1aac1840d18d5ebfc9e2f6c0b72468c30870a8fdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Have some generic map for functions that apply on num_traits::Float elements. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af5106b67297dbfc1c61160c7ebf4dc8f1bb344435e168474dbe902af257e31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we want to avoid going through the layout twice. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/utils.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6755ccca3cda7b557fd25999ec3a7350b42bdaa9f4f0fd812dbaa9058efbf020"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we want to avoid going through the layout twice. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/cpu_backend/utils.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ff508c4ddb88c455950e1e91a5ec5b7623dc46211271f90cbc736535e308e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we want to avoid going through the layout twice. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9067051633fe5114e51f20e4f91c85ef338307cd6300d17a04454d02168141e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we want to avoid going through the layout twice. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/cpu_backend/utils.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da722924c26f9581f8ae138bce59343bc09828f643ecbb480146f0ca3db4b7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO This is bugged (also bugged in GGML \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/tests/quantized_tests.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3fa3434ced474184193b8dee6712f31578fcd40b808646d3a700ea785daf5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid passing through the cpu storage here, especially if the gpu ids \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/tensor.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61421fd0f4110098f72e87f79d91778682847e08d211d9de85897082701afb3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do not make this copy if the DotType is f32. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e49bdc8955bcd66d0bae300f2a24585f619ce9921f75521b3be73944b190b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: vectorize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb83faf444632baf3b17f5f3f11db6a3a65933b489ee98776418edcf2357ccfa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: vectorize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/k_quants.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"b366cede7b0e20c7ebe585108251888ee7fc5ee7d0339f7812acd235c89ae86e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement when RuvBot is fully working \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db3a29aa05e98ceade86b730632a4002de1db14c53307aaa372cd374af89da2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14970fd7dfaef9782e22a88df9d43bed23b7b74637f57c96ace89b8fd9eb565"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e543639557051652cd08118ed0e5d18b5a7d699f514b77a9ddbeaf03323ceae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"873960c5df83d275e0a81e02f4d668eac54c867f6f3c0dc0343d692d6c60f2bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab3b83c5db4216031e5dddbe5fc12773c1b10230c98376fd66d1f2d4b6b4a55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7876d0ee93bf269989a8566051a40f8e3c32d087c6f30ad457baadf7bbbe40c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a726d88ad6548c2ea17e6ad9e444ac2c2c2e1b822807725b88ec3ccc9eb40c72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e155b7bdcf9002aee4a6405f629c4572369e282e797130875969418a89e6ffc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa08c1be97da64cd92f06dc9b49084e49e4b75e9877e826e49bef2473110b79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bef7e946fc3f29f7a01220488e501267eaf087a5435545e5031db041e3a38a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40ff94a6f15e740e42841d4536f7eba14f8a41e7e16d6db803ea385417571ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/core/RuvBot.test.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5799555de906350fdf7105ef7e495440785a6e93d17c620484bdf54197dc9a84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/compatibility_tests.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"929f5ee2961afe0cb7316ed38f0e30def686da961eb5068f43077174a57862ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/compatibility_tests.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83a0377d7a2ceed5423ee4035b481267950093b862f012c6d154ff11bba95d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/compatibility_tests.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dc89f8b6810bbd6a3b81fcd1ad4704e8feed1803d62bbe9d5fde6e7cf47449"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/compatibility_tests.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa5e8b46185e3b1091e7c19a7ac311e2112ee9cd43d6162569f1d827783b3e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/compatibility_tests.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"115b35f380a7b621c7542d90728688087863da9a032fc6d1695fb10325e77877"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/compatibility_tests.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c1615d83e060f3de807f212754a3b26471f3b28fa784679d65c45f97f7db4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0586080cde5dc2dd7c46afc346e1dd4f2b1eed6067441b25829fd612e79c6cce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd08fe18225103017df2856a7dec7868c94c13bec1c2b6c90f363fa84716b258"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2514e9b605bc4670ff6713d120b22573e804f11ff83362464e219737b0ccfb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88bba734b815a4951feede74a00d1e7f5a1de1fe9b09be9fc8f0cfd03175837"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"73981e1fd8f08e85f9024faeede6b2bdda2b23a0e86fa625ecc01ff13a0df52a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9de4eca2c2b47678658c7f3955e16903e1b3b1a8b9275cdc7794c76fb2f4d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50b0892a7c42ec670172aac8433f910581ecb04f70d5739234a936e058ef2f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"35db24d6f6144bc608860e8b7fb0bab2c8d8842caaa508673f8740d510379e27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d93adf9773c032d40e4dc4b6f8df3e4ab024d967146ba909d820ea4fe56d345"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b996003fe9510f51c60270b82b8c050de4ca7bb0dc648819acc522773028ff3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"20382c10edf8b699552c8305cbf5287f86905212330f2bd27198d836e5db2bfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ce4dd01b601b2f09c942577f3a68d3d262738a47d8326ea098b865676f02d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4acda3ad9addc410dc5cba2ee152d03b0b17df1cfb58b952cec5b62e22243b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd571d88cd2f277b53672229f2d06fdb73b79873eb73181a53d4ec7821ebe6e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1aa27c7337928a02aaf4e4fa48ddfd3f6fb4eb79f44225e0f5787fa78ca49d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dffa658cace12a641d366d046b43eafd3695009b74eb033262868ecfde81fb6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9438013e69c7d9cde26b9a252feb8bbc91389d020d1560eeb1ebc16b1b903e5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0704538c217055c5eac268f2c35eadb6ae9d81739a2fd06e0fc146277a9a4fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fda47c429196fe09793c8b427f328ec9b9da5844f7ab67c9b3233171b339a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"703f3aabe58068a435a4df22801c8ac48d409f58d2d6b43601cbac7185beb22e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db0225842ba5a214cd15229cc380db49a74d41d9157074dfdd5b27f1514b7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"67039be2fa44e9b8577cfce9eb63151ac70f8f0057d24d4b4e72a8252fbd4a54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"08173cf3a43ee0a4dd54b1e8334f2a64c6069f27af8e145c82627b7669c5aaec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cf7524ab061da9c4c8ed9aaf6f24e8b59f877b42aef30fec432274a802787a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"d723f0602676d65d9c037df1c3498551a8a20d73d95c515113119c0f3a6bf77e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"838b534fd071d2526f1e32256045754501dde6b34c6604f3efb8be4c942a617e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1851013d54947d834ebe78e77750771a88efc262ceef4c562918d01e119222"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"2927b36fd81ff87eda0753f6c4b5223ba29120f4359247899ac008ba29757b62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd24488afcb8a044be92552266d4effae797f5ef3752a655eb9d37fafdb47b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"603f9f2bec1d7824717ded33fcc213c3dccb3e06d98a739c7469b7876cc05ba7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef737607dc9b960b3b9c21e7c906c0a549094b5a1f66153920fe9c20092133cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5e4179ccdf19890e66cb9696853323b928db849cb2115800f67e052e663c64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6f4acbcf5ce253477dbdd7caaed4191d2060e63ca50729f00a4da159928c90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Initialize memory manager, skill registry, etc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f1394ec4958e43a91018e9ac51ce30362bf79f5cdf0fda05f7b18ad2fce054"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Initialize Slack adapter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca4b14e60247fc0403cd1223440c725af4e2acc31524ef7c46e024920a3cc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Initialize Discord adapter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"747bb4275f8de4dab0447e1a354a0194004bd4509899b08f5b98250852743016"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Initialize webhook handler \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a71a265358349814bca21546f188c4bfd53f199822eb20c22faacf0036921f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stop all integration adapters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"472688de9faf9c630deb9f08c74a1dc31fa78b5f07a72c9c9b72ad029691eb2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual ruvector Node.js binding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"357198e024dd908da22770685090a392daa5342df7bdea9065bb834c3da14375"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual streaming from ruvector binding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d4387d2749c46f8971ddc6d10329bb761fdc5c83b7fb9978b643824e7cccb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement disk cache \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/cache/index.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"633f7219f5bcecc1cd254a51eed60d5d82b692af3b4d642407825f3ab9a27089"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Integrate WasmKit when added as dependency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5dc19fb336c5535e537123e9209d2ff002d7dc365d71ab9df3b8401af31d05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call wasm_alloc export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"636110bf78586ffdd2321b7f1fe7e0b6e39a1fed7d019a0714bdcb1141537368"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call wasm_free export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"15006fefde95bc32e386aee814bb6f6c3141e641a3b1572b90d90a56cd1f1f06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call ios_learner_init export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b765bd16a7884529a8d252877bd83f0280245be288d117e0246fed146289c67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call ios_update_health export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe653035304cb509c18bcfe877665f2ce7edb2ffc1c103e25db443ccd7af8310"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call ios_update_location export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f67ed80a4d33b239c0e9cb93d261bba89d5d5caa62c362a23328e8adac188c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call ios_update_communication export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f4dae1be0238045c16c624d657f8279891459c11235ac8d95047594466cf7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call ios_update_calendar export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"769d39b1d469a5771e7b451494fa1a9ad2ff81185ad2a40d6030d8c12c71c127"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call ios_update_app_usage export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"994a7fad9e99488615f9fe61acca3a9f1758ef6a43775b6be36071e6142fda67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call ios_get_recommendations export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"69287a7de87b336da40bf9b7d81da4b1ae4f99c9700dad2788d82c7df9fad529"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call ios_train export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d67d32f1a66f044b3353668e22fa4011b9eea4f884ccf96590f7d7e9598bd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call calendar_init export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"0859c206527571f00342250b8975f0dd4e602372d0b2b32cafa5687b905659cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call calendar_learn_event export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"019eb2493d0d2b109801fe91e9e4f8fcfd0da927a602fd79dcb10f9f624841bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call calendar_is_busy export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc199a87264b2e4c858041274a9df9442398448de24037dfaf7ba17fd016f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call through WASM \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"783c1c20ebb451ed3a3503ceeef892e0fbe0d9a694b506fa61eae16cb5517538"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call app_usage_init export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff8d4322486518e75e05d5a9812f95e2cfedc1dc55b69b8a140b39a1d396e9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call app_usage_learn export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"1592ff568e07968338d602c0a1ecdc410b314e4533150f7a4076d94bd8f8a5ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call app_usage_screen_time export \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c6cef762df0bf6ec9f06a5e3f161ef68b1fbe20893dda22513f8b31b0b50e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call serialize exports for each learner \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a37a89755643ec379a4717f962615bad805056137733762a61aec648198b9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call deserialize exports \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm/ios/swift/RuvectorWasm.swift"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39d34f4c8cdde90d9b7553cabdfeb155bb3e5c5daac71d622afb93e2c6bc8f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement interpretation modules \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/vibecast-7sense/crates/sevensense-interpretation/src/lib.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7535ffaeaaba07c834496cee6394c67a4e9ad3d7f65e75e6dd7d2e6bb7dfb259"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual OCR processing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/src/cli/commands/batch.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcadfafc83be9cadf0de80a1b868302d7836053f61bddeb0a1563a2f8cb0150f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual OCR processing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/src/cli/commands/ocr.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0bcbb6315d6b26f17f71c2678f9ebcaf671030f803d5936f93ad99c280c849"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual OCR processing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/src/cli/commands/serve.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"705f88bc37e3155c9e76820c831591fe229bfdad4b74a426b8978dc7cabca331"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement MathML conversion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/src/cli/commands/ocr.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1350908306e65306900fabd0f479ceae55db79ef65cc2bda3c5a8f509c9e9eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement model preloading \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/src/cli/commands/serve.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4419a98d5c130a6e759c2c2d6ca26879042f0531020064e6040ba2d658be86ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add model preloading method to OcrEngine \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/examples/api_server.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29ed8409cabd0f9f88dd5b47f2e6e6efa54b3c9874317bd3a39180c74252787"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual PDF extraction using pdf-extract or similar \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/examples/streaming.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c145f861a42e12c8ce487611f4323908f6324e78ee3bc45a0f0c47fed14d7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Convert page_data to image \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/examples/streaming.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55c9cca7689923ae12e80db2aa1ec0382985fa8cc4a67a59708ff3daf0ad305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement clustering \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/ruvLLM/src/compression.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccc2c3dfb8eb512de5cf53f155a882eb4eb2c417db5fb8e5a07f6bff8953767"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once the graph API is exposed in ruvector-graph, implement: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/graph/basic_graph.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa3ca257224ff43c0d423bdcdb8286772cfcdc56e7733f86488bb1c95126263"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once the graph API is exposed, implement: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/graph/cypher_queries.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e84404047270b9e38812dcd899b9dc057f7973609def65c1f99ea7656e97c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once the distributed graph API is exposed, implement: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/graph/distributed_cluster.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a18675af0a807d0c8ee7b94eec25e6c5467e0880e0dfe041c34ccf777ff2da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once the graph and vector APIs are integrated, implement: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/graph/hybrid_search.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"764932fd6485aa480b0c003017284978b2a984ea54ff6e69ce10b27e8a11024b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf54ddc6e90e43d982f75dceafdf3355c71a03e7fe38eac6b0b8129d68a3cf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"340dd866d6ec8c66f0f0c2f51cb75fa90ae3d7ffcb47e51ee3f562c1eb4d71d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81992226aa0329eb3dda2412e1bf39260fefcf446b286df48f0627a3c8860e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5f54bee8f7d405272285485218b7a00c3b74fc9a633b683169d603589bbf63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"de043737a542f90673215ef2a344ad2fdc9db5214b83f58410e5986d2f282425"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2516964a7d9b0da80d3abbbfb74b33ffdc8dc8e355d1b32045382a274bb57aab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afc564d9cf4447e07f3f8277fdba8b258cd707c3672e22c65e7366162e3edf5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf60a8332048f0d5da9eec364d54995ac067a5e253c30e8ea465096770eda4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3720e51b037cac41783c6c02a6ae0a6972f05c8b2671b3938223879ea058818a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-federation exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/fixtures.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"411aae983907cd897a898e64971d61d879ef72f6d324ba8d99ab211fba53e1e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement helper to build test federation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/federation_integration.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c945ea08c167ee38d85c6887e297756e7eb09a1a2f96ef9b4a8f561657a7fe54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-hypergraph exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/hypergraph_integration.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9d3e2cf5fbbdf5c950e55632bd1c0d96f6f659a38797b9a5bfe7c88cb83727"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-hypergraph exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/hypergraph_integration.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab4e9e4f4c5d003fdd8b39fb68c6ad71306000d1a29f5bf072b14734d079ba3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-hypergraph exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/hypergraph_integration.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"175b016401d14944535d853eb57dd073043da615426b5094215216bf6b87babf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-hypergraph exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/hypergraph_integration.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"df712ecf3c027ddee608b7b73210a6b323f08fc04033279ebef782c7eef70144"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-hypergraph exists with sheaf 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":"examples/exo-ai-2025/tests/hypergraph_integration.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb66543f0432029e1094729180363315ce9c980684aedc762a72b73945e4f786"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-hypergraph \u002B exo-temporal integrated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/hypergraph_integration.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"493a2a95a0cb7d5e1eec1d98698171afcf0df26a8495fc1a27dbd26161415211"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement helper to build standard test topology \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/hypergraph_integration.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12a7dd41f7a1ee24e0fb051a45c7bca0161f80b08d12f356dacd4f4b5d50952"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-core and exo-backend-classical exist \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/substrate_integration.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9353cf7233dc986d03656f4a55eddd46a62eb58953c6526a117b8fcfcbefe50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-manifold exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/substrate_integration.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cb646695bfe65885fc46d4a2f3a05937ca933a96f5fdd912103ae264f1af40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-manifold exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/substrate_integration.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd51d674b51fd4463fb6f3b1153215f545dd403befc1da38d3f5533cae28c7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement performance test \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/substrate_integration.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"21001b0222e9f776e7be94e0a7c0cad26df108ec66e3337710fc193dcc0065b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-core exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/substrate_integration.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0a605e0030a0d836d57b23861e836f670a8b6e04f2b2bc958def654edd4f66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-temporal exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/temporal_integration.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d1f7c3b01946ffb7a5ef59e847b6b19d88ff217ce5258a642f82facdf41d59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-temporal exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/temporal_integration.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0f3471d3ce9eea59be4ec41297cf66ced67fd8dc443bc66c2350b4e08c6b2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-temporal exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/temporal_integration.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31799f67ef04278a16b287635707e156ed2b993f5958ed91d1700da3c20df3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-temporal exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/temporal_integration.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbdd3e3e264c91aac2be2bd84164c5a48398f228f4e00f63e54ae70426f8c0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-temporal exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/temporal_integration.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3a8b4388a986256df97c79fb602041d4c48fb9f4a873cfa0767c2f7ad3cf76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-temporal exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/temporal_integration.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"74336fad1d65fbb0469a26e904e619ecd09e150665ab9563ee16c47c30ad3c10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-temporal exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/temporal_integration.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56d73f5755fe80b8addd762a57161ebb88dc900f3f200cbc4b8450a716fde8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-temporal TKG support exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/temporal_integration.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d85ce391384d273776adeb4a6532340882a39cd16ab79667cd493dc5524dff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once CausalResult type exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/assertions.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"180ad290683c5e9ef914768d5ca43207a6891412cbd6f4f02a646cd7dfac8010"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once CRDT types exist \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/assertions.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"975f401b80d8234fe2750081abd13d51b51847bb9b2eb9a33b45d8b4818aaed2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once CommitProof type exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/assertions.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ff7511c5ae40028936eac41c4720ec5a41fd078f21b7904fa908bb03bd2591"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once exo-core types are available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/fixtures.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba13bc34a42d4b56359bd59dc53e16ee7e8cd1cf499d37a30afc1485f4c920e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement clustering logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/fixtures.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a73aea5ef21073ef0a311e4c19eab607afeec3bb84ca6f1b3fd0d55d489d3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return actual Pattern once exo-core exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/fixtures.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"84373539928ed155e66e87fc451971aa445692470a71267cc647b29aed83af78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Build test hypergraph once exo-hypergraph exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/fixtures.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a298dd4ad35bf1f540fef452177178fec20fcd50c668048f25c888db1076fee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Create linked patterns once exo-temporal exists \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/tests/common/fixtures.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e6748fa76c045efd858ea5755d13e0a8f8637d0460d09def260ceef9b38fc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement proper hyperbolic kernel approximation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/research/09-hyperbolic-attention/src/hyperbolic_attention.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cdef94ba38261e07e268820fd607a60ce02efbfe16abf288e75f540b672357"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add hyperbolic feedforward network \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/research/09-hyperbolic-attention/src/lib.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c42399cbbe81114e3ba817bacc574889809f118f8601633fa429711868bd079"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement full vineyard tracking with transpositions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/research/04-sparse-persistent-homology/src/streaming_homology.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3071a93f4a4c3689dda528c92aa181266458eb8bc4cd1054eee41edffcbb92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement full persistence computation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/exo-ai-2025/research/04-sparse-persistent-homology/src/streaming_homology.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea55a382d4e0cb47f615c322c374ab681af0bdb4051a7daa88e0cad7870905aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(iter-B): post the latest state to the ruvector-hailo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/esp32-mmwave-sensor/src/main.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6db260cae51595576c5c2d65229623fb079602d67c718e005e4da12b711c83c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: actual load balance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/src/evolution/mod.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8c81581192029618f6d0d78b285ff02e4d48731f2e12016c659b56ec799620"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement PiKey.restoreFromBackup when available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/dashboard/src/stores/identityStore.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"98156f1cc0f4de01154ba8f8f6200d3e19fc16605f685ee2886930789778f1f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement batch verification for efficiency \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge/src/plaid/zkproofs_prod.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"299ec78672bb293635f5e4998d878e03f2f368516a70c8b0e73588da2506213e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Measure actual load \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge/src/p2p/swarm.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a62ef0dc6a89d61571a31cc4676a31f8880eaf70a82a5353c41bf2fab9f62a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement multi-source discovery \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/data/framework/src/mcp_server.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"be89ddb761f8e9f4529617abac569468a786d5926afa6eddac09270e925c5aeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement coherence analysis \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/data/framework/src/mcp_server.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76f5220d6b5afbe3b2b33f6d806f1cbabdbcf5dcbb302c5e5d981505b2ce045"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Uncomment when OptimizedDiscoveryEngine provides getter methods \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/data/framework/src/persistence.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ff34a19569a9af85a0d1e5b70b4c7b86e192a205d83bee53068a3a59f089d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement proper state extraction once OptimizedDiscoveryEngine \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/data/framework/src/persistence.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"042a521cc9d37847bf2be6d3afde4995eb5d171869c1d8ea8625e4eb9413c8a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement proper engine reconstruction once OptimizedDiscoveryEngine \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/data/framework/src/persistence.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"354918c94c85be1ba11a8b14f33c9fe3322339f374e7fafd01036357fd0e6d34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When ruvector-mincut gains no_std support, call: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/bridge.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc70906c76498b962f1892f6b25c0c6809f790d42f7e124e067f6190cfdcf84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When ruvector-coherence gains no_std support, call: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/bridge.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f833e1e3b56258c98cd87e8278c88e622fd8f03ab12012b89c7d2403ac2011"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! ML-DSA-65 is a future TODO behind a feature flag."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-crypto/src/sign.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"981aac23e572c8a2802f12247551ff6d6d5cae6830c7c3d4717b72b852c9a584"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Todo item status. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-wasm/src/tools.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fcff0da5e8a5c6157973c50a4496bd92482004cdda03ba4e7001f168841ebf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Todo -\u003E HNSW -\u003E Memory -\u003E Skills -\u003E Filesystem -\u003E SubAgent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"606b835e83979f97fdcc1b4d33ea993723dd762a0ec24c8b7efd98ad8c51df59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo, filesystem, subagent, prompt_caching, patch_tool_calls, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/lib.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dabb4cb487eaf4910110079dd97465c191b3ad18e5a82c6688930359b67456a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo \u002B memory \u002B skills \u002B filesystem \u002B subagent \u002B prompt_caching \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/lib.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"824312704fdff044c28c33c2ee7bdd17761bdcc1621711355b7462c18e384516"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo before witness; patch_tool_calls before witness; witness before hitl. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/app.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b5620f194e8d3ad7e6cb3235fbf24f584d6fe03b00b5c39fe787c0a924ae69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Connect to SSE endpoint, perform initialize, discover tools. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/mcp.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be378df4bc340acbf15b61f9de31ba403c1bb6057069f03158a8e6261dabe7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(client.rs owner): confirm \u0060A2aClient::send_task\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/executor.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc28fc273177c116bc795166f06be7b08487bab002c9846f9f7b8332910302f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return actual stats when speculative decoder is integrated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/serving/engine.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba73b2faabec75032d10f77fc0d4c3b8f454283ce4a9ff3bfc90a81c340f8a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement per-channel \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/calibration.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8148e4a7ef3ecb3e40f8da28898b8c7ff621252211bad187f65efd9d232c9f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get from model \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/training_loop.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d1ae3907a65e7ed46a48642300550801ad7fc4222d9bd1d3b615e0b460dfc0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Compute actual gradient norm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/training_loop.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe71353de04cd1a33ddeef9e8cc45395ebb271c3f3b27eb49ba422975e0e0f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual forward pass through quantized model \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/training_loop.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"56761f21812173b74c9584e8a91d29742a82dc1ad2eda6d48d9d24986f4e9f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Save actual RNG state \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/training_loop.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c28634e7eac349a4a25f04bb977f87bf29cad25ffbb45b39850655579329284"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement GGUF to Core ML conversion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"83648c2e54006578256015a09feee5ccf55b695576376a5c6e3528ca07a174f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Implement actual benchmarks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/proof/benches/proof_bench.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0dce23eb53cf0dfb4b804ba586e1260709b762c48b8eade3b158483a0b87fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement caching \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/proof_engine.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98f657bf938f666a1c4fbc66476502d317ed1d1e0934c7c0ea369b0aa2191f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call into ruvix-kernel main initialization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/boot.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a75f0106b48969b18a16e9283272df55241d22b39b193307aa4f7d98e48b22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement interrupt handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/exception.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd48089637dd74c93bd459811f6d4b89e98520e599399e5ccef97bb218c83f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement fast interrupt handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/exception.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d26bc2d91636cc3a690c58b714628f19e1332250b7965e6338cd896f5a9f9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement syscall dispatch based on syscall_num \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/exception.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"005e609f7c8cd99e048e8200926fad7262dc9b3cac2e62277764d60a684deecb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle page fault (allocate page, update mappings, etc.) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/exception.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a38db3d7a6da43c0bab101ea42b49f80fb9c5c54041d4e56f8b68c21a1bfb62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle instruction abort \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/exception.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"653230f57b317391e1a33f0828ef003a33870591718263f5134a8dbc20c75c55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement proper page table walk for dynamic mappings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/mmu.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca44584baa1950f5f336242092f4ca5244b1044bc5004d1fb28016b98065692"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Walk page tables and install mapping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/mmu.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f2bbffde3d34299f88425300fa979a1b4db301c9aae0d2e1f67b4524af0af2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Walk page tables and remove mapping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/mmu.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec673a73e5d709e4ac112b8bd92f7213047753f089f96dfed2e86865fa795f6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Walk page tables and update PTE flags \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/mmu.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"402ac302c53294a5615e97069cf4271c5d9b2ce661b1fb9edf906dbe0bc60def"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Walk page tables to translate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/mmu.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb5e2b7bb8fe09ca427035858e5df55286839695cbe16fbe1cc832208837ee4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Walk page tables and get entry \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/aarch64/src/mmu.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8029028f1ef8ffbabc98f91581164a1ccec6bfa953dfe348686b976c40a183a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Stub / TODO / simulated / fallback marker near a domain keyword. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/model.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff998d6f2611affe306e8c804a643b1218603d29ca43c97a5b292a39659e003"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! Stub / TODO / placeholder / simulated / fallback / brute-force markers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/scan/markers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2713261cad4d16087b702b8c11c25ae5086b5fa7ac5ababa8528a020604435e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement INT8 quantization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/model.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"181ccae9b08c9923359ab2f7512e53f0cacc9efa01331ba29095b5550534cb6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement magnitude-based pruning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/model.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f79f6995096f3dd03e037d176ff129aeb5f8051d30bcd3bd376b4245d8c3742"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement conformal prediction calibration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/uncertainty.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4205860f6dd7b640be4697dfba12541b19060ed499a0f7b45165d8bc618ce17b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Send response back to sender \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38af5aaf9f8492c27ad5fa66f2112cb66198ddc6203686db7badf7552268003"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Send response back to sender \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37cad599a3e3d594639e30e046c0e2f325313da45fc1ed64806931cb0558c05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Send response back to sender \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c6e932d5658af77ce8a8ae17d5a54aafcd0c702878b0efdc89d529224e4601"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement snapshot installation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e862fb7f8c099e506dccd71f448ff75231f81e8f0bfd555fad029f315121558"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement snapshot response handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"483ad886e9d8a838ea91008ecb157e69744110c106f3aee5f1302db6ce9eab80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Send request to member \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90423390570d7278fc3815a9066fbc19df41956e4660eba0cd0372e5a259db4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Send heartbeat to member \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76dc88c7781fbd15b3a027210e1e4fad86d83cfb496d699e428c72520e45d50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual index mincut lookup \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/integrity/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cde322c57f3fb9391eba4a197ab00811da7502516bea357bc5357ff0e7f8768"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement graph compaction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cfcad7140805384ca6d89f12d1037163975b793ea15cb4e72e4d1a047555c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extract actual LIMIT from plan \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b6fef4a62a28de80d90f2c8e20647692e2a6e78a45183a4072ad24076eeccf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement proper reloptions parsing using pg_sys::parseRelOptions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48f3dc96fd549271b2296eb890f9a4dc1ce3d1c5791d361e5cb743eceeb7c45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Integrate with contracted graph integrity system \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"265984c23cce5ce840dbfee7cf6973d3057bf45356559351875f7c5e329d3f1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Report to contracted graph \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00b5bfcb6e6715d21cebcea7f226673383c4224c3694ad5de3f39a92bba7edf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse actual reloptions from relation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb3b3dacf6c2014e46e9bc6647e117cf700ccd899b7055c777826e3be0faa16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse reloptions for lists, metric, quantization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c85c41ce4c55448bdb9147017d80ef852d980f6a7a0882cb7af4bcbb88184e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extract vector from datum \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1529e4fc3bb9e71a84e4ee4e1337b5c00c561454ea393563871acd9398994403"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find nearest centroid \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b24213232c45002d6c1422771f6077bbf5da8a6b51f3b150c5c184414d0f229"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Insert into appropriate inverted list \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ab2c2db6e6df526a2c77d600655883173bb759e3ba1f7fb2673b658bd79cd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Update metadata counters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3defec715f8213ad3d054346952e98700f7a02d365f930a90b19cc831770ec6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse options: lists, quantization, etc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb75a4cf67ed76392ad22b8e5d7b010a3df340a1351827c06fb52ad81c9415f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Look up index by name and read metadata \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f27e1d7e23314143502f9fd60c55debfdbc3506eee4e4fc74295155a125ccac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement incremental retraining \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/ivfflat_am.rs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"44abb5b54bef03686016959fdbccdf1b71f33deda64eeceb9632e6882dc656b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Send to SONA engine for learning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/dag/hooks.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69e18817c4c2402758291bc532f012f0fe232571235590c31b2f03cccb25b68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/model.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"45486937f6e5ea3588ff8f33e6d4c9592d7ddcd5e42552c9065c0c65877b200b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual AVX2 version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/kv_cache/kivi.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4426837df80a7bed521a67afd9fc396e69f12d878e5fe6f841bd261ac30543f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Implement full linear attention with kernel approximation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-gated-transformer/src/attention/linear.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d696183301da8f011071566c93329be182592e867764b3d25e91b08e63db1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Integrate with SubpolynomialMinCut for exact verification \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/hierarchy.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"04209327326c8e1f15e0cdb5b54eac90fb9ebe5c6087570dd61d912dfe208aa6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Actual WASM initialization when feature is enabled \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/level.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb4dfdbf5af6d8f725396c5d53682c7368aa0455f454aecf19bd8b143b153fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check for WASM runtime availability \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/level.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d12a290e51a3c5ef5b79cf5e76a34bc946badec3424a0f12ff9263fe9633ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement query execution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/compatibility_tests.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e193f5ca8180ecdb6f49822d11f90455aa5c5fb9f6d4372d2d45789f878e73d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement query execution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/cypher_execution_tests.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d32cbce91e6b1571126bdf842a2b213d80de17cb7f5c53b2632a61e23499477"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement atomic property updates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/concurrent_tests.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a8f2b350bc503896ed693ea4873592e081ee15c93b2d85d92275fd99795542"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement batch insert \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/concurrent_tests.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a865acb6130c2a74ba4aff3305e8271b9335510567505b767c04b32cb7789952"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement distributed tests when distributed features are available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac4b777bb51d5b761850ba4e390307125e3489f10f8d2e078b86f2365949508"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Set up a 3-node cluster \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfc65c03bff3dfdc8556d64d3c761a1d3a22a4524a59fab61d2a10427014b4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Test node discovery mechanism \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"94efdd7479ee94e78c127e03e42df0043da5ee82d50fa0501c9ff3c0a052c14c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Test that data is distributed across shards based on hash \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e09831972cde9dc06fa4e61c12b87848706c3f7eb0eafdb77d4886f5fba41d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Test range-based sharding for ordered data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"492c348fe0e762b88ddb94f1ff8712f1851ea45bf9214dec2f39687ba4a9276b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Test automatic rebalancing when adding/removing nodes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48982fa0f5d8ddcc0016dc25cc72ef3951ce26dec27bce58185cc2d11b147e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Write to leader, verify data appears on all replicas \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"20503b4c075ed26cb94113431e55dc04907b5b05a8ed37dc462042c9f8b88941"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Write to leader, verify data eventually appears on replicas \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ddb55db4bb4b53361f2fa72dcee4c1ad4273cd25e65ed7bc582861677506ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Verify all replicas have same data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"358ff7b2531e531f58b3af8a81bdfb4a0c5508999e5f1c4930f3df5f6d60a522"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Verify reads can be served from replicas \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8923506ff25409bd2b47f0b29cbe533f7ac84c151dbf58eb12cb9e4f2ab51c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Monitor replication lag \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bfb53f3003214a918aeff3cfbe907e816b191e5a039ee460e4f9765aa01530"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Start cluster, verify leader is elected \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbef8b87581ae2a3ecb014654b78fd751f562eb5545d33bc98ec8e0567f2af7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Kill leader, verify new leader is elected \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c26e06a37f1f8e9619e2ac916a45412e2fcda437f104f875d8da1f0d5c0273"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Simulate network partition \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ea61bb2dde218182d481527453de95f9d1792fbbb857ae1d6b6eb2da32d3e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Simulate network partition \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4976a1bdcb41064251104e6df07d42e4da18d1b18f5246cbceef0c2ad5ae3042"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Query that requires data from multiple shards \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"def711b3b1bce1f7782221e0f902cc7c900a47026c2c6da9ea76bbd03db41857"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Aggregation query across shards \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcc5b35ccc9693986340e324114f40203a8f4d88ea09b106dcda93beec86700"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Graph traversal that crosses shard boundaries \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bdc0e7d38742f56fda416d24a7bc96321616705ea273929ebb7b4336344ffd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Shortest path query where path crosses shards \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32dd2ffc9917fc22d9e5f2d4ce928a3312d9eb6e36c99d4eb90a783feee96f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Transaction spanning multiple shards \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4cccc88cb8886c4de952497c994c07a4532807223e9d6e9d82bcceb00459cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Create scenario that could cause distributed deadlock \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"90655da98c6771bde2a174cd07ca80ab05e2022289c231e34b09e940151689da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Transaction that fails on one shard \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"32173245f2dfbfe12e073e2ebcea255ea421e22ca4d566aa6ff051798b96d3a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Kill a node, verify cluster recovers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce309ec35a26ab78fd9ab41c5d041077d174b5d0639d0d56d7e7f350bc9f493f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Node crashes, then restarts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3220868cba41edf9334da74aea2c2095196acd50f5adfdf4a83c8a49de7dc37c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Verify operations require quorum \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d29755d6823748ac6e03bc098850283bfc7f316e498f178d50b980ed6bf4582"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Query that spans multiple independent clusters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8984d7c4140e42de970bdb5586c750ba144b4fe160cfff180f5afe833e5366c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Search across federated clusters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e48d1992b6ebce0c48b1f307f7f6d0b04ca06672d68e8c28e3875167bcb27b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Data replication between clusters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f6150e4afcced882ab506350364c513dc55ecb663284b2f442ff066c8370fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: With strong consistency level, verify linearizability \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d474173c4a0251f6b20b2e74776c6fcf8a229995c2a8d85b7d53c4f3c5b71bec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: With eventual consistency, verify data converges \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54027556206e891f00558ceeaf61997112216ed3af97a3b9a341dda2e30a16f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Verify causal relationships are preserved \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce93fe5732ff09a6fd5095f61ea1216cbda4785112a3722e8dc1df0c822ae23b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Client should always see its own writes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8963ce10098b1f591ad3f4ff2f5c2d55b8013f7edaf639a4e0413ed36aef3cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Measure throughput with 1, 2, 4, 8 nodes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edb5314891749a5a6dc75fa4bbb3b618246dc71928877821b820c36d4026a25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Verify load is balanced across nodes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a66ce309d944a77cb91a2b4853ca9906e4c08cea77fb19c6c6c91a8a7d0876"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Create hotspot (frequently accessed data) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08fd75926343a084fcf86fe836f9653ec4df43f8be0fadcfeb6cec16f8b4bd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Test different replication factors (1, 2, 3) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eb86516121c347df75e00b181376debb2498680ea6bec3d6028f6308b0a3bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Test different consistency levels \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc05f178842295b5511bbd57cf88c8d58a59b9219727b4acab5f363e5a26d99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Test different partitioning strategies \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d62953b04ccd8cc4ecf874c7668859747ba73f4d9b24f2694066e980421724"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Verify cluster health metrics are available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4e683a16a48ee60f4209c2ec57e645b8ffbab97dc3d57bc3e99e7beb6a5b9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Verify we can monitor shard distribution \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed554e212bc1ce15762027d72bd3c7b50e7753d5bddacca2d424b5ee8b2c56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Verify replication lag is monitored \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2088be9bb42a3af6afda307d1bdcf3a388d472ffb3aa6ceb815ca19b8e24c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Create backup of distributed database \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3be1288b347bfc55937b0ef3286a5b4f9ff49d9e6d78ea359e17a4b024f647"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Restore from backup to new cluster \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c01cba2cff0a7691fdbed9302cbcf4f512aa2800f97238f6b2a71a0afb1d6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Restore to specific point in time \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/distributed_tests.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"faca22588f6f85556510ea90ffd39dfd57ceedfa1c6de43f338ca4522bb6c758"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement update_node method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/node_tests.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4156dd759f0b17894a92ce2171311332342c8e0267150f58e7cfe677068393"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement graph traversal methods \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/performance_tests.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5beeeb015d18fe1d704211de00b0e91191e48ee3a45308f0051b31749baf345"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Measure actual memory usage \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/performance_tests.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9557dfd0aa97c5d14d2c18997c06f7a4a5f870e1e6f74a9bdc6021b38b6544f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Query Performance Tests (TODO) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/performance_tests.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"433b0537a592ef40c9cbc38f9180146604769e697b9b03006905a8436dbc0b59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Index Performance Tests (TODO) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/performance_tests.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67165aaae8519e4634f00f3a13ed833f0f9563a28b4fccb508a3217cb2e5864"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement transaction operations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdf0cb1843b70c3805e8786a252314cd647328e103918a4b361f5f02a27e52a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement transaction operations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf90b48cd702907f1c9e2bc5111c2b900480915baf2c441fcad1f51579eb7e70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify that changes were not applied \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9366bacd9e5fbadf95b50c47b0bf1bec9735541c14dd7b44b898d862f64c77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement transactional batch insert \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5172df99cbdf7d54223f4a23dbc60256fa1eaa483dd97c742c8f553ec4f8d0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement transactional updates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a5bae4b042f5d94f2550ea61c9647dc67a7d61e7aaaab49edb29860e42d54a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Begin transaction, read counter, increment, commit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f9a956622bef5f6bf30b46121a53ad619ce150e45f0271e60ab52cd8183a6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Verify final counter value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/tests/transaction_tests.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c247503d018ebade48df35ec94dc3dc550e3d66a1fa54950de6fd3d9731eb32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle node growth to Node16 when full \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/optimization/adaptive_radix.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"54069f59806bd564a32aa5ec7e2b5f2b5dbaeddbc2ecec3289c3fbc8fb03054f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement comprehensive benchmarks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/benches/distributed_query.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df6a69fd26f2672a5eeb2255ec8d5b536fbcbb64e7ce36b1c341799eb7d613b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement comprehensive benchmarks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/benches/graph_traversal.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"baee5262ad082c8bd1629973740f98b68169ae114cce2de37fdf07c36d4de752"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement comprehensive benchmarks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/benches/hybrid_vector_graph.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f27c56df4258045371757491c7d5845b543581c154e849828931ae16d6ee40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement comprehensive benchmarks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/benches/query_execution.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2588223e3ac0e79526ef432f851fceba1b560d5a523f772f6b86d52c07340fe4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement comprehensive benchmarks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/benches/simd_operations.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c037a3575aaed4d8f53b3e792a2c8032c8f67dcf0f554b4d2d012d93e440dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Implement training configuration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn/src/training.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a03e474dcc0b2772d8b4b04a3ded899234b773dc9848c03143ed443c45f3ff5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement disk size calculation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-collections/src/collection.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcf5e342ffe4b94774628990321485c3e7db4a49022c9f7bc10f1fb313f1b78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement RAM size calculation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-collections/src/collection.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d46475d82bfa868a0c1eee554203ca3ac16018c6be69b686ef2adb24e451e70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement when VectorDB exposes all_ids() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/commands.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47bacb43b2798f32df90df195d586eceb58e62a499e9f7a686eacf39978fc3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement FAISS import \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/commands.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fa2e923aec899cf5cd209a6049745fc3ccf03237cc58412db6a3927348ff62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement Pinecone import \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/commands.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac25fd0235685aa56aab8703302809012cc507eb428830b7ebdf0690d76ad1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement Weaviate import \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/commands.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb96add9bbbbc49ddba46f71fb5632cdaaf954aa1459338ab48b5c6d2213e94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Integrate with ruvector-neo4j when available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a8910853c030702ed29515ddad068f7cc285b8a2521f1c3aa318fc439f228a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Integrate with ruvector-neo4j Neo4jGraph implementation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4ddcfd0d5f317111abc170c214db3497ff6a6cdf90cf7ff9d4669b64aa535c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual import logic with ruvector-neo4j \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96a261d2f307aec55605b3cfe12d1e0fa292ddafc03b931e363770c683a7aa7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual export logic with ruvector-neo4j \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c43bcd6549083989bf29a0bf559d1ad33c90a0ccc99f16098f46e028d628948"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Integrate with ruvector-neo4j to get actual statistics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e885e4d5ee87f99ee7439f1c1ae6b6959d279030dbfaab46e5f60e9d0b13b626"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual benchmarks with ruvector-neo4j \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"318ab31959ad855cfd1c652c9152a753a9170da4bc6b7cd2e190433af19e7e69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement actual server with ruvector-neo4j \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"53aafa61049134c884126bb9114498b59cd41e75676caf83a5451d9a9be7d934"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Format results as table \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b820ec8e999cfeba735d0a1bf488ca5c41b9fa4a4e5eb2c190eb8073a4bd1463"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement CSV formatting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/cli/graph.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccf32bdbc16564e5adec4b728c77999656c36859e5377fd108103be5041e6a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement signal validation and normalization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/signal/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"addc453ebd1cd6220b729c597be30fdc228e9405e9b13712dd21c20036f5241a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(safety): If wasm-threads (shared memory \u002B atomics) is ever enabled for this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a212eb09b11628feb4a838556be1918ab26f720b953678888179aabb1afc38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(safety): No null-check or alignment validation on \u0060ptr\u0060; relies on host contract. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/src/lib.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"869ecef5abb0338c692ff1e1c3e27bbc6fce47575a970c1743d015e7c517456e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: persist to Firestore subscription collection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db751d7e585721d97935f8bcc4958ab15674895097dbddfd1d21c4512a14f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement checkpointing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-kernel/src/lib.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"458b8111b0d4f86539c069a9c94d40805a283d0ba587d61b5f6e091bede053f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement when gRPC is available \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/load-generator.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"89021d34636c4b7a1d8bcb35ca3cc648f5b23c581d193f77d74d9e62e2a4261b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate from data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/metrics-collector.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca95a064e57c979cdc05162bb21385720a6f9b9a96fd31fecc25acbfc440f719"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate from data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/metrics-collector.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd88cf6c24b7d181603d0ad6cde506eea78e7a3a37895986ea60aeab6314034"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c9a70b8e90de78e6e6735ed8b2d8378ce68d562ecb64ab3f87ce2ee6c96571"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf66cdb1a0affcf7c05f258e00ba1e64e9b685d383519d58d090d470f8ab5aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"30559541ca255e6eeec67bbb8a48535bc089607207a2818f4c184b11fe9ee318"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdc83b8e789df32ff03b238307cb9bbe522dcca5607f35c7a65d65e26d799a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76ab365234649df0ba1ed422e821602a7677d482eeae09459dc86dcbd62b98f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdca0b4342806eec433e512ff968f8155ae6717ec0db033457289da53b7a33d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f102b754a96351207d52deea83ba209c50fa18dc0bc4cb7a1e265129bbe54c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate based on storage usage \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"525c4ca2976382a3f40f2750b71930092f592fbf0580b567cbc59d6cffa91fb5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate per-region costs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"809c24289f8371aafc67483d317574810546c87b284865202f434ccc7f4672f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement based on collected scaling events \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b35375f0fbf78429c6ca7a2f00be3b13fad01018f88c0f9db947d3bdc4de52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate from incident data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/metrics-collector.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec3c361f4aacb4b95c292d7cb42d206b8a941462ab102c29107371cbd0cbfee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Collect incidents \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"029decaf92b6ed99d3ffaaa66a1dc0a9a312f190a19b3a1d892494445f4a68ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Track \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/metrics-collector.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e0d7adc8244cd77163d88ef9362248866361387d0e03853d44ba91ba770a07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extract from time series \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/results-analyzer.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"939fa207f44650b11e5e7a1994c8f3b7ee5ef0e579cf9d568949d9379fb41dc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extract from time series \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/results-analyzer.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"665b1e717a94c752dd10101dc4a83f464be643cfeaa60b5dbe92d0208bc96902"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Calculate correlation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \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/results-analyzer.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e81dadc1f61cd93de02e90bac45bb2073ec691d1f8791532107d02310cc6a20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5642cd036119425780c73e49f385c15a15e4249f4b4a7e67a6c3af353239a1b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"42613e72db17c368963c5b770d757ac600f25c9769da3fdbce6b08822f6e27da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1474f6f8d10f3f31ec483a589128ae36ad2a844b842100b0dc10439b7beb0746"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2ce8e87f6c5b76a25f72c8fca17204b695be551043af82b0cae6f285c9056c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac7b8d2d6383f2adeade569f27f2d836572426862d5c8e4525733954b1bad3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual attention computation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc933403ded627e280533faf34b5d24a7e12be1a2fd6e3b5d98c846c523792ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual Mamba SSM computation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"346d06a3b0bc0b7ebf139136155e768d7c04e668a42d5ddf14ba1e2c24f1770e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual RWKV computation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb14998b328f1ac6787eaaff89f72daf1534bf5473229e5f0e7efb08bdb3345"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual Flash Attention \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1badc465b50f3958645761255757d0af38b2d13ff16e15839e3b22c1abefd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual hyperbolic attention \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d714d6552f4aa087ecc7b2506b0c6b61a298313e6b536e27cd6fd0fb3a2f8ffa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual attention \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc6efa756e256b854942789c054f364b8a2d13b895318207f86f9388e42c41b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with actual Mamba SSM \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/attention_latency.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc61a771cabf1778020b0d3678c570549394bd24df067020054d82109b33b2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When SONA is implemented: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benches/learning_performance.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f783b07a11e639b36f23e9284f2372e9cc4c59b53a707cd453981ec29ee46e6"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-026-rvcow-branching-and-real-cognitive-containers.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-026-rvcow-branching-and-real-cognitive-containers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f487b9bb52611b9aad0b64e7f54645b58e5b88a516df0bdf0a11ca085457b5"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-037-publishable-rvf-acceptance-test.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-037-publishable-rvf-acceptance-test.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f7dc7337aacaec12e6c441340022bb923fe471bc44637c55ec873414e370eb"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-038-npx-ruvector-rvlite-witness-integration.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-038-npx-ruvector-rvlite-witness-integration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"468bd894cca26e7a858837c0272d47dc5a750d0ad99000da59c5465be4df0351"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-039-rvf-solver-wasm-agi-integration.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-039-rvf-solver-wasm-agi-integration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b80d712030a2fe189b91cf49d4fa2c457621a7236c263ca3c8bca3868f41c28"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-043-external-intelligence-providers.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-043-external-intelligence-providers.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"813a381346cb57d10f41d38a66c4c4aded66fe2b8cbfe42374cb1bab1fa297a3"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-093-deepagents-rust-conversion-overview.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-093-deepagents-rust-conversion-overview.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9e5f7d4ce1f1a78e205062342f6f2718467e00a5a517ab58b97aa0a5778769"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-094-deepagents-backend-protocol-traits.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-094-deepagents-backend-protocol-traits.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f344cc3a9af427180ab6f86b07f70c00660086bbf4572800d19ef58ec0ca1d0b"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-095-deepagents-middleware-pipeline.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-095-deepagents-middleware-pipeline.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6136ff221682d1ef2888ddf1b14f17c1761fc4729689da5a9a990b783466ba1e"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-096-deepagents-tool-system.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-096-deepagents-tool-system.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"509c17618e38d15f1aa67a63eeebcee2e7bc6e16cc75155b4af64936e2ca757d"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-097-deepagents-subagent-orchestration.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-097-deepagents-subagent-orchestration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"713064f7aa5aa2e7e4e1f1fe97558855d3bb1916c8e142fc1faeec3436ed86fd"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-098-deepagents-memory-skills-summarization.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-098-deepagents-memory-skills-summarization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d8f55ae202cbc94981ac6c5866ea9ab64dd22e4493274dd1509c4dc09155cc"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-099-deepagents-cli-acp-server.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-099-deepagents-cli-acp-server.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc91c425dc31851014ee632c6d5db754fb22a434e3029b6dbfa5df0da8809a5"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-100-deepagents-rvf-integration-crate-structure.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-100-deepagents-rvf-integration-crate-structure.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a93649d7c9d2529a959d4485adb09655ed6ca536862981644272c2f0c2b155f"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-102-deepagents-implementation-roadmap.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-102-deepagents-implementation-roadmap.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d97af73577dcd31b48662dbd9a8805595c6ea6bc52e964012febfa84f90ae7"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-103-deepagents-review-amendments.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-103-deepagents-review-amendments.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bef83e3ca8507f566916eac0bc12435cf185c3009c75f1de335a7acec663445"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-104-rvagent-mcp-skills-topology.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-104-rvagent-mcp-skills-topology.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7686f3b066f8091c7b4146a3ec4ccce8ccfac8143cd5fda0b07b3cad1bb2c891"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-105-rvagent-mcp-implementation-details.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-105-rvagent-mcp-implementation-details.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0b2f6d405ee820dc94d14529190957246a67c108a07e6058009f6c01a2e732"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-106-ruvix-kernel-rvf-integration.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-106-ruvix-kernel-rvf-integration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c6ab9c5c8638961154202d7a7c5da42d7d4075470ce1d02425499b76feac09"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-107-rvagent-native-swarm-wasm.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-107-rvagent-native-swarm-wasm.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6898b694c764b48f8b79f663178679786523e89b0f481609e14d7bcb13a561ca"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-108-rvagent-ruvbot-integration.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-108-rvagent-ruvbot-integration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"094d2327ce2a66912c9a2d9cc258a5ad06032a022b55a5e64cdfbd528bcd76b1"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-111-ruvocal-ui-rvagent-integration.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-111-ruvocal-ui-rvagent-integration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a970b1d123f0ceb43ec3377b82dd39315d2a4029081693c2775b4f2417c5ca"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-113-rvf-app-gallery-ruvix-applications.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-113-rvf-app-gallery-ruvix-applications.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3b25c9d75948f8cc7168711fa878c9df1f7c5f17833fde66b63b123698ed38"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/ADR-275-rvagent-subagent-topology.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-275-rvagent-subagent-topology.md"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bf0d3a37f6ea0710d1d49b7aba95f7ce3c21fe331c2f2f110be0410a54795a"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/ADR-276-rvagent-learning-loop-gating.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-276-rvagent-learning-loop-gating.md"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b59df813a63d33edcd8d0a756a1ca3687bf4e83ad083a64ba415e9ea68d556"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/ADR-277-rvagent-positioning-and-claims.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-277-rvagent-positioning-and-claims.md"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d020d553f2ee07a4beb611f87f82c801c426803aedcebd3bf01808d83a9b60"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/ADR-278-rvagent-flywheel-adoption.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-278-rvagent-flywheel-adoption.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb21473cd73df67aa4a8d3b666ac20d4566f919de28b47105fcd888cfbd4a152"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/ADR-279-no-c-and-the-sota-program.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-279-no-c-and-the-sota-program.md"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa11b45013dbfafe2605f64b5722eba5d8b41120fb878b3ca05af7fb4b4c449"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060crates/ruvector-mincut/docs/adr/APPENDIX-applications-spectrum.md\u0060 declares no status, while 4 of the 6 other records in \u0060crates/ruvector-mincut/docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/docs/adr/APPENDIX-applications-spectrum.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb73d88afc71d4bc0a560df11d4ab7dbfa22d7195522ff7d7398328d0d97bb3"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060crates/ruvector-mincut/docs/adr/DDC-001-coherence-gate-design-criteria.md\u0060 declares no status, while 4 of the 6 other records in \u0060crates/ruvector-mincut/docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/docs/adr/DDC-001-coherence-gate-design-criteria.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe5829304a39ef0b447ae9586bd940dca2de2309aecf211f853155402e67de7"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-python-cli-empty-batch.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-python-cli-empty-batch.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31014967d663684a9e7f898fede9662d27d425bb2501dc00e586a1975ff67fc"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-python-langchain-batch-ids.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-python-langchain-batch-ids.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"325f84d52a9bfbf634059e122613b1e7102931e1f048139c858b69c911b195f0"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-python-llamaindex-constrained-topk.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-python-llamaindex-constrained-topk.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f6ab4b60ebcf660e181f1eb4cc3367278d63ed067c238f85f502f10956f39b"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-python-persistence-pair-integrity.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-python-persistence-pair-integrity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"857da8204ebac2ae1b53ad72aa59fc66e30fa7db2de1df59f06fc5f106550ddf"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-python-rabitq-external-id-boundaries.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-python-rabitq-external-id-boundaries.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e57b16c18bc9305bd6d0562cf84761da1c4473fcecaa4d98ca891e42007b3d0"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-python-rabitq-unknown-delete.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-python-rabitq-unknown-delete.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eb0b694d3398fc1d42c506c837589300a163f319e27c7fb5f145fc04bb1cdc"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/ADR-python-rabitq-vacuum-identities.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-python-rabitq-vacuum-identities.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b9079a034bf4cac6a7176feb78fd0fc2818c5b7f50fa0dbd2a3803526676a4"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/python-agentforce-collection-capacity.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/python-agentforce-collection-capacity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aab9653482455a08a63f3d8f29c5d840d7b5e38f3fc589437dfc65cbd56228"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/python-mcp-existing-index-preservation.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/python-mcp-existing-index-preservation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f5e30e58adc33b367ba1d3c492e00eb7b7edcbe13c68dd2d87fdc86f1aa905"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/python-mcp-sidecar-discovery.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/python-mcp-sidecar-discovery.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e964bfe3abca8a2db9a7a21879f86407a13c88e4969a58fe4d790f6f0b742c91"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/python-salesforce-pagination-completeness.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/python-salesforce-pagination-completeness.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04db5920179b55874d573c22a80e4e3520cdf9906cbb868840609cf9ec036e5d"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Consequences section: docs/adr/quantum-engine/ADR-QE-013-deutsch-theorem-proof-verification.md has no Consequences section (a heading such as \u0060## Consequences\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/quantum-engine/ADR-QE-013-deutsch-theorem-proof-verification.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6be6d623018eeb361e57d09312448d6937507221eaba8aaa18347f4b267f72"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Consequences section: docs/adr/quantum-engine/ADR-QE-014-exotic-discoveries.md has no Consequences section (a heading such as \u0060## Consequences\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/quantum-engine/ADR-QE-014-exotic-discoveries.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0790cd9a6840a2306d4c1dcd12ce9eae8371d2895535210893a97f8b7937e408"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adr/rvlite-browser-writer-lease-transactions.md\u0060 declares no status, while 330 of the 368 other records in \u0060docs/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/rvlite-browser-writer-lease-transactions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bfc8cf5f07f13dbcccdbdd35b7a8db3782c616071b68ec72e27821ac8c9714"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/research/sublinear-time-solver/adr/ADR-STS-003-memory-management-strategy.md\u0060 declares no status, while 9 of the 11 other records in \u0060docs/research/sublinear-time-solver/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/sublinear-time-solver/adr/ADR-STS-003-memory-management-strategy.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f56df3aad8b6a7a65f7019103df9a5a540c8bc44400d56e694d038113494bbc"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/research/sublinear-time-solver/adr/ADR-STS-SOTA-research-analysis.md\u0060 declares no status, while 9 of the 11 other records in \u0060docs/research/sublinear-time-solver/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/sublinear-time-solver/adr/ADR-STS-SOTA-research-analysis.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d751700ed440973a4009a1a215c1f164017ad97b8236578dc7878fe2ebd82b"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/research/sublinear-time-solver/adr/ADR-STS-optimization-guide.md\u0060 declares no status, while 9 of the 11 other records in \u0060docs/research/sublinear-time-solver/adr\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/sublinear-time-solver/adr/ADR-STS-optimization-guide.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"120bab70ad9f789f418bd3d3c62d105358ff67f20f5c027ccba4695c30228618"}},{"ruleId":"D20","level":"note","message":{"text":"ADR links a record that does not exist: docs/adr/ADR-316-adr-numbering-hygiene.md:6 names \u0060ADR 845\u0060 as the record it supersedes, and no such record is in the decision log. Fix the link, or restore the record, so a reader can follow the decision\u0027s history."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-316-adr-numbering-hygiene.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadb677b6f11610c222b1d1fd7668e7348d308ff6beac94a138bfa7619868c28"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: docs/adr/ADR-029-rvf-canonical-format.md:3 says \u0022Accepted\u0022, but docs/adr/ADR-033-progressive-indexing-hardening.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-029-rvf-canonical-format.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfd5f408a84f598a82423dd4088b0a7ab4745b56abee85d71d3df5f55b99133"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: docs/adr/ADR-030-rvf-cognitive-container.md:3 says \u0022Proposed\u0022, but docs/adr/ADR-033-progressive-indexing-hardening.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-030-rvf-cognitive-container.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"37966b94a31e1da4b2381000833389f3dca678211c3a3080ab1305226f8adf8d"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: docs/adr/ADR-135-mincut-decompiler-with-witness-chains.md:5 says \u0022Deployed (2026-04-03) \u2014 8-phase pipeline implemented. Louvain partitioning (35x optimized), 210 training patterns, pure Rust transformer inference, 95.7% name accuracy beating JSNice SOTA (63%). Code reconstruction \u002B operational validation added.\u0022, but docs/adr/ADR-142-tee-backed-cryptographic-verification.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-135-mincut-decompiler-with-witness-chains.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d609302c18857fd82cf3d29388ef37c2c8f5baf0b3b9b84f241d752b221923a"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: docs/adr/ADR-259-ruvllm-darwin-mode-local-mutator.md:1 says \u0022Implemented (code \u002B unit tests \u002B CLI; the download-path bugs that blocked the live-serve e2e are fixed \u2014 see Implementation status)\u0022, but docs/adr/ADR-260-darwin-mode-metaharness-integration.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-259-ruvllm-darwin-mode-local-mutator.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42645b7f624dade51a35e9efcd12862b857de5825adc63dd376548771dd56ba"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: ui/ruvocal/docs/adr/ADR-033-RUVECTOR-RUFLO-MCP-INTEGRATION.md:1 says \u0022Accepted\u0022, but ui/ruvocal/docs/adr/ADR-035-MCP-TOOL-GROUPS.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/docs/adr/ADR-033-RUVECTOR-RUFLO-MCP-INTEGRATION.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2ce79494cdeece649c18b4b5dd8b6ec9689de08b0aaa14ddd1eb07dfe71f55"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: ui/ruvocal/docs/adr/ADR-034-OPTIONAL-MCP-BACKENDS.md:1 says \u0022Accepted\u0022, but ui/ruvocal/docs/adr/ADR-035-MCP-TOOL-GROUPS.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/docs/adr/ADR-034-OPTIONAL-MCP-BACKENDS.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c68dfb890ed65b55f826091c417e684245f771c1ae7b4712a08a7b98a108bfe"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-150-pi-brain-ruvltra-tailscale.md:5 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060HashEmbedder\u0060 (crates/mcp-brain-server/src/embeddings.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-150-pi-brain-ruvltra-tailscale.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19cd4b88c9da72503a923a5ada60aa07f50f218d779db764038919c2d9d218a"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-156-rulake-as-memory-substrate.md:5 says \u0022Proposed** \u2014 positioning addendum, not a replacement. ADR-155 still\u0022, but the production code already uses every element its Decision names: \u0060VectorCache\u0060 (crates/ruvector-rulake/src/lake.rs), \u0060RuLakeBundle\u0060 (crates/ruvector-rulake/src/backend.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-156-rulake-as-memory-substrate.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bcc3a60e25c934bdd37195c08dfdcc90a002fe859fc93d702121468a17d147"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-264-matryoshka-coarse-fine-search.md:1 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060Searcher\u0060 (crates/ruvector-coherence-hnsw/src/bin/benchmark.rs), \u0060MatryoshkaConfig\u0060 (crates/ruvector-matryoshka/src/bin/benchmark.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-264-matryoshka-coarse-fine-search.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c5eb8aabbf17f32fade849117e37431441273fd151f40eb278cf1112f89a1a"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-264-pq-adc-search.md:3 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060PqCodebook\u0060 (crates/ruvector-pq-search/src/main.rs), \u0060PqSearch\u0060 (crates/ruvector-pq-search/src/ivf_pq.rs), \u0060FlatPqIndex\u0060 (crates/ruvector-pq-search/src/main.rs), \u0060IvfPqIndex\u0060 (crates/ruvector-pq-search/src/main.rs), \u0060ResidualPqIndex\u0060 (crates/ruvector-pq-search/src/main.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-264-pq-adc-search.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b7a591440826dc3337fb70ddf38d1ad49bc81fe1e2d7883f173323f2366e1c"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-272-speculative-ann-search.md:3 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060AnnVariant\u0060 (crates/ruvector-cluster-rag/src/bin/benchmark.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-272-speculative-ann-search.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f879a259b9205b3ddf679ef7a93331f34c1b24a5184dcdebe2aedea4f2f11c28"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-330-cama-pattern-correlation-aware-memory-arbitration.md:3 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060SourceKind\u0060 (crates/ruvector-agent-memory/src/main.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-330-cama-pattern-correlation-aware-memory-arbitration.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a905bf668399152137aaa4c7c0e06e956584c95d21f119e76abe4e0e2b4331f"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-331-pandora-pattern-voi-cost-aware-routing.md:3 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060RoutingDecision\u0060 (crates/ruvector-attention/src/sheaf/router.rs), \u0060Route\u0060 (crates/mcp-gate/src/monitor/mod.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-331-pandora-pattern-voi-cost-aware-routing.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc88ae3bf54c36fa638f93832ab53ebe67bcc29971f24aa7bbc726af3a2aab0"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-334-scope-sharded-context-index.md:1 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060VectorDB\u0060 (crates/ruvector-bench/src/bin/agenticdb_benchmark.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-334-scope-sharded-context-index.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06ff99cb672a6501419804cf97478190cc2318b5e640e2d6608cef8d961967a"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-337-adaptive-runtime-monitoring-voi-escalation.md:3 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060EstimatorSpec\u0060 (crates/mcp-gate/src/monitor/config.rs), \u0060Buy\u0060 (crates/mcp-gate/src/monitor/mod.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-337-adaptive-runtime-monitoring-voi-escalation.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7925cbf944139bbaae9d87630089f5206794c0fd822c71ef91d035cac189e5be"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-354-rvf-dialect-convergence-and-strict-policy.md:3 says \u0022Proposed\u0022, but the production code already uses every element its Decision names: \u0060Strict\u0060 (crates/prime-radiant/src/ruvllm_integration/config.rs), \u0060RvfStore\u0060 (crates/ruvector-py/src/rvf.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-354-rvf-dialect-convergence-and-strict-policy.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b6c9ad48a043ac7eedee45f1691e5ca897a2ce32fcd25b8d465577a0db930b"}},{"ruleId":"D20","level":"note","message":{"text":"ADR still proposed, but the code already adopted it: docs/adr/ADR-359-e-means-shared-clustering.md:3 says \u0022Accepted; local implementation, registry publication pending\u0022, but the production code already uses every element its Decision names: \u0060Config\u0060 (crates/mcp-brain-server/src/midstream.rs), \u0060Model\u0060 (crates/ruvector-e-means/src/ivf.rs). A proposal the code has adopted is a decision in force; mark it accepted, or, if the code should not do this, say so."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-359-e-means-shared-clustering.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f26a2beac952efcf98530599d1a41e7232de8f404d7d56dae3e15a3c64a1051"}},{"ruleId":"D20","level":"note","message":{"text":"ADR decides a question another record already decided: docs/adr/ADR-146-diskann-vamana-implementation.md and docs/adr/ADR-144-diskann-vamana-implementation.md are both in force and decide the same question (\u0022ADR-144: DiskANN/Vamana Implementation\u0022), and neither names the other. If this record replaces the earlier one, say so (\u0022Supersedes \u2026\u0022) and mark the earlier one superseded; if both hold, state how they relate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-146-diskann-vamana-implementation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c341956d9c0f8cb4394abb15c0afb22290b255dbd2ed5d06789171283825c1"}},{"ruleId":"D20","level":"note","message":{"text":"ADR decides a question another record already decided: docs/adr/ADR-266-metaharness-darwin-integration.md and docs/adr/ADR-266-metaharness-darwin-ann-optimization.md are both in force and decide the same question (\u0022ADR-266: MetaHarness Integration for Autonomous ANN Optimization (Darwin Mode)\u0022), and neither names the other. If this record replaces the earlier one, say so (\u0022Supersedes \u2026\u0022) and mark the earlier one superseded; if both hold, state how they relate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/ADR-266-metaharness-darwin-integration.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ea09104e53a761341df31c73839309f1ec97544f0d4967a935d6db7e4bc3a2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Parse criterion output\u0022 repeats the code it sits on: 3 of its 3 words (parse, criterion, output) are already in \u0060const metrics = parseCriterionOutput(stdout, \u0027ruvector\u0027, scenario);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/graph/src/comparison-runner.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca37f63b40fcd944ea163d14ef7b78308e164f360eb8dad65e7b4afc4a0db48c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Error: no baseline data available\u0022 repeats the code it sits on: 5 of its 5 words (error, no, baseline, data, available) are already in \u0060throw new Error(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/graph/src/comparison-runner.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5aca842bd374bcb3c552fcf332b548e205534136ddf7b17a2ff4615395cb33"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Multi-region orchestrator\u0022 repeats the code it sits on: 3 of its 3 words (multi, region, orchestrator) are already in \u0060export class MultiRegionOrchestrator\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/load-generator.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7132710af02e2ef164e829b6f275868d4aceeb477e2efb81d40c5da383fedb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 10 comments in this file only repeat the code they sit on (lines 189, 194, 222, 248, 290, 327, 357, 369, 383, 421), for example \u0022Record resource usage\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/metrics-collector.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0472669dcf888d1afb48c032f9b7940d70ff72362da89ebc5f14b6c21b45471d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create latency histogram\u0022 repeats the code it sits on: 3 of its 3 words (create, latency, histogram) are already in \u0060private createLatencyHistogram(latency: LatencyMetrics): HistogramBucket[]\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/results-analyzer.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e65cbdcb23f027a8a9d9e1cb63cc5d2e5a3effbc21a57d7696dbb103c5bd3ea"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check SLA compliance\u0022 repeats the code it sits on: 3 of its 3 words (check, sla, compliance) are already in \u0060checkSLACompliance(metrics: ComprehensiveMetrics): SLACompliance\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/results-analyzer.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1498ecca67f0455f14f744f75448e2efee3fede401883dc01466e307295298"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Save analysis report\u0022 repeats the code it sits on: 3 of its 3 words (save, analysis, report) are already in \u0060save(filename: string, report: AnalysisReport): void\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/results-analyzer.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbda71bf66e58da8b60dff41bb41cad8fb044952d7e8578d3b303c7bf8caa8c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate markdown report\u0022 repeats the code it sits on: 3 of its 3 words (generate, markdown, report) are already in \u0060generateMarkdown(report: AnalysisReport): string\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/results-analyzer.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae8550a3f35c19791b2d6562fd306f11c7dd2083090454d98e2062a081e52b0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022ASIC projection (256 cores)\u0022 repeats the code it sits on: 4 of its 4 words (asic, projection, 256, cores) are already in \u0060console.log(\u0027\\n--- 256-Core ASIC Projection ---\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a4c30990accc844c243f6c590f2b78bf3aa0043a0649dd779c9435678c462b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 1: Initialize HNSW\u0022 repeats the code it sits on: 3 of its 3 words (test, initialize, hnsw) are already in \u0060console.log(\u0027Test 1: Initialize HNSW (dims=4, metric=0/euclidean, capacity=32)\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba402116191f76d1f48b05a117ed35221825f973ba032a6ea4af9520c6d8f02"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 2: Insert vectors\u0022 repeats the code it sits on: 3 of its 3 words (test, insert, vectors) are already in \u0060console.log(\u0027Test 2: Insert vectors\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1117b740ef297fc712120bec5e9d2f5e160d1f13fd176851828c9fec267ab5da"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 4: Node types\u0022 repeats the code it sits on: 3 of its 3 words (test, node, types) are already in \u0060console.log(\u0027Test 4: Node types\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2682abb05c2f5b81560c21a16e70030627f36a47678e0f01fa130f2a541561"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Retrieve from empty store\u0022 repeats the code it sits on: 3 of its 3 words (retrieve, empty, store) are already in \u0060const empty = store.retrieveBySymbol(42, 10);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/neural-trader-wasm/tests/node-smoke.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6596f2b0e5155f4acb6f051c6baab363be4f3e034dbb4a7df5d3b0b0eefa2143"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Convert vectors to Float32Array\u0022 repeats the code it sits on: 4 of its 5 words (vectors, float, 32, array) are already in \u0060const processedEntries = entries.map(entry =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/worker.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e705181cd5bc84e8e69de7a1a201c2b3c16e2ea3b05224d5306d8bc05baada"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Convert query to Float32Array\u0022 repeats the code it sits on: 4 of its 5 words (query, float, 32, array) are already in \u0060const queryArray = new Float32Array(query);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/worker.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1803f936d9cdd66725ce74f294f7e9823300cf05701248a5becd3e927139a82"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Module: OTEL_EXPORTER_OTLP_ENDPOINT\u0022 repeats the code it sits on: 4 of its 5 words (otel, exporter, otlp, endpoint) are already in \u0060let composed_value=process.env.OTEL_EXPORTER_OTLP_ENDPOINT;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/asyncgenerator/OTEL_EXPORTER_OTLP_ENDPOINT.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fe86dbefab322166ea31568ef411cbd538164589fad79bdf158601091609d3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Module: getFederatedSignonCertsAsync\u0022 repeats the code it sits on: 5 of its 6 words (get, federated, signon, certs, async) are already in \u0060let composed_value=await this.getFederatedSignonCertsAsync();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/asyncgenerator/getFederatedSignonCertsAsync.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"751507d903ff83b18b38a2f380cd133cc918492bd8a1a347dce4d3608660f5f9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Module: serviceAccountImpersonationUrl\u0022 repeats the code it sits on: 4 of its 5 words (service, account, impersonation, url) are already in \u0060let composed_value=/serviceAccounts\\/(?\u003Cemail\u003E[^:]\u002B):generateAccessToken$/.exec(this.serviceAccountImpersonationUrl);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/asyncgenerator/serviceAccountImpersonationUrl.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c465254c798b4d6638dfd87488fe6ea2ec87e97f2c9542d7da827052442ee964"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Module: ERR_FR_MAX_BODY_LENGTH_EXCEEDED\u0022 repeats the code it sits on: 6 of its 7 words (err, fr, max, body, length, exceeded) are already in \u0060var ERR_INVALID_URL_InvalidURL_ERR=gp6(\u0022ERR_INVALID_URL\u0022,\u0022Invalid URL\u0022,TypeError),F41=gp6(\u0022ERR_FR_REDIRECTION_FAILURE\u0022,\u0022 \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/ERR_FR_MAX_BODY_LENGTH_EXCEEDED.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"251786f14a6e4349baabb72bb575bdac731f7d97d82327d3571492434f5e177c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Module: KUBERNETES_ENGINE\u0022 repeats the code it sits on: 3 of its 3 words (module, kubernetes, engine) are already in \u0060var __esModule_APP_ENGINE_KUBERNET=B((fCq)=\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/KUBERNETES_ENGINE.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bada994701ef73adc72ad839eb60001ae5bb68d70fafc3f79383b341972c603"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Module: _api_ws_speech_to_text_voice_stream\u0022 repeats the code it sits on: 6 of its 7 words (api, ws, speech, text, voice, stream) are already in \u0060var typeKeepAlive_typeCloseStream_=\u0027{\u0022type\u0022:\u0022KeepAlive\u0022}\u0027,b5Y=\u0027{\u0022type\u0022:\u0022CloseStream\u0022}\u0027,x5Y=\u0022/api/ws/speech_to_text/voice \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/_api_ws_speech_to_text_voice_stream.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa2bf6e5d79e8ed66ef547dbc0ab63d7aa137b5ba4e00b14505e55e3221b139"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Module: _smithy_core_cbor__tagSymbol\u0022 repeats the code it sits on: 5 of its 6 words (smithy, core, cbor, tag, symbol) are already in \u0060var CO1=Symbol(\u0022@smithy/core/cbor::tagSymbol\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/_smithy_core_cbor__tagSymbol.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31cce2a4073a00c2c619fd700fbabb85d2d677c2d93884f54876ad26f139c90"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Module: tengu_log_datadog_events\u0022 repeats the code it sits on: 4 of its 5 words (tengu, log, datadog, events) are already in \u0060var Esq=\u0022tengu_log_datadog_events\u0022,yE1=void 0;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/tengu_log_datadog_events/tengu_log_datadog_events.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0809c3e0a25dd17fea49181628dddeaf429c8cca766a446b6aa2b848dfbd81b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Load the native binding\u0022 repeats the code it sits on: 3 of its 3 words (load, native, binding) are already in \u0060const nativeBinding = loadNativeBinding();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/src/index.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3990bb68f83e43b3bc2f7f1a7f197df5b7ce6cc3c8fd8a1ca95a19765aeffd2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 2: Load native module\u0022 repeats the code it sits on: 4 of its 4 words (test, load, native, module) are already in \u0060console.log(\u0027\uD83D\uDCE6 Test 2: Loading native module...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/test-package.cjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f162f6f13e8c7a3112b9b73fa60ec63980e6a1054010ed2c618439246a9987"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 4: Basic operations\u0022 repeats the code it sits on: 3 of its 3 words (test, basic, operations) are already in \u0060console.log(\u0027\uD83D\uDD27 Test 4: Testing basic operations...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/test-package.cjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"89879789a434b82e13c11994bb99c0baf3139bddd2f76380a6365a82bf2de1f0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 93, 96, 369, 395, 579), for example \u0022Start health monitoring\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b1f725dfcad3aadae22b44a73e8ea312b9742aca36d4858193e1777fc22f78"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Start message processing\u0022 repeats the code it sits on: 3 of its 3 words (start, message, processing) are already in \u0060this.startMessageProcessing();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/coordination-protocol.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2dcb9d6e13219811f63eab6e17391550a5f00c5f42c89e19015c2a8a3114046"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Broadcast consensus proposal\u0022 repeats the code it sits on: 3 of its 3 words (broadcast, consensus, proposal) are already in \u0060await this.broadcastMessage(\u0027consensus\u0027, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/coordination-protocol.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4896720c2ca5276bdc04dcbdbd2d678a6512a927c9a1e692700ca74253b25ce"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Insert message by priority\u0022 repeats the code it sits on: 3 of its 3 words (insert, message, priority) are already in \u0060const insertIndex = this.messageQueue.findIndex(m =\u003E m.priority \u003C message.priority);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/coordination-protocol.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a25cf89e202ddd9ac1b3107823770176b3deb171455f3e9997e10d76a830499"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Pre-task hook for agent initialization\u0022 repeats the code it sits on: 4 of its 5 words (pre, task, hook, agent) are already in \u0060await runClaudeFlow([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5650ac727e1b7cd3cad82a034cedcb0219560a39ce63f9b7c0bbde3c24ab2b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Start metrics reporting\u0022 repeats the code it sits on: 3 of its 3 words (start, metrics, reporting) are already in \u0060this.startMetricsReporting();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac09210f599bcb807168410c46557bda28017b65d5805a1ef1dd59e7a8efd8b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Start sync process\u0022 repeats the code it sits on: 3 of its 3 words (start, sync, process) are already in \u0060this.startSyncProcess();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a4cbf7af3c2e3358e762de43ad60d0ae369f5ba85afdd3f55d4fe8c968199e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Save local index\u0022 repeats the code it sits on: 3 of its 3 words (save, local, index) are already in \u0060await this.saveLocalIndex();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dff3bff09628def01b9b634f8c0c8cffb8787c889ddce9491d99b9480c69e4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize swarm coordination via claude-flow\u0022 repeats the code it sits on: 4 of its 5 words (initialize, swarm, claude, flow) are already in \u0060await runClaudeFlow([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ee149328832672a3b4608c87015b8f2bb266c6d184c8c1d3efafe44ee71ead"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Notify about agent spawn\u0022 repeats the code it sits on: 3 of its 3 words (notify, agent, spawn) are already in \u0060await runClaudeFlow([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cc8766aa8d5f17a17af252ede6331a3cd65fbe470e5e0bef6c0790d8bac051"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Store agent info in swarm memory\u0022 repeats the code it sits on: 4 of its 5 words (store, agent, swarm, memory) are already in \u0060await this.storeInMemory(\u0060swarm/agents/${agentId}\u0060, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f3e020e1d7d9c3bc0b31121b3b4aafeb6c02dbb61588d02845687ec05b58f7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Remove from swarm memory\u0022 repeats the code it sits on: 3 of its 3 words (remove, swarm, memory) are already in \u0060await this.removeFromMemory(\u0060swarm/agents/${agentId}\u0060);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9215a111387a184d37700af6c278f542ccc40a672bbc88ca226325d1b715feda"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Parse data if it\u0027s a string\u0022 repeats the code it sits on: 3 of its 3 words (parse, data, string) are already in \u0060const outputData = typeof output.data === \u0027string\u0027 ? JSON.parse(output.data) : output.data;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/benchmark.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"7662bc758869b11f6114beb0e14109155e42e6401c53967eec65eedc13e60536"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check quality score\u0022 repeats the code it sits on: 3 of its 3 words (check, quality, score) are already in \u0060if (output.quality_score \u0026\u0026 expected.quality_score)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/benchmark.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a84d48064c6caea80c138363a481d21ded29644bb2e984f8f1a69672b98099"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 887, 1046, 1075, 1084, 1140), for example \u0022Extract common patterns from best results\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7581af1787d1dc6b7c940da91a2db4a2ce1569e7ffa0c954eda477defd658b1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022DSPy training and benchmarking\u0022 repeats the code it sits on: 4 of its 4 words (ds, py, training, benchmarking) are already in \u0060export {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/index.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf5d55b4163abd7393d893e1ef56a505c1a2a49757733925c1577d224da5729"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u00224. Data structure operations\u0022 repeats the code it sits on: 3 of its 3 words (data, structure, operations) are already in \u0060console.log(c(\u0027bright\u0027, \u0027\\n4\uFE0F\u20E3 DATA STRUCTURE OPERATIONS\u0027));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/benchmark.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac2e6c66b8a32e4b6a9489793112c31ccf0e1dccf0a316afe490afa40acc7e1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u00225. Cache key generation\u0022 repeats the code it sits on: 3 of its 3 words (cache, key, generation) are already in \u0060console.log(c(\u0027bright\u0027, \u0027\\n5\uFE0F\u20E3 CACHE KEY GENERATION\u0027));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/benchmark.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e4032e275043f9f2b17fcb5f174ee6a841736b54d83bd04cc250da1b0b513d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u00226. Memory stress test\u0022 repeats the code it sits on: 3 of its 3 words (memory, stress, test) are already in \u0060console.log(c(\u0027bright\u0027, \u0027\\n6\uFE0F\u20E3 MEMORY STRESS TEST\u0027));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/benchmark.js"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7d6348405969185efae5b54cf675917bd4618dea7268424cd37862b1de87cb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Extract JSON from response\u0022 repeats the code it sits on: 3 of its 3 words (extract, json, response) are already in \u0060const data = this.extractJsonArray(response);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/events.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f51c149bfcc01404db6ff48ea3213e0d618e7e301b6b74a7582b4d0d7b193a1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Extract JSON from response\u0022 repeats the code it sits on: 3 of its 3 words (extract, json, response) are already in \u0060const data = this.extractJsonArray(response);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e99c1c01f111d31d8c8e3ee471f779a51aad04cf8579151138a3b36d9b0fa3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Extract JSON from response\u0022 repeats the code it sits on: 3 of its 3 words (extract, json, response) are already in \u0060const data = this.extractJsonArray(response);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/timeseries.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0864d7d735eb76f5331af065596935449b755bc13e6d22c1aff9e2bd0dcf7d20"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Skip this fallback provider if no suitable model found\u0022 repeats the code it sits on: 6 of its 7 words (fallback, provider, no, suitable, model, found) are already in \u0060console.warn(\u0060No suitable fallback model found for provider ${provider}\u0060);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/routing/index.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd2d5f7cc7967fff80284ea0b8575327b4d5267170ff6c5d0d014b950172429"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test configuration update\u0022 repeats the code it sits on: 3 of its 3 words (test, configuration, update) are already in \u0060console.log(\u0027\\n2\uFE0F\u20E3 Testing configuration updates...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/test-example.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"89549c1f40c1d9a541bf00efd3bb1cdffa903859ce72ea72ebc78194a1e3c5e3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test type system\u0022 repeats the code it sits on: 3 of its 3 words (test, type, system) are already in \u0060console.log(\u0027\\n3\uFE0F\u20E3 Testing type system...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/test-example.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3d563a462b84f6a8bfcf06cd52539cf6faa3d960c038f35b66a1b338fd005d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 6: API key handling\u0022 repeats the code it sits on: 4 of its 4 words (test, api, key, handling) are already in \u0060console.log(\u0027\\n\uD83D\uDD11 Test 6: API Key Handling\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/tests/manual-install-test.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58cdaef95d71e34a54adeb93977287fda51c9cdb712506fb78db31f6f032554"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 8: Fallback chain configuration\u0022 repeats the code it sits on: 4 of its 4 words (test, fallback, chain, configuration) are already in \u0060console.log(\u0027\\n\uD83D\uDD00 Test 8: Fallback chain configuration\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/tests/manual-install-test.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f70fa3892834df827024757b1adce070c9460abe9d4520b38a24b2e37b074a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Run scalability test\u0022 repeats the code it sits on: 3 of its 3 words (run, scalability, test) are already in \u0060await suite.runScalabilityTest();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.ts"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7683acf1a6f5e2443bd09c992530376b46d0519ffa202e8e64dff863480ea45"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Run cost analysis\u0022 repeats the code it sits on: 3 of its 3 words (run, cost, analysis) are already in \u0060await suite.runCostAnalysis();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.ts"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45df128f4096253c8d9d45ceaa4627cfa5b6e0cb8dd3d942b4e9d6d66df399f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Run quality convergence\u0022 repeats the code it sits on: 3 of its 3 words (run, quality, convergence) are already in \u0060await suite.runQualityConvergence(10);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.ts"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8bfd36094ce1d3f49742d8bf12ff8e0885a32ac3363e8d168ba058b19d7904"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Run diversity analysis\u0022 repeats the code it sits on: 3 of its 3 words (run, diversity, analysis) are already in \u0060await suite.runDiversityAnalysis(5000);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.ts"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"452c1f3605069a6bde01457c605706e4f0901635fddf2cb1b2727af2ecc8b37b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 887, 1046, 1075, 1084, 1140), for example \u0022Extract common patterns from best results\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-learning-session.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc52b62cc8c311e0d5165909eca84eb5ac766f71c7e5b2cfce244bdededa899"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Parse data if it\u0027s a string\u0022 repeats the code it sits on: 3 of its 3 words (parse, data, string) are already in \u0060const outputData = typeof output.data === \u0027string\u0027 ? JSON.parse(output.data) : output.data;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5141c80a777b2f7d13f14402015402428d7c95194f227d68f863d53a4c958a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check quality score\u0022 repeats the code it sits on: 3 of its 3 words (check, quality, score) are already in \u0060if (output.quality_score \u0026\u0026 expected.quality_score)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7568cedcc5b94080f911d481dc585e0fe70314a7aa54a963be3d873a0c3427f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Phase 3: Final evaluation\u0022 repeats the code it sits on: 3 of its 3 words (phase, final, evaluation) are already in \u0060this.emit(\u0027status\u0027, \u0027Phase 3: Final evaluation\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ae08089d4b30da74ad0f4951f1190cd67d3ce0721f012b1f95a4469c148dff"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Parse the generated data\u0022 repeats the code it sits on: 3 of its 3 words (parse, generated, data) are already in \u0060const parsed = this.parseGeneratedData(result.assessment);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a1bf71f150daa51398628905b48cb17a4f65adf6c71fc648dff4a1824d06d3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 10 comments in this file only repeat the code they sit on (lines 114, 118, 122, 126, 130, 191, 224, 259, 406, 433), for example \u0022Phase 1: Baseline Generation\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e27c8fd3b96372032d9b555aa2b69917a69a5820cd97d015fc3da85ac798542"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Phase 2: Learning Loop\u0022 repeats the code it sits on: 3 of its 3 words (phase, learning, loop) are already in \u0060console.log(\u0027\\n\uD83E\uDDE0 Phase 2: Learning Loop (5 generations)\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-training-fixed.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7bd2a08ed765fa8c15662b0b83fc8de2fcea4369f5dcf73078bcc828f7cce8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Phase 4: Final Optimized\u0022 repeats the code it sits on: 3 of its 3 words (phase, final, optimized) are already in \u0060console.log(\u0027\\n\uD83C\uDFAF Phase 4: Final Optimized Generation\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-training-fixed.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b8a35d18418bbbd5015499514c0b7c898215c058ba4eb72e5a2ab69d010853"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test dspy.ts import\u0022 repeats the code it sits on: 4 of its 4 words (test, dspy, ts, import) are already in \u0060console.log(\u00271. Testing dspy.ts import...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/test-benchmark-import.cjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4306b93f2fc9cfac891002e431ebc560243891752809ddaec7a29073eaa948"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test PredictModule\u0022 repeats the code it sits on: 3 of its 3 words (test, predict, module) are already in \u0060const predict = new dspy.PredictModule({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/test-benchmark-import.cjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfe1efdc5e210b40d66a1ad35eeee93ddd7607439652945beb447defd029f11"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test ChainOfThought\u0022 repeats the code it sits on: 3 of its 3 words (test, chain, thought) are already in \u0060const cot = new dspy.ChainOfThought({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/test-benchmark-import.cjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"877cc27a31cd32116e64693309f86f975572a827bc22d32a29600d4d075c04f7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022World Cup patterns\u0022 repeats the code it sits on: 3 of its 3 words (world, cup, patterns) are already in \u0060this.historicalPatterns.set(\u0027world-cup-final\u0027, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/burst-predictor.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96b49dc8afd7792744a02c6d748d4dc514ff7e2b382aa92ccf0fe3840954351"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize region capacities\u0022 repeats the code it sits on: 3 of its 3 words (initialize, region, capacities) are already in \u0060this.initializeRegionCapacities(regions);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/capacity-manager.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f6cca4d2a2c5f52f1ba1abe71a0aa7efee5521c6035fad9a6d2654127da636"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check budget before scaling out\u0022 repeats the code it sits on: 3 of its 3 words (check, budget, scaling) are already in \u0060const canScale = await this.checkBudgetForScaling(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/capacity-manager.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1478e331ec6e9cd3231b7afbffe9c14d9dfc26d3d11d4373001e93bcfcd3907c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 7 comments in this file only repeat the code they sit on (lines 49, 52, 149, 197, 323, 332, 344), for example \u0022Load event calendar\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/index.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b76cd878bea73568b386828be5bfe820386ae332e74736c9c610cd7349e806"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check CPU utilization\u0022 repeats the code it sits on: 3 of its 3 words (check, cpu, utilization) are already in \u0060if (metrics.cpuUtilization \u003E this.thresholds.cpuScaleOut)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/reactive-scaler.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aca16d5fd93b4e4dcc70b0abf4954a3326065249d9054b6d76ccaad1f4928c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check memory utilization\u0022 repeats the code it sits on: 3 of its 3 words (check, memory, utilization) are already in \u0060if (metrics.memoryUtilization \u003E this.thresholds.memoryScaleOut)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/reactive-scaler.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecea32558984060bef61e60b31b76f519f53ab2332a03fd6cb8ecc96f48dfe6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check error rate\u0022 repeats the code it sits on: 3 of its 3 words (check, error, rate) are already in \u0060if (metrics.errorRate \u003E this.thresholds.errorRateThreshold)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/reactive-scaler.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"194499b02d9cd43c149d204b22307a8a6190fa314f2fc7a7c013680cd93f4d2a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find replacement with same type\u0022 repeats the code it sits on: 3 of its 3 words (find, replacement, type) are already in \u0060const replacement = Object.values(this.data.agents).find(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b008a2e123646abae738825da7cecc86e89ee795d687703cfd256ea2b7e65f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Register async agent\u0022 repeats the code it sits on: 3 of its 3 words (register, async, agent) are already in \u0060intel.swarmRegister(agentId, \u0027async-subagent\u0027, [\u0027parallel\u0027, \u0027autonomous\u0027]);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5081f8f77f5d049c804629ec00fa0fd776bdcc235cb9b6e869eb2508b49b2a6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Queue size check\u0022 repeats the code it sits on: 3 of its 3 words (queue, size, check) are already in \u0060if (this.requestQueue.size() \u003E= this.config.priorityQueueSize)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/load-balancer.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e758c1dce8d7388491bb68bcc424ea15af3bf83c73e4012cb0011467cbe2d7f2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check query plan cache\u0022 repeats the code it sits on: 4 of its 4 words (check, query, plan, cache) are already in \u0060let plan = filters ? queryPlanCache.getPlan(filters) : null;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfd0c426cec29a36a8660bced6ca9e1682e02c44588c7893cf488047398f49c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Route through load balancer\u0022 repeats the code it sits on: 3 of its 3 words (route, load, balancer) are already in \u0060const routed = await this.loadBalancer.route(collection, query);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb7cf203da4b9a1741152f05d1cf0667d0a639cb0a903e885bb471df77d03d9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Query result interface\u0022 repeats the code it sits on: 3 of its 3 words (query, result, interface) are already in \u0060interface QueryResult\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"534fe9fac80eb404e50049a47fc1c605ffac226b45428fb10c334dfe4176c7b7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Connection pool interface\u0022 repeats the code it sits on: 3 of its 3 words (connection, pool, interface) are already in \u0060interface PoolConnection\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0c8a1df46cb4a5b29adb9d5e34223d6e20b28ef82ce01d134aba76aca8407a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find available connection\u0022 repeats the code it sits on: 3 of its 3 words (find, available, connection) are already in \u0060const available = this.connections.find(conn =\u003E !conn.inUse);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b138f0017729e743eec7f64dd0beabd14d3d49112d8bb15abb50e5874992418"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check deny patterns\u0022 repeats the code it sits on: 3 of its 3 words (check, deny, patterns) are already in \u0060if (actionPerm.denyPatterns \u0026\u0026 request.target)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cognitum-gate-wasm/src/index.ts"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a102b77fcbda3b45cc18ebc2f11158470e0753b32254b9145c3c19655309e2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate relationships between entities\u0022 repeats the code it sits on: 3 of its 3 words (generate, relationships, entities) are already in \u0060const relationships = await this.generateRelationships(entities, options);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/knowledge-graph.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a7f621db055fc8bafe3385e152a8deeca02e26bfd7304b52cf9bcac2ac24f5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 10 comments in this file only repeat the code they sit on (lines 7, 15, 25, 38, 49, 59, 69, 79, 85, 96), for example \u0022Graph node schema\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/schemas/index.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6890c9d4b7b25eb6d557060bce1bcc08173c9364cc725fd9f1a38a29f982d708"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 7 comments in this file only repeat the code they sit on (lines 61, 79, 98, 119, 142, 171, 184), for example \u0022Benchmark 1: Node Creation\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-node/benchmark.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef25993bfe83facd014122e744c5454b86d7d50d74e63910091b5b3eadb2189"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Copy the .node file\u0022 repeats the code it sits on: 3 of its 3 words (copy, node, file) are already in \u0060fs.copyFileSync(nodeFile, path.join(tmpDir, \u0027ruvector-graph.node\u0027));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-node/scripts/publish-platforms.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"420e2b059806b6dad06bb2d258e7f62fd3ad83cdbebb1e0b6db64a8967609a37"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 1: Version and hello\u0022 repeats the code it sits on: 3 of its 3 words (test, version, hello) are already in \u0060console.log(\u00271. Testing version and hello functions:\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-node/test.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b30aa6bd1580ca3890e9ec3c0e3772ee9454d2c98217a8ee337cfaa68f3913"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 10: Transactions\u0022 repeats the code it sits on: 3 of its 3 words (test, 10, transactions) are already in \u0060console.log(\u002710. Testing transactions:\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-node/test.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d0b6baf7c9330e5508d2ca75aa571e4d0ea9cbcfefe3c1760ceb6b847b1387"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 11: Batch insert\u0022 repeats the code it sits on: 4 of its 4 words (test, 11, batch, insert) are already in \u0060console.log(\u002711. Testing batch insert:\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-node/test.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8072d63b76dc192380ec2096297da15230d700140606ebef893daa10ed36bf2b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 12: Persistence\u0022 repeats the code it sits on: 3 of its 3 words (test, 12, persistence) are already in \u0060console.log(\u002712. Testing persistence:\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-node/test.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"85947c5bd39bfade362b3580d36e0b52bfefa86786e726a1f05759c4d84bdae7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Install PostgreSQL and dev files\u0022 repeats the code it sits on: 4 of its 5 words (install, postgre, sql, files) are already in \u0060spinner.text = \u0060Installing PostgreSQL ${pgVersion} and development files...\u0060;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"853a17545defd137eb4d9744fc1cc43ff89c66ac81f99147e733667fe0b62d17"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Wait for PostgreSQL to be ready\u0022 repeats the code it sits on: 4 of its 4 words (wait, postgre, sql, ready) are already in \u0060const readySpinner = ora(\u0027Waiting for PostgreSQL to be ready...\u0027).start();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6495ed267652b94b93b8e21e3364408273ca499d797ef0077d151f547f5359"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if we can vote for this candidate\u0022 repeats the code it sits on: 3 of its 3 words (check, vote, candidate) are already in \u0060const canVote =\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/node.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2700342567dd36409643b9ce7d38db87e486e1482606659edac1c3f95e5e2c33"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if log contains entry at prevLogIndex with prevLogTerm\u0022 repeats the code it sits on: 7 of its 7 words (check, log, contains, entry, prev, index, term) are already in \u0060if (request.prevLogIndex \u003E 0 \u0026\u0026 !this.state.log.containsEntry(request.prevLogIndex, request.prevLogTerm))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/node.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65e6b10e22f15e188ec7226c6c52c6d1c5f64b5d7e24e8a92b413ea4b309338"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Load native module\u0022 repeats the code it sits on: 3 of its 3 words (load, native, module) are already in \u0060const native = loadNativeModule();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/router/index.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6f12177031ac83df7b35b6ab6779ca6fa4f00fd48fe7fcdb42a4c968b524e2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test routeWithEmbedding\u0022 repeats the code it sits on: 3 of its 3 words (test, route, embedding) are already in \u0060const results = semanticRouter.routeWithEmbedding(testEmbedding, 1);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/router/test.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c618aa09c26c17aa5b4a512a0f9293e0ebdf27358196598fad077736182f398a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Normalize and resolve base path\u0022 repeats the code it sits on: 4 of its 4 words (normalize, resolve, base, path) are already in \u0060this.basePath = resolve(normalize(basePath));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/node.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d188d9c10e249d1e92ac1ea334d1902db6e0be7ce20938222494d23e37bb91"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Stop API server\u0022 repeats the code it sits on: 3 of its 3 words (stop, api, server) are already in \u0060await this.stopApiServer();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6e7102bc096b0fd6b027fbff54dbf703dbbd24a18df81732fc749a153ae695"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add system prompt from agent config\u0022 repeats the code it sits on: 4 of its 5 words (system, prompt, agent, config) are already in \u0060if (agent.config.systemPrompt)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b7f7ccb2c0fc211281a9aa04fc97a90bb3d2601cd1ce8783e32e71e3d8d212"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Call LLM provider\u0022 repeats the code it sits on: 3 of its 3 words (call, llm, provider) are already in \u0060const completion = await this.llmProvider.complete(messages, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dcaf215833d11312ad2ae27793b04f430410642f47d70596affed8874e957b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Base adapter and types\u0022 repeats the code it sits on: 3 of its 3 words (base, adapter, types) are already in \u0060export {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/index.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"66210bedf0cc448299ff5f4f1751d6e07fe1f860d4296904d432ff3358a7d99c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test channel connection\u0022 repeats the code it sits on: 3 of its 3 words (test, channel, connection) are already in \u0060channels\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/channels.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27cc25cd09628cae12c0645906625436808812fc091340da15c4cd11de58444"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check LLM providers\u0022 repeats the code it sits on: 3 of its 3 words (check, llm, providers) are already in \u0060results.push(...await checkLLMProviders());\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"db86066b043c3ca01617abd4b87d0ec86caac6055f0843d1accae1c251884f71"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check memory system\u0022 repeats the code it sits on: 3 of its 3 words (check, memory, system) are already in \u0060results.push(await checkMemorySystem());\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a326966c716019269838d4e3a74d22dea857ae6b16928ec6f3739c4962a4d848"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check disk space\u0022 repeats the code it sits on: 3 of its 3 words (check, disk, space) are already in \u0060results.push(await checkDiskSpace());\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b65b69b9b243476d19bb17ab03f384142a928fff31327f0c4421e284880df8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Show template details\u0022 repeats the code it sits on: 3 of its 3 words (show, template, details) are already in \u0060templates\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/templates.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c31ab6d79339d87f9c162d877a6fe65eddaba56f0a6bfd13f5bbcc007d93db"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate deployment commands\u0022 repeats the code it sits on: 3 of its 3 words (generate, deployment, commands) are already in \u0060const commands = generateDeploymentCommands(template, options);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/templates.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b3e4c3dd6e4ebf063cc74daa4af64fd0889fca19caaca04b3e5ee2283051c7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write config file\u0022 repeats the code it sits on: 3 of its 3 words (write, config, file) are already in \u0060await fs.writeFile(\u0027ruvbot.config.json\u0027, JSON.stringify(config, null, 2));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/index.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cbca71d0e6751bc7f56fa06431fb7d05ee33a9da2bf5f3432a8dd95b2bc002"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Call wildcard handlers\u0022 repeats the code it sits on: 3 of its 3 words (call, wildcard, handlers) are already in \u0060const wildcardHandlers = this.eventHandlers.get(\u0027*\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/BotState.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9bf3c6d5200b041292bc16e032484afbc0771062c10c9d878c1e6c896775fe"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Chat adapter interface\u0022 repeats the code it sits on: 3 of its 3 words (chat, adapter, interface) are already in \u0060export interface ChatAdapter\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integrations/index.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1bb98a5af597fa25752274980bdafed329ea4f2114ee284c09233e75031094"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Slack adapter options\u0022 repeats the code it sits on: 3 of its 3 words (slack, adapter, options) are already in \u0060export interface SlackAdapterOptions\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integrations/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"984294a2246844dda004a871c60bc2fbc3e015785a3a0560ba14543312aea868"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Discord adapter options\u0022 repeats the code it sits on: 3 of its 3 words (discord, adapter, options) are already in \u0060export interface DiscordAdapterOptions\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integrations/index.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"396acb7d77c689467a0c6d4c5f86a4c806e16d1d0fe6ff5647c495c7bc99c1ca"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Use fallback embedder if no WASM available\u0022 repeats the code it sits on: 5 of its 6 words (fallback, embedder, no, wasm, available) are already in \u0060console.warn(\u0027No WASM module available, using fallback embedder\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/embeddings/WasmEmbedder.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e06b9b1a15f47f9f99edcd6d8e8827ee989b213d8b99956931220e9499689c9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Sort by score and return top K\u0022 repeats the code it sits on: 4 of its 4 words (sort, score, return, top) are already in \u0060return Array.from(scores.entries())\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/search/BM25Index.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acc2dfec464eaf94aa2f077e0e1e4c02e265c914731b1eb442d384403c23460"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Sort by fused score\u0022 repeats the code it sits on: 3 of its 3 words (sort, fused, score) are already in \u0060return fusedResults.sort((a, b) =\u003E b.fusedScore - a.fusedScore);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/search/HybridSearch.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"534604ca7235a78315d156067580523583f626631a786081ea0a0470389b9988"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize ChatEnhancer with skills and memory\u0022 repeats the code it sits on: 4 of its 5 words (chat, enhancer, skills, memory) are already in \u0060chatEnhancer = createChatEnhancer({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/server.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f22360aaacfadf4ea8c71c45875c581bf1a89bda2d77856cc0983062d5cc71"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Execute skill generator\u0022 repeats the code it sits on: 3 of its 3 words (execute, skill, generator) are already in \u0060const generator = skill.execute(context, params);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/SkillExecutor.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9817cc7471257ff517434aa70e0ab99266493be5c375049a09b9fd75188b25"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Priority order: critical \u003E high \u003E normal \u003E low\u0022 repeats the code it sits on: 5 of its 6 words (priority, critical, high, normal, low) are already in \u0060const priorities: WorkerPriority[] = [\u0027critical\u0027, \u0027high\u0027, \u0027normal\u0027, \u0027low\u0027];\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"339f2eae75d321606916d5a88097eb8cb45b1b9549c5e79ae6fbdd712e7b9b9e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 25, 114, 131, 143, 155), for example \u0022Mock Skill Executor\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/e2e/skills/skill-execution.test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d2a35e1ab7a7e309402295bec9692a0520f4ea328003bb138b5310b3cc97d1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock Task Manager\u0022 repeats the code it sits on: 3 of its 3 words (mock, task, manager) are already in \u0060class MockTaskManager\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/e2e/tasks/long-running-tasks.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9179afc6022e13b2143e1005582db7b12678d327c2a3b80e1971e6b653302eb3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Slack Event Fixtures\u0022 repeats the code it sits on: 3 of its 3 words (slack, event, fixtures) are already in \u0060export const slackFixtures = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/fixtures/index.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"753995e63a48fcc8e892ef3b08faf166be09d7a9f57ac65790b9e15633799b96"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Seed tenant 1 data\u0022 repeats the code it sits on: 3 of its 3 words (seed, tenant, data) are already in \u0060await manager.seedTenantData(tenant1.id, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/integration/multitenancy/isolation.test.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e202699af854590c3ff9578e5c900af1e0a1724d045636adae1c7509b3ba9ca9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Seed tenant 2 data\u0022 repeats the code it sits on: 3 of its 3 words (seed, tenant, data) are already in \u0060await manager.seedTenantData(tenant2.id, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/integration/multitenancy/isolation.test.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f88db51685f691d93f67e564c86a68cbe6422e2a3e0842f4f3d49b4e8ab689"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Destroy tenant context\u0022 repeats the code it sits on: 3 of its 3 words (destroy, tenant, context) are already in \u0060await manager.destroyTenantContext(tenant1.id);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/integration/multitenancy/isolation.test.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bab53812c6f7e14bc95c1acd00862c7020b10ca52a5d2bb5ccc8af6a5241c5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Extract path params\u0022 repeats the code it sits on: 3 of its 3 words (extract, path, params) are already in \u0060ctx.request.params = this.extractParams(route.handler.toString(), request.path);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/api/endpoints.test.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58de33a170e19c621fd43ab5b2d44359fb5688dab448d87b3f4bc6b81cce9c0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if error is retryable\u0022 repeats the code it sits on: 3 of its 3 words (check, error, retryable) are already in \u0060if (!this.isRetryableError(error))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56998fd2a3114206a162ac761e403554cc83c950316b4c9ccafad44a02a0e39"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Search VectorDB\u0022 repeats the code it sits on: 3 of its 3 words (search, vector, db) are already in \u0060const results = await db.search({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"219782ad5415d82d0af963aafed456b1b4cd5db9c24f9b93c4296deb91ad9c47"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create constraint for unique IDs\u0022 repeats the code it sits on: 4 of its 4 words (create, constraint, unique, ds) are already in \u0060cypher \u002B= \u0027// Create constraint for unique node IDs\\n\u0027;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e363f815e41257e6dd189039f52fc5329a61e0c23b978541fa2ae52e9399de"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Reconstruct state at both versions\u0022 repeats the code it sits on: 3 of its 3 words (reconstruct, state, versions) are already in \u0060const fromState = await this.reconstructStateAt(fromVersionId);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e15136babc7d98d77f3acfb1dda8dfeb42c7d6f7e5ae9db74be9fc215abd7a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Reconstruct state at target version\u0022 repeats the code it sits on: 4 of its 4 words (reconstruct, state, target, version) are already in \u0060const targetState = await this.reconstructStateAt(versionId);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bc6232466fa3d40f4746d64c3696993a13847737defbdfcb10a523bd0eb80e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate changes from current to target\u0022 repeats the code it sits on: 4 of its 4 words (generate, changes, current, target) are already in \u0060const revertChanges = this.generateDiff(this.currentState, targetState, \u0027\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9add3b7d93409a2a667dd4d2632507da4bebfbba3ca3f8c7caa399d70b25fac7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the source node\u0022 repeats the code it sits on: 3 of its 3 words (get, source, node) are already in \u0060const sourceVector = await this.db.get(nodeId);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3dc67bf096452df78c900ff1c60c7fe5ab5075f673cdae0ecbabcd5e9fad02"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update connection status\u0022 repeats the code it sits on: 3 of its 3 words (update, connection, status) are already in \u0060this.updateConnectionStatus(\u0027connecting\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/app.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba99661623c78c05579763537b15b770e6a1c06f9f1297a78b117f090743d21"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find import specifiers\u0022 repeats the code it sits on: 3 of its 3 words (find, import, specifiers) are already in \u0060const specifiers = this.findChild(node, \u0027import_clause\u0027) || node;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fe7f939d1a119a2e5fd7a8bd398d549c17c15b6a279800bab549e51f570f13"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize FastAgentDB for episode storage\u0022 repeats the code it sits on: 5 of its 6 words (fast, agent, db, episode, storage) are already in \u0060this.agentDb = new FastAgentDB(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf6759916399526df6d0ac742ad9962f226a19c6c80f633bdf328ffe5ef50cb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Calculate drift from baseline\u0022 repeats the code it sits on: 3 of its 3 words (calculate, drift, baseline) are already in \u0060const drift = this.calculateDrift(emb, this.baseline);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bce476fe5882d5d163f51ac4a3034f145a6bd6e4a4dd7ca5c7f585e869f7160"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Acquire buffer from pool\u0022 repeats the code it sits on: 3 of its 3 words (acquire, buffer, pool) are already in \u0060const buffer = this.bufferPool.acquire(this.dimension);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-perf.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9be1eeed8630d50e1d375c574fa2b2465a41b87dec9801e5e9914e3b64fa36"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create embedder with config\u0022 repeats the code it sits on: 3 of its 3 words (create, embedder, config) are already in \u0060const embedderConfig = new wasmModule.WasmEmbedderConfig()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx-embedder.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"62db2a749cb9d2dfdca08c0eeb3e2c1fb5446345cb3defacb615350455221879"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Each worker searches its shard\u0022 repeats the code it sits on: 3 of its 3 words (worker, searches, shard) are already in \u0060const shardResults = await Promise.all(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-intelligence.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0952c364798e7de152c04f2cea300d04d58872e30e37396bbcbd2f7e295b42c1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Infer purpose from context\u0022 repeats the code it sits on: 3 of its 3 words (infer, purpose, context) are already in \u0060const purpose = inferPurpose(declaration, contextStrings, renames);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3ee49571ad9983677aa643485b6a3d6dd8ce99ebf0281f1a5a119e8c8f4a79"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Single embedding benchmark\u0022 repeats the code it sits on: 3 of its 3 words (single, embedding, benchmark) are already in \u0060const singleResult = await runBenchmark(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed6923ee7461ea42724259ad123df0adafb9e7ab7fa0ef9550c32b9d3b8f996"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022File discovery phase only\u0022 repeats the code it sits on: 4 of its 4 words (file, discovery, phase, only) are already in \u0060const discoveryWorker = new NativeWorker({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f184e37dc174fda38e48299d149fce78765898e3483f401f93f5c18df5d0f9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Pattern extraction phase\u0022 repeats the code it sits on: 3 of its 3 words (pattern, extraction, phase) are already in \u0060const patternWorker = new NativeWorker({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04fe0eaea74f9a371eeb61e80aa89bb1b33ac76f913feef03d7e74c4f91096a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Simple pattern matching for *.ext patterns\u0022 repeats the code it sits on: 4 of its 5 words (pattern, matching, ext, patterns) are already in \u0060const ext = pattern.match(/\\*\\.(\\w\u002B)$/)?.[1];\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b56ac76c639bc38731e04418ec3cac7664e0e7e085a3db1ccb8a407fe8dd158"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 7 comments in this file only repeat the code they sit on (lines 68, 108, 178, 211, 258, 308, 336), for example \u0022Array conversion benchmarks\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/benchmark-gnn.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8e3e430a4379587c7bea4fc0391e78f897df8730e0a026996cd38570ae4b20"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Pre/Post hooks\u0022 repeats the code it sits on: 3 of its 3 words (pre, post, hooks) are already in \u0060console.log(\u0027\\n--- Pre/Post Edit Hooks ---\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/benchmark-hooks.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fa2eaed63228c121a84fa6302944159f85b393b1c3a06f5846be9ec47444d9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Pre/Post command hooks\u0022 repeats the code it sits on: 4 of its 4 words (pre, post, command, hooks) are already in \u0060console.log(\u0027\\n--- Pre/Post Command Hooks ---\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/benchmark-hooks.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be12a28693166cd19e994dfd0d7dbd94c79168b7022054935ca21a974209020"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 3: Type definitions\u0022 repeats the code it sits on: 3 of its 3 words (test, type, definitions) are already in \u0060console.log(\u0027\\n3. Testing TypeScript type definitions...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/integration.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd231b17aea4b1731028a23e64d4f88abc479687628240a714f4c62a2f567c5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 4: Package structure\u0022 repeats the code it sits on: 3 of its 3 words (test, package, structure) are already in \u0060console.log(\u0027\\n4. Testing package structure...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/integration.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0531753a668c51a0a3fbd447743bc062605688247471a712114d00237f4977d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 5: CLI functionality (basic)\u0022 repeats the code it sits on: 4 of its 4 words (test, cli, functionality, basic) are already in \u0060console.log(\u0027\\n5. Testing CLI basic functionality...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/integration.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d54f0873933220fb370a00329e9431a328b076f44a9c8e458be3af1984122e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Validate wrong type\u0022 repeats the code it sits on: 3 of its 3 words (validate, wrong, type) are already in \u0060const wrongType = toolSchemas.validateToolCall(\u0027Read\u0027, { file_path: 123 });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/optimizer.test.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f528b362e5daf31c484358e6f1c30265a18801afbf9b7be27b85b17503df990"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 1: Package structure\u0022 repeats the code it sits on: 3 of its 3 words (test, package, structure) are already in \u0060console.log(\u0027\\n1. Testing package structure...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/standalone-test.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ac337f28131780339d496ebe3a18f6ad3d18d99c24d85469c8ec90ad7543f7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 2: Type definitions\u0022 repeats the code it sits on: 3 of its 3 words (test, type, definitions) are already in \u0060console.log(\u0027\\n2. Testing TypeScript type definitions...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/standalone-test.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f0c4aeff7b1fe6e27ace86a0224195745c1c6f00c75ec463fb93e99b786711"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 4: CLI structure\u0022 repeats the code it sits on: 3 of its 3 words (test, cli, structure) are already in \u0060console.log(\u0027\\n4. Testing CLI structure...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/standalone-test.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"834c0b0ddb2c83650e0677694c1d71295527b6642c0cba235e1ad2bf40214957"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 5: Smart loader logic\u0022 repeats the code it sits on: 4 of its 4 words (test, smart, loader, logic) are already in \u0060console.log(\u0027\\n5. Testing smart loader logic...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/test/standalone-test.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9875fc0ff8124a926b3a0b3f5e5a446800e9fa9315e31d7a90d5ff5219b2075e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check models exist\u0022 repeats the code it sits on: 3 of its 3 words (check, models, exist) are already in \u0060if (!existsSync(QWEN_MODEL))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/real-model-compare.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9488c23bde199947349ee5c547f880c5ab7e8061cdc703d9b5af09a297364b5d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Agent definitions with Claude Code context\u0022 repeats the code it sits on: 4 of its 5 words (agent, claude, code, context) are already in \u0060const CLAUDE_CODE_AGENTS = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-code-synth.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c2ccf9944ee4abdda842251e4e865dcc142d2e6bba8980f97054daa2e50ec1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Prompt for hard negatives\u0022 repeats the code it sits on: 3 of its 3 words (prompt, hard, negatives) are already in \u0060const HARD_NEGATIVE_PROMPT = \u0060You are generating hard negative examples for contrastive learning in an AI agent routing  \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-code-synth.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"576b30aefa9b74b6bf3ffdd768ffff9af815adfde077caab70a038c899212172"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check for API key\u0022 repeats the code it sits on: 3 of its 3 words (check, api, key) are already in \u0060if (!process.env.GEMINI_API_KEY)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-code-synth.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4c902c18cf7e592928b1192450b3aba0873c282a47a68adbdc77bd37058001"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get hard negatives (confusing agents)\u0022 repeats the code it sits on: 4 of its 5 words (hard, negatives, confusing, agents) are already in \u0060const hardNegatives = example.confusing_with\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a388a0af9e927272f5422f41f8675a7f205cf511d4b2c953d3599baf25b019"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate LoRA config\u0022 repeats the code it sits on: 4 of its 4 words (generate, lo, ra, config) are already in \u0060const loraConfig = generateLoRAConfig(CONFIG.outputPath);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b6bf1a65bd6eea44a824ad22052d5197a8fe370e58710776edc73fa4e449e3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate training script\u0022 repeats the code it sits on: 3 of its 3 words (generate, training, script) are already in \u0060const scriptPath = generateTrainingScript(CONFIG.outputPath);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"225cfaec3ef9afe827414aaac2a8a1bbb634ddcedfe0d9e4df7d71795634f300"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test similarity pairs\u0022 repeats the code it sits on: 3 of its 3 words (test, similarity, pairs) are already in \u0060for (const pair of SIMILARITY_TEST_PAIRS)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/benchmarks/embedding-benchmark.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9496c329e9636deca45d1c6643b50f3e8de08ad1ceebef093b3fbf37d91f33"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Sort by success rate and return top k\u0022 repeats the code it sits on: 4 of its 5 words (sort, success, rate, return) are already in \u0060return allPatterns\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/federated.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5ec6506119de5b89aabe0828c970cbdd2597a41f7754bf3f7399bd27151b65"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Apply dropout during training (simplified check)\u0022 repeats the code it sits on: 4 of its 5 words (apply, dropout, training, check) are already in \u0060const applyDropout = this.trainingState !== null \u0026\u0026 this.config.dropout \u003E 0;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81daa0821ba072d67c59eda14a49b89bec0d9cc2a0c77094a8dd2604fbc472d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create write stream\u0022 repeats the code it sits on: 3 of its 3 words (create, write, stream) are already in \u0060const fileStream = createWriteStream(tempPath);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/models.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7beda79728b21863ab663e727d83c44fd20d0a4d2138b91bf77018215a428ba"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add memory benchmark\u0022 repeats the code it sits on: 3 of its 3 words (add, memory, benchmark) are already in \u0060benchmarks.push(benchmark(\u0027addMemory\u0027, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/test/benchmark.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2413d0e02b677c8d9c9491832d9fde62f9ac1a85c070da29abb49611a345c57c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022List of open stores\u0022 repeats the code it sits on: 3 of its 3 words (list, open, stores) are already in \u0060this.mcp.resource(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/server.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee569b90ac85f73ca0ad3c4b7c180e6c581dd8ebb6a0c858418b2ed83b089a9a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test 1: Import/export validation\u0022 repeats the code it sits on: 4 of its 4 words (test, import, export, validation) are already in \u0060console.log(\u0027Test 1: Import/export validation\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-solver/test/solver.test.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1319119bac303bdf093a8e4ba33d976f073df3b6538c756d10d194c9397d28d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Verify AcceptanceModeResult interface\u0022 repeats the code it sits on: 4 of its 5 words (acceptance, mode, result, interface) are already in \u0060assert(dtsContent.includes(\u0027interface AcceptanceModeResult\u0027), \u0027AcceptanceModeResult interface should be defined\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-solver/test/solver.test.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5981ae1bba0bee179e5da64c99317494a022821ea4d6aa59bbffa4da0d4a6e8d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Verify SkipModeStats interface\u0022 repeats the code it sits on: 4 of its 5 words (skip, mode, stats, interface) are already in \u0060assert(dtsContent.includes(\u0027interface SkipModeStats\u0027), \u0027SkipModeStats interface should be defined\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-solver/test/solver.test.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faeaea7ef2990beaf3eed250978aa710626b61c37e73997f9538c68fad8f638"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test TypeScript types compatibility\u0022 repeats the code it sits on: 4 of its 5 words (test, type, script, types) are already in \u0060test(\u0027Integration - TypeScript Types\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/integration/cross-package.test.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bad5bc8644513f3ec675b6951ab8e146054431f6f38a38d7f0843a0a01a8c4d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test memory usage\u0022 repeats the code it sits on: 3 of its 3 words (test, memory, usage) are already in \u0060test(\u0027Performance - Memory Usage\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/performance/benchmarks.test.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2a121155fe8ea67055730dd773354af5c306b5b9f4543270b8c0f1a91f3ab7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test backend comparison\u0022 repeats the code it sits on: 3 of its 3 words (test, backend, comparison) are already in \u0060test(\u0027Performance - Backend Comparison\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/performance/benchmarks.test.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a3e98b1aeed9997cf4ee9fc02fb37545177ca2722b9a12f18c72ff6a83a89e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 8 comments in this file only repeat the code they sit on (lines 29, 49, 75, 118, 140, 192, 239, 262), for example \u0022Test CLI availability\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/cli.test.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b1609bb26bb83a8272066fa17f21a63f12c738c41c4a5b390080f6b4ce628e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test vector operations\u0022 repeats the code it sits on: 3 of its 3 words (test, vector, operations) are already in \u0060test(\u0027@ruvector/core - Vector Operations\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/core.test.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba96ec9c582e08c7025f9b93946ec4355d0de7d9bb76d471ad6112b196db339"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test search operations\u0022 repeats the code it sits on: 3 of its 3 words (test, search, operations) are already in \u0060test(\u0027@ruvector/core - Search Operations\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/core.test.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"61626c1c5592fc15b6b1b1b1dd0068eee81e615488d2759e88c4b582776cb704"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test delete operations\u0022 repeats the code it sits on: 3 of its 3 words (test, delete, operations) are already in \u0060test(\u0027@ruvector/core - Delete Operations\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/core.test.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6435e08aeac8fdf92351612806fd9430b7f2980d772dc4ac0a8d81d20d91dd8c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test get operations\u0022 repeats the code it sits on: 3 of its 3 words (test, get, operations) are already in \u0060test(\u0027@ruvector/core - Get Operations\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/core.test.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"27afaa76a603b460226f20346e1cfdb71da86dee2079588de37101be5176f7f0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test VectorIndex creation\u0022 repeats the code it sits on: 4 of its 4 words (test, vector, index, creation) are already in \u0060test(\u0027ruvector - VectorIndex Creation\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/ruvector.test.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dcb15cdddc6435563e9a6680076e1236d2b8e21d67334defad9cc88f46cb49"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test vector operations\u0022 repeats the code it sits on: 3 of its 3 words (test, vector, operations) are already in \u0060test(\u0027ruvector - Vector Operations\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/ruvector.test.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdd165064bd9c4cb7e540ba9428cf306ce264ca1f3baead3174c46428f75783"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test search operations\u0022 repeats the code it sits on: 3 of its 3 words (test, search, operations) are already in \u0060test(\u0027ruvector - Search Operations\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/ruvector.test.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ac722bfc51159274bb333c0886f8c12369a56dd667eb60a9b624daf3131299"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test delete and get operations\u0022 repeats the code it sits on: 4 of its 4 words (test, delete, get, operations) are already in \u0060test(\u0027ruvector - Delete and Get Operations\u0027, async (t) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/ruvector.test.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2c37a3c427fbd388284752602abc8c1d9c1728d4709079f82dcc991595b940"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 7 comments in this file only repeat the code they sit on (lines 9, 34, 73, 147, 204, 234, 266), for example \u0022Test WASM module loading\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/unit/wasm.test.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d11af5b87dd2d5f9cd9cea5a3571ba024d21bba70aad66823dc75134750bd34"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u0022cancer detection\u0022 is in ultrasound.blockedClaims.\u0022 repeats the code it sits on: 4 of its 5 words (cancer, detection, ultrasound, claims) are already in \u0060assert.equal(gateClaim(ultrasound, \u0022ultrasound cancer detection\u0022).allowed, false);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/test/evidenceGate.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e94421c554375cffe3b0c7e0e822c5630532a1af6e277f4ff0cb76ed668046c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Benign vs malignant by site\u0022 repeats the code it sits on: 4 of its 4 words (benign, vs, malignant, site) are already in \u0060lines.push(\u0022### 3.3 Benign vs Malignant Concentration by Site\\n\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-ham10000.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0904bb2d885e9a2d2a9538c46ac899e52fa70dbc5cc9270a4a75dd5e06c0a72"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022BCC vs Melanoma overlap\u0022 repeats the code it sits on: 4 of its 4 words (bcc, vs, melanoma, overlap) are already in \u0060lines.push(\u0022### 5.2 BCC vs Melanoma Demographic Overlap\\n\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-ham10000.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"058560dbc4dd43396121c0fcfd8070c9e6a400899d02cb3bd0a99c0cd6e18d53"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Age-stratified risk\u0022 repeats the code it sits on: 3 of its 3 words (age, stratified, risk) are already in \u0060lines.push(\u0022### 5.3 Age-Stratified Risk Matrix\\n\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-ham10000.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ce90862d6be347af8dd8370b70e7be45d72b695a3ae61f5ae12e5f4eb32376"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Combined high-risk profiles\u0022 repeats the code it sits on: 4 of its 4 words (combined, high, risk, profiles) are already in \u0060lines.push(\u0022### 5.5 Combined High-Risk Profiles\\n\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-ham10000.js"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab85dcd5e083b066d762bcc673f828ed509bee79aaa2433c83110da246e1c7a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create the RVF database\u0022 repeats the code it sits on: 3 of its 3 words (create, rvf, database) are already in \u0060const db = RvfDatabase.create(outputRvf, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/rvf-builder.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a2752561e278167239734ebbb7bd31105c06408c43192bab2a85da3febc8e1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Build witness chain\u0022 repeats the code it sits on: 3 of its 3 words (build, witness, chain) are already in \u0060console.log(\u0027  Building witness chain...\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rebuild-all-versions.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9054a2471ad6358fafa31f9630d084c1ad6ce96e2ed4ffeac49a27bf7870027c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Collect all JS files recursively from source\u0022 repeats the code it sits on: 4 of its 5 words (collect, js, files, source) are already in \u0060const allFiles = collectJsFiles(sourceDir);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rebuild-all-versions.mjs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6721e1efee850680751c6955847cebef84d33877de17a2b3d56c578357b460"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Read the .env file content\u0022 repeats the code it sits on: 4 of its 4 words (read, env, file, content) are already in \u0060const envContent = fs.readFileSync(envPath, \u0022utf-8\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/setups/vitest-setup-server.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cc23f69d46b1cf9e95f8c3b79ed887659b02a7ff44549d7aef9c7af5788b75"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Parse the .env content\u0022 repeats the code it sits on: 3 of its 3 words (parse, env, content) are already in \u0060const envVars = dotenv.parse(envContent);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/setups/vitest-setup-server.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2de45962192ab2adb45b8f828f2556cd7d672b156615d8516c4ed79d720ce4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write full_config to .env.local\u0022 repeats the code it sits on: 5 of its 5 words (write, full, config, env, local) are already in \u0060fs.writeFileSync(\u0022.env.local\u0022, full_config);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/updateLocalEnv.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb78d48785aa42160b845852dd092e6343d4e393f6c138fd0117337d184d1b8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update request context with status code\u0022 repeats the code it sits on: 5 of its 5 words (update, request, context, status, code) are already in \u0060updateRequestContext({ statusCode: response.status });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/hooks/handle.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"87555d6670cf93d1d62c80b63e120ef92364640d5698ead034b754b7afbe9ae4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022get origin from the request\u0022 repeats the code it sits on: 3 of its 3 words (get, origin, request) are already in \u0060const requestOrigin = event.request.headers.get(\u0022origin\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/hooks/handle.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"894950641bbe18a9c6f1c706b8c55f2a8348d275a380bed40a5efb089b1f78fa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Load MCP servers at startup\u0022 repeats the code it sits on: 4 of its 4 words (load, mcp, servers, startup) are already in \u0060loadMcpServersOnStartup();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/hooks/init.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadc8075b13409345df7afccc541e1d0c00c01cb5f01ebeb520e06426a7abb4c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022keep alive until textGen is done\u0022 repeats the code it sits on: 4 of its 5 words (keep, alive, text, gen) are already in \u0060yield* mergeAsyncGenerators([titleGen, textGen, keepAliveGen]);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/index.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1663c02c6a23d9dd3b1ffa990e43fab4192a10fa006ffd34b59e36afca4d89"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if this is an assistant message with tool_calls\u0022 repeats the code it sits on: 4 of its 5 words (check, assistant, tool, calls) are already in \u0060if (msg.role === \u0022assistant\u0022 \u0026\u0026 msgAny.tool_calls)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f67c518c5abf3ab7a607cccbfaea2445b5d143c2c3c586d4de285728321be4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create the WASM MCP server entry\u0022 repeats the code it sits on: 4 of its 5 words (create, wasm, mcp, server) are already in \u0060function createWasmServer(): MCPServer\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"26be9cda55954d0c1e7e0babb87747f0a613e7a3449c61f8f046f21b366dedd6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Derived store: count of enabled servers\u0022 repeats the code it sits on: 4 of its 5 words (derived, count, enabled, servers) are already in \u0060export const enabledServersCount = derived(enabledServers, ($enabled) =\u003E $enabled.length);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5630f19e67b0a9fbc13e2c8c370571ec0d0e743494d9889488ff09219ce3720a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Merge base, custom, and WASM servers\u0022 repeats the code it sits on: 4 of its 5 words (base, custom, wasm, servers) are already in \u0060const merged = [wasmServer, ...baseServers, ...customServers];\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9440712ef7a737bb0eaebc0c820e211ffe6ebdf580a71ee91b80ea4020339393"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Save all base servers as disabled\u0022 repeats the code it sits on: 4 of its 4 words (save, base, servers, disabled) are already in \u0060saveDisabledBaseIds(new Set(baseServerIds));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efc6fa52cc94d50b61caf4441ed027a5f81b725f7e2eea9980044a2ea682192"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize the MCP server\u0022 repeats the code it sits on: 3 of its 3 words (initialize, mcp, server) are already in \u0060const initResponse = callMcpInternal(mcpServer, \u0022initialize\u0022, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b21169d3133282aaf0540eaddf10597d46165f5e421dad1683bbbf0ff4189b2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get content after the first single asterisk\u0022 repeats the code it sits on: 4 of its 5 words (content, first, single, asterisk) are already in \u0060const contentAfterFirstAsterisk = text.substring(firstSingleAsteriskIndex \u002B 1);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"619a3870cbe87dd67869b0de89abc5f3f3e457d73b0fd60276c16e89822ae679"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get content after the first single underscore\u0022 repeats the code it sits on: 4 of its 5 words (content, first, single, underscore) are already in \u0060const contentAfterFirstUnderscore = text.substring(firstSingleUnderscoreIndex \u002B 1);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"accd9c2de4d2e4da61a3e1933be7013ac9089dc548df079b5da8ff02f4f6d87e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Handle incomplete links and images first\u0022 repeats the code it sits on: 4 of its 5 words (handle, incomplete, links, images) are already in \u0060const processedResult = handleIncompleteLinksAndImages(result);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1515260cf53722af6444b1d8b839fca751870614837fdcec243a8dd55912a9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Jinja Llama 70B Template\u0022 repeats the code it sits on: 4 of its 4 words (jinja, llama, 70, template) are already in \u0060const llama70bTemplateJinja = \u0060\u003Cs\u003E{% if preprompt %}Source: system\\n\\n{{ preprompt }}\u003Cstep\u003E{% endif %}{% for message in  \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/template.spec.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"340b32ec45267727a134ae9984003cd5524e8ca3d79e4abdf3ef7dafa7869965"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Realistic Llama 70B template tests\u0022 repeats the code it sits on: 5 of its 5 words (realistic, llama, 70, template, tests) are already in \u0060test(\u0022should render realistic Llama 70B template using Handlebars\u0022, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/template.spec.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d3464e0ae9bee0f4b7d3feb5fb88eee7707859a901c571268d8619a25ec07c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Register Handlebars helpers\u0022 repeats the code it sits on: 3 of its 3 words (register, handlebars, helpers) are already in \u0060Handlebars.registerHelper(\u0022ifUser\u0022, function (this: Pick\u003CMessage, \u0022from\u0022 | \u0022content\u0022\u003E, options)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/template.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdadf93a96f25a305dab12edcd2708fae2b04eca5f340581d331255559242173"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022RVF containers store\u0022 repeats the code it sits on: 3 of its 3 words (rvf, containers, store) are already in \u0060if (!database.objectStoreNames.contains(STORES.RVF_CONTAINERS))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"975ae1df85a54d37510cafc707d9e52e014eabd83289f9762ffebdec221f7e8e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Return prompts from active template or all templates\u0022 repeats the code it sits on: 5 of its 5 words (return, prompts, active, template, templates) are already in \u0060const prompts = activeTemplateId\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/index.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdd985ebe31c250a52826b7403ed3bc57953749b63e083ce14631dc50747e01"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock browser environment\u0022 repeats the code it sits on: 3 of its 3 words (mock, browser, environment) are already in \u0060vi.mock(\u0022$app/environment\u0022, () =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/tests/wasm-capabilities.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5a7554ebca891368efc9ee5c5be132e1df083de3c792553395607179187cf9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022build the prompt from the user message\u0022 repeats the code it sits on: 4 of its 4 words (build, prompt, user, message) are already in \u0060messagesForPrompt = buildSubtree(conv, newUserMessageId);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f73e11446e82e391d05b5a3a957960ab7f9cf7104c0b5bb958cb63d26295af"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022update the conversation with the new messages\u0022 repeats the code it sits on: 4 of its 4 words (update, conversation, new, messages) are already in \u0060await collections.conversations.updateOne(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"34515ac83302a89425a3b8764fe65246aac36eaa829aad0278658361e19753c0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Filter by allowed user emails or domains\u0022 repeats the code it sits on: 4 of its 5 words (allowed, user, emails, domains) are already in \u0060if (allowedUserEmails.length \u003E 0 || allowedUserDomains.length \u003E 0)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/callback/\u002Bserver.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"607126f0874c3e6c1e4da2ebbc7b7699dc4b664b69f7ec8d90d35f919b2f9ca9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get cookie hash if coupling is enabled\u0022 repeats the code it sits on: 4 of its 5 words (get, cookie, hash, coupling) are already in \u0060const coupledCookieHash = await getCoupledCookieHash(cookies);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/callback/updateUser.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c3d41caee1c5ebc0adeecb1267d9937bda7a52de9bdc922e87c8f27bc246a7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022update existing user if any\u0022 repeats the code it sits on: 3 of its 3 words (update, existing, user) are already in \u0060await collections.users.updateOne(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/callback/updateUser.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7c50e02b11f4ea27ee527774537ca3157ff7dfc78576a58a346665c5811fb9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022refresh session cookie\u0022 repeats the code it sits on: 3 of its 3 words (refresh, session, cookie) are already in \u0060refreshSessionCookie(cookies, secretSessionId);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/callback/updateUser.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3d5266e788f63da4b2a98087e694002f073e3a7e909b598a5ad92bd1642cb2"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 16 of 283 project(s) overshoot their size bounds, lowering Project Cohesion to 8.9/10. The most over is \u0060crates/ruvllm\u0060 (130219 LoC, 1062 module-visible types across 29 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5688c3deaded7f5ee4e2a3b4f8709d1d0a92a2ebc9db4fb2d7d9a4a75c03069"},"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":"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":"76c923c01f519c15ae3328d99efe5ed4046231580aa4af3cc7690ebfe0bcd9ec"},"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":"cdf7cd4b003f1b9eb7741dc221491427a6a80af0d18883303ed5e06fb65a8c86"},"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":"97c718432301a30685770b3b14f65074ed7b549e66aed2f571dd9d338114c795"},"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":"3946f2d0b63386ab2ad38ab1e37b492e603dbfd0fc5a4259a8eb34a3347ee4bc"},"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":"9c42351b961c281a108da587b7fca8e81f9c28a3437bcf66a8bd040e64b4fb71"},"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":"c8ae2ec3ab49301a10694d500a926c9f4e85d79aaae24e337e8b5205a32348db"},"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":"7def7248737df7fb9f2641154100266d1d15664eed422b4a7d8b377c43c67676"},"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":"75d5923c0e296ccce8209c7627e96c13295a20af70ef1203ad4a84e54fc7a322"},"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":"e74654bcc886d15f541e1b43508d11d7014c3ee4108bade960bc2648d0e43c97"},"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":"4133ba6c6f699d3ae87a31ecb7df3b194573aced144d0a7cf1b084ff13f3e1e8"},"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":"4207f5cadfb4493a7599fc3fead58fabdf7788fc493249a4b0483da5e79debc4"},"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":"3f86650571b22f998727394a577af895c82d203ece7924ae6a369e91affe9b4e"},"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":"3e40f60065cfa8d0e66cb1b8bc609987677e4b749dba66b187d9ce8b056d2fbd"},"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":"4310bda98ffb62bac7d5f628223362b18bec6e9c40454ee08cd56685b5257e35"},"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":"1e269079726648a853763cf6f8b706b00009a71b720cb8d02ee54485bcbcf43a"},"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":"08efc98a97f5d34f3fdcc7cacd23b0328cf80ea7962cef81c8ad29e2723a9ae7"},"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":"f3f77714d5f45028795150524c079322a80ebd1e1bc3b42d8992d8293093b18a"},"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":"e2cfc8c54b1c8edbc01745fa5f7c58f509e21f2abce72a0957d5e1fce5714342"},"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":"118147bb03b4f3197d551871f5f74fc8ca9368ca051b22c8cb4347cf9237dd37"},"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":"c5aec0ab559e657e834e934f90438edd42990a5a55c039122633d50cff5eda39"},"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":"9d173bd3670718d148518c1305621bab82a23d025becc4cc988711762ce8a4c5"},"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":"46b0ab9ffccb120592ca319fe1ff7dccb26d531eda6d47035511f8a432e65cc9"},"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":"cf994c2afd08f0839f184ddf6bfecd979eadc82b6b8dfe7400537e5d249c85e7"},"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":"80b10c848e22d630d9801640b11d354c28c6e028bcd8fe42647c683dd16160db"},"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":"a5ad028dec7af988e9ced78f222d1de24ab17aa731c1e12f826c129d6ab415d9"},"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":"688dae28c89db409a26a637f6fceb6bb150df4b08c72b04d44b5ea9df7cbc985"},"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":"eb040917b8067a47cb3c17d583f9a200cac6f442d865ae87ef5c95e05099bb5b"},"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":"4910034996a28d4a8a886b3c5714681183b7766de021fd1d9d55f31ca0b1f768"},"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":"414088fd1e978d93b50b0a124f7565278439e5e5f07599ce62d5ce81d4febe3e"},"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":"06d2383ec513dab0783e40bc71eb3466d956423f6f2f4d01ebc9b8fc40aafef0"},"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":"76b8bff7b7d2d9a224d5829195cccab19387e646277af779ac949d4fd120349e"},"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":"067fdb0209f32730c606a9fad61f41498b04f07fe6352861d39756ffd204443e"},"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":"09c436d38d4511c8f9642319de67600f05185c0c0d238c4d755cb0f69bb11e1e"},"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":"ab9b4ddd69531d927b59e379cca157251f0430a42ad8123fde214a9d131a8bf5"},"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":"0b07a821bb33b6f4c571e29c3909fdfcd65e473696c72c17f1d48a0be68ae240"},"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":"595eca2fcd6615cd5d93f1ffbda979b31c00b1c64a6f349ab0abd6dc1d3db89e"},"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":"3f015e2b53f7a0c3c51eecac6cd8970183c4eeeb72dd9983e1ed0105c9492191"},"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":"e112d7dec905379ffbbfbde67d80270845acf5babcb7ca7dd924bed45fefa7b8"},"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":"e0f3bbb79bdba3fddb7a974c677a102af797cb061305dc3da01824f3597fc85a"},"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":"cd123d25bee28a1e0ad35c96f40874e9351d23375d01a533cca96959a831d722"},"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":"55acf95c8ecdec20b197bb357c3052b9a2aa9b115024035cc4b1eb51ce13f12c"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc612ff8e3758d567076c7c62b26f20634a8e6af0c66b1ed75982ea7a1d7e416"},"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":"d69a5a01c81589b5a311e676997e884b97bf134ad6d643fd1d20790a4412dc4c"},"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":"a2e0d6d32ce1c37779567326287fa307b8d942a818f162a2921014ad8dedbfb5"},"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":"efcb17726f89b9a9b9671a02804d352301b345d6535d070d98a29e43d6eb3cd1"},"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":"e165b0f5025d2739133615f41f708dbb1fead80c633440815633372a4eb8ad6d"},"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":"2bdf45dbbc991152a0af664475f3aaa04f7fce8e0d356dbd773cba46a0279aaf"},"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":"9b64d0fcd4b0ce22cc9698901a6d2a4c700a8027671823de89f62e63b2625fcb"},"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":"32e7879589afc67d7fa21089024efcde2af6ccdc0cdbac558d5cbf27398a893d"},"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":"3dd45585e3440a96a576118533c28d9a1f5f295f046edc72481d802e2ca8f57e"},"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":"cb556800b182b98419fcf62c933a78238afb1e1300a09d0f0ab7f7003047b114"},"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":"fc1aa24c394c41fbd7012c6ca3ea3bd1f2f14464485eabeaa77e51041faca3b8"},"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":"c16eac0eca018760174d1e9974e5c1beaf49d1a0b476d2de2d0c77edbb126090"},"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":"c11e8667e6cbe49c560cfe864fb65e318028c52fed2408e2ff118a76e6c0fd08"},"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":"13f77e99e7e44b4ba9093e19d5dd5765163c9aacda7b58b6ca500657bdd63a2f"},"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":"e9a1952cb4b338459d8c1029e106eb4165035fbf7a63d2fa3751c22129fdd9d3"},"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":"b4e988a974349f511dd2ab02f6047a7dd9c43508f84e38347dad2839d88b3e85"},"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":"b9c4500542773aeb04a211acdf1801066ccd3132210b8f60f53e6608715cff9b"},"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":"430b4d968aeecc174f5563e312b477fdee24c969a0695386406ae1f0bdeb4a5a"},"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":"c9cc6a58f64e75b25e33d13f172676332b1b977e5f81bc2bb16b2a993e3882da"},"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":"8ec2724d1fbe3e04a21b7037ca96c69eb559e7baccb8917ba2791a333d7e1353"},"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":"5a155b511df97dc00100e8566469f94fcbf7455284c2c822cf500b2c103acc9f"},"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":"c56bbc2ebb214e87dad3d71086898609210b9cc30293431f7bd83137ab127cdc"},"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":"a0a704f97a579c80f03ac0af0438481e86693af0aecafdff9700b5ecca904200"},"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":"7adb68b14e324810b7ec7ad3b2c36050436477bf354e786f244811197c339f03"},"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":"6d9b0f858f27c80b3aad76c1ca8277c6de1119e184a3658a18baebeeec25939b"},"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":"4ba06c2ad960ecb49eb082f7a44a81abdace719f0132d64c33cb41f5d1ab31f5"},"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":"a994ba51c11ac0dfe6e5474f4058ae43ca3c59e017ef62c4259e082914143801"},"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":"9e9b72caeee24fcc1f6d4d1cbd0b4993f66addf095cf254c5556ae9adc8590e6"},"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":"77635dcc99b7007d58b31a8daa34345532b689da62794ef621a8749470d0fd5c"},"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":"f0220f46ed0c05193de3d4a977f55a36acdfcb1e9e63397bedb56d624303acc7"},"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":"baec99bb3f582020939970bbcc559ec0df86a25c62cc4d86ab6842411d83e5a9"},"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":"ce03149def57ce0b5f3ec7a04394a472d579d57e8c2c464b2bc0a6079269883d"},"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":"b045f06583c9b465f808666ab807bb301b75e163408a0670ffe050a381f461f6"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40b13e661977ec383b3447ceb5c9f2b5ad4da373f334fdb358e33166ce854f36"},"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":"4dec2f5cfde3a7ac5203499360d3d791cf55c858b12157d1fe9ab859d1a72a29"},"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":"5305dcf3f3737d2238ccada6d13eec48223b41b8d638677365f9725f7c5ff10c"},"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":"3367c69b15ddf732bb8cd73c8a68fad09299cf22ca839013a9d4885a6c1f5c17"},"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":"97d47ece5e54aac54a7399cf2e279e24f79007362ddcf3cc719dea70255d53ac"},"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":"0392f2fa8074a0dd66684843174b9949b16caef1229b557ab83ccefcd4557ff5"},"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":"fa4145b11a252d559915774ce522cb5650448881ddc7ace8337f7bde8694a7e6"},"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":"0361e79a967542242934e7358609a4b1d6f01e24180317dde1d436090a402250"},"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":"21530f41c000ff0251745c563ea7f2ffcb713b14e291bc3ed60170d00212bdda"},"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":"e6928aa8a2be9b36fd4870a255a5816123bd0c48b8cbb1218cbf2796b68df33b"},"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":"e7e0145afbd6bd7d78df5b64fbc0219be271a970857c2ace9ec52e2185009b3b"},"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":"ec966e7ae7506eed77f785aaa561b97f468b65ff952df8e8f6305aecc6534c06"},"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":"abb1bc1916f481a32d4cbded51c7fce8cbedf2278c24974b2015f12d6a20ce4c"},"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":"5564edc4913ef076b9582be2f33c7127833166f7ce8d82e9231b79156bae13db"},"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":"1c040665b2846131f00cd005ff238b5a88e82048a22faf67021d588d61df563a"},"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":"2e1675077bf1ca28abc47b817869fd8c86560327898577982b89bae8bc279820"},"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":"92c7a0c8670f580068be6f0b5d8554ff643149a1b328c47d8a1415924280625d"},"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":"90895b878e9773d9248c3991e5c6d01cd06f62b1faddd16ac3eff10333974a7a"},"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":"a05fd1f64b4237d02641f22c07b3b66bfe146e69115a055f2de2cecc5df880ea"},"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":"dafe79b610cc782431488627646647245cfc7a4ac4baba7400c1a1e7fc549971"},"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":"fba0ffd464438b354926605b0eb7abf869d745f5a8e43604378c434b24a2f2ca"},"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":"3f5f022bd62a6004345db1a45af04287e392d646683dad920c06f7cf3d0e82fe"},"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":"65880320f185a7236d181e0aae55f88322e7ed1a97b5bd4daabf869964f52a00"},"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":"e83dfa5a2d00118e09bd7fac7d6b84706e0838d82af9ea48e1ef97ced34c5830"},"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":"742181fb7d61013735c4cc80a6c552e18254429bc7bd2c39645dcce53cc5d60c"},"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":"d97e20fcfbbe5a68fafab74c338341aab219857d0c259be0e88fc7281ba90e25"},"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":"4f36bd0dc3211b7be7240e684d16a4304689206a669795e02cc86bcfa5be93d9"},"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":"eebaf3025b21e41c149d7705b7a2779ad934ab4934316497f35c332806e3716e"},"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":"39bd361ff51a08a37efd3cee345d6125db928e30447d808af6f0c3532fccd043"},"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":"2e45d1d677577bcb715159349d40c377c13524ca10fd6c901cc6144b6c570805"},"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":"24f110a1e5a89a2dde54b536d1fa9ab2ec3fa70e18f3df154851f6e7997014f5"},"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":"1f5127b176d5b601e65596a622d0e31d5cc3b23ed61cebf35d6fd5dd7d57f5af"},"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":"554c13c0176df6ef181c4d9696e30a7c81861207a0fc031d71552577517b113e"},"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":"3e86c72bdc04da4ad22292c2ac1b2f41b82aa2e55b4809fe961ec20eea2e799e"},"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":"2e2844eb212d4c949c19fc8c4891fb400e8961b7fce97d6148bca859625831eb"},"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":"5cb1cf5800628d7433c1c989f1e7fa3b434d7a3a95dd2b07000097bd8082197e"},"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":"3d63ea805cde6a5346d431535d65dee8b703784113732c150210dd3b10f9506a"},"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":"23158ae242d02e6dea697689dec1fe79dc7437ef2fe1ad5de5fb08bf3095ed52"},"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":"e328b417c8b7b1c4e969ba794d1c862df88d1c550d0439d7f6f36aa8f9d72cec"},"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":"7bb044c9c7d9415839b449fe00220265db01c14b3b910bc0db94d498705352a2"},"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":"521510daca34238c211edf620e692274f5429b9ddbc3a0f216afea4460920344"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0940013c4fd7becf695d532834556d2c5bdbb234f5ea9744b5639ac93786754f"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f2fc9236b75f26920fa2c0a27f06eb652b749375d0ceb0b7161ff74dff7eaab"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e1abb979a9136a30ecca02cae04c561f41f110fc6b176980af7257096828d01"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aae34d3f5355b76ad746b0cbd564872574020d2a07a52f7cb108bd6bb3a6bce3"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af1ae3a7fefd62d0131aaac7f5b17989c2a6b65004a9823b2be1c2b08079ea03"},"taxa":[{"id":"CWE-94","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":"b6a4aaa296ac3f77aac6cf9de83be9df75bd8614c721d981a34dff31e4f98344"},"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":"f815cccb636d85d3afc8da0beaa7033d8f90aee2fd08d0a76e709ab463a3e148"},"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":"43bc7bf4b4175880239914d347b93ad2aa2a12d47ad6ac89ee74f1a4eeb214c0"},"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":"a502bb94e43e745502da957d845e5ed6d85d8d7f3097731997b6c9f9532c9b24"},"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":"92c18927aeb73937bd8c62666b6d9043525f4fa9b667086c851b93c514cb0089"},"taxa":[{"id":"CWE-94","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":"2267eab6bcb468f9632ca3d324e26d7501b7122cc51c54f1676d6b9203fab659"},"taxa":[{"id":"CWE-676","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5009845470429daf2b396561a657f106e1ed176c62a88dc0b802cd89432f87a9"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2400097c75aa0e982b5b18ad26d8c1062f0c07bf57f8ada170791c7ab4f85adf"},"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":"d0b0f25d8a66621ecdff6e50b3822f5f18946cc123a4474f6992657448b308ea"},"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":"585689ecfc9b705949777f73c331a16af9e0c42933bf759bfa6c6b883b7c45be"},"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":"ad0655d77ab9fb44bb2e075858ea0cd53c38ecb92d6b15608b24f65890dea9ae"},"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":"240657f5d61f0bdeec2285b082333f48bcc816ab092659d47257fe585f966ab2"},"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":"0b0c215b4c81b7a4f1f6c8658a5fce40aebf810ff04eaac0f2e966d3d38e1596"},"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":"d81cf896f084b1ae865b9fd266e868e1aeff37c66e9d3f72dec1fa107aaa07a5"},"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":"7ca128df14dfce86400ee122826bd56f446d71297428b78da860b6dc6c466d0e"},"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":"b0882e68286e5f0cb69ab8c13f68d2730b82da3e4589c813eea6b9ed0d8214b9"},"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":"af857f3212f65a74926c86fabdfb0b756b60cede8587a8f5678e9c0a45d51432"},"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":"7811b1062f27f4e944880e644bca579c95908ae49f302b8ce363ca896f0d3bc0"},"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":"05c7ff3cf94d94cbf22d52bc8a83609c9fa0d720f2709f8e652ca1320b7ba868"},"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":"128dfa332cde36c1b1859a45182dc1246182334b399aedc422cf517742c4f32b"},"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":"42ff37fef9df9a00937533c206a0610470c58002a12ea9e9e379d2230ba76009"},"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":"30b7538702a220528f6dd408ca47f93d5d30a0e892dd11de8885ef04e18577cc"},"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":"9293ec9af3f8cb2cc055b76c24a9533c2a6a070930ba56511502fb4e70d3a72a"},"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":"e5e418bdbb796c37580628026f30f8cacf03d783fcbb8578e080ce53367da8e6"},"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":"5689f476b929d3f40e73f3a94b1562bca4d9a8eac293b74716745b9f34e00e27"},"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":"1bc3e394de46e47f3a41f0a9ab98b6bce815457a1f7d60bc7d2459a3f97376bf"},"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":"24c98987bb7ac3b724e4a33b549321ddc63377c7e4a4d2c1cea18bf367a7dd8c"},"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":"2fc715daed1f78535718af70d315daca062e5f8791883f988f792f7cf58b5554"},"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":"f1b7a064d04ffb37d1c002b01cf33ded7234349f5433c7ea8c132a78cc08bf99"},"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":"357b75aa92e7496da2931429a60a456015d98010b82f7eadae8c65f3911d0e16"},"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":"c3b794cdde42e6d4cee1ed584dcedee94666391e156e8813cc70546fb474ef39"},"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":"224b4a5c2e8bd64801c8defa8d2282e2f9989918a3c69a015ca79b6a5bc578c1"},"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":"0870e6368bc35524ee86f6631e4cf1d87e3675c5b8af8e89cc124f598ad235a1"},"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":"508afbc65c815fcb97884e124769d36659b50ebb22759ff80abe048301cdc6cf"},"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":"15f90a36414a83209faaa8d98c719f60f3fec5141a46488c523722b56b00d2a3"},"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":"a2b62b9dfb07477bcada98c9dda01a9ee24200ebb90db023202421a136209f0c"},"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":"f2aa9c65b4cf1a8655d17a175c2ba7447575a6bb58073226523de2558ea2556d"},"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":"8ac1923a20fd8919856d1cedcb5b97551b6ce95ca0f89bf8240a50feb3c8d431"},"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":"3bfc7e05c9c06b6d150402fbba2963e564beff58dc0c1dbbd6423e7bf55281d3"},"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":"a1dbd373efe660cbcac9b46831448ffd3ed1033bdc3ff9425fd36a6445e5259b"},"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":"af76fcfcf85e488cd543972b57c2e8d6505b89f52299e1d56a858f65b2e1f234"},"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":"b44cc7f2e44c0341e0db5a1b523fdf236e60bccc3d82c0f86adbe63de1a4b1c0"},"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":"0f5f75bcc46b00b07a7bbf8788926422e8e620118f559e786eeb22717e7e698c"},"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":"9555c1269e0a541af401bf534ef4f8d3745410d9e8928e0422d6a16fd1b3b08f"},"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":"109ef0b1db2669020e6af16be53a8b0e5bc835c6c1450ba97d6f2c9ac48781b1"},"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":"56dd28344223ec32a0214dfc9c790397bc2e82baeb862e4f72effbdd84125de0"},"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":"62a3eb9bd890e2988a91cf800a55671fdbf77b3039edc3c8fcf1ca3ed78e8101"},"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":"50fbc71dd6a3c7cca5dcf1d934759bb51749bdb9205bc068af0f6bf4540a1163"},"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":"fdfb7041551a1a39f187e0c164ed24a4ea1ae54d0ba0242c87a09ec264a45fca"},"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":"7a824e9f1c0811e67e4967049dc77ab0978fc6ac8ae65380cdfb17c46aab5c36"},"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":"50d0351b6b5f1c8571b7d9c7ecfcb081cb09c2f92d8b8b3a9ef8ef2a5ae11c51"},"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":"77ece1f8d72817ee5df68c6cdf891ad6fe6c8d97607fd0e5e26569c2569fa96e"},"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":"39364e3b6523960a20ff3dbbe85f69d546f3bb392acb921b84cf15f5a0abcbee"},"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":"183b518bf217a96664d8b65aa9286ae001967fc095608a6ae540cd0c5b3d25a0"},"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":"52a6b206ef84e34f19ab9da3cb6ad38cef3d84267a4634e938650d87d368d591"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"4da74901a4ee07ec4c8281e3e276d182aca6c245266520b98f59711261813d81"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"7d9dda23510fc372bb8a20ca0adaeaf1e8def77f8cbeab199c42bac74ddc5c5d"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"f8da15a4826cc60ed7982b2ea598917c2fc94d6883581477c65c064280b6b4e0"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"97993559ddbb72d06707280f9be7dbd6f36eb882c82156bde6b3792522fa433e"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"b5428b5ef371e7e541671ba8be3848d2f0a3101521c6f9df44ec9a7278411189"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"42635ac21660a830e60fdb75e37791161f6bddee2e8626782dd2114e0e5903f3"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"52146956afb35d205d9ee65143567f62dbdec6fab2fde45b4e19ad0fcdf17a9c"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"5089d82a0545e21d5eef37512921b21f324a0bdd70e37b13647a0e7a98fdacee"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"6f0610a1610a1da0264b613ffef3569967a47520421c46c8d2b78358a9a049fc"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"4bc30c436578d74af14ad47b7d97d1e57f9f38c21edb9c0efcb051c0f367c4ae"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"7f6bfb4ffceca6e2847cf2d7179f3ff173589a3dd118406dae1bded2e2c3b5e2"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"4c693dd6789a0e8998cb4e9ddd51530de9f1aeafe32faa361e560ee1d4dfdc5d"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"a55130de29bc70952f42158fa2418396f8e7ce3f629c7dfe55ba04da70d762be"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"12140dbadce013121b5a2e61132bc635205f33dadbf67e78eec3d7114ac4b113"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"07ee358749b4149bf2bed8cad79325d4e6f3066ae04bf589e86e590c3278c3b8"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"c16bc98fdb70c2c9acb3f6c5a0f03ba070781db6dee2a91664b0970326f59681"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"df69d0d89c427ae132e12f3f6b8765006e58eb8a8a6ccbfd96f2638553da7bb6"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"84dfddac50368c54b6fcf607bdc04e5c659f5b645d7fda17e437122d49064f91"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"6e505c3b2cdaa47069b4791ef217c5d49c735425fa88d9b853e43e03dee85dc3"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"1178d27ed5b660e3c04e6f6d03d73c335d5e8e5c6f3281e0c02fbadfe3be2dc6"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"9fc1834bd6a7104f331c4f5702880ce52282211c7e322a41fb5dce665d704412"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"297b204abcbd8a93dd728e93b8f6d7d23d7c0c62c46303ef79e96ecfa26f599d"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"95bcfd85f90d9f87c8b89b70c845899d79cecbce38f4d425449e837b934e4f94"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"fc1bbac82006cd7b6d69c778949f5e8c41d1c0e7abff14bdc5246bbd6218c8f4"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"5da796759c85bb05d2a6593441c3e341f8731e2dd1925d7ad6271688f8d1348c"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"3e68438e04fad10c20b0238f545181694d34d9ad362b26a5f95f9dcaed2041a2"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"cbd72cf36465d104d31623a2150a8abc2c5a6d846298d70ee4a7a64730c3c922"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"08d080525faeb23f05992bc9076daba5c8ac7f6e25d1944a89e28ddd83b4fc2d"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"1ec91f9a1139b07c4467aab10f3d385ded1d7b7c05cbb1dfc589510ebf672e3e"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"ee34e9daceed153c6d8e0ff5e8f63a8a7a0ad0c25ff7398768aab42f6f0fc328"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"a6c0a671510199eb8ce4d08b926ac0edb9d343d069809a8a1056c2b626bd95cb"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"a383988208d08df8743006547e29c4997b123c023bdadb9cfd33941c97e52a4b"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"71f0c91353cb317e126cae7d4fa518092dbe343a8eb963fc780bb02015ff45ba"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"7fa842970dba905f0735566ad52b680286ee59ca9e3b2602f510ada028a41eb4"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"4b03ffe038caeade86b8e94d2641df9994d9daed2dafbacca1deab777d0018f2"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"497cc55eafdb45958d679bc205e21e97d438682b0d305f7bdfc91ab4cf44b165"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"fa465f3b5d1236c134211528b81919c15e596651644bce075a737f2a2b5a3a9a"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"185f72cd031f0924353c1ef5d8b5fcc233aa253790849f3a4fe7b997d85cac0f"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"8971d70660bbd887082ecbb7087de1a9d0a3a5e68f417c7725f81f942a3b86f0"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"3cccaa4fb0b247221dcf5b28a7e24588cf446643305a62cb18b5382969574d73"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"33372611fc74ef496e7234591927d0b0c082116bc0c9a8b50a03cf8be9f676b2"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"98d5067be7ef1d43eca89d7969830843a68c67b17bb26b5e37894d9c7e09a63c"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"d9acf4724024785e822e3feafd7e46682da0dfd49893e20d4924da56de556a53"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"bc658b2c931901806a7c4ca0efbf62a6845e6802abee88e4a57771a30698566d"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"430854a61fbd425770c481d57a084a4de82f51ba470736d94dd07bdb523d6021"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"411e164161b0448bf104660776860fe6eb4434a07c25cca551d254058e16e7fe"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"ac4fdb94a7d482a0df67d3b44ab3b9973713a94d02a8e52b8fe76e81b85013a7"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"6795657c242349c18f812bb950d501bf79a8d190536a9e48767310135eaa5d80"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"1d5627393364dcdc3022174a0008db5bee4973cb93d4fee3273511e7f90b5995"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"bcba13c0cb410e8eb2400872d84fa0480d32214313979370028a7e4b4a3a625d"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"b2772fa35e8e8ac7bba12ff9642fd5936fb1a6fc80bb64f0397bad71ed90a993"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"d66772b3dd11b3d274c31225b4275c6bc2afef034ba07f34782f60d271f8e321"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"36f7ed37f0309e490874c738bd159869527bc478af6de1791fcc52350c05fa05"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"ad90f49191e616416e41f2256e9cd7f9f8b4be3cc3db8ae5dd6f6c5e7452ddc8"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"73d5c0b29db24bddca6c754fd389171e21dcee64860107b9b5bd6962e853d20c"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"3f51de2c5c0a842319f8f1d8165320ae033ba1014e2049e6e29d51f117a4d137"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"027987bf0834e9b14d94568ef02e1c363632433da1dedad7eaecd5792fdcffe1"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"25abdad60e561697c51cff275269fcfc54cadd340cf161a3f5e81952f9af3e05"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"60f1ee1487b3c1a7fd16db0a15dc86d18bf0b87c42b746da45e55bd1674dda5e"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"2b764d074167cfde50dfeaa14b835444e7a9a8c1a99ccf68bcf0521fe26fb105"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"62a93209cf1273ba44634b8b8a2eac5e7766f75d6369a6e051acb2fa4b5539c6"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"fd0bc0ea3bef061b83cac3565bc283bb62a7e3eec0fde239f10c80d82c2ba7bf"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"982c780ef8ba5c1b27617e5f7bdb8cc7f48824377cd908d7aafdbc0d2d2325c8"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"81eb6aa5f9fe8ec89bb90094e1d3017a74537d5166d98a31770d8f197c50f460"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"126eca42d6070a3ca86228c5ba2f7f39f440078518ec955e8b54c4e149683372"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"352485053c42d86831909d72ba5318463358064b1b16a88e4f22a8d480f649c2"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"5f5c20fb00b65b1d771340ad34861e40185c588f99b59a7184425d51949a3f83"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"b7fcd3d5b786d7fc62c3f6a7c100ec1b1bdcd7f9c2760c662027448f0b4a99c5"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"d75759a8de5355b05419742b4386bab6a618d9f7523ad2efc7fbbc925851c70e"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"3d91769ad66ffbbc2572cbbf43b7d9722369d83c0ff133dcf695e48920fa6ebf"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"9672938c8d062e76f93f75ccfc2b7474c2dc2fe1336235c19773ce632234ee80"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"a4a23be9e65442f2c1b4a06109f09cde7a9204e7391572145d35ae98c5d92be7"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"2983f608c34378b63d5b2e87d0f9c306bc858a27d009379e5e2264b2bbccb583"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"3a592db93b42746bad04535a1799397b88b5dfdd01c8615ae8c524c967e84d89"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"7cca6d66b6418921e5b1d44bbd168dc5ce12f4b0fe6a8c2bcb8bd817e6cc3de2"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"76cfa1dca62e573ee7ae16e6c40569a37a0a7d57ed4ba151df76004099b5d995"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"1351aed7d9cb05dfe1fe9a390fce2b7fc2e87e275ae6b5408acb1c31b8aac5b6"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"2cd6ea3da8841d4f5629164fcb94493a65a88d128a38d3882d4d4accad1ced34"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"1174bff4b9d39e3127cf132d722d03462a6f7cec56af01edac1e44e5122c660c"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"4711f895e537604769ded24d0dab192f46ae0c8f677953a5c827238ffd99e4f9"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"bbc1c04f9843feea268615ba8db852b523e83552d995e15d485c2d26b161ce65"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"c5016bad64c7a6c62611836c03d787f1f7ce4009bf0b1a300d7ced71e78219e9"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"312b49e31bc53612357cd083a1d8044c04ca570289adea900340d184f6117f1d"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"22cc508330536f705f94a48f6ccdff9c1fc4140fa7d386eff99c8f7fff453be0"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"c4ffb3abe00ff3249ec8617d70c32639f68525e7fcd918b3d86d88318a05141a"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"ceae5573225afefd9f2c9aa0c84a747170e6937d13816d584c48e31ccf23e92f"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"0e5350cd234315cc3123922ac0f7eb203287f26f5578960764babb5424fc7244"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"a252ea244558578dcea60f8b8e0bafa5013353d539caa65fa32567324cad65f7"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"213397da9c6394ce1cfa5855f29f2a5f6b7b3cf2b052ee4edfe6e9ceb4334122"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"38bedde0d0489178d5080d9270ad31f4c7919b8ed2b6e635b2c54c273247fc9c"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"488c8a02254a0edbd22780e5875817cf3e02c505607468834979d908ccfbcbdb"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"51b4610af05034ba7c1487b6b895bbac603b53c7921d1725c1f579654eb22759"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"8620e84213233ece19642b0e84b024b4b7c453c59be124c24cf14cac0dcdd5c6"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"12e44c3062896791cb8ff233d0c2d118d6bd642a2e1fb5bbffccb7c1e64496b4"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"09745f88e2250d00f4db7616e9d3297443ff6bdb82a8c1fe52ac9c1181faa4af"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"334dc43037448dd600c5f8e3780326d8c934fc246ff0c4b9f7ca550b56316ea6"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"923bdff4a7b8bd9ecbbf1b93ff704bed058ba0a00c0d7dc7ed997f63924ded15"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"d0fb6569abf29a3e250abb67484a33b5793ccde2301e53eb5ed567c9b89b486f"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"270adf8dac7514fb9ad74964e3a08d2c6cbfaad4298d7e5a36b00a6a4e974be0"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"933ea3fdf7cf4c71f958580e25693feb54eea810fef4eb650d62a83af1aa5b45"},"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":"5893e139f48348cb0efde0d637e6c3ef5b5d9b4e4471118630fd6c43f91f52a8"},"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":"337212b5ffc99203900748208e0bd6842becfd337552264908af9e45e49a5824"},"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":"53b498c50df8ba67b2a015a875d7b0e890a9fee88eea6fb75abba45eab0d596a"},"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":"8d0a43c6cd898ebb906f2cb21faa75a554234365a4d3b7a72b584ec7f10fb100"},"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":"06b165e9400c8d685c212d2b4438c1377327ca67b5ec6bfe70d8941f3ca4396c"},"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":"8a99e7bb757d63662029ae25aa55ce22df6dc47da6225042a168498fef361231"},"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":"5a5e41d71752690d39f8e4cb12e9dfc6fa2d8a03c0c852a62c653c5fd1078779"},"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":"ec76c86f2383bfcf83d82e6abbc81bb97ca6eec289cf8d72262245fc6882c79e"},"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":"e037b4839866fe3c489a2f63b048035fe9c2659f8089ba150f828e63675fdb0b"},"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":"73dd6fa4505a4d8016aaeed4523873ae528a6fdf65a5dfaf83f8976536dc3336"},"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":"98764fdae1e516bebcc340c4497446aa13a0491dd1c71d59f7900a346dd53e59"},"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":"3d12f0255705d9ff4d774aedd41c05b41db837b72aebaa1ceaeb5b5d0431e55b"},"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":"612021b63a2e3f42a8ad3ed2213f2202e6d3830f9d07fc9deb04fd84c7024873"},"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":"a683a41b9094ce4a5328ebf19ad83b767d543abcf4e42d91717785b0052b1f2a"},"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":"32e85430f22ecffd2a1724b4f4e10a5080df4d7e591929e88051b76bfd4157fe"},"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":"246882a6225bc2ffc90fa866ba52c2917e05c022163e17e5ec816073b1f5ec85"},"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":"7285743d445b5a6dfe2ec6aa2904a2886f7f472a195dc2bdd3c07059667e7226"},"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":"659d2146dea24e2777005fc348ce8f0e8be2004a652735745592795edc0ddb00"},"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":"df4c875310ec5c5a686a7c6fd7398b7ee754fb404947319bb34aae9263190dd4"},"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":"cff33a5e9f4b0bf2e75823b900cba5bb74784d93974a9fe5b8a5236f3b474967"},"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":"821ad9b44e63be834925a76dd7090f52880da2fc764c1cb66dd172d29710ef0b"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"debaa154ffccd9a0d633e36bf38947003368c979a42d1fc301ce26365cdaba68"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"832194f0f8c6d5946f1a8bf1418c4e73c65eca78e25d34cab31b8ac7b43d9f29"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"d9c7d90860b7aae0e29c8b0d8624b15f337d5cff8c022690367308929bada7ac"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"2c3f3b9502cd779c11a8703b0e5c1b14a2e97aa0e18447f4e27505ae7279c8ba"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"bec3d55fc48679c0a6092ace25a2d24aae4a8d1d2d248ae5e66c9e40de7f54c9"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"5ce293c886c3debcc8621130691c2be2df3ccb7f6a67de8d569b95932b35ea36"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"bc401623a570a4d8b25c79ef859f9454a56a0b2f88f2704dda64baa45c87e5fb"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"af3637eade5722a05120367a088e594cb5c9a3af475b0e035403348c11891f93"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"56965b017200ceb7bf581797ef827115dfae81bd69457d660b68e408b36f0cbd"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"0d7157ec81c756941e5f866eccb364ec5658e4314230315020404085980d113c"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"8b5cf261a4110b0c8533f19fe95c3af2245425ed88ae1c4569b4fc9fbaf4ce5c"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"5dd36941675b6a1090d166680885a28261b54415f26cd3fd167e3208b55ab7d2"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"325f514469f12d182672a03e283c6fb34b7e520ed4b4d8d140bbd95c1b13973e"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"e1ae46bbaa4707274e8f99a284803993b8e15f984f254623ee62e5b1bf28dcdd"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"79a6f904b93ac9134b67745ed3f90fc09015c14586e40dda18039cdf1d917d7f"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"2e8081274faff1ee0f1167899c075fbaeb5054d704a2913b4cf323ab9d0d5e8f"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"bc3415af756de6a7f43699b3b35233ee367bd1ec1504007dd1952a99aca110c2"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"58a2f1a25c801fa0fff8a7e1da4319ee6ed096c06bfdf3f41bb7044c5422bc14"},"taxa":[{"id":"CWE-94","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":"3fb0f81f642812db4e5eba93b2702aa3e856eb6d79c1dfeaa4bf3faf4349dbfe"},"taxa":[{"id":"CWE-94","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":"0d7b21bffcd68231fe1c5568a174b8de5be1e2e0acc7354e1c9b9d443a6a4bc9"},"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":"a0a2d09ef03a95e689ab83fb714511b957f22c2c47889758adc8ed34298db838"},"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":"1d88fa5e102f821207fc05d7647629baa1d32c3b5b2bb161d8d4c59355024d95"},"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":"7189b59d2719295851214d1f3aa80fab866fe76c4b127ce7200ee571b989288b"},"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":"a30b422e71482da7e403aa910e65b399639ac0b1dabf605dbf0e5f9361d4589e"},"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":"ad9d2bdcf43c045b2d6fcffc5a3a6ee320da2d86ce71bc4c83c7ea3e5a1a0984"},"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":"35447dd0c2ee7c53c5744d697ac9cf145b6225335b43281bac6995b4f9311cb9"},"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":"26cdad46bf5cf748491b9e24ad7ecb8fc8490c1be5920d51980297a22924ede4"},"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":"4445fb79b2c4efc41b55e6728e2bc35a44e4df909f6d061bdc88a395ca4080ff"},"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":"72e05a6a12b3277e0bb884edf844432d4616a44743f32c46bd27c5e9ff7972ce"},"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":"1dd210689a1ec008ca0433c69eaa5141cb84ae6ceaac9f99f50d649e6a6196d5"},"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":"6563b4f892906faa6648be0554b2b70da75852bd5d1e06f303d86caa2173da84"},"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":"f04bfd2f9c32fa0361a184117719f2eeb9c3f86ade59895dbaa09824202f67c6"},"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":"afaaaa0a409a85140a896c93b58b40a68d9e75ab407d43e6be6dc0e87a40ae2d"},"taxa":[{"id":"CWE-94","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":"7a459b6efadd2bb0bfd175661178004b3a0ae7bb7c28b397ef0048c3db6219e6"},"taxa":[{"id":"CWE-94","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":"dd19c563f1a0b2c01169526e35520a924b7e0427e8cb32db1992eb6e6119b830"},"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":"aa28d1e425d55abaf9d49aa01f064b3c53990d3c4b3a417054dcaa6c7727230d"},"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":"432b8271dd0917362cbe1fd73f3e598f7df69afbed7fab6524d68aa044895c72"},"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":"f6fe4a518a987f30ef11749d64c6f1ac43fc6887a7f797a48bab959a90ea6d68"},"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":"69b084eff6fe8c158581a8e5608cb5d203d63505d8a387cd61f33864ee7dd432"},"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":"1ecb9e5bd89eb84c9443b186017a636e21c9d5ac0ac459f687a22332330503bb"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6bd9d589be1f824bd6458ffbf76d01d141f3d11d1219cd31bbd9664ff61d614"},"taxa":[{"id":"CWE-1104","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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"77b079c46ba3259ab0fa82b5cd28122f6156e5b6fa2e485eb6248b4b10f62525"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"736cab89844111603817ca917142d0465971058aefddbdb20e7e32fe2e2e2825"},"taxa":[{"id":"CWE-1104","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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"8ef2286e8a521d73b74c4166615c07a877c61296388bb2b025fa449968bf44e0"},"taxa":[{"id":"CWE-1104","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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"b37ffcf464aecc482eba536c794baae7315bf9508b3822b4509dcd94c6c2faca"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"fb2d68d59c2036b64b2f65dab903323ee05f6a8899300bb91cd77201e52ec2bb"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"41d3dd20b7a06bc4ea2e0106844eaa70aa8aa237393633586d45f5b08c42f6ab"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"9e3e70c5ea799262fa910d0310ecffd260663a72d701cd46d1f5df469f857037"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"a3b1756064a300911019af087a230c750858c463e56bd3c806b5226f852e8b0c"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"cf5a57cc6018a74931aedfde895fbd2f8b761d4a69983c2bfea4623253fa1dca"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"a86242be9ca9702dfc5184bea439a2a3b8ca04dff6adbb0ec9188d8fb7a5dfd3"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d201741f1f69e5082e0f87815006deda40ac8ea92f6ca5b0cc3f48ebeaf0d78f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"cc9795bb39d7191e558e9251cb6875669115cb9121f3eb4e7d10d58183d911fc"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"dc509dc5c2e9a9e0af84ab4cd9a1a2dbbefb70ee3a8d12e6067b55f967ba6d6c"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"12ce848ebedac7472d28f8de0980ba58715d765641692bd57df4ddd4bba7e19d"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0ffa362dab71df3766cbc25cd89c763bde2dd9db411dc56e62b096aa5b486a9b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"667f38b1b9141fbde8fdbc85d4b91dc1fe078a0244aef942b9bded86363f6283"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"1f5e8c02b19e0209c519028db47903782f668ef1f7628ebb0814a7db38271bb4"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"293d0a0cbdd54f210d77b8dd6a190f76f6f56e53ef1ab61f2d5e2edb1cca278f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"ceab4e89d0b3c5744eb91618aea235a7f98db1c914838a54d2cf5782b8792684"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"afca7655d32434eebb55f0891256cb3bc4053abfff3c5b994d7d2e56d614cb25"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0798d1bd335f03dd406cdd9938e4640d18c9824177cc9688b825a23ea6223e93"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"8d8c24f66bd85ad8547660408101878348ec6a9be5af392be2117093cf72c63f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"2bdbe8f0852f3dd96ecba45737a1c4b397ede6de1075d1b305d42745f04cbd12"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"8882acc8ee790be445e580399a1ac236ecb4cdb4883b8808876572e55294292f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"95740b583969c78c7132f35629806263a32606dcd6d14eefa8ad5abaeaae0af3"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"e0a6a76e357f79280fe1ed2631220f5ab2288335a7c53507bfa9e530ecbece13"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d23dc5356e24d6be3ee06ddd8f4da2d7886273b7810072ab4b5e4ec2b1f633c5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"2868d901dbdaf0e0d50a6a70798adeabfb5df6b8e2db975eb736ee9a4bb14d34"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"7d8f499e06299f91c9894e3d99ae2edb914bc36abac7f9b68417d0a59dabfa3d"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"5a193ff96c2f215102756bb140b6ab2bde2983478d3a248ae09e8b05e7925590"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae6975af16dc2f1949f2e0a0d1ffc8739d2602c330bff52870beabc7390f7ad3"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"4be08c06bafb554cd48588345932d04f5d4685ac49355f15725fc6a5f664415c"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"ddb0a0d1ddedfc57cb332b41c628148721615e3235666b4a8b1367ea76528299"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"f5c6dc688b38d139223a3b218893c6d9532c41d1c9fa2ba9df2d39758a646e91"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"a46ab2ca093d11c91c7a38e4691054800e76e9cd29bec2b16bcc2492d94cdd87"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"7976de2ab9e436a1a78032aa842e668138e2c8d240d95055d2cdd8dade4c6bd0"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"1b0d98967521c68c6a47deae95799d40661d8e6a4e1a721ad8a15521e3f7d933"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1811eefee1652ec68a6033a4224432e6777a778aa32295717e3db079a55cf12"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"e276d4eb7fc93ee569935c3dcc8896cf3a37e30da5fb99cf331c73d900de916f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"1cce666ef5b187176f6828a5145e1f8efa998c5afcfcf43b5e6f1ccd125c4490"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"e6790f47092b3d0481018c6e93a66886cb82ef8c327b22114f7747d22cd53881"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d747cb8bf3b2da5fa230c9399a44a1f94cdb31b1986f66955af8e9a8aa7e428d"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0bbd5d809144b6a655347e54fcbc5cf4cd49c3e43f5fb60e65fd39639f40bcde"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"63778fa624412affc09bbae17ed4e235deee47c1e8fbbd49594e08c2f223c987"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1287f9cddc491e87f724afd7cb0352f4483c045a7c31ef6946763e670e48d31"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"5558aa23ecd8e53f962e8d11670d4c84652e47dee4d420b1f89def6f44bf3bd6"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c9d955c70d35e420dec832970b323565bec404567f26e37476a51164e719159b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"f2108c7d598d5c35675446e3651894cc2a5e6d1b3870895d244124665ba3868d"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d3e8ba527d269d4eeffae27885f58ae652c4bcc71f2d5e5786d52b456b2ede46"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"fbd37e0a5b315d231779a08b02ecbe8ecbc6a06367a0918b71e3151a8a3d2ce4"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"dd1bf0769790d75b0932530430102c4c9dba5e580df68a055e1f816a2e189c5f"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"b583020ccf9809c6fc2e1a88b163b9ea8da1de1329ade3cb78f22633a618ca74"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"85e74adb0a2ea4b997cbcfde1c55fd2f87a2649bc22f3a0e1c1ca3ca45668f00"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34f1dca21641403be4e32301c6cc5915f4d12839c2062851ac827cea37a67068"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d43c275f944cf6a1038edd9b9413ad7d3a1ada00ac8c48b20834014abec816fc"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"979f839df5013383ea970ea9c6077e12327f72ba6e2541a4bca437b2a289c210"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d0907d9b1e38b9d636e97a69497fdff46680dfa631a77cb97646f982760a3c27"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"5f76ede736002b77bde2643b38e39fca9155e340330183e70ca0bec39c2b8e02"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"c67bc20b7422792e1c94fc701c34feace48fee5d7a206f1d919f5b5c67efb03d"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"5587e547a9a928a66b8875f50c31c88edbb557a29dabe06bc204d09128c91c10"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6d471a7576903e25fc76f77879b320b23a37b75832e061994184e356129d71c2"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"3d7739a4e53c5a639a1b88eb815772fa31d53db7d38a52acf464847c1d1786fb"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"f0cd0a714acd4c65e78251ddb019d225eb1a48695ac3dadf6f0b78f8ae28864b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"13fd9da882ec4fd64e058bc8281b77aa3b8689510dfe6a330c72605745e79dd4"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"903f91fb0bd0523070abf51f26e1cc4fa04a181013e004b1db487e094ce3af19"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d8f099dd927a4c8a8060f8cb5607d2fdec8047a147325b6eefd7726fc0d6da28"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"ceb87e2127e08ab06b25b098044ed17b4c17be0b9b199ac750e98474be689f0b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"894ab403e548e79de291c614de6da9b014be6f4af8218e21e13482802bf8f754"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"7cdace735fdce5c39e99becf49072ddf7111ae9ade30c1bb1669447aa2d5c117"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"486f7de01ec57a474ca117194d03563c2d7aaad1d28e5ea4613363d514b757c1"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b880c0e23c761a9201e6a0c676a48b5b6c2e5de746ac54092678fac1e9c4a54f"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9f103b67f1907fc639008d780f6f8b296bb582305eeaec89c845b0b2cfb4471"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03f6be2dec73e61c8453b336f1df73c512ff560991d4bfe7ac423bb8c35eabe8"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf4a24a3ce48eb918b6b2953e7aed7efdb8211f234d65f1e7aeddb7d729db638"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2193ca309facdf5e4f20bef28597fcf29ff58108932a98378e18daa90365404f"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bac8f4378ae79c58650b100b7a3605601af4100d96ad88a08cadc6fd3b3df98f"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"274b8d22dc07af7a73cac8bdf0b604c6332a00c14da0188b95f911aef938735e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a776c4c945d0d6ce2dbaaa58c9fa01063cc99c04a01182038eaeea1b492da820"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"749b695bea7cf78c39f70af5df75a6ad6d842109a360c0e6c7ed4c1a771c4624"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db2687bb5c259b6fa0fc9f16219476eb24cc6fa19dee34603e451ffc64789034"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"498e8ecd5ec4186243a91f1dd2ca3f43a9def77eb18b00a597a5c412d7573d0e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a04da80fa804f098d6836ccf183813e2028d26834420ceaa45327de056d359c0"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fd077813b5630a415989b022c76e09698b2a13bd660d4acb72759c3158e35c6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b637980d7a8f5d31f921b9746ecec68785214fa6d3708d09f5356bb24015813d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94c25fb3123eccb3ff949afada1ea16bbdad34ae81b3ddd9fe6cddf8848db215"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4c67af30a3b1046dd202bd9ba88c11d79405d9a8bac691526aec00524d028f1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15a9b6ccac388b287d7b4b247cc74118ff28713754c038e003cfc73177cf25b5"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82067b01ab808657a8fd9e04f85ae00ebb2035809c48745c535979f58497c006"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7942e5e758eee104130d630a03d218eb891aa22d811cf01442a0aeb989eecfee"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2b7903f1c30122b2467775ec94ab9fc15661cb36d63703c5704791d021125e2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f9c03c638b83a9f4c726e50c0b34c4a4d536f394203397d25c02733fee60f85"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90000a6907649aaeae423d2f156a964f95b059c984d3e8be85213bc8dde922df"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2577f60473d8f21c22948bc2830cc6966a6673aa9dd5dface2c24ff5a8253a81"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a587f9f8721f5754c2be17975051dbf40b580304c8dbc628430bb46f99871d5"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b72f503fb4ac662606c955916286f6d0018dc9734b2a556227b86679ce1d06b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2fb32031acfff729e2a7120a0be73b7ed3bc49892b6253c818a8be9b1b22ca6d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6fb9d0f3616b3d2a788c6edc4c1a3933be8890aeb07ea527b481d907820acdb"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef0eab4c7986bf28e3170d4f317fc0bd61d895aa27d467ea0bdb67e3e81b0702"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c0416f18e2c28d19318bda0c447b00a280c33f374cad970a47e3bf5ba049ec6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6965c46f11907e33f3bc272567d9a09955c9ae727996309f79cb152bcc5fc683"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"099088ed70830f7dfcf4bd41572faaa9b37af519d2a0ee783a15ec35a6c844f1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5fd4b36cfe925203b22bcfda9c033c71972c5ae295c92df2eb20d44427f7985b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4208f3edd2c0cb9e84c32c02acc0e145692652d0a1508a1dd0e7c1ef9aa95141"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7deefd3b5b25929660228f53434a1d56db5e0f23c54b9674606dbc4831bd979d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d0094cc1e496b80e69a30be94a82e6b05418cae4258c8f21831a69af15cf295"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ce437c62cdec7ae8df14383f6758e69592b52d9a056a73e756da4203814ed49"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b12b5ea645111d91d1819b7d923f74d15cb15a540eaf9d3fb3134b6e0deed8d2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d25842b29fbde1dca77fcce1a833e2db66aa81197af8724e1f8043410c9f81e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e5452d628a278d628962f3436ca619beee900140f13d2499571ac6a35d66d4d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77a922b104bce822d0c9d85d86c7b6634a51bee60826fef886947b0a03eff8a4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98ac3289f3f3e5b22c9e80dc48a48e38af76fc3fb58a507638a363a1eeaf3daf"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2173e72ca3df716460ba5dc19d549267806a606f9d6b793257b4f67e6ecf1f10"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3083e0b1383bda74d10a0e1ab3e15497eb23f131d193315772e5fd71452a8524"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76ed1ebf385a5595835717237e639aea3439e4bbdd570607a989b8af7c7ae845"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e5425a47aa3d5a2856ed4cf65f01dba733fded9320579f5a8483e26e9489201"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5291a910fb15663508705d5a7bbe343165706e74fec05134fd6f59164eebcd1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80960ff30c5a6d2f4d90f7699910767a2771007155f8c7be77b9696490211419"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"450c7f4e96302c0f44825cf669a0b1eef64bba7c29d953bffbe472440bf179e9"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"957660fc92af7dbe35d98a055d22a8670b9139ed12a93de35677efcd0859f78f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08fededc1b64874b766b1f4c099a9aaa4ee1aaf0d09b345ab09fe26640518af6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcdc1e9ddd521d071f4285f4d672dfb19af0841ca967bcd31a4ae3e7ea27ae43"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9879ef788a724f62dad6325e6783e58c1b1f2ccc7a054f0a17d2e6615c2b1a6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c560911e244f48436de2e8356ab3ccae2fffb8aa9d50f07368fdedc85b92b031"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74842dc81f56b1e3eb71bf915e3fcc806d06ae85af26035bf945f491a22045c6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aebc7ee8c5b71f6c06034d6e0d195e37eac94b53043f0966f174685404de0c67"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b65157ea884d651148b60010227c9fd46ea0a104c4fc19050c84df7839c9064"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c80017fea7a3852a443a2fe9cce14ae8c59add4abe2e031d0dbe02a2f791a3b9"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c8528e91be2160d18fec495ff30d0679fc9af55b154605dde894f9fb57313f2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44795ad76d6eca55bbacca3ff771871cbeccb03b78e8783c732c5903c75543fa"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"392b78cbc35e880c699aaab8dbeb7b79953e47e2ab876666001d8418f17d08ef"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0c3c53c65298348f032406e96e915bce43c16a25888b8c6540ee6bf2c8f4d4e"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1007188d824015a3c0001a171771cb554106a6e1b57cf7266657b8b85dd4e40d"},"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":"2e16644796a6c5097e0c81738d921fb870b4c43bac9ee44ab4bdaf3dbd49a1c9"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c730db221daea486a8db569780c6bf31fe6562c68396997076135f2bf1893f6"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"caf85d67d44aa206140acc5048a2208c2b2d69119e548cfd7b3029126936de6f"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50468e8614151b4a6cd7e6f3571838fec002279ea3d3d9933ed41801095ab670"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97b68bd8019708d658af69ae16a9859519f24837140fd69be5a7f9425be8dec5"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b742cbaf94e84f8f5a587e5213e1307a077c5fe56f0ae2bae035fff663f4f8e"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ecda458d6e3e3d2f3f4b8ee9f89dedf9cd19de34013793b6d0b05c454395f3ca"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c11b0dcd8632a5f6f28790a050b98ccf129277e63fffd3ff65b382303f1daac9"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"301f8a5fe2099b65dab8c54672e060c2df0c8c3a38ee73d2a4532fa29d0bd006"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"912696d52d70f2e5f44578de91315f2b1cb30f69a89fbdc5f32b6a8f11d61dff"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b4447042489222f5bfdf26c8f7ca55c34e65eea18d5b11aa38e3c0b6f3258940"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"123db7083eb7f0ce7660a44ff0f1995816377d462b2706790875def76ba6a505"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ca1122719e3b8ee7a6ad19e03c1735f8e3f19b09014bad12f73e9702abd5bbf"},"taxa":[{"id":"CWE-310","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79e1134c9888080cb363dbf27b818fa6ff4cae1d79424b07b89d938b11edfd2a"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b98c38d514cbbd9b7f62044dbab8c9ede17501c2e8c39852c90c3c7bacd07514"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"800321e894722003171bfbc021d9ba0561c98c4d472c316a84abd69aaea57277"},"taxa":[{"id":"CWE-326","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"315307e35a3613a5e2cc9189e985dce418ed160b792f7823c80ec862f137928b"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0141fb0d0331952867ad05c27b94b69c2ff6afcb1e3a6e0d56d1634dbb1d10b3"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5568af472ac2b06954c19e79ad0d0bd51189583aea31489a7ceaaabde5fbbf93"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2db28aaac4349e04e2f90188b3c9177dba056c24c8c960b2c95da0b78098217"},"taxa":[{"id":"CWE-326","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9287255ce8533da1fa6535b29886306383c29d281767fd80b1a26c8f8761e251"},"taxa":[{"id":"CWE-1220","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"4a6d7be1587f13ac3ec3b02f9b93b29c82d4e2465710803b6d4d3113ed281981"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ded00c1ddaa23ef0539a4e80016eb7e08718c6a26cab855a058ef98cc51a7e1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c38437df57a39e227c785363259915b02426b7db685bb5a6e5dc22a2b40ea967"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d766b9a468ae7e26a43deac856650707a9e7504633d6aff73ff8659b2aa680ed"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad342f3a0d1676564609d8fba6436bd6a0c3164abafaa9f6b606e2c229c08e62"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c08bfbb6f142affef046e80a17645ae0257dd47541b75faf62ec5633c39c38a2"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c84626f7d6c29fdab86d0351180230eb5ad230f071a5f822318ebdd1b2047a74"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5888a46238a8b57bfee04c25a8795ef78968f323f1d47d29f266e0b59d1c5f48"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"139e37c003226e95edad9d7e6b22b65f5b7da7135a1f5dc0cab77b2924be1f26"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a8dd3d0bd42640701221903bd3efb0dca46e016fa0a02872dad8129053477a6"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5665296224ba7f14bb25287fb87115956cb4f91fc5686fb1cc8f33a397ec68ed"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac810006a36d5930f3ea4609e2172b9aa2fb15e79996a1a7dc00d51fa0a85e3a"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d125dd76a5a4bd509889ccb9c01fa86f4c4b68173a209b3d7c4d57dbad157477"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d291ea87cff7c0e8e924d05453a8f348519fbab69519d7d7a20fbbf4323b629"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3263e47b6d675b9f20e0f54b06be3356b1be307ae2b2df6795d2d09c6a41562c"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4471373db0c3b1877590f201ae6317329529158200127883d5f41b66a8fdd740"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d511c9a82e2ab7b45306ad51d515a77cc46a570a10cb91c49f432452cae1da5"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35c5b5ac55ef04b21c998d8ec0d4e0071aa9c8360b970f7f3919b7a49044768f"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ffefe50ed2a25674cb71d368622b3a38d1aab29a5bcd37da58d7960ac496c75"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a24409bfb285045bad394fdb3a0023875471db3ff3eded153b2839e022611059"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d381e726dca09ca4ed05df8147d8f639c293d2b6f1c4139217389455b4430026"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c207905e5e8f7dddf95c9dfc71184d757bfbc84606de9877ddd1734026b47057"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"642a0116d89ae3909433bd908e561dd64df6d2a4e7f1b5adee163f43a5afe8d4"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f6d7c076ce9bad96cb1310b95ed8e2e8f089c7f3cc19225bce2a562e4b0a16d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"995f95f888a9cf772eb3c1b68737c8c35d379340ce8135d11403c8e136494495"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34f21daf27eb16f40f4c82b1dc52eeff66d7d3f04228e85df60abc935770314b"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"619a3ad4842b925b0622184be42cd7fa6f548ef9d52b2be5776b5cb7f94513bf"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"978c19c716ffa3f706a0ea8e7b47d6a89413190af57597325c02ba810b4f5a20"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8fb4dfe7735399f64497399a5558661d92f6bdacd80860bdabf121d1eb28cb27"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d4e8ec0d479ddbda0c3f7633faf1331e5f420a07232a99eb3b1e91793b275e3"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1fac3e8e1df8bb78219b3b7eab6c441ccff8e9bda77711421ac6b6c55bc5ffa"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1999463e52dfb7cb77896cbc9fa6e9627a85e6e9c49377c29142e3407810d83d"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f03d04efc96858bcc3d6b97e2b29018a988a938e4f377dbc2a397c9a0f5a80ad"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a26ce43571fb3a43bc009432a6a7d8fb5550ab79c58c93d040d63171e0def6f5"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60c02be3faeac553a99da0837dc7b61c50fcfb71742068548b93e3316cb0c3ed"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"190c3f66c2614c09bc14af64f341bbdce7550c28025d59679cae3e9b4a20b3f1"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89baf6f054d521ce41e5fffe26dfc6c7167544f34cc39660c059c4d0b6679c73"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0828436d76ebcab6c347592d2678eb624f49fe8d60960ca80ff124917569c7dc"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6aee4fa61bca9ed41bb7f40217ca124814e21c76f3f2cb7e50bacf96c90bc9c"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f8b36f1f4df8f697896fa14e45020b663cd660dd8069132ca5ecc5e80b98d04"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f845a183b530c31b37bc1955b8be6e02302b67db541b9c68a9e97bef6ca2dfb0"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a8c3cea6aefbd26860bfcbfac5dbfc67cd0247adddc1c54e01f988efd4f16dc"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c705d650bdd1bb2c596aa6533e2176aad58f030212acb383bbdfaba9cdfc3b54"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"281a53ccc402f90a9dd6a152b18a92713b74b04bb5db37e787bbafc4dd3a75f3"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b3078fd95c03e37731d8f4c4583b4bb7787d31669c9760f6e22eb2a50fa7270"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8d6476b965afb5eb5d08d8bd88ff3bd01b8be623d1d97f63113519f2fe233db"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c54a0ea1b0341585a913a134a9ac6f9e48220ee9ec901cc3cfd2e0ca192e0e8"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1282024a259c5837f3f0631e1e56eb2da1d471cfa930fb0eb82060f2f482c24"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6097980baa844bf488f659a615291ebdd2171d95e3088147ddffaa6ef8d4059"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"3a968928e70ff50b33e93866ac6a5faf81faacf749765e14f5b62ee58ba47ce7"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c3693cf6beb490dc10e66664fc54aefb4f30c0576c9b8052a1ad20b35e2b4ed"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"804f9477e841ae5cf694f4875107f7f2ede35feea428a83642c871f48628f031"},"taxa":[{"id":"CWE-778","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"418fe3f7fcdd4fd58aa47f64eae4d4fa407a228fc0a3b5a20b53ef54ae534c50"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4d013701e7fe42684b74a943590cd0c2c4d374ca7b351e5e1daaea83080b9a7"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a94742b6f06f6d0c341682de052e7fa2e438208b31f360e26af7a30ba0f2ee4"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb539fa44dbff7dc72b7219a3d7c1f97e8ac2ea2ace95499feab766e8e0dba12"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","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":"9bbaddcb92d398201ee0b0d037ea0576396aefe1575c25bb6ed8b3e22c1d9cab"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75620cca405d12ce534827ac5cd02f2d81a717c65ac1d1855d880298337f2abf"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71c3eb5211ed40177a91389c848fc526903e5de524719a78b163d901614a30c0"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"395c752b3c62472f5dca4210304cc535e93b916cf44605a62c928b838f82f4e3"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ade9ba3ea1d3a92f45dfb23955364db529494a406d88dc469064d6b09cebd4e7"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bb339da89a65122c82b6e94bc1cebe55830b41f029597ed9a54329b91cc5004"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64ae26224b1b84a3c2bf008273094ee6deeb084a2be9b9a0837343eb37f48fbe"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55abb22be97da11460376714507a4dab19bb4d420726bd519a82b50c0bc31c8e"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"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":"32cc8116efce1698eb4dc262ad01ed0073bb76e658632812598db4fd2259f9e5"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abb688fc19ba82e0dc3d609492a234b8c2b2ccdc59d6f303cdcf0446256de334"},"properties":{"dependency":{"package":"unic-char-property","version":"0.9.0","advisory":"RUSTSEC-2025-0081","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":"a4dcd4e713c40de75d50f12201b0d8154d7740350a5ce91a0af3c9a610acb5d6"},"properties":{"dependency":{"package":"unic-char-range","version":"0.9.0","advisory":"RUSTSEC-2025-0075","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":"ab985d48338c34544b430c81061833a5cbee44047864b62ab800f80d03dd9cfe"},"properties":{"dependency":{"package":"unic-common","version":"0.9.0","advisory":"RUSTSEC-2025-0080","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":"303a3d729c6644f9a498407e74bac6b07d140cc2bf719d352ff157422e93a3f7"},"properties":{"dependency":{"package":"unic-ucd-ident","version":"0.9.0","advisory":"RUSTSEC-2025-0100","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":"bdb095122c14527bf88077bf1306f6f2794f67dfdc88b89f8f88a5654b53655c"},"properties":{"dependency":{"package":"unic-ucd-version","version":"0.9.0","advisory":"RUSTSEC-2025-0098","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":"2654edf435ddca4ba752e34426cc3c9922edbeb947b550426627834b1b05d1f8"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"074fc5753ee5eabced6cb7762b61e565dea84ea2bc775f17843ca70117ce246c"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d93a7d6c19d6bb8807bf52c4b18876bd59cac3c200dd7a2ce87588b698fde4b"},"properties":{"dependency":{"package":"backoff","version":"0.4.0","advisory":"RUSTSEC-2025-0012","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":"11e0442d20438a1a0e5230f5cb857767d8c4ea86aebe80e2b2ec2e9eb3b7f7cc"},"properties":{"dependency":{"package":"clear_on_drop","version":"0.2.5","advisory":"RUSTSEC-2026-0283","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":"3b3beebd02c2a2f177007c358670aa2c4bd8114ec370e22a61a8358aca109080"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30db1dcb2f414bd060e73bbf06842f3c8c461f7f82bd3caea0d039ea9e313376"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad462e2de5017cde3d9ddb1ba6d4ea5e1204e7f5904d6be245340e1b58d185d2"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0253","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":"3baf24abc0ba3bad980fed491397f4262c4ca4323a578b605c3b53001271fe30"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e146ad47f00240415be0b72bb13acb5f632bcc80e646c6f1290ff03b7bd20414"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f63f06bd0f4628534cf96e9dc010d2e5db08f4a76c6f0cc75f288aecd6ffa46"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abdca0eaf5a44d74f8b159733879a37db990ab573f92ab92d4f97da0809b2770"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b241cac1b1cd606f440b89c8353447eb35cc891c3a6861b55c490152b98d9f6"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30af9e69384f03ee74ab9a3833f52b54c95ad3b7dabb8d05a2ce44c99a776108"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe3c0c6822953232bfd14963b52b0ce91f3bee824bf8e7f052b7a95bc24e4695"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9bf7cacb163be507fab913dc1a68dd92fdad4ff625bd6d62d2cc8cb55344ace"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"beecc13e0df41b4fdc4c6107eb7bd741ee499254a99fbab4109cde709790118f"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96bfdb39273aa77ebe8845e85b820bcb0d06761974b4587286c3e9e233d63429"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2fbd4bb28b6ac1982ce6cb54f70aa191cd0944449f71092963bc4b3cbe964ea4"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4b6b3ef926f19d38a4f2e9d4f64f08c9d6124d23237319fc2e7a18f25c9bdef"},"properties":{"dependency":{"package":"core2","version":"0.4.0","advisory":"RUSTSEC-2026-0105","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":"db04a75db5612ccdc7faa142e00e00f5aecd9daf64ad6b315a2a63f9050ff78d"},"properties":{"dependency":{"package":"fxhash","version":"0.2.1","advisory":"RUSTSEC-2025-0057","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":"7ac6a90ba0145b1a82d1c6d0e5944d22cd8047d48cb2e2621fd48d232c5171ce"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"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":"a5fdcf96eb52df4b63a68d7027431e1903aee6a353601e931e2c9cffe4511e19"},"properties":{"dependency":{"package":"anyhow","version":"1.0.101","advisory":"RUSTSEC-2026-0190","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":"b2fc83663693d609d14ad75676b5fa9fc9e0a8ec99781201bcbbe3df322c5653"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f412baabf8357f92cc3ea08aeed6d750520051f52a43d53275728b9e9105c5c"},"properties":{"dependency":{"package":"rustix","version":"1.1.3","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65e68e34a2a5e3fe02274600c27df134390a47fc4b40144c998f33366eaeceaf"},"properties":{"dependency":{"package":"tokio","version":"1.49.0","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6527708c7cfd51a2080bf419f27274ffa38cfaee4b2ec36220439404265b8be"},"properties":{"dependency":{"package":"@vitest/mocker","version":"3.2.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a2eb8d9722f4ff040d5b6d08112c81ca0238c49edadaddecb38521aa4f6ca18"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"npm/packages/ruvector/src/workers/native-worker.js","line":52}}}},{"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":"2f1c7a5b58103bf184cfab7bd7987fcc89b7b6cf910fc2f6fc1b3f8190f44241"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9a38403b861c6c8ac43c14c8246d3e75fb1639dadddb231b065b0617b845155"},"properties":{"dependency":{"package":"hono","version":"4.13.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f76863bb1f8b66b8d325994f0450ea6f2bbc6ad88ce1e1afcc749237c5826db"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c580e3b90a2453e23a4d9c24141bf521a7925fee98f1e3d7f3d7d1b935828bf"},"properties":{"dependency":{"package":"vitest","version":"3.2.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"npm/packages/agentic-synth-examples/tests/integration.test.ts","line":6}}}},{"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":"19ee97b73f3231c0c869f850d917f4e3ce80c87df7a034f1caf7d1ba0549c05b"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"880c5a9e3754ff2f8b6ebe629520afecbaa8208a75ab43985dc95bf538bfa60c"},"properties":{"dependency":{"package":"xxhash-rust","version":"0.8.15","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af35004c916a494d179c63eaf108161b2aa5b0d1d3efd45ac52f1e5308e49c6e"},"properties":{"dependency":{"package":"xxhash-rust","version":"0.8.15","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e8f085dcdcb55bff988aa382d2cf2c211830db64948f0f2f4dea09720560b22"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d885a6c3524cf72fd5a2ed03e9e79b3e2b2b4c2a38e5f00b3f7bb7e4044b710"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f48cf8c9f415048128045caa118a1e03769d0b4fe18d7f036c2f3766e3e8d8fb"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"705e8761c5e609601c0419d94a8bad1aeb6aee434f48ec4660c92e8bf534c9de"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"988455afa44a81f95e7964efe8bad9d9c33b120c9c9d4096a073de2068278972"},"properties":{"dependency":{"package":"pqcrypto-dilithium","version":"0.5.0","advisory":"RUSTSEC-2024-0380","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"938a886d9dd9d4a5216db40d4a03e7a9520433bcde73eb9d27b21e0d2b520120"},"properties":{"dependency":{"package":"pqcrypto-internals","version":"0.2.11","advisory":"RUSTSEC-2026-0163","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7565a6d000df6477c73c5e3d668b09d1c5536f518065260d47752b6a4467dc49"},"properties":{"dependency":{"package":"pqcrypto-kyber","version":"0.8.1","advisory":"RUSTSEC-2024-0381","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18b9cc6844a4981b3df5ba9466f1a35902b84b759eb878199c3f15033201fc4f"},"properties":{"dependency":{"package":"pqcrypto-traits","version":"0.3.5","advisory":"RUSTSEC-2026-0162","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.26.0","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02f23d22faedb4b2699d96dfc73d0616ba5c934702bb67e6fa9d5e2ffcb1b76e"},"properties":{"dependency":{"package":"rand_os","version":"0.1.3","advisory":"RUSTSEC-2025-0124","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52823bb3d8e50cd6da5f86c56ffa5d85eb69381c028adc7f91eeedd95ecf73ef"},"properties":{"dependency":{"package":"rusttype","version":"0.9.3","advisory":"RUSTSEC-2021-0140","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74b8ce3ab9f2c56132a0112a97e2f80c19397fbcaaaa1185607e8b4e19c88673"},"properties":{"dependency":{"package":"ttf-parser","version":"0.15.2","advisory":"RUSTSEC-2026-0192","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eab8eeab72b1a1462ec44c06fb5cb865b2cc78248e5223d30aa1afc21a950a36"},"properties":{"dependency":{"package":"ttf-parser","version":"0.20.0","advisory":"RUSTSEC-2026-0192","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acdc312c15090227d543e70c3a30087da5544b5724402c8a1114ec30137acbca"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19c7c758f75990d153ff63d221f0b9cf6673063172ff12e3734c049a620a7350"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38f06896b48174ecbf61ed925097a922207ae124cf337c750549a649459ceb22"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ccc98836e096eb29afedfd53f35a22f7e2b2a738b878e1c5a7b276ef004a175"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b66703e279931dce293079b41fd5443e88387a4d098727da705c85074c8f9fb3"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"565b81b73cbc0373c0bcda7172a3ba3601beb4e0ac52dc0104a99cb0c9fcec48"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dce307038c70c5f7f634508ecdc88633e2383fd80862f6d9d4ba2b91b1cc1f98"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b2d2e953c15b844a20464426b7cf2e7bd83d6110a00be95a9c5c3e15a00e18a"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"029aa7b398a93c04b46bf1aba77d3477c3b3ed033c7ce2c30131d639da6a34e1"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56e57dc576fac91215d3de44b40bbebc4c7d162ed16f80cc27e620f545393400"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17452d689a3d98075ba44a47ac906954eb2dd2b4cde0a8deb93d51608660df8a"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"670db553eb596ee7d5b8f6fb991ec3fd830d92595391a09ac4369f233688a330"},"properties":{"dependency":{"package":"serde_cbor","version":"0.11.2","advisory":"RUSTSEC-2021-0127","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"001a3d3261feb8488cc172b3add67eb0624f0d281bbf6db1777b6ae991d617d6"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c1bd03f6ba9a5e245ea68adf32c7ef18de61bb1f74d1de4da72de83c22d7135"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9c1ae84c468bd3a1031a7a2756e07c2c0d0f59030ab140f150ffe3c2be009bf"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8835c8c2442728430d3ff1889af586fee1c95641873b7a0024c0a9b15f9ede46"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14c9ecf774cbed2f085a47e0cd98597af42782c588bd1e6a6e3748562802f96f"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43e0173a960cb09e3e121209d3eb3a667fed26804127850a9a924579cbc9854d"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a3ce8bd1494338e537fae2d53b8c78f7787cbfda0d71151cd240ac2d335dff7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62a1d1361e17e5aeea963b3f4a02c63c6f029d402dedf6a53ab42925e80f7fbb"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0097"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f8dc86ad358bc76b7d88108d3e830487c35851270a7719ae9547195e8e22e93"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f710b8f70d86e957ebdeb357e3513220484091dce60296e941e49fb4ef0d0374"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2fb369deca1ad67088b2c8abc184369daced4dfa8e636d6676bfca390831286"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4953b442c26bdc652c2db7679fe1ded9be32c2fed75c35cd7a2d8164ad70641f"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a7de10e8ea4ac7145cf3da3e0aac1803588f1bf1da5118c0bab558469ec3ed2"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0002"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc9782672821d27f21858465f26e2b079e6c2532bfe10249afbd282a1cbe84c7"},"properties":{"dependency":{"package":"pqcrypto-internals","version":"0.2.11","advisory":"RUSTSEC-2026-0163","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f086b3ba724385ee5faceb7878e08018b674417d38dda8398b173896f731a057"},"properties":{"dependency":{"package":"pqcrypto-kyber","version":"0.8.1","advisory":"RUSTSEC-2024-0381","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86f2655ae8547413350c1375e89c6cd406785b2909254ca56d5dd10990886be0"},"properties":{"dependency":{"package":"pqcrypto-traits","version":"0.3.5","advisory":"RUSTSEC-2026-0162","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be817c5531bc07659a19df48d8e129dd3116a29fea52853b52f8c7e7ac71f584"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"babff498815e484263223b14d910b4b6d6ccbe825836c1d7d9b85cf436e3b392"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"057f2d4ee923f3cbbcfede92a7f4fbcb93b9f19e19f25fd28996df926d1eedef"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3361ae9e06dd9002f07c5b8571dba9457d0bfea1af8c3b136d61d11d29aec47d"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7209af2751d910755351542da7c033b9081d5f84cae312ea544bcffa15d0e2c9"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9da55ceff0e8e0cad778c521ff9a4499859b9c3fc470004a7101e8dfa123288b"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"233ac47b0b8dc1072a10702765d972ca65472e131da20da91134ebe5b8eea034"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bdc1c6e4ebdf9be1227e7c46c615f7246e9589e00489cc9523681538d33b6d81"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ccd1d7ee420e5709ecd6f503c0bd29776430e4696bf6da330c9beff067e0e11"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8abdc58c034c97d3126db8cb347e193e3ca208edeccc0688f1577a2a3b3d8bd"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"871d5cc50c33f6401cd592c6e4b7096acebada98cd61654878cf02e06b0491b0"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43ffc9e8e652fb7be352d60d4e26cd211586419ec2d6c1f6a8a09f378245b8b0"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9352ca017077875c741919e03392c447f63ea4c31d6fa802be59062e4c03dbc"},"properties":{"dependency":{"package":"rand","version":"0.7.3","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0097"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6be366e1476797bc06b60a4b22be4388d6cab5dabecfe96eac749f78b535c25c"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0097"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79a077f5b910bc3e0b221156418774224ef19c670ad79a4bccedc37107189764"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0097"],"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":"dd615430197de6c2db8d806e0207dd681a7d82819eb2ce3e5f6c3b68cd89d915"}},{"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":"157ec02ad6b635a52de7ce8944a14ef496d7dcd3384b8be7cbb414675a41eec2"}},{"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":"40d01f45ee9cf6652e4fcbaaa537a2c9ae26f942f451596f5f8c5ff9f266e263"}},{"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":"3e0a61660c3748729f67218631d5e8284d3e277ac39febfde07eae34cc70cc0d"}},{"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":"9bfd0a2a5424af0d8688fac922a21354e558d31a6921a33a02a4e821b9fe6cb2"}},{"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":"3f38c8e3e43428198c59306f395ef88a5beed64e263caae4dd45c12bd5927764"}},{"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":"740d38fa0b0755c641f5b93581b24fc6472a934e0a705dfe5d90e51ba2d7efc4"}},{"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":"d147c7f7fb9bd82c260d1ddc9bbedcb66885d62112450f489ad8bd30bec5928b"}},{"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":"33c58a0be4b41817b8a8df7e7bb90262c2567b005e56bd6549035c2db786df4a"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c487b91f67964266d88c7d18cbc82e6f9701dbd92646c1c8d8b3cfc39f81169"}},{"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":"5b388314c2d047556e8e31bbea776debb49c261ab634a24dfe559e999d6f81de"}},{"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":"03c20684fe17b732f89c256d185bc88065bc9bc569f4af62b7a58bda0cfc6ac4"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d9ac092f2aebde9f21e92027dfd41cbec19c98ed3917d4ab2024329f731a51c"}},{"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":"5b01afea0c0055a72071f6f5093ea75242408480f3a842fdcb543befa852cdf3"}},{"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":"4a9cb41478e1e58eb0fc3994a33f459160eedac7a47f9058651c18662b242795"}},{"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":"fa01a3af3c376e91b5d454cb52dd06a7e120ed6aed0c80466e8d2c27de7b1818"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ece49b1e284f3fa81ad7c46c75cef5802e60c018e2fe76d23d9d7167db4045f1"}},{"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":"e82394a0544b86f134f3b6a7f57ac11d488bebf783050c988979e0daf62bd3be"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"485bd2da539f6c748b7eead4a2921f4bec3526b2300ec7739e97dfbb6b42b200"}},{"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":"61be54eec1ec4e8b794e43aea4faf6f1e9aaff66862dd56e11faf2e703ba95a1"}},{"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":"928f52b321effe6fc86bcbc6299f4776e9607f47f1becd617af1f45ec674ba86"}},{"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":"501136981296b8406bff1091a95817f6d1a70bdba73b53f4041e64fde0619b4a"},"taxa":[{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"3f5a98745f636ebadcfeca71449bd2d224e43a35a92488d430d2f09df20fc36a"}},{"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":"473a6dbdb1a14c2de5a20e630e5070cd9416dfee70e434f9b9051aaf09db5217"}},{"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":"92f1ff6534ac644fb8822073ed86be8317c677d06842ffd1984ca3d582e72945"}},{"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":"4eba59310f9a43386dfb7710a275d385355beddea36212be33d9412368653d95"}},{"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":"b09c66e7087441440c2fafe288ca9388f1b1c9f3fc3dd032fb726eb399bc4180"}},{"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":"3cc70fe359ad410e773e5c493ddcc14fa2a0a73c2b6361be4fbe57e0aaf09d26"}},{"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":"f7e32f9882d7cfc6d5e1e3e7ec9c140ba1edff96fd18bbcf60bffd0d3e169d24"}},{"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":"c54809e531a2ed8e5abbca909bcb067ac974f71bda363f0a950ae6e59a118bb7"}},{"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":"0f5316609f402de839020df8c8545b3c8a32fac5101ce9c885df3522088c2c08"},"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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e90274a6dd9c5bcd28cdd270a0fad59c61c18ec5ab5d202250242f77d13db7d2"}},{"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":"4287ec7bfe948eb664615818013e1c22d6444c7232cc2824e8573e9e4a7da222"}},{"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":"d21fb24d0720ab8313319c82a6630da00f04daf872b547a21f74a9fc9fa34d3f"}},{"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":"1de75927a2e360e6eec979a2531bf3d55bdd0e7583941b666e35c840e234e607"}},{"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":"75ef2881793f46d34b659e38842eac83d0e0635f5640a9727e371da2c754396d"}},{"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":"c7a4cd78af1dd0d07fe1138b3c61609fc0f33254ca76147805b382615e215371"}},{"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":"7b5e0e34b5467c9838f646931fdeeb0f1dba8521e789a511cbbf2c446e3d5683"}},{"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":"afba46614f46c6aea1c59e3965d46c683b2160dae047ac536a5c44127e5c96c3"}},{"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":"00a5e15ee020308b762ff6069425baded910d77dc69494b897e0ff56341818cd"},"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":"d7353dfdb1c885787905ca3b8fb32cd2c323edab09f4a5faf578d3aaf6f5c2e5"},"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":"fba6384eee18159fe26dc62e3b48fae9a26933be75826944371395a618f352e6"},"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":"23113ab8b6f9e7a6af1607ef5637e07bde001abc60c85d0fdfd9e9c0125b8d4e"},"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":"3ba484981d1a1a49da9423506abd5909fded7b2d5fffff80cfbcca4110e8ab3e"},"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":"9921fcabe95a38410ef45f770d28089a2450f2c5364d07caf34c4eb0429d8ead"},"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":"97f9adb9d6fe590fed32dc8f74c73fa321dd4e25f835bda9761acffddae71a5a"},"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":"f1122b1392ffa03767c1094f48753fe0bbb8d2b68ab9fedebb1e7157f393144c"},"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":"cc5760690385ff3774538f7605471969860a247fcc38708fa2e62e1a6087f2f4"},"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":"18c3dbdd260bfa34ae777ab2f5f8833131b3dad39d8d9f493ded36f95545b0b4"},"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":"304852e1f1d78add5d62af87c2e6c375eb5c091b4d04c72b779d3351d5454fdf"},"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":"906f9a0940e5d2a5ee70b1cddb3a95efcf9b1f274423459925b7e409f4aac1bd"}},{"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":"4e1b09280f93ecb73a8f176bb7268c23941beda2409f7cebd957e8020aea5f80"},"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":"ac2b0bafd20c2d3175a4ee50d629b4184975e3b3e00ef2346251d6c06b168093"},"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":"c710fc158e9c249567aefe334fb879f49748c85cad0027c80b8079714be8bd8e"},"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":"76ad5ee8ff7737e7e5cd9e200b31440991604b0579d6b2271cb5d464a12afa8e"},"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":"e7098763de5acd8232f59103a84e59ce4150e2411cd0ee22fdc0bdbee2d08211"},"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":"c58b92a294d7e39e652bb8acfb18e9e0ae663f207d1bdfc1ca67c00811fa3dd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0072a938b2d4bf5d64df8243d9f04b7729b125fd7db62e01e32e1b144751c305"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebd33da1822b6120cd23042b8c1159cf6b85bb3c10357d3f869ef6ebefb26e49"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"450fac51a2a041dc78768e65fd359050c90a863316a7442ac59e73ff5fe0dccb"}},{"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":"355595dd651ff3feb01d7dec0d6805c286c04734119c9ab6997fcbc059e7aaf0"},"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":"474036a9749f8e33a5d6f429c37b875315b3c7b171fc209d5745c5d47169e57d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31373668dc95a9a769fbb830653fd044964f077fd6c5c8907c2c577308d99cc1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9671a34bac7ff8d833591fcff5310310b45cd4c9dbb3ee693ab530717a3f8eec"}},{"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":"908416e930f445b43678e13d251e3eb42b9cf7580262c20bae5d43c0371336ff"}},{"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":"8f0c49b67612eb3a8274cd82904b7c59de9d5a2e56b246f2f425872ee62165b0"}},{"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":"d93d13e51be341b36a387c33f3cfc1f17f92fa255ab936349209a7d592fb65f6"}},{"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":"4fd101fadabd3e1ef82b4bc7e3cf587289bfb98f604e1646de6e010510aa73ae"}},{"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":"993f5af8479294b4551e333e8bb6a0977f43c88099391d5c7dc6d0944a6d4aad"}},{"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":"c80d6b4bc55f73452188b94f544b1cb3d97f25b323c7e1492f3c0ae692d1256f"}},{"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":"0a832722ee5d6a3037be2b4bdf7ab2e6da0f001f6d088cc6e30f099c365ca3c1"}},{"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":"ccd3374a7a312b964700b528ce22ec8763a4b0870fa04d9817d3a62cffaf0d89"}},{"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":"05f4259ea68b35c71c4749e2b76d353e3c5a95e48c9cabd0c0927767c868fe6b"}},{"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":"296ea9c34ed0a6621314703ab0ba8f37ad5355e13891545a49d8d54a66b82df4"}},{"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":"1aecb1377c4470c64f12c6c04d4577d12721cf9a6da2a904951d7cdadc208bbe"}},{"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":"a999a0a38d173312d9457f438c8d83bf5fb9d0228f9daeb9b7d6129d6c522d5b"}},{"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":"dcb4a55167ca3b57ad84e665a05739cb8e68eb64ff4ab534bacc9ad67d0f968c"}},{"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":"ff6aa02caae649cbb62036ecea218caf8f0312a602e2d7314db1bb3736751880"}},{"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":"01e2a4c39b24a15ee41e6c1a8d3aaf696c7ce46231d7b2cebb0bdaf02c7e9a7f"}},{"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":"7473f8fb20965276cc76939dad4e17d8f59bb1358845b6c6218ccc2d49f46d75"}},{"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":"0e8c48a9c3cf21e008e11553cc901721e990c4cd3825a8837ec533d3dee99b4a"}},{"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":"95adc56c86dfb4addefa902b731065d0598130ba1c3ac925ff84ca1f79c93625"}},{"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":"85327cff544efbf905b9e82d1cc07064875fd736ec594f333e914112237990ac"}},{"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":"78b1f440287ad25918b2b1d7f736325dfaeed4dda4b7b9af8b49ecdaa6475d10"}},{"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":"f868b6466207f37c3b99118fe0b340cd6a077e38cb6ff15d2137c92f3657b02f"}},{"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":"6dec65e0201e44d07bc094e80a99c01673db43ee292da8db3f866f3033d8d244"}},{"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":"70c2d9f5f19a0920986983e3ca58cf24655b344bbc720293c1523067d9c1aeaa"}},{"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":"5c09ad8011b4a8fa2e807baff695730dfd8cd6d1f041c92d38672a107b42a606"}},{"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":"2aba7944b89b51de1833762b84a1c6ef5b47613bbfcbcab4dab1bc55d05e1a48"}},{"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":"09bef95f30b9b2456a2cd832d709c2e7efdc6dbe6ddf08fe2beb9733a3d025f3"}},{"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":"41836e6341468650399725f9b1b12398935f2fb23eb457405a1840d89ad38a50"}},{"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":"8aa6a64fc790ce77f3037c780289d01d873a19eeff26714a68cac47b9e5e7561"}},{"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":"76db7b8f607cc8127c340dfd039e26bbaefec9d0fd9620802a558a78ae84b068"}},{"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":"9eb89522444389df68d393232834c9a94d3e7d074f665b41bdff4a679f71b8b5"}},{"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":"7614d6c65f7732eed748aa3f8d3f6058d72dda5ca60832c70a2da2027c2de30e"}},{"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":"a98e006e63fd599b58f50d7606ba3fc8b352bde4e88f9036f4a8ffcf29bc6b9d"}},{"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":"856658767c4919d9510311dcb5b51aae3fcda9a47f8bbcf9b735bd1de44cd71c"},"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":"158a4326dccce540928fba5d12b53cd481bf99d37f41c9e19e38b733c5b4f678"},"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":"be836ef16ca29058e1098651c170a4c6055660af0b026a02815f9a1ad5935279"},"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":"5563d3d4c567536636fce65a5f55cba7c5f3ef47c6db917bf1cd43a7a1ada045"},"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":"23cd8a01a6bbc1a8e6d83e993ba933b5a5ce5557f7f2151b6c6dff2d992901fa"},"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":"c72de1fc4dc71b89a46773421d9fe41fafd153bb7c219a631bc30a34d0d5c1e5"},"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":"7adf9848d14f4a2f4e59f33378d8af3ee0c2c0b49fb2b27df0ae588af63b6607"}},{"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":"7f8ac8449d0100351212ddeb4837acc74a797e26b02cbbdd6984acd190bd1222"}},{"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":"57c82c52bfca9567bc3a3bf384ff39eb5842eb07660603e1760f9512afd1cef8"}},{"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":"120e732e204d29561bc992ba01550e7e460d543fe56232209c547cd26f454939"}},{"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":"bc1f17803598fb4a7945a4c0ffde045a710687a36dd10eb4cc3abb476e857711"}},{"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":"faf61f334385567654e2345a945996f04e613cac79cf6e833c87e6a92f54f7b4"},"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":"b9bb9b322c3d6f1b1082c207e4019c2e532a1fc5def67de4c67e51d037a596e7"},"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":"2ddbb7f903f117d3c930a8d4cae45fa0b184c8dc82b2cdf1f9a6aadc02ee8256"},"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":"179897b38bdad0e3bb605a05e4e681f106149657ca8e002ec9fb5f18a694a30c"},"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":"325a9560b4f5e2cce43e437c5c7a3d50cb4bae2eb4289174fad8621eb564a48a"},"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":"3cec140ede116abc8ca546d35c8114feaef13468c49c3299f906a480d2ad278b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8fa9bd84ccd4f5c3e23c792668474a4af30176978c37d8b985c97517265cb46a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec6d5fec053b5b461088ab6749f915666703d295642c64b264103e33e7bbab70"},"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":"48598b9de0f39b0a60ea8168845743cba739c933e00e9d5cc448277eeefb9447"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f94b232f7636d04ed73c7ba6116800edd4bfca1841c3b494d0731f531a2362d6"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"06baf172f98eaf46830ee5396d7c8c86c90dc5572a373329fe44461722e943af"},"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":"e66dcb7384a82eeed749040ac46b47934df430dd7d2a17f5777b01f6ab076ede"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83f765a67f7ebae980addba1bf86e84714b7e92baf9b927a0bdcd5666a76c2dd"},"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":"50afd50c5a58bc73d69ce1edd3d7f5e4826a70e3e775baf8041e93b9a6227184"},"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":"4e511ccc92aef7092fe8e934f0e089ccc630a0f0271d56e76add0fdbe1a7b079"}},{"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":"58d32a9d4bd4c72ebe800c3ba529fa1f170a8f2ab9aa23ccb4bc47ee46496f2e"}},{"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":"166ad34d60c71f67be2f21db9e9fb629a9913610175c271acf4631f58999f23a"}},{"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":"12bee5f5f2583e3b1226f978eb587d273962de5e408ff757a3386333670fd390"}},{"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":"20a3ebae102bae808fb59a29c96d3b2c3720aa2020f1418fdfa81586f92f7f51"},"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":"a4e66ea41f0b0b96fd275067d9d9d6f2ac56c67bd7386268fffc76a6ad14e43f"},"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":"5f0f2291969c4d13e07d0bd91bc0a53f4364edea532ab80c3e332706230cd84a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed6341c25bd2f5d11164d1ac111361ba7811fbe3b04c793e32ebcefac5d8444e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18a384cfbfcf954ec16a9cd3769e6263d97ecf8c8bc3d3628a3c034db8612887"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0719e7f4e996c1141e4a47b2dd6b9405cbb7265810e23a3c620727a886ce6ca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"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":"43f9297f0631894932f5421443dd2f7da7eb181eb2644f581d2527689db78532"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7fd97f9d35bbbc11504306454f0e1cfa8decdb57c6af8a294b916adf8cd7629b"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f11cac8ef521244bb46e04fc307fb6f7a5393f819c4107c5e7fd172865426087"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b55fe48d533e844e9c056d818a9c6d2d16b99e31dfb7f6d70fdfaa559b02f0d9"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"115e6d57a19bee06b5bf5a5cfcdaae865e25dac496c6ea76408c9dfc28b18e08"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7aca3dce88d1eeb93c64553b428d9c94229bcaf0d3694d521c636ff53f39de98"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"179294fd2043cf3fe75a50052e710135ff7469083a1ce0fb9a30839a55157899"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7bdbdff05f093ee6f36595d8e21631df6a0f52077861d88d7292cdff36b6e94"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dfc07f53622046634f073ace4d6ed7b67b21cd184a2cbce88d3138cea706ac63"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae1ea7502e2a6dc4cdc06aec0a4baa04005c319d2bb56640a9eaffc3ecf57436"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68d64037ec6076ab9101e93386c9c65f1294c4683d5bca1049cfabcf3b523042"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5457bc803f933ed3bf6a9fb58f992863bc256ed3cffcd34d80df69922bec458f"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"344eb6078ea2fa1b4f784d633a5d9747863c1c2bac1beb4736d6e6cd0b46fe26"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9da59a8205197d474f20bb023129061adc9076db8eb325e38db1018f55d44433"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"975809ddf21a889e4d58524d3216077fd0b2522133c4d18e6c5828d1199405d9"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant_simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c113b0500ae1247497e1c960fa7820b88a8df935d29c0260801b3be8e4a60c0b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/pi_quant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3311afc7450b27e8b6de321583691a6e352a9e724c8baa0770cd4dab4748a6b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/router.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb858c9905fd832252644f907e90d014e025c85bd9bff408ee66ec325f7db43"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/sram_mapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6907419f378b19024fe0e5bdef635e1cbb8a533d8181b8afe3299d05c7b3af0d"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/reconstruction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7acf52fa71e6a1c04e4a46b40f0225158532418bd6b120d17587722e4ae9a1f"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/signer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"424dbcfc116096b2f79d360ab893f692ee2e3ea3ea3a1da8746ee09be24ded5e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f8c5a601d52fb43cef2633343a211688037c7bd0ffa2c6e6bff943899c58a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/precision_allocator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe01b8189fefceef0c8370b4a7726e6e907ac1425f4928a39e5f6df5cfc02df7"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/affinity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d532d534bf9687e140c53ed775395d664d4f9df951b88dafa4c60cc0f92b7abf"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/security.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ad0ce024ec1e4ab2fe9b9ad1a6af766a6c848b19b2a59f23fde0a8730e5800"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/tier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c911d17e9109df9c8f41c80a1f730f1e134b643c4385275965d6ef74012407b6"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/vector-search/benchmark_quantized_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"766c962227fc00c1de2a657ba0b0aec2f5ecf1a9fe72e0d151a2b8c41b2adf5f"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/quip.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acd201eb915a5a70399ed331bc7dbafdd78b50b925799b96f45ac07256603ca"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/hadamard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d517b1d9da4fd8729d749f0c5bb0c13614c93821bacc003db859c403de37db9e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quantize/incoherence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"489a974293ebf0e6841229d3250e5e61ee3995f1a92b553b4dc170da4c7a77f3"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-partition/src/ipc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0a6728f6c11ad469145ed61842ab7879367f609877debd267dc24a72bd0cf9"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/training_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"713a8c8278836b70507814e45adf827a11847fc94e8a1dc1933626608c1b1b84"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9581f594afc1a2cd8b4271016d0e561e8911db9476d13a883a03714e06012a6"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/graph_rewrite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954c6f79ad750c71aa10d7c939ef8d572605af75710944a900aea5892cf7ab3d"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/differentiable_quant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b5340e4779b100de29ea471f83560d9b8682b5b9f4d48096819c40f3fedb8f"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/allocator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2818dd001764ec5c8dc38386ef72c03074363b8594435b3a6a3838ab99ef418a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/pi_quant_wasm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fbf2dfefbf875bf3a0be0d0b8c3aa2ca8ad6268b3fc273d85c31e6f53a709a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/lora_qat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6bdc0af742bffbc1a9ba208c9ac5428303096d236c46e7f13fdbb2a03293ac"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/policy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa20329da1e510a911a7b4167206b556cfd946e315b67aa7f0a66aaa1b7ba88"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/region.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"757c67fad4ee39d90e6fb4deec02f18bd6de4bbaac31d6cb77f46aca6c626fc9"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e0ec2bde3bde970b4fe18fefb141f4194ab38fd64e5c002480deb041238459"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_scalar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"146c6900a7742a91defb447d7d5d709dc9e402481b9b2934f09d49305bdec3f7"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeba05e8b8da660c55fa2cd3d07f18cbca9c5e2b8a2c4bc73f7ea4bf9e7e119"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 72 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: crates/rvm/crates/rvm-hal/src/aarch64/boot.rs, crates/rvm/crates/rvm-cap/src/manager.rs, crates/rvm/crates/rvm-wasm/src/quota.rs, crates/ruvllm-wasm/src/quant_bench_wasm.rs, crates/rvm/crates/rvm-coherence/src/mincut.rs, crates/rvm/crates/rvm-partition/src/device.rs, crates/ruvllm/src/qat/calibration.rs, crates/rvm/crates/rvm-witness/src/signer.rs (and 64 more) (101 orphaned of 3000 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 3000 of the 3969 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/boot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1c83fd78e9aadbe16e4bf33145e9450f64f2a7ecb4e6a69aec56ce17c063df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"762818e267155559c0e03be28605defdfefba725bb42f1755e0446e738576dee"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/quota.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d8a5f187c493f6e81c984ad0a95c2b90379dbe10ff08c2c02e8d69f5ce3e3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/quant_bench_wasm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cb73faaf7c13ac1a2b8600b62aac1e97926c51601fda3b7995c4b4bcabbf0c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/mincut.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9628ea70373c9a8ddd3fdb59214ba08138c601957d184ae621ae18cae221b5d3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-partition/src/device.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"167c808da1974166000584c351809426f22f20ebbe2038607c9e9ee2ef0c9e41"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/calibration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2940d5482e066d864100fdd259c792a07d3daa1e5583a6a86d86c309baa7c1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/signer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd29acf7383856fd1d1ed2e16eaa817f49b6985d80194b3a59b050f84e4ae182"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/quantization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac29f550d0cc3f6010c30c85259c8e360d93fcee744b1e91e289ba1462f3bd9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_neon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7275fa29fde18d56d7fee94347abbc6216027bdf4a4663e2639fdee59cbf863b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/reasoning_loss.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"594c48c1e428acb35085cb169bbd823ebe83bdf2a81ef033c92bcc437739297f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-sched/src/switch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c8ca8db4eae38e94f2cd38ac490ae3ce3f3839e94898ecf81588d6622bd69"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a526e7da41befa50bdbdd7bd957a536c90fbcef585a0df6694a5aac23ec86c3e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_wasm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db536ed1c98579fda5f176972a7506849a405f3f0df836e21e8155161fe7f04"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff29847fbc6d58024736005bd8ea04a7875afde3a749cf1b92cf2d939f14718c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d285a9712bb4e64a239ac7d8ab1a09ef3788dce5aae8760185d004053d214eeb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/mmu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bc5bdc599657d16627e15c231b7004bdbc41648f895827d15e12c474ebcc66"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/distillation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e088610ce95e2e8e5c127c720cc3665f328294157375d80feba00905dfc4fa1b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/tee_signer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b357fb7cde453aedea33f302b82e44864ff99aa66935f3e45c4ee9cf8756367"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-sched/src/scheduler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b15f1fbd905fe66bbb9f0666a6ce880158d86f9de2728778e253f3cb90d6f9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/tensor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84a8573d36b863da8e30cddfc54c6b28acf3b5e3fea1ce052df6a9d3719cb7b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/derivation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95569b1db873fd737b8f34225666e9a9457697fcdda19ec1f61162a9502ba59"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-sched/src/smp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916ce034b77431a07144527be3ac50a8e38b7799e299b9c7bdc371f8443a0ef"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/tee_verifier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28717ff0c871667dd424be1dac50f23d0dae4195cbcebd01fe7cbf12088e4fb2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_conv2d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e815462dd71e5a7bc1711f8ca0fd74effd46d7c3ac740a8487c227af90a48a30"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/pressure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9808105a0027cc104e854cdfc25b31866395012496b5461f9f83b9c7b844e15"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/params.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1aa82f16127c157c0cadc9d2c7e886be3e189461e70df8ce58d17b5e448aa4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/qat/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a238465f157aee5fed3dd7039c93d3502ee5d50c0adeefd1ba4bb1e1f7b609f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c86abcc8254e2d28216dee71051b5e1733ee536f6124932162d9d1dde22a3d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-security/src/attestation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7463f0a728bc01e7c27edd3931bd52452d5b45297ce342ac0d6ed95acce0c34"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-boot/src/sequence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598d3cee6ab89d7cb5e5a7451d7d3d53eeacf9987bad03cb8338da49a833daab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"639ca7afd8df5d827e3c08bd658db17fa4bd074cd7c2909616a511e49c519d76"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/host_functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"589eacd550aadfd2944a5f2aac9372dc5fd4a94f52f60249ce2ac1fabb499896"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/moe/metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"851f33bd756b8c71f5c2dfe72b2048755a2af713135b1a9f0052b7fb123aa798"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-boot/src/entry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ceecc9366f297e108ea575435ea71d15281719e2b7d639fed827190dae5e77"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-wasm/src/migration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deee8831da9a68f3cf0a257d001eeba334371e54beaf3b1fae182b3f835fd532"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-security/src/budget.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4b26c7597cdb4172ac25b1068a09304e3c07d030277f6b06977f3ec491698b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/tee_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bff1c47c95cd94bde7e0e37ce0a4756c001889daae1feb6b7b9d81294e03f5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_depthwise.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9f026ae0d65108a13762086b6f615fb80b21edd0ae29bbdd512d09d2fe0325"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/interrupts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34fcb5ed0421e7a8a085b3a3f8a74f462e6dfd9a7f918ae42a85bf8ceee8a3e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5bb69801fddcae587e4ad5ecc63a8522e5fc924d461023e83d44e2ce4cd166"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_pooling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf7153d8542fe86ac8997b5d3b533ce7ec228cc2c3659e93d25d0ca5b0bab34"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-proof/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a2507f79d82de13a7178a84ce23b99878dba7c9c41b6abccdd6529c9c31d9d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_residual.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28c436878fa369835997a7dbd35ed9ca2160305337b29318a88fb634f2d3d65"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/adaptive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a86ab0c3e4011e0f3505bbc20334500935b8527ba5b420844ba8dd9e8e81ae5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-partition/src/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"753fd7ac8c31cf328f9cb09f81a529669b074151e550d36bcf54ea644de5465c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-boot/src/measured.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2a8f67f82cdfe834ef94052bd83fe8bb781191fc65e07c0c40ba3c5b212746"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/timer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8336136dac894bee2fbacc210de1cad5070b89e2902b65f4dd5e5a8d9536f913"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-kernel/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b82cfb25abe4e843e2d20f27d143f89239ed036925d1fac01e3fa5f1d5b8cd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-security/src/validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67047ea6ea3ed742325f21b36ff14596223e11ee3089499b216ae9d98f370936"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/aarch64/uart.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526a0208264742b97b6b2c9673e20401735e2c4ffecdb88fb2a61e84b809e639"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/grant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5a5d75b92b289133b7237e401ccc5f3db6ef014c140c493ef41f1408771d62"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/hash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5b4654f54ac2c3c5c9eb501e99a294fee9583d9073f68e2c8c8479dd923c05"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-partition/src/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"332e8b3d279e4c0f4c9812185a1cafc2c5b9d62c56298cb6690d81657c3d071c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/layers/quantized_linear.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fa84b8bcd18db2ccc4e634e112d4fe6014985b0de982cecbf50e66135e728c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-types/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2387f8a054035197c7520e58849b9987337cdfee830b9ffcf2510e688b60000"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-types/src/capability.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef893f8356a66ecdafdf04526df04ffbd9ad916c582d8b0bf865baf29b0194"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-partition/src/lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d92a5568b702812217dbcf93e602c42c91fd9aeb46c62810eee342183d0a14"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"344d00a883f3206eefb436dcbaf25dd86aa01bd7ef208e2067416ad1374619dd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/scoring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1893fffdbb3e865c9caee075ac3607485f47b79657ddd13c24e490ba20d68f52"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-coherence/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca9911a7efd16f3d45860c244b9e4d1ac02495cc77a286f64d08273b38006bc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-boot/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c8e6ed79cd3d19d8a82930d8d9b5d9a2330b557ab7074c65a38579587643d9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-boot/src/hal_init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"387385534e572eb137a796094bc3f0862422b1b0c92d4e9daf4f09a895cc14ce"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-types/src/coherence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"064047cd4036d3d8c4c7c128c0705b6b6530ba67bfbeae4add26e771ea590735"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-hal/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbe79dc763712df9998c1a3dd68c5c4494a281d8974b598d33c291c9edc67d1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804f6bc677f72caf7121491cabf9374248960eb10718d1cf6289c3dce3bdb431"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/revoke.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7744dd8312523b77f400f4ef53d98f15706f7653dbafa8b9719446dbfcb8e093"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/time_compat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0f780491e872b8e23f5a923cc7c0eaf582336ec5eb5994e5b21be83c832fc5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-witness/src/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6087809f49d7527b110f60053e5057dcbcae2d9e065eb6b22d8b6e1b0d5f74"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-security/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae679d6eb5f32b44d17e3b9db883c10f608d2969d3873215389da45c90de377d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/quantize/calibration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20df2c758038e387f5f324491c25bc74c08ac24e09e0e480c90a71e84c9bba95"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/int8/kernels/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed934a2d9bfffe07b672ede8c1cf9ab5a40e882250ccf1e6e3d8e4837d6f623"}},{"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":"25c67546e61034a911e061f475b510845b139a400f8bde81e3f175b66aafaf0a"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"4bd97f17248e0230ab13080bf837b4e3de5aaff96c2608c65d02d48172602d8c"},"taxa":[{"id":"CICD-SEC-1","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":"fccd1d1a9b99c74366e52aa7a72eab7b2ba2676fcdc9cceb2da93698a67ae4f5"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43a19aa0e2795208eee7c9272a741749f3d50b78538a8ddff56e51b1fcff4647"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9bd60c0fc4f29948f2786d5fc5ce1f1a77536f57d0b7ad4720e7cdc94e92f5cb"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5051829ec23a147209668149f148c5a1f1cf8babb0e0def7dc96565f35a674da"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a102401e0a844433330beb494fb0f96490557fe4c3ec393f696355c8143e01a"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aba23e0f221ca7fc77d3472e0697661b797de9e0258268658bf5bf2505770a1d"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f57195b6de5affdbc5439a53fab8a7ae753e414b708376d59d1a5144d51cba4"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1d16ff3de73f675346fa922b72b12d291e823e5b1bc472519b9e75db6e13f9e"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6f96798c125dfbbd49925035d4a52444235d827d393f922dc39c6ee1fa74881"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de1aa07392a6643beacd2f8c2974e72b9e0a7d6733b3c72a82f9f7a703398c1a"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d82d1e88f6e8d15fc4302bf6b7ce7c3732c6bea3e64c2867939dd646966097f7"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ad4701c91f7eaa24aa7b7536975da3068c18dd1ab098025ae5c285286432c8e"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc9ea026fb330e85e166d1b3e2123e1b49eb21a8a77edbd63d669d162d26b4f5"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6bc18172ec9a8dde259a70812332cd78be7d4084556f03493a5b2b7ae15a3b4"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46bd804e98d407184a5a919b288cc1d343160ef44785e762a73104246a0dcd9d"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"666c1d3f2edd818e6b8c0793bf3a34a16c91631c47c05ed41d498b463bfc38bf"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd2be82cbd71b44e357bdee56e304f6ef06905df2cfad61c14a9dbe93485170f"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c86c5a4a63066175fc903f880019368bdc8de239aa045cb46aa0e275fe11337"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e417c3aa5834775ab96cbd5081b5ef534663d872ea93dfa8ca19fde4d46f2d3"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e881a24fd77d0dd849f40814e18f3b6c39582a98e88cec309977a7af14c4139b"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef47f1348e4a9455b8343b1fd38dba6cd859c38c00a5865217a3c5181305bbb8"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9299f2f63ffaf35292a7ed0272b34d5486ddba31f79ed77c0b1d642ab7cbeef"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42b89f9ed67d1f61fa1079abeb1a2fbec40855895153fde5ad35896bf9cf13f7"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8ea4c3f1124c61a65cf992a31ef6f1d3e48b875d7da6cb2471c8c1f07b6566e"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37cdb7829df8ae3f3e273ee793e65e2cb48402fcd8de9ac577119c560c2040f4"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"547b20869cb30297bc626e61c699b3164cc111b0c265f76e5624dbddf83ebe5c"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af9ec3876f709fd670f6ee87d56c440fc500ae2410a2130b640b5cf29e57e8c9"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1cba4638e87496ba2cf480869df8ae7e93ad1967355c0cdf634d11d6c63e3b5"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cee87d87cf731fac399b26a02c7d8146a07242247c0d844282e849de3b7cfd35"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cec6ac4496334c596d73484ba8ad4dbd37869e9fef1f8c106b65a238c89e88a8"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e1cee90b5245373cb5f95810443fe922dc6148fa4111527e7c6486baa522f5c"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85042387a47a3491e1cd77dd210cec416fa337e260b32ef327818aef66c1df15"},"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":"958d922a0c78e5247804845a7e8b6cdf4844a2c2ee58ec5da7376b39e0109bc1"},"taxa":[{"id":"CICD-SEC-5","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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 10: crates/ruvector-graph-transformer-node/package.json declares Node.js 10 as this project\u0027s engines.node, and Node.js 10, support ended 2021-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/package.json"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a2cd25bd36558cc709766f11572178ef5de07cbca7425ec24d79124100be77"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 14: crates/agentic-robotics-node/package.json declares Node.js 14 as this project\u0027s engines.node, and Node.js 14, support ended 2023-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2023-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-node/package.json"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b1ab02cd13b776ab93f6ab09cbd470bfb4c9780f06e947bfa3f4a0bc6ede14"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 16: npm/packages/sona/package.json declares Node.js 16 as this project\u0027s engines.node, and Node.js 16, support ended 2023-09-11. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2023-09-11 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/sona/package.json"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae2f3a8282e46ca5dd279e36d8b67377808c252f1adc205b7a3682137c5b9b"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 18: npm/core/package.json declares Node.js 18 as this project\u0027s engines.node, and Node.js 18, support ended 2025-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6648803ca1184d1b831cc0935c1131320f0ac2f71c390fad75199d5bf2e7db6"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb509afdfe23d45dd9ed5f9e4f01a0b3c814751a93a88ce7a1cc5049d8faf383"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/origin.html"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5457a27c31876881d9db381bbd265897977565cc15567e9cff514b0319b225"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/FoundationBackground.svelte"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e655b62c93b569805b794e0e43ba41e20abe485d712023473063f980a942c31"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/RuFloUniverse.svelte"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc4af2689baa9dd3e02ca012b7b2716f51f0ca5063f99e8a7fa101036bd75ea"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cvideo\u003E without a captions track: Video with no captions \u003Ctrack\u003E offers no captions. This player\u0027s source is set at runtime, so there is no caption file to author here: give the player a way to carry captions \u2014 accept a track/captions URL alongside the media and render a \u003Ctrack kind=\u0022captions\u0022\u003E when one is supplied \u2014 and capture that asset wherever the media enters the product (upload, import or generation)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/UploadedFile.svelte"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c54e030e3497e942f3f6898f692f2cd43e4aa7ef570f9c2d1ca1c09e00b3d46"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Csvg role=\u0022img\u0022\u003E without an accessible name: An svg presented as an image needs a name \u2014 add a \u003Ctitle\u003E child or an aria-label/aria-labelledby."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconPro.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9abc9f457c30a7f6b7a20e81e53a9df8f2a157c00d84f803d954cac566c3146"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"91960d3866fcddeee3e59b1e5e43a5c5174cc1a1626c096a1d28b28eee4ec71a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f79b096d9087654c6402e695b7b48b922c83c1a5bc2808fbe007d0021c5ec1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/public/index.html"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67242995c450f70c8597c2f55398f34d9919f3b8ebac7e29891667072df3bc4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/public/index.html"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f666a9426d8315b35e73b301a987d7923883c74da616b59b41616cff5d5ea41"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/public/index.html"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"22994d990131fc4246a7cc6a587d108f8b15297ab96a936d6a85e357a07cdac2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/index.html"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2b0f7bb30e92d1c9b4052cb206eba64ad5b1831741f2126c557568d2742871"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/NavConversationItem.svelte"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3beb3f93b739c9890d224552a1e7619b042f867b6f2f9ce58abe167ba8419b5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ShareConversationModal.svelte"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"09584871f449df9d788264def4447eb8f438f466a32f18a8c1f37b0798ab16c8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/Switch.svelte"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7786c323d870ac028a8cf6ceabb8ac89708760523f9ba9898722794a71b177"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/SystemPromptModal.svelte"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07fed3683b3c8511d82ce78b6e1534164234b0c6cde76dfae2447a1b0becdca"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatInput.svelte"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b93f9fcb93f64ac896ac3ff11e01b33f5986ff87b41b732476269b3fd8c017"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatMessage.svelte"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5306c846a791f696e3c41c647bb8ab86f8fab87c368b425e287ade1c251e35"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cimg\u003E: This \u003Cimg\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ImageLightbox.svelte"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2953feddaef7fe67c9692e4aadd5481687894efeae5c872a137fe983f474ff"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ModelSwitch.svelte"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab79ce3c62b71104b1dff0ddbab0ef79e5ee2cbf41aa3163af059a9cc5f65ee1"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/AddServerForm.svelte"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd134c7ea44b9b28fd346b157d23c7119a9b4e30714e9029bc1ab96f62552a2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/AddServerForm.svelte"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c39c8230c48e4fff7bd499cfdc6077a653ec1d4a42fecd6f0de36a8644bc159"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/wasm/GalleryPanel.svelte"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98d79b5f862e3c99198399e1c2ea6e04af6a077c346056c5bed208262eb15a8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/application/\u002Bpage.svelte"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"df146e668e1033236ee53e56ab0bfbb271abf8dda9b29e5d80962edc9a6b2817"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/application/\u002Bpage.svelte"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3005c35c2f34486d8007ca08b17bfaca43ffa10e52f108f36bcccaa59f504e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/application/\u002Bpage.svelte"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"42751feef52980d82f8090678cdfeca4285476f20bfdefe9440fd36c814c82a5"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbe755562c8ca218086316eaedf364cad4745229c0f0609ab33041e31f415d1"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h2 to h4: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b3e3d46bb89bd29e47555c9f7a6e0b5d30d7a574f8f9fcf391713b49ca7bb6"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h2 to h4: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf17198fd56f25bf7c4cfc036d2f83c854550e66e1b1c791b0c44383b607ab50"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/origin.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c576d3a83e7eecc49c98f47a0de4960ba1e77d77a5b30812a035277232714ba3"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/wasm-example/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64cda6bb325773ae599128caa50e1fbe416565223751a9080d40841fbf19551"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/app.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1159cd50995088873df9c0688924c1af20238e000a303466bd96af916b1ebd9b"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/app.html"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cdb3bc10dc497d1cf1e79aa2f11b8653214ba90d9d3ce2c5ed6e25a4cbd0b4"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ccode\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f79f15869b902541170e65950dba4a9ee8be933f48e1d21a9d6a71028349ab"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2660b7389caa23da4d97f07cc37f3699a4482183299041a54252c05ea9ecd03c"}},{"ruleId":"AC4","level":"warning","message":{"text":"Link used as a button (placeholder href): An \u003Ca href=\u0022#\u0022\u003E (or javascript:) with a click handler is a button dressed as a link \u2014 it announces the wrong role and stops working without JS. Use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b1e77c168f071ca09254fbedb7cc84eb81141d1bf60ec4478b393b0eb5013f"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2f11c2ad8b9e9f20640361109e3e2700fb933e4226ff50c6fdb0267345a4e2"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatMessage.svelte"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"741f10e8bfa1a95b4f90b35960e9cfd9f8f2d1e201ca29f0a53ec51249e4123a"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ImageLightbox.svelte"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbe2a7932accc15e226f55c1a1742c9abb6a7d453b5f68a22e63436a2ee5e04"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cimg\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ImageLightbox.svelte"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7830b8a8ea517496281ab5d4048d9455e542d65da57dd6b87de878475f2f7fd7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.fi\u0060 moves (\u0060animation: fi 1s ease both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8383ed05bee5d404fb5dd1a46236f5187d9deac2db5a92a4ee08238b965aa61"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.hero h1\u0060 moves (\u0060animation: pixelIn 2s cubic-bezier(0.16,1,0.3,1) 0.3s both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a1c94b4a4060a11489dbcd092d70de26f00b155ba4ef7c4784e1a4b563f5e1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.hero .lead\u0060 moves (\u0060animation: fi 1.2s ease 1.5s both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c14422b8a129a3112c88ee1c9aac60bc2c2fd605cd0afd3142a87eac8df9f0d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.hero-actions\u0060 moves (\u0060animation: fi 1s ease 2s both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f9389cc6ccfaff77466d0a9c6e2ec725c6423996a8e53ccaa20c5f350e0069"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.hero .stats\u0060 moves (\u0060animation: fi 1s ease 2.3s both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4745a51b31cb28222fa2674cfa1ba44f66b1aa155a34e796fe736bfc60a719"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.key-display\u0060 moves (\u0060animation: fi 0.8s ease both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/index.html"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eef6a3653cf677443021d4e4ad805d751d9ae73216d17b2983a370491b7d089"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#narrator\u0060 moves (\u0060transition: opacity 0.8s ease, transform 0.8s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/origin.html"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f543327e5c75679564118bb6d4a9fa02c8e2e3a8b455940452a1ec12147f4233"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#progress-bar\u0060 moves (\u0060transition: width 0.3s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/static/origin.html"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0f58ff872b064cb6a79b5a35a18d53b756a6d41556ff102c6660cd38aed128"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spinner\u0060 moves (\u0060animation: spin 1s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/wasm-example/index.html"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d2323751528a46c8cf459333da112f728661b18c81bd2f3f9b171c3c1066b4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060button\u0060 sets color: white on background-color: #667eea \u2014 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/wasm-example/index.html"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"11305246955cba723db79d259d45a6fa1a982e32f7d94fb58fb9178acc7cb5de"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.message\u0060 moves (\u0060animation: fadeIn 0.3s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/public/index.html"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"801dc276d0170f340719a8004b890738ecdea9d9c14b47ae44f8f35411c78917"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.typing-indicator span\u0060 moves (\u0060animation: typing 1.4s infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/public/index.html"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f3b296977dc0753e6a08fc4fce00c024274cffdfc447163ce193efd99cad3e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.input-wrapper textarea:focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/public/index.html"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb25d26cff4638112c4adff5ad80c34c70a73b8385241c459b319bcb34707c1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.btn-primary\u0060 sets color: white on background-color: #6366f1 \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/public/index.html"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beb5d8df472f62ea6c4f884f2adfe1fc0b9a03020cc220a249944c6d5cc40aa"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060.message.user .message-content\u0060 sets color: white on background-color: #6366f1 \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/public/index.html"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"58db30fdaf7780c1a8b8b5bfcfe4670b0a84296a98a93f0f5ce8addad2749425"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/DeleteConversationModal.svelte"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"253a0b2cfe880198a58ca442d39a1d17d3f3c59deb5bd1901048e7cc2876ef60"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/DeleteConversationModal.svelte"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a853b4eb122fe78c14cef66850022dc7efe34614b2ad1402732a25f99ba39088"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ExpandNavigation.svelte"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f09306254c8f07da49c62bc47fbe8ad06ccb497db4ad65992b935b5a2202ac6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/NavConversationItem.svelte"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d126a19a20ce1d8a3b12512705368794c18ff684446cf11d02628cadd8153d1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ShareConversationModal.svelte"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4c47b25111bbd691a1e9324ab88148d4349a2d92e74527a5964fb1fe06a083"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatInput.svelte"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1689cbfa956a5a27c6be000e682a60f95e0adf0c4544266042855fb216235d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cbutton\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatInput.svelte"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2bd1763545d72c62f8ced5cc1e44e2ce168b7039c9fee6453edf853d334e17"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatMessage.svelte"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebba5a4929bdcc9d27f0504d5258ec57b763a9ce54893d78e7b648d5e5c03dc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatMessage.svelte"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c45efa288085d234501f4fe35a06dc38ac041efe6c80eda7432bc9a3b0b927"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatWindow.svelte"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"42515eb65eb28b27904fb0b540e612e2eab7e17f5e1757f8aab01073c932583b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/TaskGroup.svelte"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d313f50602c5c915d816cf84ca0c7b618f8c7966e4f4f68ac4fd35914b6b0b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ToolUpdate.svelte"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"514ebb6d61585ff3824bd86982400a9ddb5280d3f039f08b57aee00ec28f3c9a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ToolUpdate.svelte"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f54efe8c05cd39156cf1d577e3f32d42340f4b74af656d483094b09c1c49fe3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ToolUpdate.svelte"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"773f3c598791d4dde7fe533f4531ca0732e2728f9c02367eeeacd0aaa079916b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (1.0:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/VoiceRecorder.svelte"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"655262950e4f25f973f0ee32de99b27cc421d798f33884e3355c81173cd09c3f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cdiv\u003E moves \u2014 its \u0060animate-bounce\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconLoading.svelte"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"83314ceaadf48fac3c7abdfe4304d9ef877b63681ec8f1753f2232cbbd7031f2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cdiv\u003E moves \u2014 its \u0060animate-bounce\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconLoading.svelte"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd189aa54084448bd5c472f321758f474f1c27fe1266f2699b98590823b0f7d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cdiv\u003E moves \u2014 its \u0060animate-bounce\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconLoading.svelte"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"99abdbe20723542664402bd65833c15860a1b63884a9dddf5fbff46691017c48"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.0:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/AddServerForm.svelte"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d0953de9acf9aeb2c24dc4276b6618fa40d0cba92a7f594808f30bd07fd5a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Ciconrefresh\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/MCPServerManager.svelte"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2595702d49f320c4a4fb2aa483d95c5a3cf32be36a942a8d77ca857df34777d5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Ciconrefresh\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/ServerCard.svelte"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea382903fde9d37a0e50871337b30b38206e36bbaf2576fa8409452476b8f5ca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (4.4:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/ServerCard.svelte"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce71bc7f1774d36e2b39c8384f2a975f22c0ef04002944c96199472a633b86cd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cdiv\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/wasm/GalleryPanel.svelte"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8682655f94c6bb333af9983e20f6bd380ec627cf86c507e626bcbe9c2a2ab90"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.1:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/models/\u002Bpage.svelte"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8d9f980ec1143d2dfef2f912eb1df12ca05db06338a488750dc684c70ae11f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.2:1): \u0060button.primary\u0060 sets color: #fff on background-color: #5b8cff \u2014 3.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/style.css"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb5ad805a719b500ea6b8bb806f17802f29039010ea0969ed9bf0dd68327163"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.0:1): \u0060.error\u0060 sets color: #fff on background-color: #d97a6c \u2014 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/style.css"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"505bcc0c1ca406a39254199b8bee5ea6f1057a0e451cf1f0501c5dcbb570dd9b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.7:1): \u0060.state-chip\u0060 sets color: #fff on background-color: #7c8698 \u2014 3.7:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/style.css"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6040dd84a5962715ccc9256c613553eca3342de68a7aad7187df2e98a39ee6da"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.btn\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/styles/main.css"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2b93accf32eec591c55f05c45e4ac424981f98a2faf2e12cd26a4d39b432ed"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.base-tool\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/styles/main.css"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7082e5e337cb1b4b35f77282d11a81e96bf85e9c827fa02f07bd5acf6dcdc3a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.animate-in\u0060 moves (\u0060animation: pixelIn 0.6s cubic-bezier(0.16, 1, 0.3, 1) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/styles/main.css"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b398e1be893c5bc69b84704867ec537d8f4279c81df9f62558e0e572fe610a07"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.qd1\u0060 moves (\u0060animation: qdot 2.2s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/NavMenu.svelte"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b741724a5908361c7d7dc5e4fdedef49d10af47585d655f364ee5023b927cba"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.qd2\u0060 moves (\u0060animation: qdot 2.2s ease-in-out infinite 0.35s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/NavMenu.svelte"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9caa3b2925ef302a27664da628b1305e988ecab8caee3e4572e863834180fd3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.qd3\u0060 moves (\u0060animation: qdot 2.2s ease-in-out infinite 0.7s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/NavMenu.svelte"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7850fe469535134443ef8cc6ca02d48dd8902d4ede2dfe36b9bb9f38d5ec731f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.stop-generating-btn--spinning::after\u0060 moves (\u0060animation: stop-generating-rotate 1.2s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/StopGeneratingBtn.svelte"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d141f78c35b44c69d95380f2baddbdda99bf14854c26fab26ebb0b034a3be10"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.rv-hero\u0060 moves (\u0060animation: pixelIn 1s cubic-bezier(0.16, 1, 0.3, 1) 0.2s both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatIntroduction.svelte"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6400c9b5565a760172da0f238e9bec67ff6a5fd3c224667ba6f4cbb724512135"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.animate-in\u0060 moves (\u0060animation: pixelIn 0.8s cubic-bezier(0.16, 1, 0.3, 1) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatIntroduction.svelte"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"603a36d353af2d80ecbeebbb95d1297c86f876cacde2a99f66b3f60e01f22211"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.qd1\u0060 moves (\u0060animation: qdot 2.2s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatIntroduction.svelte"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"878b95efb6900b22c98866f919792b8ed61b4efebd58e9035ccd04f93dda7b6c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.qd2\u0060 moves (\u0060animation: qdot 2.2s ease-in-out infinite 0.35s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatIntroduction.svelte"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d373a1ed786842cd5da9cefbf31aa620ac10a08114ca3836c31bee8ecdfa909"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.qd3\u0060 moves (\u0060animation: qdot 2.2s ease-in-out infinite 0.7s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatIntroduction.svelte"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fc7d520cd57bd91c9dc56d87b65adcdde13706ee8e3f550f88f8f61eb22a51"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.router-shimmer\u0060 moves (\u0060animation: router-shimmer 2.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatWindow.svelte"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"0850b99ece7b2ee2f40b104f7ecf979798cafa2b2612e402f1745373001543e5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spinner\u0060 moves (\u0060animation: spin 1s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/styles.css"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfb2093098b0dfb2f42b7a5f4bbbf1ca6ff207ae8fc40a147ea31651652a7ed"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.toast\u0060 moves (\u0060animation: slideIn 0.3s ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/styles.css"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6982f7d30a002356c831ae98423473a4bb709e7bfdf2da96c0beae36a9d084"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.progress-fill\u0060 moves (\u0060transition: width 0.2s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/sonic-ct/src/styles.css"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4da3875cc50008c6f1c67d99bbbe0e17a18f6590b729f4575a5c24325411df"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.progress-fill\u0060 moves (\u0060transition: width 0.3s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rvf/dashboard/src/styles/main.css"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7faf30d61c72a3f2ba9fcf80bcb72bd48f1159eb02b8708a29592e376a7f0e65"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.loading\u0060 moves (\u0060animation: spin 0.6s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/pwa-loader/style.css"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"845e4667acb041c98ebbc4f7ee3fb7668395f6eda7d0b98967be0a57f5f99b3a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.crystal-pulse\u0060 moves (\u0060animation: crystal-pulse 2s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/dashboard/src/index.css"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44ddaeaddc28a9c375fd7a5e48cc34bc157346ba216dd7a89bfaa4e6bd91892"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.data-stream\u0060 moves (\u0060animation: data-flow 2s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/dashboard/src/index.css"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"69733ed5b0e0b743a6e6779a1fac580d059ad42ddbefbd377175644cb6dc7967"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.network-node::after\u0060 moves (\u0060animation: node-pulse 2s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/dashboard/src/index.css"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f08a8319bda01c2a2a6d31c4023f8e359485d286ac56a60d4475a3fb39e1182"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: sparql$module.load_store_from_tables: \u0060sparql$module.load_store_from_tables\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad235c1fef3a876bf08bc8cec8aa7b3727c4ebf9b6e8ef35d6bc65912a9398e"}},{"ruleId":"C3","level":"note","message":{"text":"Partial audit-trail evidence: An audit mechanism is present, but the trail is not yet complete \u2014 missing: a write-side hook every change flows through (a SeaORM ActiveModelBehavior hook or a database trigger recording each change, or an event-sourced store), per-entity coverage (an event-sourced aggregate, or a hook on each entity that needs a who-changed-what trail)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"274a04e524f3228d241c99316455563739cb06cfd10a01e446d00b8a14956083"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: KernelDescriptor: \u0060KernelDescriptor\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rmsnorm.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ddc07244db66f058bef9262b0c5725e9b6fdb3fe6c5f95cbdcd023dd62d8a6"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: KernelDescriptor: \u0060KernelDescriptor\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rope.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"625026de1f84a6146f2e7337aefc0954bf44c1755c2a2440ba1a2ebfd5d42b66"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: KernelDescriptor: \u0060KernelDescriptor\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/swiglu.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c4f35fb998f3cd821e8bf91480cfb2ef87eb54180b9678938913e485e9cfb2"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: TierThresholds: \u0060TierThresholds\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-memory/src/tier.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"df714befa0dd95a4e7eb7aee618216d3380b132bd7ea874ad9e1e9664a076930"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/agentic-robotics-core/README.md links to \u0060../../CONTRIBUTING.md\u0060, but \u0060CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-core/README.md"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0061d2cfbd8c3df46831e84732a2a2358ac198c4d0a4b1b85787e7663d3de4b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/agentic-robotics-core/README.md links to \u0060../../PERFORMANCE_REPORT.md\u0060, but \u0060PERFORMANCE_REPORT.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-core/README.md"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"42565ec7b8345de45b5a131a36570c738bfdb2d525853e52b51f684341781c15"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/agentic-robotics-core/README.md links to \u0060../../OPTIMIZATIONS.md\u0060, but \u0060OPTIMIZATIONS.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-core/README.md"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"9408eb2aba9fc4502e0821b0e45a9da8a03cba12457084858f8b9760235225c5"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/agentic-robotics-rt/README.md links to \u0060../../PERFORMANCE_REPORT.md\u0060, but \u0060PERFORMANCE_REPORT.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-rt/README.md"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce77190b8f7e9035e0ff5eeb77e1c2c4d0ab7dd30ca105c766ecc87a34b43e4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/cognitum-gate-tilezero/README.md links to \u0060../ruQu/README.md\u0060, but \u0060crates/ruQu/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cognitum-gate-tilezero/README.md"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebc5a7fe13b26eca83b4599abd527a50858fbb522f427e359c9dfdeff3aa644"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-attention/README.md links to \u0060CONTRIBUTING.md\u0060, but \u0060crates/ruvector-attention/CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/README.md"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"64af70cf780c8a75b5d2838e90b19032fff18d0d0f52056d4d94bfa367feaa1c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-bench/README.md links to \u0060../../benchmarks/LOAD_TEST_SCENARIOS.md\u0060, but \u0060benchmarks/LOAD_TEST_SCENARIOS.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/README.md"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ec741a4c87b3ae3e0f8d230f4bf011402323f551ca85f71b8d9bac01c04626"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-bench/README.md links to \u0060../../docs/IMPLEMENTATION_SUMMARY.md\u0060, but \u0060docs/IMPLEMENTATION_SUMMARY.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bench/README.md"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c0b5196ae95b7a1b641985e8a5dd1225901d459529c138d0512e35fc6d2c20"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-cli/README.md links to \u0060../../docs/guide/GETTING_STARTED.md\u0060, but \u0060docs/guide/GETTING_STARTED.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/README.md"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a0f4d8c2f69ae9d5401c6a04875dffa92a4cb0dddf821bafb6b6406d6363be"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-core/README.md links to \u0060../../docs/guide/GETTING_STARTED.md\u0060, but \u0060docs/guide/GETTING_STARTED.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/README.md"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e348c629e23db42b152b09e55294309e48cdb09aa78f0e9bdb1b7c2e8a41f7b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-core/README.md links to \u0060../../docs/guide/ADVANCED_FEATURES.md\u0060, but \u0060docs/guide/ADVANCED_FEATURES.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/README.md"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68887800cec0b74cbe74421cf00ae4cab0a01ef567bb0f243862837b0e59706"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-fpga-transformer/README.md links to \u0060../../CONTRIBUTING.md\u0060, but \u0060CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-fpga-transformer/README.md"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbb6dc1141398817c113218206fa43721e316e68f68f2bc2b476186fdb858be"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-math/README.md links to \u0060CONTRIBUTING.md\u0060, but \u0060crates/ruvector-math/CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-math/README.md"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda556b366c075d6d7368b785752cffc74cc97c5b96e41a5db3e2712c3f37a57"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-mincut/README.md links to \u0060src/agentic/compact.rs\u0060, but \u0060crates/ruvector-mincut/src/agentic/compact.rs\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/README.md"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"38584942e1cb1fc48e1785068fa610c4ea155663660fc0a3d9ecf77c30322ce6"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-mincut/README.md links to \u0060../../CONTRIBUTING.md\u0060, but \u0060CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/README.md"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b8c3d6aea66438b725ac158d187619ffe2e973719d1a81f3c7cdd6ead87c1d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-nervous-system/README.md links to \u0060docs/nervous-system/architecture.md\u0060, but \u0060crates/ruvector-nervous-system/docs/nervous-system/architecture.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/README.md"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"92060e9e1b1da87e5d037057e2c679c56070688d27005ed9ff96f8ad5654346b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-nervous-system/README.md links to \u0060docs/nervous-system/deployment.md\u0060, but \u0060crates/ruvector-nervous-system/docs/nervous-system/deployment.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/README.md"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53e82a389a0c1781af6f00d94d8364a443335db72291a282143f482877dccbe"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-nervous-system/README.md links to \u0060docs/nervous-system/test-plan.md\u0060, but \u0060crates/ruvector-nervous-system/docs/nervous-system/test-plan.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/README.md"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaf8873f2cbd2d5e2475b88dd4eefa870f12b231862c2ea40e2b5662577d539"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-node/README.md links to \u0060../../docs/TECHNICAL_PLAN.md\u0060, but \u0060docs/TECHNICAL_PLAN.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-node/README.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21306b38be97b92bcc208be0770b3f4fb471a106548b513db4b6b3c97e7d765"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-node/README.md links to \u0060../../docs/guide/GETTING_STARTED.md\u0060, but \u0060docs/guide/GETTING_STARTED.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-node/README.md"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"3129a0527ccc12bfee238058c8c335120d3715ae5994a8ae0bf290f1b2d85779"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-postgres/README.md links to \u0060../../CONTRIBUTING.md\u0060, but \u0060CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/README.md"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"593b87634ac0c3985d3d07eda5e32180180c9ce8d468d313655e444e04a51230"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-cli/README.md links to \u0060../router-core/README.md\u0060, but \u0060crates/router-core/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-cli/README.md"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e91985612342a19175c2cf42bd7066d6dc6818799e5d971cebcbe9a858fc7a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-cli/README.md links to \u0060../../docs/guide/GETTING_STARTED.md\u0060, but \u0060docs/guide/GETTING_STARTED.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-cli/README.md"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ea2a347f8e44ecab49e788e6e878750d3b466bf2a55b69da04949611e53ee7"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-cli/README.md links to \u0060../../docs/guide/INSTALLATION.md\u0060, but \u0060docs/guide/INSTALLATION.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-cli/README.md"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c055255f95de401c7bc97cdce068f4aa22945c9f5809e419313af74c8227f1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-cli/README.md links to \u0060../../docs/guide/BASIC_TUTORIAL.md\u0060, but \u0060docs/guide/BASIC_TUTORIAL.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-cli/README.md"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9f151186fa26e9535f31ac1e143c89323960cff7be0a2fe180844cac11f1cb"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-cli/README.md links to \u0060../../docs/guide/ADVANCED_FEATURES.md\u0060, but \u0060docs/guide/ADVANCED_FEATURES.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-cli/README.md"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"3019642a5905a1e41fce79b9fcb65e192d8d48862287f1637edfd77decf3b3a1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-core/README.md links to \u0060../../docs/TECHNICAL_PLAN.md\u0060, but \u0060docs/TECHNICAL_PLAN.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/README.md"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b06fe0aaa3d71e7207822a619c31409fccaaffb3fa52504683a44a22fdc0bb"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-core/README.md links to \u0060../../CODE_OF_CONDUCT.md\u0060, but \u0060CODE_OF_CONDUCT.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-core/README.md"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd089f473993019fc526786600a89e86c4b35084bb2d70c1b7a2d21bfc805a7a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-wasm/README.md links to \u0060../../docs/guide/GETTING_STARTED.md\u0060, but \u0060docs/guide/GETTING_STARTED.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-wasm/README.md"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"747570f8f3875282abdcc6ef88ba43e02b0f35629e0b8f051f3c2843d4ca8994"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-router-wasm/README.md links to \u0060../../docs/getting-started/wasm-api.md\u0060, but \u0060docs/getting-started/wasm-api.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-wasm/README.md"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cc57519268c4839e611d0f672ca49b23ffbb28bd7cd062813bf4cf328390b9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-tiny-dancer-core/README.md links to \u0060../../CONTRIBUTING.md\u0060, but \u0060CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/README.md"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"8055b148be2c4d96d2307006aa37bebfc19726414478febf4c37cf8602868216"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-wasm/README.md links to \u0060../../docs/getting-started/wasm-api.md\u0060, but \u0060docs/getting-started/wasm-api.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/README.md"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe8a20397e53a69fd5c02eaf16e7010b1a869a40ca886ce81aded0b9e1d11f2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-wasm/README.md links to \u0060../../docs/getting-started/wasm-troubleshooting.md\u0060, but \u0060docs/getting-started/wasm-troubleshooting.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/README.md"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9af22856faaf6befd04647b4e0078741b5b07e5023fcac84f22432732f6b4c5"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvector-wasm/README.md links to \u0060../../docs/guide/GETTING_STARTED.md\u0060, but \u0060docs/guide/GETTING_STARTED.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/README.md"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c2beda3191e8ea19c264a42fc46ea4ecf165522339e207b7da6000adeb951f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvix/README.md links to \u0060../docs/adr/ADR-087-ruvix-cognition-kernel.md\u0060, but \u0060crates/docs/adr/ADR-087-ruvix-cognition-kernel.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/README.md"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d41d9ef4914afd0038b2164d610a1d3504d0d942a45f37ab8cb625473567471"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/ruvllm/README.md links to \u0060../../CONTRIBUTING.md\u0060, but \u0060CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/README.md"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efccaa619f53104c1294c2e9536bf17d0fb2b740ce86652205a7866d21ea756"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/rvAgent/README.md links to \u0060../../CONTRIBUTING.md\u0060, but \u0060CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/README.md"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aee9fd00323f6edf029a43fc9399b22ab0d9b012418fee0c5a72980475bd54"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/rvf/README.md links to \u0060docs/adr/ADR-030-rvf-computational-container.md\u0060, but \u0060crates/rvf/docs/adr/ADR-030-rvf-computational-container.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/README.md"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0d01ba2416c5cfb83ac7e81f0c92516353926078d20f900d5ce410c63fb526"}},{"ruleId":"P1","level":"warning","message":{"text":"CI formatting step cannot fail: \u0060cargo fmt -p ruvector-typesafe-core -p ruvector-typesafe-ffi \\\u0060 invokes cargo fmt 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--check\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/typesafe.yml"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d7693e7fe579564448e9c49ada649d6a2e87a132679192ab7a4562636f7c49"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060ruvector_mincut.canonical\u0060 is marked as implementation by its own namespace, folder or name: \u0060CanonicalMinCutImpl\u0060 (crates/ruvector-mincut/src/canonical/mod.rs:1093, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/mod.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ab2eab37ad63ef33d798a7c83faac4b783e5a11008dd2dcfd2235c5c6759f6"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 47/116 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/agentic-robotics-mcp\u0060, \u0060crates/photonlayer-bench\u0060, \u0060crates/photonlayer-cli\u0060, \u0060crates/ruos-thermal\u0060 and 64 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/sona/tests-js/lora-ewc.mjs\u0060 reports through \u0060console.*\u0060 at line 83 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/tests-js/lora-ewc.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb1ec4f59b36125f1c196de57c7fd34cb343435d0dd8f643ae67ad839035a17"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/sona/tests-js/lora-ewc.mjs\u0060 reports through \u0060console.*\u0060 at line 177 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/tests-js/lora-ewc.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c2822140227081699e061ee3010aac104881bae9f3125e8fc84be57b5243e0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/sona/tests-js/lora-ewc.mjs\u0060 reports through \u0060console.*\u0060 at line 182 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sona/tests-js/lora-ewc.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bae9cc33ceecf752fb9162ce8c3da39e74b4c2ae4df8cf22677d6f9b46d8c1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 11 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"78836365eeea40e798e9b88eaa89be471a1ff333fe803ae3452797452686fb79"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 12 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ffd94de6888f6e953fc88fc1945a5804f905c4c0a5f229e252771991606e2b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 13 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae20451c52b2aa29965f0182978c9d1e67e23ed4e07905a45d45347c11cd116"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 22 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c8f743cf1f7f03a907a8a7756b9d3ce8036a04b47d402c436b28339a1b181f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 23 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d16cf685b932cbf4ca023803d5f8de8311fcc5c1d4f9f4b7a167d3afd13613"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 24 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8ea256efbf42357ff49fe600945364732c238a48a378b90cb87a06095650a7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 25 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c678741198c805b36c83c6700f8d6f9036399cae8b063ee82e848cb63983512c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 26 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d1ff484b301695330252311529e9c1958fc726aad92f1330ff4dddc317dffd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 27 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"09412a1741d51190fc25961b2a68fe9da6c01df4ad2642547db10b1d477d73d7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 30 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b5984506a2bc9a35254fa996c4a2a6a8fa69c0176074ff473f5924c2fe6ad9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 41 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27b4c1399e6d20d928051663928f16968783f4278762fca3557b69201fb3911"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 55 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3f48fb8b5db19174440d4869c8589b6a1956debf4e60f62853bef0a49df594"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 73 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6e9c321161bfa18e880b2304d13dff92ed745b60510fa668f761e7b51091c7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 81 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"afeb7fc30709e1e157909f096346e0faac42a25ec42eef0f26ba996eec46098b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 92 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b941aadde200d76038a2d96ccd178954ac05dc43395ab2f9dc84562e06c2764f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 100 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff9281132ca1935a49d0d04633206c0cfab15115a05c820ad541bb0bbb679c0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 108 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a72c01111d2dccc8ed59b86926c21117b4104136921c916ae28d686d76b37bd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 110 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8028160c52745ecede8d736f05ab5dd7833a28ac3658526b6de7faccf00499c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 113 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"646aebaba32fb44a55cb43f7d20e455992054819197528759237906dad2a8bd1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 121 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2e242343a7407cadbd0fea10c0852895b15c2e2cb8ef962d39a2b3d8e768a6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 128 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8707dd77a2065a441c57418a243e14d690175140553db3b27ef55a9acdfeace9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 136 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7723bfe834ac7b0238cac847eb240d31cd57c3d81330ecdfa49ffeb6f2ac0ea9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 143 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35a104ae8def9d4fd99506e3c20ed5c7d659ee3cff2de759bb2adbea008097"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 151 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d268abe48592b3e75b5013bea7a467286dd1f8e23c6258fbe912c6658061e9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 159 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bc97ee00b7f801dc5fc30fffe3e678d3488078e6b202b7e87519b97ec9fae9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 161 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e5905e468b7080af6d991623450abdf62ab62a7f935715fd67bd15fcdf7034"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 164 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf9092160c87f1799d0d6c380337552c9f4b657dd8f2ee457d1ac356af433fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 174 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c58d1cd81a49ac19c8c719d57d0cb8f23cf8e826a3b7d012790ea3ea51925d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 182 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8d64dfbca4d7838576158e003551d1873421506c18bbea5852d92a098385a4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 195 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e147bb4da353f8ff0cb426d44641b61144caa702e65cef1e8d2343fadbb5e5d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 207 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a14202f9dfaff7b6166d12c8c74ba00d1dd830877d79f402c959071964e3a4a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 218 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"876d83a8b32eb3f95776b48f4e90b539d3fee72879ad62c788ee0647e37d5b9a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 226 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3583aa07722ba467c260770f2c52896f79e1a7c1a94bed82774dd66f437de9b0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 235 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2581618e0cac01bca4741bea60d94726246ada63f5979c7f44b419e274ee9b4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 237 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6141bb64ee53a156fb1c1bc6743c6db3297756be0b2c6af7cd32bfe42303433f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 240 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"323cdabf424d9a63f57b447576009b405aba0e610a6f4e577dd518e100b05e22"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 243 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91837655d8e66f7e4b5c20ab750250548ff8d728aec3f03590c2d5d6befb1a0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 244 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea79a495728437a2b8cdd8b66a12ddff3811eebbb467a62b36bc9360aa2bc45"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 245 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afa1f25d66df8e2f4f36ebfbccd4f6d001f4ab1f66143f395be28adf76fd3ce"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 246 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"928b81c4e6f143f7649ba02f53e2bf0e25988044a8ead19e4349e6fd87180cb1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 247 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec316cfb4f7a40ff30b8c2a0be63321b707eaac540b6aa245a2f9c1fc2e6396"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 248 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95c64fa8b2f8af61c9143f841cc591e36fe9aae44e55a07ea082872420f338c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 253 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"86606d6643fbbaab1375c8d39ec6438e7f6566e0d13041401ac6636b17e4435b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 254 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"925d333d8459328119f40e35c99db44125236f8bf3d283a7f66ec7d190533ee8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 255 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"88431c3882240b571426f3790ae5b54cad8c3dabab7fe006900accfa462d2111"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 257 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ae8a797ae104d13f56b493492ad97d40f08a9b8d8975fd4b3bd7996f112130"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 260 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd11eb153ab29cd3a100969dbb3efe966c20e53d9291f0bb5992b7815e835eaa"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 266 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc477b38cf4dac54cc24e9f9e2400a960a8ce82a6f9c2e61cee689b02a2ac192"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 267 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6811f9475ef12bb7e178573683d8149f5099d16a6d57da477cb993549aed67e9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 268 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfe5b628485e50719cfebe3772f2f3b255303bd246dfdadb53d6128510e58f7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 271 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec3e5eb68089258afa08a132d0773eab41c0e4d90c79c52a2e115cbd798074e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 272 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a81f20f08d956cffddea923cdbb208109e78d3256a566cb4f61841ce11e03c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 273 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"929ec4e72d1993147a3a220ea1b83185fd27de1bafd8c8c01bbe3681528f7a53"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 274 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc87ad7139f420dc3ff8ed41fef8858ff93ef548efe9b4c720e9975fd639933"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 276 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7968a4be94882b8c772bead8ff8a002477c6dbbec73aa7a395e5b39250a1266"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 279 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"056debac3b715d6549452fa978c84f552da5a6ea987014d93c92d36ff3da5976"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 307 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c2f495dac5ef53dbfc06bf57c8ddf4313b2eb94608aa2f85d8ca8362aabe41"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 308 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"649d23be578c3b0e2e72d9e0029509950cee536c217480b2dbbc0dbb55542ab0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 312 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef57e1ecf1bdd399b86670c879749b3561a409c44bcd0c0576a07498ef287a4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 318 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a839b48f90e362cd26c0c9605a23addfb5a51f7088ee44206cecbdbaec78f07"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 320 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f269e2c9235a567b9352a4083315796d342aac1c0eab8688c4817661d34fce0c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 323 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c8c6bbfd3deefdc422bf87a60e955cc9cfb4953b7cf24bec65c95b7366f5cc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 326 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dffba3405ac78a7a9f5e0cd9671fc8adf259ba7887500a4c1717f9148c599e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 337 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48ee359d39375dcb1d4bb08b4b5fa3142ec86e46722355e383700cb99196681"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 339 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7833c174ce86204a7b855037e34a9364d1c42a60ecc2247a5e50b6a1887ebf"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 342 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be705c363f585882d542c152dd0932d5625c4ed9db475d2f19713ee7eca6c3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 345 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba1c4ddc1312cb824d17b67c106a2a4f2f407e73a1aeb76b4d95a76fc3cb3ad"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 348 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"81463bce6a33786f29b4d21aaf8b39e3529d499aa61e9d000663b70cad83351b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 351 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abef8404147557244ab322aade8322326dece36fd0df3dcf82503a42147faeb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 353 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d8ed04ba3911c64bff719e0011e2f14dcf1a45596e6cd6eac78d72ba3c137e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 356 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8242e7551d8d8c165dea24b630cd6c3b0b6fcc132be0e8fd4f933ed6f90027"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 357 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4188898f53e0f36b992ac0817e77f141f0541394519e5d41761aa4dda74630e3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 358 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c0b32b9ce95fe1f68bbb9267157e9c565c13b02ece68082530363fd8f13306"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 359 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/benchmark.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"238e8916ced37b219471b1d3d1ff7aa17b39949f61dbde8d5abf56bb1d0190bb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 5 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4305282da72c7fe3f4a5f38dadac25c45c5037747eaf8a04151132e3df4371d4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 13 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a317eb9dbe3380dcfc90f807e6cba853a01404cdf099ae6d12d832ab852a7f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 14 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0721b1b55b9b29e3a371c806af330603b1d440164fc18e7922c69d499f769260"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 18 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282ff53065184c6e1761242052015ffafb91d7c8b33595e6378a60b8713bd89"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 19 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"005f488dd7e7a71f20b58d129e32e711fd97a5a4f715f45108faed9dc766a6b9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 20 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d63892a32c4dfd8466ae729953e63b447c9d64382245e06b0adc589523e9f18"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 23 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"264c4627735b1b35f41aa29f45e3fd002dfbe60869fde31aff19b957186ab627"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 25 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"978067e20d925a8028d53ada20fa8fdfc642e3af8a8a7a20614243ebbe7adecd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 26 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fce5bff62d301f41271d2a865028ee013ccaacd33dba90e5f2bf06d54191cc4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 27 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbb5bbbf2ab2ab6a6750865a445a9a186a3d2d102184189ed07a92f73f8198a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 28 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e601dbc83e10a1d5d66e676034c78557de5e02bcc93f1943cfd38ff26e3a98"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 29 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5499eb7601f8ec128ebdf195c3cf6a0bca7716dfe3468e78bfb705f487f0e6d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 32 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0db1c94bf62fefc9fd5d6ed14a31f2caef787ed3a91b1847741c4707d04a80"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 48 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f14b9da36652693768892538338c06da6fe8a0e875545b1b126eeb3ff7acbf1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 50 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c317ac8e114c103dac256545567271e107fed1653bea2c4365fd2d99d0ff89"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 51 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34a0c78c93cea3c3641264ce96203a85bedae31efb5f9fce3f1f32994b2e781"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 54 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9113a7d247b0e851b469edb5f2c13fe6dfd559570793c44d50c2764072c0c1dd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 62 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2c69684499ffc2b0e7fb2e2efa118cf5ff46a41df9a3e4f82205d7dc7dc252"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 63 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f6693471bcc5d83555f1b90e5eac7243520e96387e5e7f4bf855917dbb188b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 66 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee5a532bad8a046d2e09279fc0eb6fb9c83fc5d8c1a929be92e702201a9df5f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 67 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0354b02b7180b8b7b9726ba31529857b39a60a16b18fc2b64615a1fb9bcea90"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 70 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaadf67a4c9115356890b75d731bd427f3d8152295e569ce5318b30d0063ca34"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 73 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d48df155f93eb65883ddf6bf614142ee5900193a0a70e9f78bbcfe01776629"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 74 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac12466baac6b8503d1c1e74ef028fc2ef21b937e024c4f33d0eea54b2e954a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 75 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20e2b851ab5bb931870505f20e8434d0f030c6cf6ec33fe59d0c2b02565f18f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 76 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b23faf4881cb7005751e24ebb735f027bbf951fc1027572f3503f6a85c2b6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 77 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffffb4b408311e8d9d138a9e8c686d30c4d38ec5c2d3319f1b0a2db0f8c5dd48"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 80 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e1d802894b1c243eea1901617479992da89e59da9a7cf478d51dd3d38bb9cd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 83 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc8897d5e0da772d3c1fa2f4bbf19ed58d080ee63c5e2125ee9001be590b3cd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 84 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ceda1bcad7f527ec9e3dacff434e25e23cdd1fb7b171d2da7cb9020ed2befd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 85 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee86e84c277c648bb1b5e3ab2dadcd88152dc5bb3e01895dec9334ba9f3ac4ff"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 89 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a1bc9052c071085f3dc080f69f70575f535ce8a822a30c940e477cf9517dc1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 91 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b200fb09a81989259dd5149b9c5d1b80aa8ee2ec2a4220836272f51465929d57"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 95 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"78850642f919b5749dea2405dc12f79efa144dbeef57700d2cbcf0661ba371bb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 96 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e15652f15e5c2e2ca681594123955b77f1926bf360f4d8f8c6bcd8b29e87e7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 101 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fe615641672902bee0b8eb7253eba753276b648de8c0becfe0cf68fd3ab325"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 106 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b451a328811a1450e0a654ffd40f811b6554f1d4bf7bd064e317ecbc655e79"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 110 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acf4d42109f8922a84c5f62a81ccdecb72b735fbb4218cdce4268980637bbf8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 116 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2481d837c37ad98d88004b678f9c235055b84d97e6bef7af2db29a0fd5d51451"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 118 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"af60286d82d87a6979e10018b89912f65c27df1bd490ee3874bfb75f89fc67b8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 120 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f5900dc397fe993edc2cb632f3ba83ff58a2d83130bee01346d05a81f9e05b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 125 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff62a458d4ce2dcaf4ca7624731a9ff1e38f42218a111f1c36a6c535320654c4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 129 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb6c8b9f4f2685d16ff4ebd596f1e6e202e0eb34e1d734f88b82a1d874ed2d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 130 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b72ff17fb71e69f53c77849f6e5da9e55e117989cf469a76dbf05a31d9ed09"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 131 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"def74f0a4a8bf33b5083d8eaed2f8f96644bd1ad99315d17db39104416a05ecf"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 136 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b193e78655f387c2ef26c51df8e3d8d576d8fd0e498eb03f9f8212b60d5a147d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 138 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1400bd4b8d8539ec1d84d09b919f1737995145fd0842d4e83bb4c5f5c72f0b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 139 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a61b471afc7f75a3fabe1bd8082ad884b01dc29b12c252d620b3659ef67fa17"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 142 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4205f22267ad135b3e8bb55e7d7f67ea7d77a09e19ec8606cb3d98a38f117f5d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060crates/micro-hnsw-wasm/test_wasm.js\u0060 reports through \u0060console.*\u0060 at line 143 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4805c64a3c3266cbc03483ba0c4d6b3b157df74bbbd2e03b89d722a6e62fec9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service-optimized.ts\u0060 reports through \u0060console.*\u0060 at line 517 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37337315147f24cdf0d48c0379010af30393c4a6f526348aeb3661b4b045726"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service-optimized.ts\u0060 reports through \u0060console.*\u0060 at line 528 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae258d6b5597c0244b2e147332f869ef11c26f6c914c1059d313b07d54a106f1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service-optimized.ts\u0060 reports through \u0060console.*\u0060 at line 542 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf793e6e5dc5f99e245674d3414b0a9ca9f3d27b9c21724e85a07c48152872a8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service-optimized.ts\u0060 reports through \u0060console.*\u0060 at line 543 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca98c9cb11f8e6d913eb40ce992393f3e7b2d3e0523ace9f04fe4ec2220342a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 182 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b6568a8bdef487005ed56b0aa88b9baf97137ba8008c55327aa6ba5a4eb011"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 202 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8109968d978a0c5fa37ddacb7e6fe07a36b277a502edd0958b0510095692200f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 524 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4fee72c8bfdbfd27b149dcfe1263519af925e5719a1def39e767e954ba1de2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 528 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef70b4feb4a344bcc597a88a5e8118e37bed0ea54c7fa888f0153edb5c51707"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 537 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90b23b92f0fa7a7607f404b86181724e29c27303fdf10ddb1f997149b79f504"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 540 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8fda6186368fed021195c39cefd0fd01a0638d985b3b73fc52fcb0a1cfe179"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 554 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4fd25cd157db1a4adef2268c1b830a23e668e161425d0bdea0568750e0db60"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 555 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fb788f29db0221e168df317fcc7e9b78a8b7694ca68679dd6c4fe6502893e2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.ts\u0060 reports through \u0060console.*\u0060 at line 556 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e4e03e016ff10e6635e86c44a91b4606036cf0d83d46aaad433e8eaae146a4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/vector-client.ts\u0060 reports through \u0060console.*\u0060 at line 225 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"161bf9ee7a3fae3a3d22d64e0219e393a991db73b1563d0b3a84d08725ad4547"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/vector-client.ts\u0060 reports through \u0060console.*\u0060 at line 288 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23651daadf0a561dc9b3bc39b91ca272a66d2f3447141a08ca1584220597fbe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/vector-client.ts\u0060 reports through \u0060console.*\u0060 at line 469 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"28539664f5045a47e93f8b875f31fd354bd2bc58a3006a1149ca2cc7e11f6224"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service-optimized.js\u0060 reports through \u0060console.*\u0060 at line 437 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.js"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"037c9eb03a4b2343d15d95b51c126e859838c673be0f1ae9af4661b5a1da45fd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service-optimized.js\u0060 reports through \u0060console.*\u0060 at line 444 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.js"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e3383d014592a25096a1a1ef27d5fa6125be71e68d81fd37d808c535371d66"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service-optimized.js\u0060 reports through \u0060console.*\u0060 at line 455 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.js"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f77eba9321dd7c3c55ad36b4b238c29d1b40d2e3b7a8ff9f2e2fee3318ea7dc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service-optimized.js\u0060 reports through \u0060console.*\u0060 at line 456 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.js"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f185c96c168ecb8d07e63a31e70d77c6a77813a73b613ac1b0d35ee78d89f2dd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 169 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4b65d58b1e9219ba316bb7bbf43fdf13a95aadf3bfd0724b89ec052819453b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 185 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7dd752a8c124386251db1ea39cec5567801e49b086c29b9241e0dc89ae70ab"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 464 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a6d10be0b926b96a84aad3691ba7d364fe3688525f12875cfddbce4139dec"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 467 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ff786e4b9eebf8b6245c57dba55c1dc494383dbfe642fb9032b5825144a49b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 475 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"668031a6c0cc7262c1e943617930814f597bac4405b94a059981e0752e9f2b1d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 479 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1c71551445acd921994c0035e99e3ae13a22d95dbd23843946de03a73d7e7b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 491 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af53637d19b93c82fef5db3e8f4ac4e67d83f8c7b12fed0bf697edbb01cf955"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 492 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2316571a895821a7717e96cd3f2e7097dc1131e678ca89c57b3ce805ab548710"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/streaming-service.js\u0060 reports through \u0060console.*\u0060 at line 493 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1362d0a771bb6a4975aeb68bc3b56bc65be7144c9a07c3d7b62fc6051dca63b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/vector-client.js\u0060 reports through \u0060console.*\u0060 at line 173 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff00959bd2a669592e88705a34d437b33b6e2001969d65310021ae29ffeee1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/vector-client.js\u0060 reports through \u0060console.*\u0060 at line 225 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cd8765f3b80b1427a3da6c6eeb66599a767cfc1dc1749f25a682bfa1764c65"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/cloud-run/vector-client.js\u0060 reports through \u0060console.*\u0060 at line 367 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"945ee0c889b0e265ab0bfa2208e0cd8abe62000991c403f11c45a0fe1748822d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/swarm/ByzantineConsensus.ts\u0060 reports through \u0060console.*\u0060 at line 84 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/swarm/ByzantineConsensus.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e4816ac5c3473bfe646a4c28229e2d07f1202c5b6e190c380e0401e82043ef"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/plugins/PluginManager.ts\u0060 reports through \u0060console.*\u0060 at line 277 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d6ab0f187df8267eaac4f5db60472c7cc957088c32f7af564b605055312743"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/plugins/PluginManager.ts\u0060 reports through \u0060console.*\u0060 at line 281 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54798d3c03e60368d2133af38b5e4cb95a8762ee3675740a064f626e31396ec"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/plugins/PluginManager.ts\u0060 reports through \u0060console.*\u0060 at line 495 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c7b889abd84c54c52b5231021cf79ebfae37ebe0b5b752348922d70898dc4c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/plugins/PluginManager.ts\u0060 reports through \u0060console.*\u0060 at line 515 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7e042fd9dd98815c20f5f7fd3e3b2d110dceec053fcc9499512917ce185728"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/plugins/PluginManager.ts\u0060 reports through \u0060console.*\u0060 at line 541 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d45212870b10f9cdf0c156b99dc81b5a97832f08a9b8d4596103e23c54432"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/plugins/PluginManager.ts\u0060 reports through \u0060console.*\u0060 at line 542 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"924efabce2fb3dcfe3ad0b7f5178ec38fd36b0f72e46f922513af3b5829c381a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/plugins/PluginManager.ts\u0060 reports through \u0060console.*\u0060 at line 543 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5fd49a4cfc4d38515df88feeb5984a907ba0ed874edbccfcc6d8dfe9977cd5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/learning/embeddings/WasmEmbedder.ts\u0060 reports through \u0060console.*\u0060 at line 111 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/embeddings/WasmEmbedder.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0516e590940eec7399c30ec24851b483da3ef4b77526fc8cbf8873450077b9f8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/core/BotState.ts\u0060 reports through \u0060console.*\u0060 at line 225 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/BotState.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a14128bc287950f16e19756ca1af6c2c5b2333100bbb4b3a640dd11eaca84b3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/core/BotState.ts\u0060 reports through \u0060console.*\u0060 at line 237 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/BotState.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef19bd7917757291f3e8b40fb38496011b45d2061973733a48d9d083be62dd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/core/ChatEnhancer.ts\u0060 reports through \u0060console.*\u0060 at line 147 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/ChatEnhancer.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ed3c69e5da1c4d374aa359de97b79b2aa808e70c0894b439507455a02a47f3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/core/ChatEnhancer.ts\u0060 reports through \u0060console.*\u0060 at line 188 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/ChatEnhancer.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b258384c5b19550c105f330023626401e467f7dee9c8da0b5c3ab14ccfbd79"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/channels/ChannelRegistry.ts\u0060 reports through \u0060console.*\u0060 at line 203 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/ChannelRegistry.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb9fcd3d3e8081b5e957206b65d7fa916666e59c367e0ef9bec81453ea0c272"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/channels/ChannelRegistry.ts\u0060 reports through \u0060console.*\u0060 at line 257 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/ChannelRegistry.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"10deee0aea6d8df9600534a6766f5edcf4a1a8f60f723dfd3f67af80d527a64f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/channels/adapters/BaseAdapter.ts\u0060 reports through \u0060console.*\u0060 at line 172 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/BaseAdapter.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f034706aeb01deff07e150abfd814f0cc084e7f414a49056e356a8dbfd96b9e9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/channels/adapters/DiscordAdapter.ts\u0060 reports through \u0060console.*\u0060 at line 100 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/DiscordAdapter.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd1461771e6b3632ec602dcb3db53b916002b1ea1dbb2dff59e9d5fcbd5e8b7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/channels/adapters/SlackAdapter.ts\u0060 reports through \u0060console.*\u0060 at line 100 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/SlackAdapter.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aae08b7567497e9f1a72dc3245cf8bf3ccb22644f3ebfe23e13cb0e588344c6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvbot/src/channels/adapters/TelegramAdapter.ts\u0060 reports through \u0060console.*\u0060 at line 128 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/TelegramAdapter.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4c57b219b0594bccb5e15b87f0aed25be4d363a7425eeb0d693e54fc6ac072"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 65 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"188b91d995d43cc41b2e56687dc31086837e3e2e3c9d28b6ee698567c3b67a57"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 263 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbc66b31918fdcd37c3daf58300a16a7c1afde5838f46ef68cc81bffb86c4c3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 264 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"797fa926819cae7fd5b2eb20f683e57cdfe8c5e9fc0880b4db8a13bd56580b9c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 267 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67ab979ef05ba20ac8af76dd5694ed54e9222fd9851374dc77a56be57198548"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 269 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"708a597b4d63a92eb5d025043479a6d9c988968611b5a0c0d01120e078780a75"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 272 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"07275c41720d42628d599a0ec40b4929da001ee29534e7a67d97f1b455aebad8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 274 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7446c3cd092b694c3390e73e8073b1689e97f29bf777a8d6a2d39ee8c2c34bee"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 277 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26cf2d22453d55296ba57dacfc5b3461db9ecfcf2ff44256bc483872bf6d6cf"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 279 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7223f68e90b21e25f4cc094b76037d3144445148257ea20c4dda4cbeca955f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.ts\u0060 reports through \u0060console.*\u0060 at line 300 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"421b055e98e68bafb625f411734ac95e90ae421bb8afdd16a8ae93d25f12edc3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 59 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0ceaf56d90df58a2782409a7372b9c328ef8c0b0a5d91a81182c9bd39e4479"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 189 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaef7eb0bc93c1880b15e408b857aa49a29743804b20436189ec159ab42c94b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 190 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7364e5f7e5151bb4e0b8cec41338aa98f2a1ad14c846dd75ad542be5a8d8c195"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 192 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c23713e759fea47c46f68a2ef1d9014ca989bdc7b3871c2144145b7f026912"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 194 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e2722dae6a66c841cb3ba8f30a43de15f95843e20cd698be78a57523e49c58"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 196 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1b3a46178e6f1f033bd1e2792beba9f516155c4099afcdd5e7127161dbb8a2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 198 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43a953750df5923cfeec0e3122d79c50af0b18906a8a4b824a6954843208072"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 200 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a217e198570c275db5ae19954b9998e7e29a15d0a323b9eecb74d0bb082a3da"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 202 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd6a15bd73497dd766a4836b45aa32eac6df9ff292bd50c54c55d7f029ca2d7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/workers/benchmark.js\u0060 reports through \u0060console.*\u0060 at line 221 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"57edfc70d012d96237f464ca6fa60d0ba64aac489bcf69f9d4df2686cdddd47f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 273 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"67376f7d06d2efab1194ac059f0520622832a9b876b1a5d9af137294637a7fb1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 274 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"334dcb6932d16881011e8a4306002627c314227281a4f6e30c5e0e861454b91c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 275 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bba297b9893c83caa174f105683edbea53897e58c122dc199f1c78195445dd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 276 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbb7d0b56cf9004529911e97c2a98c4cde8b1183540715e9d231ea0f2e4c9c6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 278 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c0f709e8a62999c8bf1cce2e78c2e52cb8223b4f79a6a3ebed0b4c33a4bbd7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 279 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61985059e7c02e41d4d396bd40901b466c6c1caf37afbadf2888c204e815914"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 280 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b826198dfcaef5bd4eaed28967008f7c377bca511292c030c524503026f91d4f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 281 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ab6977106914453228b85a6fc75b110d0e13b606af8a5b683ace477171dd62"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 282 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1172876b500268d7457e71570e3094b8752582cc54cb5e0e9920ce3670baa6b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 283 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5639e9c2bcac27a0c9d7599cc344bd38fe5160953603d5539b0eb1f15438f9bd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 285 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1bebad1b51e69f10691eaaa244dbb4423c0ddfc6c3d05625faeaea5bf5379a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 286 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dd01af29aa30378fa8453c0c02a2bdc4b91280391a89914a637127f0c081a6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 287 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba5922e8337d13904bec59df8935a7ea801de0d0d0c899a0dd3fc84b0d2d528"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 288 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d504f501ade66ae30c3fe5a082e73ccbc953d9ae2a330ff4f29c36b0f86273"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 289 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a5b7b576192b1872ab6c2f41481b37981316f82958958b10914e3993f75e56"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 291 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d440c1da84b643fd7357a6e4281875f48c6a41448c20b8cad86374e03a33b6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 292 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"935828bd9ff1fffc2025aff1c191b8779fa0d03969e6dc2450b5ec78f091741a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 293 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"53eb089aa028c85c129f952f37d79865100ff7ed4cdd99c5f5d410143bfd4073"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 294 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b093650425c254ad7a31d60213dfc77b3955d5f117b691f396c6fa7d299f543"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 296 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a19f4b81f0e2b6b23cf327a1ef8bdc0b3a5c64bf74d7d0c84f983145e31738a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 297 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3eddb8fee70fd607ea57aebf8fb55c46e6bdb78e689b061809699522fd7f27"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 298 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cbf8a35bff5cbbec174fee011ea5f4811c7b97a377a19145c7eb83fd327efa"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/api-prober.js\u0060 reports through \u0060console.*\u0060 at line 299 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb53cf819231439983e28697ecbdb91d2fdcefb50c23a463d7c875e63c43cd9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 367 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccd2c7708e5d36ae55be34e134070b23617b27679140fdb9164fd398c25c87b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 368 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a17d69346e38527f4f19407b885274a6b90d335430354432d263283e528b63"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 369 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c491b28c9079d59f94d74db1604462326e228121524a8dd4214b52b22ab8355"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 370 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f4ea55e2116aaa6c8750ebb7c3662bb3ede341cec01eae67afd56930ce7fa2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 371 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b6a69995b0a82f965328cd51bcd5a410c4046a51648948e0221efa61778157"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 372 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfe5c3cf618b2f9b5589d1130676f4f41addcc24130e1252030dd85529808d9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 373 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac6fec85004413faa77218c1182cd721db544ecf02eb21c3c40a394d8c96ee9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 374 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dca14a0dadaee83922bbd7be55837e4cadaaae275164cd33c503df975d9030e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 377 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e05a04c1d243455317e493c16adf4d44de4f9cb861b29e549f80db48e492a59"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 379 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fabf6f5a3c3fa101d94fb8a09be932d425ca0a739bf8d12875e12caf0c78b3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 380 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ffdb2a02b4eb81e9b9d769599767c8608be3db533129ab2c8ce00f1bb51247"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 382 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c901e822385c35d2bdfa3c2a2f9110920b22b74acb077d1cc7e4d69ea3ff90"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 387 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d009f824d47015f769cfe80f3f27956c7d174363e28c4370b60e4e390f5d064"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 388 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a32266e32fa6033d389d9f7f9bbc0bd32e4d1f5e55197602e328fc20a6580b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 389 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a0a15568f6c7339a5443aa5cab22a06d2b779a367db433ab85e17cb17eaf6e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 390 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e35aac369ea6d7965db40a45a07fb94ef3a30f70aca2761f8b012b954907b95"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 391 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d054c048d9f8c902002a6969b6e09956be1e2817b6b8a7c4ca34bb5260fa708"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 395 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdb8619708871f94e501f0c18c73c7797baf38c17d995b481d5933b5baf54ca"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 396 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa210cb695b6251f0c898bd5f7796484a5a6567bf853e0a64c49ea268dafb707"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 397 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"46db0189b49bf4b89e7c52fed953b425dad6b44a7688691d780de4bec6e12da4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 400 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceb159cbaf2dbee05fec2a58f622fb442ddb5f9ce85feeb3fa86bee8fb6b5f3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 404 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fbb366d30b9ff5e1cc8d91bcb98e28901adc25444c82bbfda97e0a9dfad67b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 405 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"c391e98cad06f3a5afe123c54e759250f17068518ee3606e6229187b99efc00b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/decompiler/model-decompiler.js\u0060 reports through \u0060console.*\u0060 at line 406 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7d14039c92db5f50b0962e4e5462a726b155b3cef83bcf30f1f0ce7c92b8a0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/core/agentdb-fast.ts\u0060 reports through \u0060console.*\u0060 at line 138 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/agentdb-fast.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"004993bd240c5e0d233907a927b1c24bd362589cde2ae432a2b719a24e428828"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/core/intelligence-engine.ts\u0060 reports through \u0060console.*\u0060 at line 281 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8da34bc7114f80c2dad14b751e3947dad2590fcf296a88bb339ae24a5ba137d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/core/onnx-optimized.ts\u0060 reports through \u0060console.*\u0060 at line 279 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx-optimized.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e2f6f8c2863d865e1d794a8faef5895f29ebeaa13bce9a74ad044550aeead3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/core/onnx-optimized.ts\u0060 reports through \u0060console.*\u0060 at line 294 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx-optimized.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d0b9bea19dc1b0bc3c6ec17ea41778e70c1e616883a311a129a3b1acaf2d58"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/core/parallel-intelligence.ts\u0060 reports through \u0060console.*\u0060 at line 92 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-intelligence.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd0ce1c26e83039da736bdcfe96ce02506af1e76b50036d240ce32b63375311"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/core/parallel-intelligence.ts\u0060 reports through \u0060console.*\u0060 at line 100 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-intelligence.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1028c1c708dddfbd8cc1950a59f48aa82d3233b6eea7a607c1c085cba9a9392a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060npm/packages/ruvector/src/core/parallel-workers.ts\u0060 reports through \u0060console.*\u0060 at line 183 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-workers.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4adab26fe288d382580841835db5fff85da188804eede802ebfebd48178ff8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts\u0060 reports through \u0060console.*\u0060 at line 210 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcec9ea22ec991fb1667339b1d15789113df38ba7f04eb34cdd3cfd28a8bf53e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/routes/conversation/[id]/message/[messageId]/prompt/\u002Bserver.ts\u0060 reports through \u0060console.*\u0060 at line 46 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/message/[messageId]/prompt/\u002Bserver.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f687bcca3df5c384469a1726503e25a27f94f3048c0fdc126590311d7dcad3e3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/routes/api/mcp/servers/\u002Bserver.ts\u0060 reports through \u0060console.*\u0060 at line 21 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/servers/\u002Bserver.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e78f97a2a18d4eed0d6db9fd68dbbff8d80c821df08b007273c03e1367d58d4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/wasm/idb.ts\u0060 reports through \u0060console.*\u0060 at line 69 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbf4fbce5b2fc95620b53de55a38e84234222d7a3feece9a84301728bf98453"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/wasm/idb.ts\u0060 reports through \u0060console.*\u0060 at line 76 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea96382245f1e52c95974c4021fb6b1ef831ee7b591e37ebb23fa2d99c6100ba"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/wasm/idb.ts\u0060 reports through \u0060console.*\u0060 at line 114 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebb66c7950f8b0d249e223dfd55abc3c32d8d5f0e1f03d72f5d1d438795c198"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/wasm/idb.ts\u0060 reports through \u0060console.*\u0060 at line 129 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11d81a5214c09cc43f17b1e2832e762302330e1bc39aea207b50b034e6d5c59"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/utils/loadAttachmentsFromUrls.ts\u0060 reports through \u0060console.*\u0060 at line 109 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/loadAttachmentsFromUrls.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39f95c8f71e74a24d7a10daceab6e6d581824d085b51b7b0f6d19c5d2c90fc6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/utils/mcpValidation.ts\u0060 reports through \u0060console.*\u0060 at line 28 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/mcpValidation.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df922c5595dfbbb5e782d76ab088b33466e698f4782d9d6982c8705056c3fb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/utils/mcpValidation.ts\u0060 reports through \u0060console.*\u0060 at line 35 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/mcpValidation.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b91e77f7d015fcb769ec8fcec64c1cb38025cb9793aa00631764b68d7519d38"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 63 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"40104fc9e77741ad41c90cb5fe7a8bbda13015ca00e3ac5e9dd8e55a7b755e87"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 77 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"257d18744e5ae829cefd7b36db7049cb31b3060944511845bdeca34badf57153"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 89 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5b9237c04da44948416026be2532e2e25cdd987de70a474dbbcbc1d3110ccf"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 100 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd059c5f5d9e07da62f64597807aaf00d70e3edf98f2cd4ac843a8237e2840f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 112 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf19dd9d27b89cdaa514928922f276705af6ed752d1dfe2772276a94ca0b75e4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 124 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c2cec80b6ac3792720e80b28c586cdcbc7d0c690f4728825e31178e5adf110"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 218 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca979bb7d44b4152e7e7de58036f7b2015e5bf8c3d60648222a1d84d78ca536"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 270 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1626c42dd685ee4d8766e91014a4315d49fadace6f6a7e8385ca64558333b13b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 277 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e377e6605df24d39a6ab0c69cc9a048ca5d7d78b1f99c6263b7fc2a93304c29b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/mcpServers.ts\u0060 reports through \u0060console.*\u0060 at line 503 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d43b93cf1c19295319e4d6fe4bf2ef6441d2bf28ed1f4843728242e2e8aa1a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 127 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c6f97587278a89edadaf216e840110812b9108f7b2b063eaee8121d7dfcaca"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 136 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de3babb796767e444477d347c043707b1e5f8f090064be9175611554a53da73"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 294 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9233e663d2aa8947608e6757dc44e5dc7517065138a6f986c1c1d83919ba6801"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 310 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c98368d1c52340e851e3ae29b6798122ba9342d8455b0bebbef91be7faef71"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 313 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2548a987b9ab2674e6198a0db369acce301cc1d29d691393846e6a818470de"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 346 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc92c0d2f35fc05c15c9d2c9436fd96f31d2e21cbd78425d2086b53f15717b7d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 349 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ceb84f8da339f0efd2fc864bdd5f8218f6a96375e6952135186e73e008ee867"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 372 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e69422fb2821e20d94dae810b3dd36cbfab4ecbaafbb5f880c4f03d16fc67f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 374 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b4b2d9fcb21aa9a52511410629617940d7d1b878b8a1090d9b3a143884c5b1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 423 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26d164a7df8d43f21a40bcc578ffc88d81cb1aee1f161a1d7aa74351d0b1eb1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 425 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc62156e16616e3ac83a72a5689cbc75a99b597fe7d1eca29d250673066d4d4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/stores/wasmMcp.ts\u0060 reports through \u0060console.*\u0060 at line 445 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"862beb97ab6999ab64c77457c22f245c4ceb9c03a87f6ca26f6637cad5061379"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/server/database.ts\u0060 reports through \u0060console.*\u0060 at line 55 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e800ad82c3113941c755e6ccaa1f1d115f208102554fed4cb44cce14104d6c4a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/server/database.ts\u0060 reports through \u0060console.*\u0060 at line 61 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"34abb6d0806a34e6fa19fa7f37985d1402cb3c47117036e0711b19cf6c5cdad4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/server/router/toolsRoute.ts\u0060 reports through \u0060console.*\u0060 at line 31 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/toolsRoute.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2ad5b3faaca97fa625e1cec936809fbdf44451bab23db6c451a3d7ffab98b2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/server/mcp/registry.ts\u0060 reports through \u0060console.*\u0060 at line 47 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/registry.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"284d1c37dea1443dc54c2e074f3c4bf3db3c3d3f2f6491afa48561307d0d518e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/server/database/rvf.ts\u0060 reports through \u0060console.*\u0060 at line 137 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"be473a2bd09132614246efd9cb785f7d6f352f78841d8c5bdc25df4af8af9488"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/server/database/rvf.ts\u0060 reports through \u0060console.*\u0060 at line 142 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf6ae2031fd98a90990747c99cdd7b4d2a9bf767f5f23b499dfa2b773f5695d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060ui/ruvocal/src/lib/server/database/rvf.ts\u0060 reports through \u0060console.*\u0060 at line 146 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53206303e1c54236cf687a1e890550fe4820919591fbbe1d3f3eb6ee752a12a"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch pip/gitsubmodule: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060pip\u0060, \u0060gitsubmodule\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94a0b0128f46115c52daffb3a364b9cabd105a5f37321a8bf4fd603e370aa33"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff541953b94eefaaa6bff9c99779c5750a92b827f2fe4a5ed18c8bc9d60cec7"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f72a2586ebe8d49331aaa5fa5f856c50699002b6d4eeb8c4c576c73b8ab9a52"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26e630baec5cf02a550fcf5f5e34e7f24c6a112832c22d606f3da5b950d9e99"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/client.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e258b96ec2b7b3a78044a35d54e23e1de1d291d21d8699e84ea234209d7d1181"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/client.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"af52b3c8c46b9ea3c1d2750747f8dcedb2a7c50bc2de9ad7f9059544d8e80e11"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::blocking::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/embeddings.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"021e1faec797d9ead85f8d4914233b848e771105b677a6478b131f6e6c0f3490"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060httpx.AsyncClient(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/integrations/salesforce.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8951d66feaf7aa27a45b3c8e28606c8e8ce5f55eb8273a27ff1b3f4d50ab518"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060httpx.AsyncClient(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/python/ruvector/integrations/salesforce.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cf348725272a6d5793da6de8070082158a5d677ae14b7329eef12f32c6010d"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::blocking::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/src/datasets/ann_benchmarks.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa49e2455ff9609df234cb88f771dfa0ae5121192acc0de551f501d662b685e"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-typesafe-train/src/pins.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eca076df00e7f5bb01a2be0dd2324cdb429a274940b0f178f7a944a0bd645f3"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b5fdf16c1f1dc30db5c826e4b381aa1da77bc0d37804f14c15832cb3c4b9ba"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c7b368c149257b6aa470a71639c214b51761bcd017c35a44c06db80659b428"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/scripts/fetch-models.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d759a6ecb81ae94b8f8d0dea43a807db6cc354b24b05a6d1010e26dfdf3539fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 31 sibling directories (98 clone groups): 98 duplicated blocks under npm/packages/ have copies in at least two of the sibling directories agentic-integration, agentic-synth, agentic-synth-examples, cli, cloud-run, cognitum-gate-wasm (\u002B25 more sibling(s) not listed) \u2014 55 of them are reported below, and 43 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 98 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 98 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 98 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"968ae7b27fc61d6c33bf9cc1a196db8d413681fcf976cc4c59fa4fc328369188"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (23 clone groups): 23 duplicated blocks under the repository root have copies in at least two of the sibling directories crates, npm, scripts, ui \u2014 13 of them are reported below, and 10 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 23 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 23 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 23 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee8ca3a19a9a696be86e04ddc9a3c2f7c49d4811bbde5c7940d07974dd0678"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (7 clone groups): 7 duplicated blocks under npm/packages/agentic-synth-examples/src/ have copies in at least two of the sibling directories cicd, security, self-learning, stock-market, swarm \u2014 4 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 7 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7bf0310d1957ce76a7105ff070492c7e5a88a7939cd39e6affc748cdca2c6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (7 clone groups): 7 duplicated blocks under ui/ruvocal/src/lib/ have copies in at least two of the sibling directories components, server, stores, types, utils, wasm \u2014 6 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 7 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a57bbc76270ff4ac6a2c44c85f8303245dbf025780decea95a5bfc520f43ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (6 clone groups): 6 duplicated blocks under ui/ruvocal/src/ have copies in at least two of the sibling directories lib, routes \u2014 5 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/conversation.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9209fe32e63d6c319d6fb03263d16fef86d57c9995185c14b16641825e0b98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (6 clone groups): 6 of the duplicated blocks reported below have copies in at least two of the sibling directories api, conversation, models, r, settings under ui/ruvocal/src/routes/. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/settings/\u002Bserver.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0de8e489c043611e8d3775f111f447cbac97a6eec0808ef16eb0ca4d8613c01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 3 sibling directories (5 clone groups): 5 duplicated blocks under npm/packages/ruvllm/ have copies in at least two of the sibling directories bin, scripts, src \u2014 4 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ad5dfca383e4a1ccb2cd89e9db3388b3a76639e10198530f9ce5b41f012a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (628 identical lines \u00D7 2 files): npm/packages/agentic-synth-examples/src/dspy/training-session.ts:15 \u00B7 npm/packages/agentic-synth/training/dspy-learning-session.ts:15 \u2014 these 2 files are line-for-line copies of one another \u2014 628 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd62d04849589a8c94d87a898ff678d8125f9eeec95d54792a512e6decad0335"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (114 matched lines \u00D7 2 locations): scripts/adr-index.mjs:71 \u00B7 scripts/frozen-weights-check.mjs:298 \u2014 the two spans are one implementation copied and then locally edited \u2014 693 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/adr-index.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0f76babf75640020fb154e852c6440afb4c80cfeb7577a2a4e8ed61a98c23c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (113 matched lines \u00D7 2 locations): npm/packages/agentic-synth/training/openrouter-learning-session.ts:116 \u00B7 npm/packages/agentic-synth/training/openrouter-training-fixed.ts:115 \u2014 the two spans are one implementation copied and then locally edited \u2014 829 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd3cbcf9f2c59a8e601ea833aa9a5bec4c1e97e2a5d50d6762f5774cb56a6ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (112 matched lines \u00D7 2 locations): npm/packages/kge/scripts/check-security.mjs:21 \u00B7 npm/packages/typesafe/scripts/check-security.mjs:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 1066 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/scripts/check-security.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cece3c34687c3549f60ae7fbdacdc280408d7bc721703d4aa1079efdcf3fbd9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (94 matched lines \u00D7 2 locations): npm/packages/kge/src/serve.ts:19 \u00B7 npm/packages/typesafe/src/serve.ts:20 \u2014 the two spans are one implementation copied and then locally edited \u2014 722 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/serve.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1642c43cec89a5d2aad8b4d21ba9e7a93e3ed07da353577f4255b8b02145ca85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (93 matched lines \u00D7 2 locations): npm/packages/ruvbot/src/channels/adapters/DiscordAdapter.ts:97 \u00B7 npm/packages/ruvbot/src/channels/adapters/SlackAdapter.ts:96 \u2014 the two spans are one implementation copied and then locally edited \u2014 510 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/DiscordAdapter.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9a2b773061dfb89a8af1eda9e117697c1600deb67bd0b6f2a8303f6ed729c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (84 matched lines \u00D7 2 locations): npm/packages/graph-data-generator/src/generators/entity-relationships.ts:20 \u00B7 npm/packages/graph-data-generator/src/generators/social-network.ts:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 548 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/entity-relationships.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d015b72331d075d4a38a401967f05cee1f6871aefa44180ac6c951825115b0ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (66 identical lines \u00D7 2 files): npm/wasm/src/browser.ts:5 \u00B7 npm/wasm/src/node.ts:5 \u2014 these 2 files are line-for-line copies of one another \u2014 66 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/wasm/src/browser.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"366d9429950c40ab86027c25987c9eda14cfe856e80d323a3aedd12d50d046e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (59 matched lines \u00D7 2 locations): npm/packages/kge/src/cli/main.ts:25 \u00B7 npm/packages/typesafe/src/cli/main.ts:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 410 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/main.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afd54ebcecb2e63014fca91043037823c0e89ba259a37f5470127b227572c98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2 locations): ui/ruvocal/src/routes/\u002Bpage.svelte:67 \u00B7 ui/ruvocal/src/routes/models/[...model]/\u002Bpage.svelte:50 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/\u002Bpage.svelte"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7b8645b070d7ea60b5f21e63fc6acb7fd6c371504cdc18a74e214dc5181eb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:92 \u00B7 ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b05be46a86cf87e5a0518d2fa6d1e50f04c6b48b3c75a0fc94e8fcd92278b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): npm/packages/kge/bin/cli.js:15 \u00B7 npm/packages/typesafe/bin/cli.js:15 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bin/cli.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dfd96f458e56206dd741dc80e64723f287ae0a3adfb4bc26686b17c3380fb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): npm/packages/kge/src/cli/args.ts:9 \u00B7 npm/packages/typesafe/src/cli/args.ts:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 365 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/args.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3a25f5e3b9ff4f0263d8fb8980b451f20e458e9210684430d2e11d4309fb31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/statement-parser.js:191 \u00B7 scripts/lib/module-splitter.mjs:117 \u2014 the two spans are one implementation copied and then locally edited \u2014 290 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8bf9309234da6770f35d86ff3ed601d107f7c1d0ac64a9a5d4c303e88e8a95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/channels.ts:171 \u00B7 npm/packages/ruvbot/src/cli/commands/channels.ts:259 \u2014 the two spans are one implementation copied and then locally edited \u2014 363 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/channels.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e3ae4c128a5a92f27290ce3748bd78d53f7ae75bb258c1ebf8161d3919dbe1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): npm/packages/ruvector/src/core/parallel-intelligence.ts:62 \u00B7 npm/packages/ruvector/src/core/parallel-workers.ts:148 \u2014 the two spans are one implementation copied and then locally edited \u2014 329 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-intelligence.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46c710fd9e2e898fb689e8cac07ee32a0e7efd79b49d56e0688fa208367c889"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): npm/packages/ruvllm/scripts/improved-model-compare.js:94 \u00B7 npm/packages/ruvllm/scripts/real-model-compare.js:68 \u2014 the two spans are one implementation copied and then locally edited \u2014 342 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/improved-model-compare.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b850a5f6ab16dc873bff732cf2f6606d3994376d87d9b3bc904b2c6b2e7a9201"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts:352 \u00B7 npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:535 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"119f28149ee42cdeee472e1341b491ae22eaa03690ed63686983b43984a1478f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): npm/packages/kge/index.js:24 \u00B7 npm/packages/typesafe/index.js:24 \u2014 the two spans are one implementation copied and then locally edited \u2014 217 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/index.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1e190f744725fc999b91059d16e5327d73fe39fd18ae80ec05f7c9bcb060d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:3832 \u00B7 npm/packages/ruvector/bin/mcp-server.js:603 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3832}}}],"partialFingerprints":{"codehealthFindingId/v1":"567761f286ac37173114d7d5eb52239bf42c8a786859c191984ce96535082dcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): npm/packages/agentic-synth/src/generators/events.ts:61 \u00B7 npm/packages/agentic-synth/src/generators/timeseries.ts:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 225 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/events.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e422813e7a5bffb0da7015f2292a6d04bfa7a846df90681a42fb952f80d6b58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): npm/packages/kge/scripts/hash-fixtures.mjs:19 \u00B7 npm/packages/typesafe/scripts/hash-fixtures.mjs:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 264 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/scripts/hash-fixtures.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82d4ccdd834430641ddf2499b198a1f09ce55a0843b1d4e908973327101ccf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/module-splitter.js:137 \u00B7 scripts/lib/module-splitter.mjs:267 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b534ede3ecb13e4fe5a56d1bb4c6932ddd7787401c45162aeeeaa7c7c54b37ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): crates/rvforge-reader/ui/dock.js:17 \u00B7 crates/rvforge-reader/ui/library.js:19 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/dock.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e358ab267b40dd68edaa81402f7bd7bf883943bdc5266d88f9f733ee6c4a19b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): npm/packages/graph-data-generator/bin/cli.js:27 \u00B7 npm/packages/graph-data-generator/bin/cli.js:146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/bin/cli.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"72429988b7cc1f7dd2562a216aed6f2aa613016351731f1375e1cac7317ab4ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): npm/packages/router/index.js:20 \u00B7 npm/packages/tiny-dancer/index.js:48 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/router/index.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"559196bdffe48b77f82890bf12ff3240d4f11a07a466385e2c1f1c692b7bfbc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3 locations): npm/packages/ruvllm/scripts/ensemble-model-compare.js:78 \u00B7 npm/packages/ruvllm/scripts/hybrid-model-compare.js:92 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:153 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4b2ebb94da1bcb9389c73d98995f21005093a4bc19ad9be31ed8c688f5de51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): npm/packages/rvforge/src/config.ts:59 \u00B7 npm/packages/rvforge/src/project.ts:226 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/config.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51da3905c2fadab33f74176146e87424dbf8e909ebe67779062eadba1e1f2c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/marked.ts:123 \u00B7 ui/ruvocal/src/lib/utils/marked.ts:173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"884baa21f7c6591f1e6e8e9ed6011505811b8c4d11fffc38b90929845ee12e64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (28 matched lines \u00D7 2 locations): npm/packages/agentic-integration/regional-agent.ts:82 \u00B7 npm/packages/agentic-integration/regional-agent.ts:531 \u2014 the two spans are one implementation copied and then locally edited \u2014 177 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ff8410953a0b96b5754ab8842db89b39e181f4297b41f3173133735c7304cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): npm/packages/graph-data-generator/src/generators/entity-relationships.ts:47 \u00B7 npm/packages/graph-data-generator/src/generators/knowledge-graph.ts:72 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/entity-relationships.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"448eb3ecee8655d6040762973f548197f6003d54227b9a11d1f486e598474fda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): npm/packages/rudag/src/dag.ts:526 \u00B7 npm/packages/rudag/src/dag.ts:561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd531fb617578782e9b60ebf2cbb54f71dbd3d9b7fd4c96f63503cd2559c7efa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): ui/ruvocal/src/routes/admin/export/\u002Bserver.ts:66 \u00B7 ui/ruvocal/src/routes/admin/export/\u002Bserver.ts:111 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/admin/export/\u002Bserver.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c4505c711a1257c06abc4eb25d73bb6690a74f6ea10b6c5041685c585ee924"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): npm/packages/cloud-run/vector-client.ts:313 \u00B7 npm/packages/cloud-run/vector-client.ts:358 \u2014 the two spans are one implementation copied and then locally edited \u2014 186 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc5555b0f3e7f9af92e6108cb6cef7596b78be46189851802093377de99a144"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): ui/ruvocal/src/lib/stores/settings.ts:63 \u00B7 ui/ruvocal/src/lib/stores/settings.ts:121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/settings.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aefe53fbc55812679fe1efac93d69e1717ea2cb4e3e9883dd4b34bf8ec85fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/optimized-model-compare.js:170 \u00B7 npm/packages/ruvllm/scripts/real-model-compare.js:87 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/optimized-model-compare.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"874f5bde95e7a23d7dbbf16d4924cc9f30c3b0b7316fa893377b50adac8498a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): npm/packages/kge/scripts/check-wasm-imports.mjs:12 \u00B7 npm/packages/typesafe/scripts/check-wasm-imports.mjs:14 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/scripts/check-wasm-imports.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fe2fbfc2dea9fb24e1e6a6d5409d3fe591f956641233da7b38188082c1f268"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:115 \u00B7 npm/packages/cli/src/storage.ts:133 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"808a8bcb5cbf171973af0eda4814ead0d05f3f04454e1f35cda16b5c9ff3aa4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): npm/packages/graph-data-generator/src/cypher-generator.ts:17 \u00B7 npm/packages/graph-data-generator/src/cypher-generator.ts:95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/cypher-generator.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8df73e250e2199c1debcd77c3fb958f82ac6ac8420a2543805ac2521654b44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): npm/packages/ruvllm/bin/cli.js:501 \u00B7 npm/packages/ruvllm/bin/cli.js:760 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedad55895ec0edba01de45627d916fb45332782428b58d702014b4cb44e028f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/hybrid-model-compare.js:259 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:261 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/hybrid-model-compare.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15cd471fc135fed0f3e2e4dd7d899be8b05e1d876be562643b665d0d99d1439"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:48 \u00B7 ui/ruvocal/src/lib/wasm/index.ts:452 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6728a449e5194d4ca5bc867ad8d5af36d29dbe30d23aa751015efbaa627146"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:1173 \u00B7 npm/packages/ruvector/bin/cli.js:1541 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f6a5e4678f30f825b96802deb9540592b179a744ebe6b270a246b99a8f2ce1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/statement-parser.js:27 \u00B7 scripts/lib/module-splitter.mjs:196 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a424e16fb9a0e53b54717fdc3cc57b6604c333abc7e49cff4c5b93db39cafd03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): npm/packages/rvlite/src/cli-rvf.ts:86 \u00B7 npm/packages/rvlite/src/cli-rvf.ts:199 \u2014 the two spans are one implementation copied and then locally edited \u2014 175 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/cli-rvf.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0019bae998b1f6c5192c6bd2fe4d5f15f8f88f018ed144b746e20728059e07d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/postgres.ts:51 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:24 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5475701cd6df92206b39f79203d210f2223d117d55a33093466d37a475241af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): npm/packages/graph-data-generator/src/openrouter-client.ts:58 \u00B7 npm/packages/graph-data-generator/src/openrouter-client.ts:110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/openrouter-client.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"24badba0566f54b89446fde31616047e2392d51a856bd796eb4f8990ad85c831"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): ui/ruvocal/src/lib/stores/mcpServers.ts:242 \u00B7 ui/ruvocal/src/lib/stores/mcpServers.ts:452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5373b342a01d3a675b3a45512c7525b8ca0e5c9f2eeb38b02171e9cec9de73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): ui/ruvocal/src/lib/wasm/idb.ts:140 \u00B7 ui/ruvocal/src/lib/wasm/idb.ts:262 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"168db2241a0e5fcdfed735bd0b7cec247bc056a9a5cefac9d34733a7f7ab5e86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): crates/ruvector-attention-wasm/js/index.ts:228 \u00B7 crates/ruvector-attention-wasm/js/index.ts:270 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/js/index.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab37a3cad72842f7bec8aacbfd399f98523ba6feebe6574c21829d0621f0a46c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): npm/packages/agentic-integration/integration-tests.ts:148 \u00B7 npm/packages/agentic-integration/integration-tests.ts:706 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/integration-tests.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"647055e4b802c42e44e3add593966a1ce29f1ee2cc536066c9011fd530ab2460"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): npm/packages/agentic-integration/regional-agent.ts:546 \u00B7 npm/packages/agentic-integration/swarm-manager.ts:582 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9884b1ca583c45dda5370085925a521fb6a2924bb7354dc957b09f7ccde5d75e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): npm/packages/postgres-cli/src/client.ts:658 \u00B7 npm/packages/postgres-cli/src/client.ts:679 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eec1be2b48797f12586318be4102c08855df662dece07fccb720f0f21b12409"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:3771 \u00B7 npm/packages/ruvector/bin/mcp-server.js:715 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3771}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21e0ab5fb04c9131380d13f0e3386104af3df6697e7f08a74c9194b0d5a987f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:4371 \u00B7 npm/packages/ruvector/bin/mcp-server.js:690 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4371}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda441c6a0260b4c63a356b418db9f4688a67eafeacdf99366a028fc8a4f9a7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): npm/packages/ruvector/bin/mcp-server.js:4704 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4727 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4754 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30d993d63afcf33accf2b5cb5d1f826be38e8e028be0e95f5879e6983178298"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-perf.ts:388 \u00B7 npm/packages/ruvector/src/core/neural-perf.ts:418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-perf.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd4a5e6fb5c0fbc7cfa524aac77c4965f8c96a4746b797ad4eb74263e99ec25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ui/ruvocal/scripts/populate.ts:63 \u00B7 ui/ruvocal/scripts/populate.ts:90 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/populate.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"216c64431b079a9f86244481409ac7ed4d7ad886048fb96709ac817229727d5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): ui/ruvocal/src/lib/components/DeleteConversationModal.svelte:2 \u00B7 ui/ruvocal/src/lib/components/EditConversationModal.svelte:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/DeleteConversationModal.svelte"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4778c98fa6729cbd25ec6e706c16f0ca0b11bea88161cbb9f6faf23680b96b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ui/ruvocal/src/lib/migrations/routines/04-update-message-updates.ts:128 \u00B7 ui/ruvocal/src/lib/migrations/routines/06-trim-message-updates.ts:33 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/04-update-message-updates.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42ba1b66e70f910873fe35bbd7a4840e58a5e6a026ba25340bf784986acb5e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts:265 \u00B7 ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts:338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a11ee731ad867685b72c0f2cb6e8bee55636a949578f524b1aed7d5a81b64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/v2/models/[namespace]/[model]/subscribe/\u002Bserver.ts:6 \u00B7 ui/ruvocal/src/routes/api/v2/models/[namespace]/subscribe/\u002Bserver.ts:6 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/[namespace]/[model]/subscribe/\u002Bserver.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15c718960265e658d702e916774a3eaf68c0048f56a25182f8efdd32f28d8c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/v2/user/settings/\u002Bserver.ts:79 \u00B7 ui/ruvocal/src/routes/settings/(nav)/\u002Bserver.ts:26 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/settings/\u002Bserver.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3b59e19246e36a0325ff3250c782387d2a110c5985dfdf08c02bdbf06b57cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:6311 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3422 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6311}}}],"partialFingerprints":{"codehealthFindingId/v1":"978f3755ae7b13d58dcc61202b76311362637b61ede022fb2ac1ffa9b3c9ae1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 5 locations): npm/packages/ruvllm/scripts/ensemble-model-compare.js:16 \u00B7 npm/packages/ruvllm/scripts/hybrid-model-compare.js:17 \u00B7 npm/packages/ruvllm/scripts/improved-model-compare.js:18 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:17 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10215da063284d662d4f2ced46015ecd434cf9a50a0328a8c35747526a8342d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): scripts/lib/rvf-builder.mjs:194 \u00B7 scripts/rebuild-all-versions.mjs:387 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/rvf-builder.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd33a5686f68ecbde0593bafd742f8e74f4eb7b06e5cfa098dcc6e404200e911"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:220 \u00B7 ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:327 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fff7f35d0a74afeb0cd2629daf21529602050b1e1171f1947a82ca8d4c1817"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): ui/ruvocal/src/routes/api/conversations/\u002Bserver.ts:7 \u00B7 ui/ruvocal/src/routes/api/v2/conversations/\u002Bserver.ts:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 123 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/conversations/\u002Bserver.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"510645311e7c67801a16232ff32f01c43b29440e2476fd054f3bc19f050b0f03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts:279 \u00B7 ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts:315 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd30fdc290a504c6545cb5264baf29796755530291677d2806505a3399812b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): npm/packages/agentic-synth-examples/src/cicd/index.ts:184 \u00B7 npm/packages/agentic-synth-examples/src/security/index.ts:147 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e621e3f9ec5fbd0c31b7f8215d61b74f58cc8e6e9495b99c0dbe244224f70d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): npm/packages/rudag/bin/cli.js:52 \u00B7 npm/packages/rudag/bin/cli.js: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/bin/cli.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfd9a6ba8805ccf516f91c2e5429d230109f1a9d198140a5930c48e7ed1f662"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10419 \u00B7 npm/packages/ruvector/bin/cli.js:10511 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10419}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e858a4f517b2e44e6dbc0f27c5c15327cf51bd764111712333391dc51d3665f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/statement-parser.js:117 \u00B7 scripts/lib/module-splitter.mjs:163 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5858d40b6ddaa66d12a91e06fd952b54a0e7384b461e2131d00ac70a16414d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): npm/packages/rvf/src/backend.ts:494 \u00B7 npm/packages/rvf/src/backend.ts:517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/backend.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"feafeedc4cb1594708025e20e023d95bbba2cc108957b909c0a3cd837cd07fa1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): scripts/lib/rvf-builder.mjs:160 \u00B7 scripts/rebuild-all-versions.mjs:361 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/rvf-builder.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac87b79a12ced253057206dcde4933cd4539083ccdcc68302291ac815636df2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/rvf.ts:557 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:832 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"809f2b7afcbad96b2f7196bbb82fd760e085b4d880cdd57ab9ccf72b0a4eff08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/deploy.ts:203 \u00B7 npm/packages/ruvbot/src/cli/commands/deploy.ts:281 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/deploy.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f20fbb1cfd7515a4ac433f236c0431fe32bb47e22179590a88d6c74737df9ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): npm/packages/ruvbot/src/cli/commands/deploy.ts:422 \u00B7 npm/packages/ruvbot/src/cli/commands/deploy.ts:440 \u00B7 npm/packages/ruvbot/src/cli/commands/deploy.ts:458 \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":"npm/packages/ruvbot/src/cli/commands/deploy.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2a470442869550c8ca1a285752fc90e3d3c93d3d6d2bceb57bb94f3d1c7459"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): npm/packages/ruvector/src/core/attention-fallbacks.ts:177 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:226 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:275 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/attention-fallbacks.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc898ed426b8c10d24d71da28440ac502f04faa0de23481bdb7f8b41f7919ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): npm/packages/ruvector/src/core/parallel-intelligence.ts:174 \u00B7 npm/packages/ruvector/src/core/parallel-intelligence.ts:254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-intelligence.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5574d70fc870444d0e1d7a66a30b56b80c20f914113d2c24e983516a87eadcab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ui/ruvocal/src/lib/components/chat/ChatWindow.svelte:422 \u00B7 ui/ruvocal/src/lib/components/chat/ChatWindow.svelte:451 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatWindow.svelte"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4239fe65cc66d3e51d3caee69fd733ec10c2d9a5e8b8367690e7ff5a4befc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts:225 \u00B7 ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts:243 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"928a9d967a8e9dd9c85b321f671452e8cfaabbd9c8c35692a1ed056621755b4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:246 \u00B7 ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:371 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e588e01b57dc664d32ac6dd0cf4436bc5d5cd9efccd7705ce0b6476263cb866"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/agentic-synth/training/dspy-real-integration.ts:204 \u00B7 npm/packages/agentic-synth/training/dspy-real-integration.ts:224 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc37bf4184bbd4f1eea41250d2602f68f026300868a4c04ca476e2d42fa6d9dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/graph-data-generator/src/cypher-generator.ts:60 \u00B7 npm/packages/graph-data-generator/src/cypher-generator.ts:142 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/cypher-generator.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7752ceae627003f976f695e05db8f35a58947cc1e888d331091dcdb4f498ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6 locations): npm/packages/postgres-cli/src/commands/hyperbolic.ts:105 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:141 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:180 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:216 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/hyperbolic.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bb27077ca860adde6b5e97e9a6ebe94515f374bef8ee3f19c88ac0e76e1b76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/agent.ts:58 \u00B7 npm/packages/ruvbot/src/cli/commands/agent.ts:222 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/agent.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"934386ca115be232582e6137c9e8305f2b0aabb40bed7c0aa75d40311f54a07f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts:327 \u00B7 npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:502 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d770648915d2c2f933b2b33ce9a903cf1843161541cad79fe391fa1077330016"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:485 \u00B7 npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:518 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"051a23f7d1f489af483e13e8b06cdf9ea89cfcb720f7cf052ec607e8a89a4115"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/ruvbot/src/security/AIDefenceGuard.ts:491 \u00B7 npm/packages/ruvbot/src/security/AIDefenceGuard.ts:517 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/security/AIDefenceGuard.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba09dd8cb33c54c773d2b7959ee877cfca4ab31f8bc8d2d829003a705937ba9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:3293 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3369 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3293}}}],"partialFingerprints":{"codehealthFindingId/v1":"728044b1b4c62fd2ea295f7427b037a32f6c6c2848127ee82d2c74004988a4ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/ruvector/src/analysis/patterns.ts:96 \u00B7 npm/packages/ruvector/src/analysis/patterns.ts:120 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/patterns.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8150600d4efd68d3e57ca5df8adba8855c37cc7901dcf839e6ad6907d89c24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6 locations): npm/packages/ruvector/src/core/attention-fallbacks.ts:12 \u00B7 npm/packages/ruvector/src/core/cluster-wrapper.ts:8 \u00B7 npm/packages/ruvector/src/core/diskann-wrapper.ts:8 \u00B7 npm/packages/ruvector/src/core/gnn-wrapper.ts:17 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/attention-fallbacks.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbf98df17e2b32d062f35cb4f0b37b6165387ba68e94d886cae4dbf47f64795"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/packages/rvforge/src/build.ts:93 \u00B7 npm/packages/rvforge/src/submit.ts:46 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/build.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"512f57817c505d1530f4fe90b6edce9282c9311e0c9742fb338726f4976a0f3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/wasm/src/index.ts:237 \u00B7 npm/wasm/src/index.ts:257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/wasm/src/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9228eaecfeac7a4da92639776ac134120245ac225aa2b5eafcf60b9558cc8a0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): scripts/training/generate-data-v2.mjs:239 \u00B7 scripts/training/generate-deobfuscation-data.mjs:137 \u2014 the two spans are one implementation copied and then locally edited \u2014 265 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/generate-data-v2.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ae8db0892b3e23a196411bff31e5503573f98e702d40840e2bf72e61d8fe74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/postgres.ts:405 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:538 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"091903c443c0658dedecccf93639660829d1362f736bfed2a5145388bebfcc09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.ts:30 \u00B7 ui/ruvocal/src/routes/r/[id]/\u002Bpage.ts:12 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb6c9af4291dcc9e5669ceff582a9f6ba73834f49ef4d4facc85546b0e015d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5 locations): npm/packages/agentic-synth-examples/src/cicd/index.ts:187 \u00B7 npm/packages/agentic-synth-examples/src/security/index.ts:150 \u00B7 npm/packages/agentic-synth-examples/src/self-learning/index.ts:97 \u00B7 npm/packages/agentic-synth-examples/src/stock-market/index.ts:112 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb61e91e97197e0e25ad8f5da968c3f63419c60ee3ea349f63e0bbf6aa115c33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/graph-data-generator/src/embedding-enrichment.ts:49 \u00B7 npm/packages/graph-data-generator/src/embedding-enrichment.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/embedding-enrichment.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa6b936e05949e333eaf85eafb5a11027464ba52e864bf8fbce1954309409e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/graph-data-generator/src/embedding-enrichment.ts:119 \u00B7 npm/packages/graph-data-generator/src/embedding-enrichment.ts:138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/embedding-enrichment.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"968eecd38f026c77911950145c5f328aedde01a67f87ec46f4a944834f94816e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/postgres-cli/src/cli.ts:747 \u00B7 npm/packages/postgres-cli/src/cli.ts:766 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5900b52a877f08b1d1759c2d80ea4a7530273e87bab53bee5d08a5f83926c19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/security.ts:225 \u00B7 npm/packages/ruvbot/src/cli/index.ts:268 \u2014 the two spans are one implementation copied and then locally edited \u2014 134 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/security.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a238fcb596f235ef30898684439aabaa2ee5670bd348504aa8d566f8dd0f8ad6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/ruvbot/src/skills/SkillExecutor.ts:167 \u00B7 npm/packages/ruvbot/src/skills/SkillExecutor.ts:257 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/SkillExecutor.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd06be40ea6be3bcc3220d747ed8106b5494df43747548f0be5ab302a185d899"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:4036 \u00B7 npm/packages/ruvector/bin/mcp-server.js:649 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4036}}}],"partialFingerprints":{"codehealthFindingId/v1":"9376abd7dbd36af0a2a7634baa37bfddb478356dadb2e546e4bee6f8e3146763"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10229 \u00B7 npm/packages/ruvector/bin/cli.js:10269 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e1651bb3a374a2eeeec4c888f82951b772ec5867fe80734f43b1b4d9b674fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6 locations): npm/packages/ruvector/src/core/attention-fallbacks.ts:110 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:166 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:215 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:264 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/attention-fallbacks.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3a57cb7b3c7586848d81bb4e0e0b97871d27bdd7cb29c39fb2d5fff82fe30a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/ruvector/src/core/graph-wrapper.ts:228 \u00B7 npm/packages/ruvector/src/core/graph-wrapper.ts:250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-wrapper.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ebaa5a4f80b5980a7932784873f348e3135b28b563f35753a46abd0ec86639"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-perf.ts:106 \u00B7 npm/packages/ruvector/src/core/onnx-optimized.ts:146 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-perf.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"171953b56e145c97ff8032334779d6ec60de70fa1371eab39913b209a3847e44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/reconstructor.js:362 \u00B7 npm/packages/ruvector/src/decompiler/validator.js:345 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/reconstructor.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdf8555d41edb2b385a01015a3f2f1187dc9a490187656ce9f67dff57e78e25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): npm/packages/ruvllm/scripts/hybrid-model-compare.js:141 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:182 \u00B7 npm/packages/ruvllm/scripts/real-model-compare.js:103 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/hybrid-model-compare.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ae1bbe22f66ff136a3bb97448e02b915d3607de67df5a11ab8b71b04ace2e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/packages/rvlite/bin/cli.js:578 \u00B7 npm/packages/rvlite/bin/cli.js:599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b197a5edd5ede4323d769c2faa85487bc0c2b3d7db92a14dc516f7acd05d4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/sona-drift/harness.mjs:201 \u00B7 scripts/sona-drift/harness.mjs:271 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sona-drift/harness.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f40a543ebefc8e492667930613ce81cfbc3a4b9472f9697983459c513eee66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/postgres.ts:565 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:917 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b20a16dd21c8b97a0ef000c374e72751d7f68a4224722653e403744dda16e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/mcp/hf.ts:6 \u00B7 ui/ruvocal/src/lib/utils/hf.ts:3 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/hf.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c77b36b293d7f6c29d14061c1345ade1e6a7b00b4b48e23058a80ad65e59e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:1030 \u00B7 ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:1048 \u00B7 ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:1109 \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":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f0ae8f2641c892e1f3cc7cb9edd7b896de48aa7cbc9d80bf8522361335f267"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): crates/rvforge-reader/ui/main.js:92 \u00B7 crates/rvforge-reader/ui/main.js:251 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/main.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b089d966bf5277ac27d2e675f63475b9d461e43cdd7359724413893d9e5584"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/agentic-synth/bin/cli.js:32 \u00B7 npm/packages/agentic-synth/bin/cli.js:48 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/bin/cli.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6771b0564d4646087bc8c89f6484488bcec83a655e732a6a1c16a8736e69de0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/agentic-synth/src/adapters/ruvector.js:311 \u00B7 npm/packages/ruvbot/src/learning/memory/MemoryManager.ts:153 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/adapters/ruvector.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece8f47d21504d7f5b0af8d0dc6e4fc26012bc609084d2a7740ccc1957e59dd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4 locations): npm/packages/postgres-cli/src/commands/gnn.ts:60 \u00B7 npm/packages/postgres-cli/src/commands/vector.ts:129 \u00B7 npm/packages/postgres-cli/src/commands/vector.ts:156 \u00B7 npm/packages/postgres-cli/src/commands/vector.ts:199 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/gnn.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"04565e9863a4d15dae7bad646d421bb7986467353cfd7130851fa69e6ce6b853"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/hyperbolic.ts:353 \u00B7 npm/packages/postgres-cli/src/commands/quantization.ts:184 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/hyperbolic.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"61abdc7a25ee572ca14fec7182efe5456b89b7e8674fb1144be15bf19758d75b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): npm/packages/rudag/bin/cli.js:358 \u00B7 npm/packages/ruvllm/bin/cli.js:1046 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/bin/cli.js"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb36fb1edecc75ce43ec9e9cb3e05de8102263cc68aa474c2a4aee15e14c417c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/rudag/src/dag.ts:594 \u00B7 npm/packages/rudag/src/dag.ts:638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d908e2910ebd8aab44206989a4603436732ea2a91bdb42cbe07f6cd8bfcf2627"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts:210 \u00B7 npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:372 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c413faf247ec19a52aee7ee9faaf6410109d488c0c17870ef06fe7d3d18ab156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/ruvector/src/core/graph-algorithms.ts:462 \u00B7 npm/packages/ruvector/src/core/graph-algorithms.ts:514 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-algorithms.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c490e2e642f5cf18ca3b1e65476e1b477e6f4f906d99b353d473e74a5224d2cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/ruvector/src/core/parallel-workers.ts:718 \u00B7 npm/packages/ruvector/src/core/parallel-workers.ts:747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-workers.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"412fb6e4f99265f3f2d80ff50b3cd2fe289c19ece6e9fba9f199a30ee549f604"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/module-splitter.js:326 \u00B7 scripts/lib/module-splitter.mjs:369 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7648f21d8698ad4f81fa01c0d6af26244b88e587f0d10ce9e546b9d28639053a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): npm/packages/rvf-solver/pkg/rvf_solver.js:11 \u00B7 npm/packages/rvf-wasm/pkg/rvf_wasm.js:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-solver/pkg/rvf_solver.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95f09f58ab3e12e47e7af6e54529f065b656a27b17da467b48e85672a45dc2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/conversation/[id]/message/[messageId]/\u002Bserver.ts:18 \u00B7 ui/ruvocal/src/routes/api/v2/conversations/[id]/message/[messageId]/\u002Bserver.ts:17 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/conversation/[id]/message/[messageId]/\u002Bserver.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8132011531ef46b7c1578767907c08aec6589423180d464e940621ce645e048"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): npm/packages/agentic-synth/bin/cli.js:167 \u00B7 npm/packages/agentic-synth/bin/cli.js:207 \u00B7 npm/packages/agentic-synth/bin/cli.js:252 \u00B7 npm/packages/agentic-synth/bin/cli.js:303 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/bin/cli.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"635754f90039eda26e65a8b843578c47835639a4be139dab659a17faf664bd30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:572 \u00B7 npm/packages/cli/src/cli.ts:603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1628922d08a9a88ca3fe7a0b68067b5ce58e1f903fdeab5950451b7a9c53e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): npm/packages/cli/src/storage.ts:377 \u00B7 npm/packages/postgres-cli/src/client.ts:291 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/storage.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c08d7d6c020c92addd179badfaf444d0520563e4c6b5b861fceea2369daaf8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/diskann/index.js:11 \u00B7 npm/packages/router/index.js:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/diskann/index.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecb8b9733c7b6844064ff33ce44392dc5aa469e1e2ba77070caa8cdfe75256a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/kge/src/binding.ts:57 \u00B7 npm/packages/typesafe/src/binding.ts:141 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/binding.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b755e646d4721501f2463ab70a07f76e6e752cd5818405ea6250b08627db410"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ospipe/src/index.ts:360 \u00B7 npm/packages/ospipe/src/index.ts:567 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/index.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c5e4fb703ef149ce37f80ea0db0fc791a54d7d434c660178b40b53300edd36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/postgres-cli/src/cli.ts:525 \u00B7 npm/packages/postgres-cli/src/cli.ts:671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b94ed531e6e4860db8929c26afb2c6b484fdb2975f56d65206ead7c7c383e71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): npm/packages/postgres-cli/src/cli.ts:617 \u00B7 npm/packages/postgres-cli/src/cli.ts:661 \u00B7 npm/packages/postgres-cli/src/cli.ts:718 \u00B7 npm/packages/postgres-cli/src/cli.ts:806 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"375481d3081b8d169788e3a9ad1e333a296d10364e74ba2a1f20e0414575ccee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/postgres-cli/src/cli.ts:639 \u00B7 npm/packages/postgres-cli/src/cli.ts:931 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c471a90e62f60ffb493de744546e7dbb819d4c28f8cc740ae0358e3461ce19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): npm/packages/postgres-cli/src/commands/graph.ts:105 \u00B7 npm/packages/postgres-cli/src/commands/routing.ts:97 \u00B7 npm/packages/postgres-cli/src/commands/routing.ts:301 \u00B7 npm/packages/postgres-cli/src/commands/sparse.ts:71 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/graph.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"75595d18a85908641578088087f6fa385749fec3abc8d78c03c29d40e2264646"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7 locations): npm/packages/postgres-cli/src/commands/hyperbolic.ts:76 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:112 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:148 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:187 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/hyperbolic.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3341831c58c2ff7d5daa409521db5a79e0e10a9cd03785e8ebf0c9ee38f0c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/sparse.ts:141 \u00B7 npm/packages/postgres-cli/src/commands/sparse.ts:168 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/sparse.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a8e691853aef22ffb8148193fd9f5c3b1221c7693d05d77f47905973d72093"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvbot/src/channels/adapters/DiscordAdapter.ts:49 \u00B7 npm/packages/ruvbot/src/channels/adapters/TelegramAdapter.ts:80 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/DiscordAdapter.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d551c248f694ae76249df9f2cf21ab58a8de99fb749ec3fe1990dff7c7cc0aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvbot/src/core/entities/Skill.ts:80 \u00B7 npm/packages/ruvbot/src/core/entities/Skill.ts:102 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/entities/Skill.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4bf1b02a88fa65b1e991efe8f26bf7996fd732ce622f4c98ebdeb98fcf5bf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvbot/src/core/skill/index.ts:69 \u00B7 npm/packages/ruvbot/src/skills/SkillExecutor.ts:367 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/skill/index.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a72062bb5fa65a07971d45ec32c28ea6051d818cb30f1a168b22b0639dad4ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts:181 \u00B7 npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:309 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec9f8ba63cba376790415e6ff448758eab26798acca3eb6338ae8997e225f13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvbot/src/server.ts:300 \u00B7 npm/packages/ruvbot/src/server.ts:334 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/server.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"90490ccda8b4f9d12f3e1d87f012af83058f8d79592a852f82d9a6effb89c083"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): npm/packages/ruvbot/src/skills/builtin/MemorySkill.ts:141 \u00B7 npm/packages/ruvbot/src/skills/builtin/WebSearchSkill.ts:74 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/MemorySkill.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"948415bd9ae3754678991690cc3163f3081fd7d6590bd7aadcb79ef6a7a396e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/persistence.ts:500 \u00B7 npm/packages/ruvector-extensions/src/persistence.ts:546 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6de97f5cf5a9427afcbb3949c88f08aa3412e94e84de21bfcbb591ded161f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/ui-server.ts:102 \u00B7 npm/packages/ruvector-extensions/src/ui-server.ts:195 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"795e15ad71c69c7e0cb8776edf5d40ab246c58d811ded8fe664394f83a7e89b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:3803 \u00B7 npm/packages/ruvector/bin/mcp-server.js:572 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3803}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c51d20642a29217716fb670e8e4aa7120f8589af4c9225728db8c2632f1056b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:4115 \u00B7 npm/packages/ruvector/bin/mcp-server.js:165 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09a0547c7c8523ee860c8481a4b34cdd873529c581ede4c2aaa37649d371838"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:6509 \u00B7 npm/packages/ruvector/bin/cli.js:6731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6509}}}],"partialFingerprints":{"codehealthFindingId/v1":"3deb0937471c572f59c438f04cfc8a9876560f8adb59f0a266667f1225d0ec41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): npm/packages/ruvector/bin/cli.js:9622 \u00B7 npm/packages/ruvector/bin/cli.js:9756 \u00B7 npm/packages/ruvector/bin/cli.js:9780 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce46f59909c4ba5e8041cac7e4854d625607fe3ef4cdb85c780c2fa9b9075350"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10928 \u00B7 npm/packages/ruvector/bin/cli.js:10945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10928}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbad4f69a86b9662883f7060752103332acd5ba36f6f1e843e94e103bd00ee3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector/src/core/agentdb-fast.ts:277 \u00B7 npm/packages/ruvector/src/services/embedding-service.ts:280 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/agentdb-fast.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb6e374d4c0d24c20b1568e4885740b8d1bb832e21f02711d7149ed01503b4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector/src/core/attention-fallbacks.ts:741 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:758 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/attention-fallbacks.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5298478b6070d9c67c97c2f1a7d7e2060c7278fc7f28474af95439dd88ae9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/module-splitter.js:459 \u00B7 scripts/lib/module-splitter.mjs:311 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d5aaf89086988640274b8afe69fe382acde2e84162c450009612169fc2cdb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): npm/packages/ruvllm/scripts/ensemble-model-compare.js:189 \u00B7 npm/packages/ruvllm/scripts/hybrid-model-compare.js:265 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:267 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60f270911883776c2187de80e77d8966280fbe01b90bfccc6849be30c871097"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/training/claude-code-synth.js:249 \u00B7 npm/packages/ruvllm/scripts/training/claude-code-synth.js:292 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-code-synth.js"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe081b832d93dd62f077bb202d560b7b73974cc99907ab3ef0db12b595ab713"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/adr-index.mjs:390 \u00B7 scripts/frozen-weights-check.mjs:614 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/adr-index.mjs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"037b2f2dd2363e6aa2e742459a58759fbdd4c0fcbc2ec0a5f3b0250978c110f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/lib/rvf-builder.mjs:25 \u00B7 scripts/rebuild-all-versions.mjs:121 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/rvf-builder.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9aba9a56378ffac10e5fd5d28320dd0c51978562fefb13a30a3002f281086d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/rebuild-all-versions.mjs:257 \u00B7 scripts/rebuild-all-versions.mjs:722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rebuild-all-versions.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b96946df745b197177c7a35c9eb3f6ccd2acc99f6fc6e1cd298d2e75e8c883"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ui/ruvocal/src/lib/switchTheme.ts:90 \u00B7 ui/ruvocal/src/lib/switchTheme.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/switchTheme.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ce6fb220ec9e0fbc531095eaec76edfd45a4d78a7b608e151ba4be516ded7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): ui/ruvocal/src/routes/\u002Blayout.svelte:69 \u00B7 ui/ruvocal/src/routes/\u002Blayout.svelte:87 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/\u002Blayout.svelte"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b161f9b9cd67b1c12ba901e4f69b4a858b643dd3c80094d1917ac2431b14fa31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts:39 \u00B7 ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d38c1e70ea0bffb16b0e2391d3e1143139c2903819659112a1cb07b57fba61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte:366 \u00B7 ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts:471 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"026ff89bd42debf0f650ce6ae991fa99a3a28234aa944f87a92c0558998566bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): crates/ruvector-attention-wasm/js/index.ts:115 \u00B7 crates/ruvector-attention-wasm/js/index.ts:135 \u00B7 crates/ruvector-attention-wasm/js/index.ts:159 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/js/index.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4130543bd586125a3745f938ee074c575c5145161b4ec2f7099decbaa0f2ec36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): npm/packages/cloud-run/streaming-service-optimized.ts:528 \u00B7 npm/packages/cloud-run/streaming-service.ts:537 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9de01c8f435f92f9edf1cf519850531488db4b662686b873eaa2c1b45ac3f98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): npm/packages/graph-data-generator/src/generators/knowledge-graph.ts:13 \u00B7 npm/packages/graph-data-generator/src/generators/temporal-events.ts:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/knowledge-graph.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4410af42a3ad4329084f02718301397b565f015702d9edc4a01b7f55fbf6cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/mincut-wasm/routing/client.mjs:36 \u00B7 npm/packages/mincut-wasm/routing/client.mjs:60 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/client.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"26714478f92db37adcaeeb71bc47357338e9f11ddb074e847048c961778083f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): npm/packages/postgres-cli/src/cli.ts:1024 \u00B7 npm/packages/postgres-cli/src/cli.ts:1037 \u00B7 npm/packages/postgres-cli/src/cli.ts:1050 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4c552bd9993f0a56f12ed60287e0afb194c3c7ab24ac7cbad6d3494200d6bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/gnn.ts:114 \u00B7 npm/packages/postgres-cli/src/commands/graph.ts:61 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/gnn.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8deaab4d2052677be33c4cf8a5d7e175ba8f5d27c11f7c80d76fc65978da485"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/hyperbolic.ts:264 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:299 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/hyperbolic.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9375ee098ff8ce2bf5afa2b2484bd2c8f41fe50110e95f9587d563d5a54b67b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvbot/src/channels/ChannelRegistry.ts:143 \u00B7 npm/packages/ruvbot/src/channels/adapters/BaseAdapter.ts:140 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/ChannelRegistry.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5eed1913461cbe003f61345cfdf09cd54e0e10d6ac45567a9bb478241ca3e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): npm/packages/ruvbot/src/core/BotConfig.ts:163 \u00B7 npm/packages/ruvbot/src/core/entities/Skill.ts:92 \u00B7 npm/packages/ruvbot/src/core/entities/Skill.ts:114 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/BotConfig.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"031578e6746933670908a906f5985d351eaa8726cc5b4fd13bb5a911ee905891"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvbot/src/learning/memory/MemoryManager.ts:371 \u00B7 npm/packages/ruvbot/src/learning/memory/MemoryManager.ts:387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/memory/MemoryManager.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"72573fe1ba6dd1bacbc9a1faed2241408c98a12817b3667b840bdabe5abd470f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/embeddings.ts:356 \u00B7 npm/packages/ruvector-extensions/src/embeddings.ts:481 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b1aad1e7f758c48531ad11395ccd99444f2a8780cc2fa52627cf94753a0e47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/persistence.ts:1023 \u00B7 npm/packages/ruvllm-wasm/src/index.ts:126 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce97614cc66afa259c72dcb3e5ef34462826fe8560283a3e23157d284f9fbd84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:5612 \u00B7 npm/packages/ruvector/bin/cli.js:5635 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":5612}}}],"partialFingerprints":{"codehealthFindingId/v1":"4380fa65ad669efd7fd776be0fd22796a806b41399eb859e1f5ba17ec92a41ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:9764 \u00B7 npm/packages/ruvector/bin/cli.js:9788 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9764}}}],"partialFingerprints":{"codehealthFindingId/v1":"84427ed081b51e4c3fa97a50b0f9c8e0173b6902ed823c184cbea22b16475a81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:9856 \u00B7 npm/packages/ruvector/bin/cli.js:10113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9856}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a12f00905f84f64de5eb16f5b1323a979a442e45c32de88f6c409211375a551"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:2486 \u00B7 npm/packages/ruvector/bin/mcp-server.js:2501 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0545cd479eb60ce95500adf8f3a4ad23fd51f8fbc9e13aafc1bdfc8b909173"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): npm/packages/ruvector/bin/mcp-server.js:2658 \u00B7 npm/packages/ruvector/bin/mcp-server.js:2717 \u00B7 npm/packages/ruvector/bin/mcp-server.js:2736 \u00B7 npm/packages/ruvector/bin/mcp-server.js:2765 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe50596d1744d25a01cf7b1f8d37946b4364c03e26ac3f0a2e7f6994a090daa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:3028 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3055 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3028}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd0c2acdfa22cf45b0813e87926efb0e5ea8a00659894ec931fe7df0de06d68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector/src/core/attention-fallbacks.ts:146 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:195 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/attention-fallbacks.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae3afe02bdb23433914529dd65fe9917c745900783d5f005ad8b8d7aec4634e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector/src/core/attention-fallbacks.ts:599 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:626 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/attention-fallbacks.ts"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66dc8327c098b4f8b1beb68db8d13bcf498376cd25c8bbe1da4d43d360b989e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): npm/packages/ruvector/src/core/embedding-provenance.ts:63 \u00B7 npm/packages/rvforge/src/hash.ts:30 \u2014 the two spans are one implementation copied and then locally edited \u2014 99 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/embedding-provenance.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08a249efb3ab5126fbaa4a7de3146ce15c2fed483348e961811f843de50f76f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/ruvector/src/core/learning-engine.ts:374 \u00B7 npm/packages/ruvector/src/core/learning-engine.ts:414 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/learning-engine.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"712b0da2f54335504977d6f3c7cb7e7fdb4b1175cf67b02a57e1cc08d40541fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/rvf-solver/src/solver.ts:104 \u00B7 npm/packages/rvf-solver/src/solver.ts:154 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-solver/src/solver.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1233d2af8f6c847fe49a7ab23477bcfcdf6759e9a928c13d3bc801c90df4b524"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/rvf/src/database.ts:57 \u00B7 npm/packages/rvf/src/database.ts:87 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/database.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a08d3db6daea83782086d226c3118c2048d9706d51197f750ec9db9e2e17e7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/packages/typesafe/src/cli/eval.ts:94 \u00B7 npm/packages/typesafe/src/cli/optimize.ts:79 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/cli/eval.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa410e01e268a4a2e65d6a989352612a70425946aaf2300821bc08af7995d026"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/gemini-agents.js:55 \u00B7 scripts/gemini-agents.js:69 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gemini-agents.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f42106daecda118dc9446c95ffb929561a0b496005fe0fa0710809c43a932ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/training/extract-sourcemap-pairs.mjs:410 \u00B7 scripts/training/generate-data-v2.mjs:553 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/extract-sourcemap-pairs.mjs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcd5e9e32432b812c1ab4abb8a1b4444753615758ee0afa5ef6636b3593f2ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ui/ruvocal/src/lib/components/chat/UploadedFile.svelte:47 \u00B7 ui/ruvocal/src/lib/components/chat/UrlFetchModal.svelte:49 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/UploadedFile.svelte"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7c4321f717c239717cc940e29aa199035367395832fec1eb3437dc2d3fdb18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/endpoints/document.ts:13 \u00B7 ui/ruvocal/src/lib/server/endpoints/images.ts:20 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/document.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44f068b3643af0bda17caab450097864b2b6181176d7d870f8c6269dea61897"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ui/ruvocal/src/lib/stores/mcpServers.ts:518 \u00B7 ui/ruvocal/src/lib/stores/wasmMcp.ts:193 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ce4286f659e2b0e285a0a68a955d240a09d9f6d426e63c92fa8693a076da0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts:72 \u00B7 ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts:110 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7108ee81a13f31f9de566b703cb66f65360db0957733df4257498ac6777db59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/ruvector-attention-wasm/js/index.ts:141 \u00B7 crates/ruvector-attention-wasm/js/index.ts:165 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/js/index.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9feb298524ef88aea005ddca39f51291c89504527825df1d9aa9b6104eca5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): crates/rvforge-reader/ui/dock.js:17 \u00B7 crates/rvforge-reader/ui/library.js:19 \u00B7 crates/rvforge-reader/ui/witness.js:20 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/dock.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5612b7fb1a8929d7a01112c81b9cdbfa905afb6c970350aed65dbfa2e8d24e15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): npm/packages/agentic-synth/src/generators/base.ts:304 \u00B7 npm/packages/ruvllm/scripts/training/claude-hard-negatives.js:57 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d34b48157584ef177078ebe85525c61006c59e0eb7f28dea5cc5a84864ee47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/agentic-synth/test-example.js:88 \u00B7 npm/packages/agentic-synth/test-example.js:103 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/test-example.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4078eb0c6aec038b6d2588427c3a060d88c3b55241b1beb6037aaa68a4a4bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/agentic-synth/training/dspy-real-integration.ts:919 \u00B7 npm/packages/agentic-synth/training/test-dspy-integration.ts:58 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"068eb170e250cfc5b9effd9ea3fe4b408be1d50db298455a6677c1a23445f697"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/graph-data-generator/src/cypher-generator.ts:172 \u00B7 npm/packages/graph-data-generator/src/cypher-generator.ts:211 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/cypher-generator.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cade24fa7c44010d3a7de66850697e65bd1b05d765e4271358c2291dff0278"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): npm/packages/postgres-cli/src/cli.ts:178 \u00B7 npm/packages/postgres-cli/src/cli.ts:340 \u00B7 npm/packages/postgres-cli/src/cli.ts:375 \u00B7 npm/packages/postgres-cli/src/cli.ts:439 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0878b381aff91737f5d779bbb89c46b915f2932d797c219b736f24ff4322b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): npm/packages/postgres-cli/src/cli.ts:1005 \u00B7 npm/packages/postgres-cli/src/cli.ts:1022 \u00B7 npm/packages/postgres-cli/src/cli.ts:1035 \u00B7 npm/packages/postgres-cli/src/cli.ts:1048 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfab07d44b16fd4138025cdde7ba8e5ce2f7240be5816db3bfc174d47735396"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): npm/packages/postgres-cli/src/commands/attention.ts:57 \u00B7 npm/packages/postgres-cli/src/commands/learning.ts:98 \u00B7 npm/packages/postgres-cli/src/commands/quantization.ts:91 \u00B7 npm/packages/postgres-cli/src/commands/routing.ts:212 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/attention.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"127db49a9e89ecc60127375518b7d9b60d0ac8540893cdbd40e275c6bf2b5be9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/gnn.ts:24 \u00B7 npm/packages/postgres-cli/src/commands/vector.ts:136 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/gnn.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba093b8c8e77756a0165e38f2991a60e3263d5b418596c9fc31f7e4ccd4c706a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 13 locations): npm/packages/postgres-cli/src/commands/graph.ts:71 \u00B7 npm/packages/postgres-cli/src/commands/learning.ts:56 \u00B7 npm/packages/postgres-cli/src/commands/quantization.ts:53 \u00B7 npm/packages/postgres-cli/src/commands/quantization.ts:135 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/graph.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"de49b7568a29cfaebb9e4bf84007e7efc5abcbf96d93f75dcb7ebbedff20afe1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): npm/packages/postgres-cli/src/commands/quantization.ts:28 \u00B7 npm/packages/postgres-cli/src/commands/quantization.ts:61 \u00B7 npm/packages/postgres-cli/src/commands/sparse.ts:202 \u00B7 npm/packages/postgres-cli/src/commands/vector.ts:94 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/quantization.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"de64374738213f38e542399ea686870705ae18f6a6542962ad5912c25037409e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/router/index.js:121 \u00B7 npm/packages/router/index.js:149 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/router/index.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7670341c51d2abcbf4d40681db2f0656664c2cdec1ed95d09a7002688ca41749"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): npm/packages/rudag/bin/cli.js:165 \u00B7 npm/packages/rudag/bin/cli.js:186 \u00B7 npm/packages/rudag/bin/cli.js:224 \u00B7 npm/packages/rudag/bin/cli.js:252 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/bin/cli.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2da310e4386b1cb218f2566258dcd0e1835d8cdaff0ff2aed2eb08fe9b921e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): npm/packages/ruvbot/src/api/httpGuard.ts:54 \u00B7 npm/packages/ruvllm/bin/serve.js:35 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/httpGuard.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d548f1cc34921010713c080744c0fa517849ee645b8c233c286b309bde850"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/doctor.ts:87 \u00B7 npm/packages/ruvbot/src/cli/commands/security.ts:176 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2b1ee77e04206c03751c6d308299bd0bdcc88064620702d1b23340bd0568e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts:164 \u00B7 npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:291 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"004fb257faf809fa74479f85570b55d9b96860f98dedc8f2a7c6f636624330f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvbot/src/skills/builtin/WebSearchSkill.ts:139 \u00B7 npm/packages/ruvbot/src/skills/builtin/WebSearchSkill.ts:152 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/WebSearchSkill.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"367cd32c8e544557e3e3dc551157fdc3109aaed52b252815b39b019dbce399ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/embeddings.ts:470 \u00B7 npm/packages/ruvector-extensions/src/embeddings.ts:586 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"86da02288daab84a0e4c8c292744a859c3ecc762900aa3df0b27fa9c30d282ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/exporters.ts:255 \u00B7 npm/packages/ruvector/src/services/embedding-service.ts:275 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c47ea7b555e9f985d4bb0a0f68efcd87ec62218afc96b1808e6fbbf08a2d20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/temporal.ts:495 \u00B7 npm/packages/ruvector-extensions/src/temporal.ts:708 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"57842e5508ce143db74a86933b6ff4bb2a16795599c647ab5bef260d984bb9a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): npm/packages/ruvector/bin/cli.js:484 \u00B7 npm/packages/ruvector/bin/cli.js:1338 \u00B7 npm/packages/rvlite/bin/cli.js:687 \u00B7 npm/packages/rvlite/bin/cli.js:1501 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb543f90ff1698e4e59e456984bf3a17310e7b003b503c974a7b665cdbbf2e88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:1663 \u00B7 npm/packages/ruvector/bin/cli.js:1676 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a8444d8083297928289aa32aebd1774ebf1de3226ed71774be1dbf5e1f2f43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:3416 \u00B7 npm/packages/ruvector/bin/mcp-server.js:396 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3416}}}],"partialFingerprints":{"codehealthFindingId/v1":"424ed23e04e461d12bfd4754830797eab5c5f06db721f64d145dda15df5f7eac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:9671 \u00B7 npm/packages/ruvector/bin/cli.js:9723 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9671}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee02c044b244e14eb1ffc17c6751414fedbbcfa37595c814dd94f8f10c98666"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:3923 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4103 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3923}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be8d46856600c5bc40fa42a514951133fa0f5910668d5a330a9d28b3e0cf4c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:4267 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4296 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e1511054bc5116af3aafd70a1ddc8c48e261e2e361f31d00da1523e9c9529a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:4310 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4323 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c772675f55fc51239f3c0f19da0f1b3759ad6bf31d9011089f0e6e9f500c0dfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/src/core/graph-algorithms.ts:440 \u00B7 npm/packages/ruvector/src/core/graph-algorithms.ts:483 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-algorithms.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"1126a0e8e6b530a820f3645306d8e8ed4729cbf662519cf044f22ea33eec2185"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/src/core/intelligence-engine.ts:697 \u00B7 npm/packages/ruvector/src/core/recall-index.ts:49 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a7b3d9bbcdc10eccc7afbffb66b361de1c9183390dbffef6f1233366cd745c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvector/src/core/intelligence-engine.ts:1349 \u00B7 npm/packages/ruvector/src/core/intelligence-engine.ts:1378 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a387b39d5f2a233f872181079cec8c585c11ec2a872e813e0729ecb1d60eb4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/ensemble-model-compare.js:274 \u00B7 npm/packages/ruvllm/scripts/hybrid-model-compare.js:360 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"db01dc9849206ea6b7dacdda073385c37ecc1529abda618c4abe1890b0d041eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7 locations): npm/packages/ruvllm/scripts/ensemble-model-compare.js:97 \u00B7 npm/packages/ruvllm/scripts/hybrid-model-compare.js:111 \u00B7 npm/packages/ruvllm/scripts/improved-model-compare.js:125 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:172 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbdeeb3c59235c5b5e63328c1031fe642c0e928cfce77a4a469afa7be7b9fbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/rvf-mcp-server/src/server.ts:361 \u00B7 npm/packages/rvf-mcp-server/src/server.ts:379 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/server.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63b94328f74736045de9551ff747f11d1f16894b19f1c0568c072f8ce5cadb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/rvforge/src/config.ts:180 \u00B7 npm/packages/rvforge/src/keys.ts:100 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/config.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0119d82548a93a86d0ea768778354b2f1c6e517b14633094d928eabadf27b770"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): npm/packages/rvforge/src/registry.ts:268 \u00B7 npm/packages/rvforge/src/registry.ts:327 \u00B7 npm/packages/rvforge/src/witness.ts:123 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/registry.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf0b07935ba7fbcb6030e3b2fcaf7f7ec7124d903d697468c8ad39d14636e36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): npm/packages/rvlite/bin/cli.js:491 \u00B7 npm/packages/rvlite/bin/cli.js:586 \u00B7 npm/packages/rvlite/bin/cli.js:607 \u00B7 npm/packages/rvlite/bin/cli.js:1395 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"226737bf800ea7884a8e4c2cf5b5bbc3106e73d1fd0027437cb116ac0da9bedd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): npm/packages/rvlite/bin/cli.js:643 \u00B7 npm/packages/rvlite/bin/cli.js:1188 \u00B7 npm/packages/rvlite/bin/cli.js:1204 \u00B7 npm/packages/rvlite/bin/cli.js:1324 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fb5c0ef1c51cebb08bbd38ef2604b4028ddf711e2c78d627cf37dc60ef1b6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/rvlite/bin/cli.js:1497 \u00B7 npm/packages/rvlite/bin/cli.js:1548 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6b4b54578f2eaccf53461d203c43452fff6479e702fc5de4d0cca7b557089e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/packages/rvlite/src/index.ts:680 \u00B7 npm/packages/rvlite/src/index.ts:696 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/index.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba7b4fd6206a57b72d36f61d4ccd3eb7bc5fe164173037d940f6ade986ce747"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/training/extract-sourcemap-pairs.mjs:27 \u00B7 scripts/training/generate-data-v2.mjs:22 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/extract-sourcemap-pairs.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2dc427b9e62f2fdceb960796baa29b687f6186eed8337e4422e3f7c3557a09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): ui/ruvocal/mcp-bridge/test-harness.js:310 \u00B7 ui/ruvocal/mcp-bridge/test-harness.js:324 \u00B7 ui/ruvocal/mcp-bridge/test-harness.js:337 \u00B7 ui/ruvocal/mcp-bridge/test-harness.js:350 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/mcp-bridge/test-harness.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9c68576adbe91eb6d985986e3c0abced71c222548f9be212e2a8c84d99bc34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): ui/ruvocal/src/lib/components/ScrollToBottomBtn.svelte:3 \u00B7 ui/ruvocal/src/lib/components/ScrollToPreviousBtn.svelte:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ScrollToBottomBtn.svelte"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab5ecb621bf7c2d623e91f76e2f7ab763ec003c45b7cab45671cdd0f1c7eb8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/config.ts:170 \u00B7 ui/ruvocal/src/lib/utils/PublicConfig.svelte.ts:52 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/config.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e017506fb6a953c574a7a6955a7ce3ccd0027872df9f4e518740ff5c716087"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/rvf.ts:588 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:858 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02202d1a9ac5db28e441e6381cd705d0f7cfc9301a4a89d64377530f64d9acd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts:150 \u00B7 ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts:227 \u00B7 ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts:245 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d2996c79aa61f1164ac2022eb062e3ce1ee896058091b69c59951c1e2f5b63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/exitHandler.ts:32 \u00B7 ui/ruvocal/src/lib/server/exitHandler.ts:45 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/exitHandler.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"07998cb54e6a65624efa472daedf0a27f0c5844651ab2875af092d9d2ea29607"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/marked.ts:175 \u00B7 ui/ruvocal/src/lib/utils/marked.ts:188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0990dee8c545dbdd4bf2afd2a627d5e004c2787f0cd8686ec16ae842d0149ff6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:186 \u00B7 ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:498 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac8258e2c7003758e1fb2ee211bae4fa70fe0dc932b38130badd8023c135b15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): ui/ruvocal/src/lib/wasm/idb.ts:294 \u00B7 ui/ruvocal/src/lib/wasm/idb.ts:394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"19298873a35ea775562841eee41ac2413b61aa3f9d659043e4cb3c66dce2af6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/agentic-integration/regional-agent.ts:288 \u00B7 npm/packages/ruvector/src/core/agentdb-fast.ts:270 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f743e3af656b46e69cd53ecdd21bc2523edfc176d3769475ed9dbde205b2408"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): npm/packages/agentic-synth/src/generators/events.ts:106 \u00B7 npm/packages/agentic-synth/src/generators/structured.ts:59 \u00B7 npm/packages/agentic-synth/src/generators/timeseries.ts:102 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/events.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"089f7213aae228d8249bfb21e108adafd6f6cd59f98165608d7b09a36e40f725"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:229 \u00B7 npm/packages/ruvector/bin/cli.js:4173 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bed2c8416b9de6807ba1c476ee6cd7d71de5be02c8230f0697c51d8f24a639"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:288 \u00B7 npm/packages/cli/src/storage.ts:276 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2336e5f582e0f3c051a452471a4a8cff92e21f44f6e9af4a487310673220a71b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/cloud-run/vector-client.ts:133 \u00B7 npm/packages/cloud-run/vector-client.ts:417 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5f9b21bd44e3a87313a6c603ad7775f0a74766f2ac43a42bf0daba94d01ec9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/core/test-retrieval.js:11 \u00B7 npm/packages/ruvector/src/core/quantum-wrapper.ts:338 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/core/test-retrieval.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"425007e3ba4b5caa95e553c68ec8b2b1283b26df156fe7b090541f60caefc639"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): npm/packages/graph-data-generator/src/index.ts:71 \u00B7 npm/packages/graph-data-generator/src/index.ts:90 \u00B7 npm/packages/graph-data-generator/src/index.ts:109 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/index.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"150131cb0158d5b4c059a5792d689b940a72724b2cf960690dae4bb393859ae3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): npm/packages/postgres-cli/src/cli.ts:123 \u00B7 npm/packages/postgres-cli/src/cli.ts:215 \u00B7 npm/packages/postgres-cli/src/cli.ts:226 \u00B7 npm/packages/postgres-cli/src/cli.ts:237 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5ee229e5c2ac26a19c1ca5abdf7c2a6539813e38d94ba71a808f5d9aa42a63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/postgres-cli/src/client.ts:565 \u00B7 npm/packages/postgres-cli/src/client.ts:580 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd5879a7e3dade7ba16a2f6dfaa9f6ba8377da0c228dd6db5ebd7ba77143851"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/attention.ts:111 \u00B7 npm/packages/postgres-cli/src/commands/vector.ts:261 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/attention.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9f37df973caefae1f357ffa19d8a084717e53be07258107b983a9b35faaa5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): npm/packages/postgres-cli/src/commands/graph.ts:155 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:356 \u00B7 npm/packages/postgres-cli/src/commands/learning.ts:139 \u00B7 npm/packages/postgres-cli/src/commands/quantization.ts:187 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/graph.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5941fd9b850c96f1a3f40b05fa64d252f4eb71557230ce04ff9ad30a1d8cd0df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/install.ts:336 \u00B7 npm/packages/postgres-cli/src/commands/install.ts:374 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39dfbd26e8099b8e405e18ffdf58c280e620717893aeb572238d87af0300aa9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/routing.ts:129 \u00B7 npm/packages/postgres-cli/src/commands/routing.ts:265 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/routing.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6251ab8d3c217e53b9291ed9796a7b0e5d74a3ac7583b5730d04e58a6d491901"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvbot/src/RuvBot.ts:619 \u00B7 npm/packages/ruvbot/src/server.ts:521 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c126ad8c0ff415e93c59ecad94349c14ecfb030b25529479149e55fe3d7324"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/channels.ts:46 \u00B7 npm/packages/ruvbot/src/cli/index.ts:381 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/channels.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c699587420fcfb938d5336a15bea8a19e022236542ee2fed65010af839acf99a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/templates.ts:59 \u00B7 npm/packages/ruvbot/src/cli/commands/templates.ts:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/templates.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11494d54adf87c536026b2efc82190b8ead73a5cf6017b75a22e464fc7e48e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/embeddings.ts:247 \u00B7 npm/packages/ruvector/src/core/neural-perf.ts:753 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1808e1f0df6e48cf8a374a61390f7ecdaea3b7e9e96ae139b817a3cd0bcfcb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/exporters.ts:320 \u00B7 npm/packages/ruvector-extensions/src/exporters.ts:471 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc7f588ffd3555f0cc56ad36bded495f46b37bc1cca2f40475521e385389a29"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/exporters.ts:717 \u00B7 npm/packages/ruvector-extensions/src/exporters.ts:828 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61c9db785aae7c631ba0c72ce0c20195115e79cb442bed8e5f8c51d9f336bbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/ui-server.ts:125 \u00B7 npm/packages/ruvector-extensions/src/ui-server.ts:148 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d94e3f2f768706acd075f2936a0b56944c0afac1f66d830b605141738fdc32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/ui/app.js:291 \u00B7 npm/packages/ruvector-extensions/src/ui/app.js:333 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/app.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a3502a33aa7e2d7ccb832dbd603ce47526f4f933d7b920c623838b18caaee0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 21 locations): npm/packages/ruvector/bin/cli.js:177 \u00B7 npm/packages/ruvector/bin/cli.js:275 \u00B7 npm/packages/ruvector/bin/cli.js:334 \u00B7 npm/packages/ruvector/bin/cli.js:557 \u00B7 \u002B17 more site(s) not listed \u2014 all 21 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6e16c992f93954ab04200aab9cc27e2c5f39d37ffdd21c17095d3ef73d557e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:197 \u00B7 npm/packages/ruvector/bin/cli.js:394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dc42ece40c4ead17da38528851c5872eb61310f2df42e41203dac14554ca98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): npm/packages/ruvector/bin/cli.js:6451 \u00B7 npm/packages/ruvector/bin/cli.js:6494 \u00B7 npm/packages/ruvector/bin/cli.js:6712 \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":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98c9e460189b23c1feaf398f559f9a70f35bc31d8539981a318b7fc8e547a90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10200 \u00B7 npm/packages/ruvector/bin/cli.js:10243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10200}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfca2ca35838e369ba09bd080190b86c6a0a319e95d010efe7e832f2cdf55bd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10559 \u00B7 npm/packages/ruvector/bin/cli.js:10723 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f657d4650891d9f1645b25ae01f54d11584e58124bad54e9770a3af1d02a06c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:3083 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3083}}}],"partialFingerprints":{"codehealthFindingId/v1":"668fb532bdbca1b102c54bdfcd898f2e6dc61f30648286f03c0711f7915e9aff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 10 locations): npm/packages/ruvector/bin/mcp-server.js:3511 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3542 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3557 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3591 \u00B7 \u002B6 more site(s) not listed \u2014 all 10 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e93d4ba42cd458726a59258b229dc62703536bf5d07673d777af9078cbf482"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): npm/packages/ruvector/bin/mcp-server.js:3910 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3960 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3979 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3999 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3910}}}],"partialFingerprints":{"codehealthFindingId/v1":"056084df40b41e801351521958e8af8c7438f78f9dd26a886371827586f68836"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): npm/packages/ruvector/src/core/adaptive-embedder.ts:340 \u00B7 npm/packages/ruvector/src/core/adaptive-embedder.ts:550 \u00B7 npm/packages/ruvector/src/core/onnx-optimized.ts:452 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/adaptive-embedder.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c50399fb03b2518d20938ef025bc0208355b89efdefaacdf5f63c8271486042"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/src/core/ast-parser.ts:562 \u00B7 npm/packages/ruvector/src/core/ast-parser.ts:575 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9293d82d99ef5816afefc1956fbdfd2a7f5492afa0031c6f19e1ea8ccb3b06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/src/core/graph-wrapper.ts:150 \u00B7 npm/packages/ruvector/src/core/graph-wrapper.ts: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":"npm/packages/ruvector/src/core/graph-wrapper.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deb7bdbd2a407fd5a746944bde8aac05431a1c5de95c9ae73c66da949f1ece1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/src/core/tensor-compress.ts:370 \u00B7 npm/packages/ruvector/src/core/tensor-compress.ts:422 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/tensor-compress.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d7841cde6e78ee3038fbe0ce07d46566cc12f37052e26e0ac242907e37a5ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/src/core/tensor-compress.ts:396 \u00B7 npm/packages/ruvector/src/core/tensor-compress.ts:437 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/tensor-compress.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ac9aa31790730d2f0098d6d0f79aa85f524b13bf5b205d200b0e0488de71b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/statement-parser.js:91 \u00B7 scripts/lib/module-splitter.mjs:228 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90cd1f5509a466336a3a1e24560eb16bac1d2f4741cfcf558c409f4a011443"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvllm/bin/cli.js:922 \u00B7 npm/packages/ruvllm/bin/cli.js:964 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaf1f4dd6a24799a212e7d5613b2a3ec1f40facb9444fa4bc406305d62d295c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/ruvllm/src/simd.ts:71 \u00B7 npm/packages/ruvllm/src/sona.ts:336 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/simd.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0921ac5959446abe6f3a257feb1b6f7622ed3c9a57fe3d383217986168d2fbf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): npm/packages/rvf/scripts/smoke-idmap-durability.mjs:57 \u00B7 npm/packages/rvf/scripts/smoke-idmap-durability.mjs:75 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/scripts/smoke-idmap-durability.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e83612a22f812737f685de319ca926ad3d843e0f8d04144869ec3da38060ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/rvforge/src/registry.ts:324 \u00B7 npm/packages/rvforge/src/witness.ts:120 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/registry.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"94458cc3344fa5da2ce8efef88456fb21d04f579ea66e72e6ee421e5827b6636"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): npm/packages/rvlite/bin/cli.js:461 \u00B7 npm/packages/rvlite/bin/cli.js:844 \u00B7 npm/packages/rvlite/bin/cli.js:861 \u00B7 npm/packages/rvlite/bin/cli.js:1154 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f7d80e9a61ff5c171aa6153bf6139daa8edb9878756fc359cfd66b644cadbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): npm/packages/rvlite/bin/cli.js:522 \u00B7 npm/packages/rvlite/bin/cli.js:568 \u00B7 npm/packages/rvlite/bin/cli.js:589 \u00B7 npm/packages/rvlite/bin/cli.js:847 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b737aadacea984cfc30600d9136dd71f3e69c382f701cdb71bb6ef315e92e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): npm/packages/rvlite/bin/cli.js:542 \u00B7 npm/packages/rvlite/bin/cli.js:566 \u00B7 npm/packages/rvlite/bin/cli.js:1306 \u00B7 npm/packages/rvlite/bin/cli.js:1353 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"517e711013d400d4b99a9e5d4a57c279faa34be13a47bf751c1d427ae2acdfd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): npm/packages/rvlite/bin/cli.js:628 \u00B7 npm/packages/rvlite/bin/cli.js:645 \u00B7 npm/packages/rvlite/bin/cli.js:863 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"646758b16822949760bdc5b79379b1f1fb72d0dcae353a78650cc761c3f61510"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): npm/packages/rvlite/bin/cli.js:685 \u00B7 npm/packages/rvlite/bin/cli.js:1171 \u00B7 npm/packages/rvlite/bin/cli.js:1468 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"125baf11097079897d7f5c7e25562b0425b71e02631a3688859ef7bac668b87e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): npm/packages/rvlite/bin/cli.js:1156 \u00B7 npm/packages/rvlite/bin/cli.js:1307 \u00B7 npm/packages/rvlite/bin/cli.js:1326 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a68f2c69730365f9341fabf12866b9e833b9a69608005eca57a38e560b785a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): npm/packages/rvlite/bin/cli.js:1189 \u00B7 npm/packages/rvlite/bin/cli.js:1205 \u00B7 npm/packages/rvlite/bin/cli.js:1353 \u00B7 npm/packages/rvlite/bin/cli.js:1550 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f06273492c6f742c17e8fea679f49836e190ae1830246ccb6dad5f858a35138"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/packages/spiking-neural/bin/cli.js:338 \u00B7 npm/packages/spiking-neural/bin/cli.js:365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/spiking-neural/bin/cli.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"628d062c8aace73fe7e1f1714cd279d66fcffa1f61c7390db2b024ea21e2a718"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): npm/packages/typesafe/src/cli/decide.ts:14 \u00B7 npm/packages/typesafe/src/cli/eval.ts:97 \u00B7 npm/packages/typesafe/src/cli/optimize.ts:82 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/cli/decide.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6fc876fb7ef560dbe2a84ae879e1065d1bf12d4f39a83e95ebe305db956d27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/ruvocal/src/lib/components/chat/UrlFetchModal.svelte:94 \u00B7 ui/ruvocal/src/lib/utils/loadAttachmentsFromUrls.ts:35 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/UrlFetchModal.svelte"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd388b0689b5ea1e484a143c3325d28190a1e7d611fc749da95d61314a07eaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/marked.ts:421 \u00B7 ui/ruvocal/src/lib/utils/marked.ts:448 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5780f0b935a47e7d38fa8d6ff9c0a027a71f191a461f4664c6960671542a7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/agentic-synth-examples/bin/cli.js:142 \u00B7 npm/packages/agentic-synth/bin/cli.js:486 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/bin/cli.js"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece94ccdc659805b5dd1a34c6ac7fa23357e7fb2606e12789c22949fef065137"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): npm/packages/agentic-synth-examples/src/cicd/index.ts:531 \u00B7 npm/packages/agentic-synth-examples/src/security/index.ts:485 \u00B7 npm/packages/agentic-synth-examples/src/swarm/index.ts:544 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aa529ef8d36022b2bb9655f279ef050c3bdc19b5beb7165e3f86279604801a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/agentic-synth-examples/src/security/index.ts:439 \u00B7 npm/packages/agentic-synth-examples/src/stock-market/index.ts:333 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/security/index.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c6db3291dff20eb01b6ff3390d00d5e711b79d1f2e7637eada88d6a81c4639"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): npm/packages/cloud-run/streaming-service.ts:537 \u00B7 npm/packages/ruvbot/src/server.ts:684 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3de2b667e85dcea7b48203992e276e50cb37d2c407678a1ba9567f7e8c645d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): npm/packages/core/test-retrieval.js:12 \u00B7 npm/packages/ruvector/src/core/quantum-wrapper.ts:339 \u00B7 npm/packages/weight-space/src/model.ts:198 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/core/test-retrieval.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bd81401ab32ef606e4632bacae452986e48ff7cfac94cde58bb540952c8228"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): npm/packages/e-means/e-means.mjs:20 \u00B7 npm/packages/e-means/runtime.mjs:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/e-means.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e9cbc97bebe44afe1ed3f8e8ad5cc320ac0fb5470b705191f45aedd88e4293"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): npm/packages/postgres-cli/src/cli.ts:259 \u00B7 npm/packages/postgres-cli/src/cli.ts:269 \u00B7 npm/packages/postgres-cli/src/cli.ts:382 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3106997444110bb7b26de5a8c0188a87ebca1c9d3cf63bcde2e5008705168db9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): npm/packages/postgres-cli/src/cli.ts:715 \u00B7 npm/packages/postgres-cli/src/cli.ts:781 \u00B7 npm/packages/postgres-cli/src/cli.ts:820 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae32975514506d2e9f68d6a7ac97c0aa80bf238a248515d1b686e4ba9cc8f97c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): npm/packages/postgres-cli/src/client.ts:942 \u00B7 npm/packages/postgres-cli/src/client.ts:1016 \u00B7 npm/packages/postgres-cli/src/client.ts:1064 \u00B7 npm/packages/postgres-cli/src/client.ts:1099 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"db08bb98fe73b5a7c160da4c407b0648e9d812a3d45b63ab434c9f26114974f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): npm/packages/postgres-cli/src/commands/install.ts:104 \u00B7 npm/packages/postgres-cli/src/commands/install.ts:117 \u00B7 npm/packages/postgres-cli/src/commands/install.ts:131 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"41547017cbfd26de074bcf7260c56b2edc68e7c34c5e1b249a49d278322c25fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/install.ts:122 \u00B7 npm/packages/postgres-cli/src/commands/install.ts:136 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3960a77328b5c718406b853cb9d9179d93ba8f44c572800151422ab1dbd6945"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/rudag/bin/cli.js:234 \u00B7 npm/packages/rudag/bin/cli.js:262 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/bin/cli.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88c2f32177d616a3ddc8ecc00688c9402c894753aabeffee83717c33327da1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/rudag/src/dag.ts:492 \u00B7 npm/packages/rudag/src/dag.ts:615 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"c143e9fd854ed475ac3b4403f15d668e7f8c9200f518900254b3a5638e9c9951"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/rudag/src/storage.ts:230 \u00B7 npm/packages/rudag/src/storage.ts:250 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/storage.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"120072f4538f42063590ab4f40c9495fb3388e02e3dfe85a1e5aec07b8f6f92e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): npm/packages/ruvbot/src/cli/commands/deploy.ts:78 \u00B7 npm/packages/ruvbot/src/cli/commands/deploy.ts:210 \u00B7 npm/packages/ruvbot/src/cli/commands/deploy.ts:288 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/deploy.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d410e00bc8e5f42f3710c5cc929e98141aa77f3d79b6136d3c17eb9f2b7b7ab1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvbot/src/security/AIDefenceGuard.ts:568 \u00B7 npm/packages/ruvbot/src/security/AIDefenceGuard.ts:655 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/security/AIDefenceGuard.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"961a9b4a59036d6413e2293efd94bc7f3c9696a7d238d7f2bb14a7ffa4a5cd8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvbot/src/server.ts:328 \u00B7 npm/packages/ruvbot/src/server.ts:363 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/server.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e42c83e287cde2d874704d6f77272e7959a38700945ff767d5c5ebb0285825c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts:213 \u00B7 npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts:510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3576e986fdddb6dc1d680994506b8b9994422e6c9c7face747febe420c5b4319"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/ui-server.ts:143 \u00B7 npm/packages/ruvector-extensions/src/ui-server.ts:192 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa7cb21b004f761a52c0f8d39531eaaabc38e6e22b7bb37db3d996e536d33eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): npm/packages/ruvector/bin/cli.js:5952 \u00B7 npm/packages/ruvector/bin/cli.js:6444 \u00B7 npm/packages/ruvector/bin/cli.js:6587 \u00B7 npm/packages/ruvector/bin/cli.js:6669 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":5952}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a984d6a556c4d80416f46b7adaceabf0d610a96ce16a9b0364afcebd11b6a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:836 \u00B7 npm/packages/ruvllm/scripts/hybrid-model-compare.js:167 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b60ada00058aec61620efd0a872f191cfcc4d7b744869b317e9ad35e8fc1fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10 locations): npm/packages/ruvector/bin/mcp-server.js:4457 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4474 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4489 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4504 \u00B7 \u002B6 more site(s) not listed \u2014 all 10 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4457}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26c37122ed435f75fdbc40fac28532fc739df1410641b5f03e91b8053415690"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11 locations): npm/packages/ruvector/bin/mcp-server.js:4469 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4484 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4499 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4514 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de54c38fc5f63692282317ff10aaec76160fdfa57c74a35d76296fbdacb4806"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:4624 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4664 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4624}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d8552da9404498ccac2b03e3fc6b8b4c700302727164bd938028aaee495eb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): npm/packages/ruvector/src/core/attention-fallbacks.ts:438 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:451 \u00B7 npm/packages/ruvector/src/core/attention-fallbacks.ts:464 \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":"npm/packages/ruvector/src/core/attention-fallbacks.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a80fe8aabcddfd54af44488e0eb149e71d99aa0434cff2ed8af735c20fc76b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvector/src/core/coverage-router.ts:236 \u00B7 npm/packages/ruvector/src/core/coverage-router.ts:245 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/coverage-router.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff32256019e6115a25f7487170c420947a20f39f17f0201ddc449adaf2b1d79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvector/src/core/tensor-compress.ts:251 \u00B7 npm/packages/ruvector/src/core/tensor-compress.ts:288 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/tensor-compress.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c1b82787766efb000e30f9c85573d97d40f5a181e8d7017c320ecbbb663bb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): npm/packages/ruvector/src/decompiler/name-predictor.js:55 \u00B7 npm/packages/ruvector/src/decompiler/name-predictor.js:65 \u00B7 npm/packages/ruvector/src/decompiler/name-predictor.js:76 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/name-predictor.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"465ee1ee38773eebe78bd496de4480edb97ca06f0870f54c2b56b6c8bdd53eaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/reconstructor.js:226 \u00B7 npm/packages/ruvector/src/decompiler/reference-tracker.js:257 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/reconstructor.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44205e16745e142393e71554b3fd22ee840f5955deb64f6d3af3b225761b3a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvllm/bin/cli.js:614 \u00B7 npm/packages/ruvllm/scripts/training/contrastive-finetune.js:136 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf00bdb0cff5e26d9fc06bc3d7cb2154c9845eab7517ddfb8e9ef9031e10b86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/ensemble-model-compare.js:141 \u00B7 npm/packages/ruvllm/scripts/hybrid-model-compare.js:167 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"53103741f7dc1fcfc8984df0c7b68ca1fe95172b5909eb08d97cad815b2fe5ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/training/contrastive-finetune.js:184 \u00B7 npm/packages/ruvllm/src/contrastive.ts:194 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1364ba641c426518436d9500a026d861e24756c7d32cedcbb376ab744d1fcce2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/training/contrastive-finetune.js:250 \u00B7 npm/packages/ruvllm/src/contrastive.ts:292 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"30879a9c63477b6f8a44b348b3c3f2f0a8a6876e4bab41a8ac9fffbe72f4d659"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/ruvllm/src/federated.ts:102 \u00B7 npm/packages/ruvllm/src/federated.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/federated.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a433e116afaa6fa34e97392d502bf992e73081d224833cf171fd17e1f2e1e64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): npm/packages/ruvllm/src/training.ts:447 \u00B7 npm/packages/ruvllm/src/training.ts:485 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/training.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6ea981e6e53299f7b9c046be79556360358dee68f96757546944e8717fbeb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): npm/packages/rvf/scripts/smoke-batch-upsert.mjs:19 \u00B7 npm/packages/rvf/scripts/smoke-idmap-durability.mjs:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/scripts/smoke-batch-upsert.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a137a50258a466e6075ca1d76c7d612756c904f38e02c6d5cb8fb94e5b695"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/rvf/src/backend.ts:243 \u00B7 npm/packages/rvf/src/backend.ts:256 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/backend.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a110c0d1eec9959c837525aa8704896b2b5309fbc68ca7738885e45c6a5bea9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/rvforge/src/cli.ts:336 \u00B7 npm/packages/rvforge/src/cli.ts:441 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/cli.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be86e9a631135e7163fb7c7aba7818a254f14bee9c6fde7616ddd87b6cf1e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/rvforge/src/manifest.ts:260 \u00B7 npm/packages/rvforge/src/project.ts:306 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/manifest.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"89479eb2e841aea5c5f736d6f7b587557a35df6a7f00787e5cf1c1f47bc286e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): npm/packages/rvlite/src/cli-rvf.ts:200 \u00B7 npm/packages/rvlite/src/index.ts:450 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/cli-rvf.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"983de541ce4836d0dad4a14e37bc13b1293d78f47cfc3bdc0b98dfa2f7b35aec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/training/extract-sourcemap-pairs.mjs:109 \u00B7 scripts/training/extract-sourcemap-pairs.mjs:128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/extract-sourcemap-pairs.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3828d268e1bbcf0c8b478c36803a7ef9da027488d7a7e9a2afe1eba3e4d0a88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/training/extract-sourcemap-pairs.mjs:390 \u00B7 scripts/training/generate-deobfuscation-data.mjs:319 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/extract-sourcemap-pairs.mjs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"847997de310c8d2e133aaa0012983efd25b6d3558b2d53dbed54ea204752c8aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/ruvocal/mcp-bridge/test-harness.js:263 \u00B7 ui/ruvocal/mcp-bridge/test-harness.js:273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/mcp-bridge/test-harness.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6554bb67ac08d757e5c2c94014984327bbf92853755ed3fb975daf6c0e488997"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): ui/ruvocal/src/lib/server/conversation.ts:54 \u00B7 ui/ruvocal/src/routes/conversation/[id]/share/\u002Bserver.ts:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/conversation.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9f80e7da38726e840fb46bd926a5e908ac3678a2ead13da834fe23bc033503"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/postgres.ts:511 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:885 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8966bf54695e91a8f78ceea95ef53d54f1a17c767f7494ded907e267af698519"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/postgres.ts:628 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:1020 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e626a6367cd063c4ecfa924375820a1359ed136e307d271290ae63238b13b39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/rvf.ts:162 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"97511233b68075899da58ba44e71df7f1e52e37b1ee8f7ee98f59e27b8b8d6b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): ui/ruvocal/src/lib/server/textGeneration/generate.ts:132 \u00B7 ui/ruvocal/src/lib/server/textGeneration/generate.ts:168 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/generate.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cef8ab06b36347319bde1b5008ab66e8e9c56683a450a0d4bed08129ebb4dc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/ruvocal/src/lib/stores/mcpServers.ts:94 \u00B7 ui/ruvocal/src/lib/stores/mcpServers.ts:118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3487755d326f6fb8327db6e54b3381c2fdd8132dcb6903266ccca1be977cfacc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/ruvocal/src/lib/wasm/index.ts:1020 \u00B7 ui/ruvocal/src/lib/wasm/index.ts:1122 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/index.ts"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"75407d13a8975462347fc22bdbf405ff9ba8d6788d3b9a00e8f864084faff569"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/v2/conversations/[id]/\u002Bserver.ts:33 \u00B7 ui/ruvocal/src/routes/api/v2/conversations/[id]/\u002Bserver.ts:75 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/conversations/[id]/\u002Bserver.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9171bcced62497c4fcf8e89b1a70456cbf90d5d4dd7300f5b78010c7815bc98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): ui/ruvocal/src/routes/conversation/[id]/share/\u002Bserver.ts:7 \u00B7 ui/ruvocal/src/routes/conversation/[id]/stop-generating/\u002Bserver.ts:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/share/\u002Bserver.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"429d80b5d00cca779e5fe2231248e468d7d6dd3e9e3ae17fd543ed7e00ad805f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): ui/ruvocal/src/routes/login/callback/updateUser.ts:145 \u00B7 ui/ruvocal/src/routes/login/callback/updateUser.ts:174 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/callback/updateUser.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"010ad2b2f3155b88bc4f5852ac35910e7f59118b3445c69dc94f9d6e5c0658ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/ruvector-wasm/src/indexeddb.js:80 \u00B7 npm/packages/cognitum-gate-wasm/src/index.ts:960 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/indexeddb.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1421659b349e6edb4cec3a101412cab6bf24182fd0214ee316ac232eb96d1c53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/agentic-integration/agent-coordinator.ts:198 \u00B7 npm/packages/agentic-integration/coordination-protocol.ts:609 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"280298972c94e5dde8df360d27c9911076a6212bc4978a6b1d9b42f7c21ac9f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): npm/packages/agentic-synth/src/adapters/ruvector.js:117 \u00B7 npm/packages/agentic-synth/src/adapters/ruvector.js:140 \u00B7 npm/packages/agentic-synth/src/adapters/ruvector.js:171 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/adapters/ruvector.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d79fc67e283be670f96c16123f841dd06b3f26e260f52416e3928a1ea2d9fb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/burst-scaling/capacity-manager.ts:71 \u00B7 npm/packages/burst-scaling/reactive-scaler.ts:61 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/capacity-manager.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9ff98119e2f4bd2ba4569da523b53f7b1a5e6454874358ca169d0c498c7d87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:266 \u00B7 npm/packages/ruvector/bin/cli.js:4260 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d3c2ecd1cba7dde9efc451ebd7d8364b13b1b86b43d01f5f7a602351e095f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:392 \u00B7 npm/packages/cli/src/storage.ts:310 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7824639a5def6231c54726e8446728a8b900902f7cbbd89c4bb4133ef859fe2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:704 \u00B7 npm/packages/ruvector/bin/cli.js:5247 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"0267de38cc417efe5fba78e96599c8233ef8836404042519894a90d3324c299d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/cloud-run/streaming-service.ts:489 \u00B7 npm/packages/cloud-run/streaming-service.ts:512 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da7803d84221bce505f5cf0309cea44ccdc85d7c326deed87aded1e761818d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/cognitum-gate-wasm/src/index.ts:979 \u00B7 npm/packages/cognitum-gate-wasm/src/index.ts:992 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cognitum-gate-wasm/src/index.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec85dcde2b2067ca4bcf46d8fbb6d00b1401f77578f58cbf98ab72539566d9a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/e-means/integrations/quantization.mjs:54 \u00B7 npm/packages/e-means/runtime.mjs:57 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/quantization.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"097a0f0b30717df9fe73baebc823aa2c74fad44c370eb09591b8abf52c21b16e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ospipe/src/index.ts:614 \u00B7 npm/packages/ospipe/src/index.ts:634 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/index.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"698e543d490aa8c45d2cee06ac44150333bfb730fefcdd8762a38274219eee8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/postgres-cli/src/client.ts:760 \u00B7 npm/packages/postgres-cli/src/client.ts:769 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64225770b8d5634201af26d9b6902c96fcaf6cd8f9767df8d6382e2bf536bc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/install.ts:545 \u00B7 npm/packages/postgres-cli/src/commands/install.ts:711 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"047bb1d9bb35ca50c4542f1c7d37cd9b110325496caa7d2dac6311f8722f4f98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/install.ts:873 \u00B7 npm/packages/postgres-cli/src/commands/install.ts:901 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fe4ad115312962477daa5945896a22608c2fc86cb7085e44628d3b6b129b26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/routing.ts:258 \u00B7 npm/packages/postgres-cli/src/commands/routing.ts:344 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/routing.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af2a960970ff832fc18fcb240eb30e2ac8e866c23cf14f84f2cbfd7689d8996"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/raft/src/node.ts:136 \u00B7 npm/packages/raft/src/node.ts:164 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/node.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fffd33dca0b07a87f03cb4f63df6fc1da313135ec94e05ac8a3af9551a587c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): npm/packages/ruvbot/src/cli/commands/agent.ts:169 \u00B7 npm/packages/ruvbot/src/cli/commands/agent.ts:237 \u00B7 npm/packages/ruvbot/src/cli/commands/memory.ts:34 \u00B7 npm/packages/ruvbot/src/cli/commands/security.ts:272 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/agent.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6f27703492ac5fa5bd684ff508da578b9f3ecfef52698fadb207a915debd7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/doctor.ts:64 \u00B7 npm/packages/ruvbot/src/cli/commands/security.ts:35 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dc536949b4feeb62c48a1d724574810b08a2ad4b29f42596b3a9c87812d259"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvbot/src/integration/providers/GoogleAIProvider.ts:172 \u00B7 npm/packages/ruvbot/src/integration/providers/GoogleAIProvider.ts:248 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/GoogleAIProvider.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f3f5b38900e4f300d04e1903fec63f3c7a80aaf4212a6eec5bb3fb07d63c54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:289 \u00B7 npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:307 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d1e352a972224985f2c13fd55c78c2348497181fc917f3b68474484f4a5ef4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvbot/src/learning/embeddings/WasmEmbedder.ts:49 \u00B7 npm/packages/ruvector/src/core/onnx-optimized.ts:130 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/embeddings/WasmEmbedder.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"010e21a3883586838a400a995e3db17cd2e7c2614d6b680bf43ec0df5f5cfc66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): npm/packages/ruvbot/src/learning/embeddings/WasmEmbedder.ts:268 \u00B7 npm/packages/ruvector/src/services/embedding-service.ts:46 \u00B7 ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:51 \u00B7 ui/ruvocal/src/lib/wasm/index.ts:455 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/embeddings/WasmEmbedder.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c5e21eeba6280287c2d6ad09cb9a43295995b13feb5c6365f4d61ba00a5ccd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:6657 \u00B7 npm/packages/ruvector/bin/cli.js:6864 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6657}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef3841a45734a9e8c74137eabc574b5138723417785a76e7bbade91e65ce494"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10609 \u00B7 npm/packages/ruvector/bin/cli.js:10630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10609}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0701b97b097a673dbecadb5b75714a4ac0a89306cfbd4e788b9261189afcf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): npm/packages/ruvector/bin/mcp-server.js:3320 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3329 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3352 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ca81b5120884e15476740c222facc083c9135861e67ef8be5ed53b16764087"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:4075 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4137 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4075}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a04d2e573825d710e61d0823ce851b2d00a066b49d3f2a92328aec766da2541"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:4351 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4374 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4351}}}],"partialFingerprints":{"codehealthFindingId/v1":"787519040c34d50f8583bcd0d3651861abe23440e09b2d426328738b59e84fa3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/core/adaptive-embedder.ts:369 \u00B7 npm/packages/ruvector/src/core/adaptive-embedder.ts:378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/adaptive-embedder.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f30587d8b5fea0b01d8c4eaf49694e3045b1b89c22f0e0329e6b5649d583e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): npm/packages/ruvector/src/core/learning-engine.ts:346 \u00B7 npm/packages/ruvector/src/core/learning-engine.ts:379 \u00B7 npm/packages/ruvector/src/core/learning-engine.ts:419 \u00B7 npm/packages/ruvector/src/core/learning-engine.ts:441 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/learning-engine.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a11b3fc9b1357130ef7f70b1a219d6f71250f17fde698fd262d085e0d619b6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/core/learning-engine.ts:431 \u00B7 npm/packages/ruvector/src/core/learning-engine.ts:454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/learning-engine.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f225185f828ff9cb57d5e20e6311880fe774b4271106ead570a93d2a28581e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-embeddings.ts:393 \u00B7 npm/packages/ruvector/src/core/neural-embeddings.ts:810 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a374389b3a2d8c46a1a8d893793f3302fa966b5d587426e353862883b7d4562"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-embeddings.ts:403 \u00B7 npm/packages/ruvector/src/core/neural-embeddings.ts:819 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fe710c7fbb34006e7c8982db16bf0debf52857d9e24b5df67cf246b27c34f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-embeddings.ts:738 \u00B7 npm/packages/ruvector/src/core/neural-embeddings.ts:838 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7ef0955d06386bc5d992ff036878b2c1fa985005c9c3125840685bbba62200"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-embeddings.ts:966 \u00B7 npm/packages/ruvector/src/core/neural-embeddings.ts:1202 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb448503906dd9bca1948a399810675e7c35e2e0406ad922a552e1087efd4822"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): npm/packages/ruvector/src/core/neural-perf.ts:516 \u00B7 npm/packages/ruvector/src/core/neural-perf.ts:542 \u00B7 npm/packages/ruvector/src/core/neural-perf.ts:568 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-perf.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"078cb664ce364793ebadb585ca8246ebe2a19fbaf1fc1df8e7ce99e0b4e978b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/core/router-wrapper.ts:123 \u00B7 npm/packages/ruvector/src/core/router-wrapper.ts:135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/router-wrapper.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44b5965d47ccfaa9dbb18b27cc1755d526aaae6c7aea3958d484dce470ad9fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/model-decompiler.js:229 \u00B7 npm/packages/ruvector/src/decompiler/model-decompiler.js:276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4c80f89b8f5d02247e71e6464028ac59b77af7e85995069139eacca507d5e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): npm/packages/ruvector/src/decompiler/module-splitter.js:245 \u00B7 npm/packages/ruvector/src/decompiler/statement-parser.js:145 \u00B7 scripts/lib/module-splitter.mjs:174 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc248ab79b277a4f7730064e6bb30f6ccc17e55c69d2cde1a25cf220dd9bb6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/name-predictor.js:82 \u00B7 npm/packages/ruvector/src/decompiler/name-predictor.js:98 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/name-predictor.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7261842aebd1dc22a7c0ba963a8b5b89a195c4c19f7abe2c03a48814016036a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvllm-cli/src/index.ts:51 \u00B7 npm/packages/ruvllm/bin/cli.js:30 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm-cli/src/index.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"578a2f13d35bbb4b82a813f6b44e78316f8cf9c7b7b4a5a31f30bfa0e14d5dda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvllm/bin/cli.js:157 \u00B7 npm/packages/ruvllm/bin/cli.js:174 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed51514a5196883f8755dd1ab51f143a7d8af711f0aeefa128cf7d209f78590"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/fix-esm-extensions.mjs:91 \u00B7 npm/packages/ruvllm/scripts/fix-esm-extensions.mjs:101 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/fix-esm-extensions.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"be406f9fcdb1ba5f209deafde52e3c087f80ea176c4742111a2111d57aa50930"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): npm/packages/ruvllm/scripts/improved-model-compare.js:232 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:301 \u00B7 npm/packages/ruvllm/scripts/real-model-compare.js:224 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/improved-model-compare.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"72111cee9f2581f97fc7bf8fff7c09cb281a588feb723b230d25164c56c0e1a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvllm/src/engine.ts:560 \u00B7 npm/packages/ruvllm/src/sona.ts:661 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/engine.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21e65a3cd6499ef1564d3b8d7b03b373a09525b3f96961e589fe833772793d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): npm/packages/ruvllm/src/federated.ts:456 \u00B7 npm/packages/ruvllm/src/lora.ts:114 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/federated.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57a68abad10680d4d2eb1232cd62e3aefb00d987672ff8402e8662e90336285"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/ruvllm/src/simd.ts:41 \u00B7 npm/packages/ruvllm/src/simd.ts:82 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/simd.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"92481af4ecfd7d9581703fe80ed29df46c70f7e4101b15bf40585eaa10bbac63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/rvforge/src/cli.ts:272 \u00B7 npm/packages/rvforge/src/cli.ts:302 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/cli.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eaa16d647dd7d0cef68712a5160709675c0b71a9d781bce84826783faf1c5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): npm/packages/rvlite/bin/cli.js:1678 \u00B7 npm/packages/rvlite/bin/cli.js:1688 \u00B7 npm/packages/rvlite/bin/cli.js:1698 \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":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df6551f860a6060dd1c3ed57d3cb7a69b88e1c57f5cc6c36a0868647512a536"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/rvlite/bin/cli.js:1701 \u00B7 npm/packages/rvlite/bin/cli.js:1732 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65533cd606c082bae11efec56744f900c6cb0c09c41afccf4744b3f99e4322e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/rvlite/bin/cli.js:1719 \u00B7 npm/packages/rvlite/bin/cli.js:1729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e7e9977b72bf7d5073e7f79717ddebeafacb08568ef7ec088df34eb25ae4c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/rvlite/src/index.ts:957 \u00B7 npm/packages/rvlite/src/index.ts:970 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/index.ts"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"838839fa69a84ce64ea33251b8da9af5765ad84d12b75515657a9e7b764ed7ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/packages/typesafe/src/client.ts:146 \u00B7 npm/packages/typesafe/src/client.ts:160 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/client.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c35767523ad0fbc99af909aaa92c428301af44469c68209455cf11a000c7ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): scripts/training/generate-data-v2.mjs:123 \u00B7 scripts/training/generate-data-v2.mjs:133 \u00B7 scripts/training/generate-data-v2.mjs:154 \u00B7 scripts/training/generate-data-v2.mjs:164 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/generate-data-v2.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bd40cecb105094d4b8b4ca40ae35f09c61c6df2475139c3c38eecf0fd68aa6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/files/downloadFile.ts:24 \u00B7 ui/ruvocal/src/routes/api/v2/export/\u002Bserver.ts:125 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/files/downloadFile.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d887e445bc266d1c95de340bdc3fbb40915a05456a9425c57a3ce58e6d1f6d75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:666 \u00B7 ui/ruvocal/src/lib/wasm/index.ts:815 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e40d55bd1329e2c4181cda28ac3d2d520d51f1f93ac321c522676f2ed87531"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/parseBlocks.ts:71 \u00B7 ui/ruvocal/src/lib/utils/parseBlocks.ts:91 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseBlocks.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9121c4275584fdeefa0ba5f894d907a5fa104698019e81c3690485f249557e37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:310 \u00B7 ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts:510 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"01867ff97b13391e4cb07bfcf66a32785c6a2f55fcc0ea1178bcaf1868b89ff3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/ruvocal/src/lib/wasm/index.ts:848 \u00B7 ui/ruvocal/src/lib/wasm/index.ts:899 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/index.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"77be6e50d0d7b3889a7b99a1e1c6d01c183ac0554557a121fad487fae7a6e8de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): ui/ruvocal/src/routes/api/conversation/[id]/\u002Bserver.ts:6 \u00B7 ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts:30 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7393c2f817183f4f45a0215e2a71142549f4843aa04a9ad2be197fa22d81438a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/v2/user/settings/\u002Bserver.ts:11 \u00B7 ui/ruvocal/src/routes/settings/(nav)/\u002Bserver.ts:7 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/settings/\u002Bserver.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26254ee3109e2887abb60c5de206a30be02dc650f02d0405ef2fe93b44117bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte:411 \u00B7 ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts:496 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdb52b181574f45c366e7ac7d6687ff5411bc1ab1f2776db28961d3063deb79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/ruvector-wasm/src/indexeddb.js:176 \u00B7 crates/ruvector-wasm/src/indexeddb.js:329 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/indexeddb.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dab764513459a37dfe89ac3ab00e3426d22a690fc93c2a57fb3e16332aef73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/agentic-synth/training/openrouter-training-fixed.ts:151 \u00B7 npm/packages/agentic-synth/training/openrouter-training-fixed.ts:190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-training-fixed.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b478828f82045c283f41eb1e3c226c9144bd2e838b9d8df673bdea89394300ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:140 \u00B7 npm/packages/cli/src/storage.ts:158 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9289d8a7df499c97097dfc1881773ff72cbbdbea67fc15aabce136cfbb7a9b1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): npm/packages/cli/src/cli.ts:153 \u00B7 npm/packages/ruvector/bin/cli.js:3775 \u00B7 npm/packages/ruvector/bin/mcp-server.js:719 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"24968b81c88b62706bb47ae00057fa699b5dd003e144e09a157fca78e127eddc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): npm/packages/cli/src/cli.ts:209 \u00B7 npm/packages/cli/src/storage.ts:186 \u00B7 npm/packages/ruvector/bin/cli.js:4098 \u00B7 npm/packages/ruvector/bin/cli.js:4139 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cf4c6a25aa10b896c9b0045bad887a0cdf196df1adfe4f287524f515412285"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:302 \u00B7 npm/packages/ruvector/bin/cli.js:4299 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b53b190480804652d0c6d0eacb8a32d5bb1a03e7121a7ffe1fdd9d506d9ad1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:720 \u00B7 npm/packages/ruvector/bin/cli.js:5259 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5c81829448d00ca6b068ceab70d7fdd27abd2bdb131ffb2b0303566eb46f1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/cognitum-gate-wasm/src/index.ts:849 \u00B7 ui/ruvocal/src/lib/utils/marked.ts:474 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cognitum-gate-wasm/src/index.ts"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e49bc0ea8be7d65f056b481f3a670d5d67d75acdea1d3edfe54018acf7ce02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): npm/packages/kge/src/cli/commands.ts:55 \u00B7 npm/packages/kge/src/cli/commands.ts:71 \u00B7 npm/packages/kge/src/cli/commands.ts:84 \u00B7 npm/packages/kge/src/cli/commands.ts:95 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/commands.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d684337e8a206288e142e087d99318d1574ad27a92549d007b1aa9548c0b9ae9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/pi-brain/src/cli.ts:132 \u00B7 npm/packages/pi-brain/src/cli.ts:154 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/pi-brain/src/cli.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"faca77c4eeb436f70049718b61b903b221311fd664f20deb6a26c9f0d2f50afa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/postgres-cli/src/client.ts:744 \u00B7 npm/packages/postgres-cli/src/client.ts:752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"959fc0b6eceb90ba4e03978668816f07259789c65b2cdcd12202cbfbabd5cf01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/postgres-cli/src/client.ts:779 \u00B7 npm/packages/postgres-cli/src/client.ts:787 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"616a887e264c69ac132d6699185b36ca1314e5676c5ae26b90aea7b033c699a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): npm/packages/postgres-cli/src/commands/quantization.ts:50 \u00B7 npm/packages/postgres-cli/src/commands/quantization.ts:89 \u00B7 npm/packages/postgres-cli/src/commands/sparse.ts:250 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/quantization.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f02f2771c4f0c978b9636d931ce4a50bde2fbaa3fd96f144e8e8d714af203be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): npm/packages/postgres-cli/src/commands/routing.ts:94 \u00B7 npm/packages/postgres-cli/src/commands/routing.ts:145 \u00B7 npm/packages/postgres-cli/src/commands/routing.ts:165 \u00B7 npm/packages/postgres-cli/src/commands/routing.ts:262 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/routing.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0f488ac15f6984dec42b1ffe8e2f186aa8965b5ca4495508031c529120aec4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/rudag/src/node.ts:83 \u00B7 npm/packages/rudag/src/node.ts:91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/node.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e3ce21a288a0f9c72093f59e1a12ffa2118039e6c6d91f4648b28e26e982be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/rudag/src/storage.ts:141 \u00B7 npm/packages/rudag/src/storage.ts:190 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/storage.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a59563df4e9c1d17ed6fc19c8824afdabaeaac6ab005066e5fc9ccfdc4c09dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): npm/packages/ruvbot/src/cli/commands/channels.ts:278 \u00B7 npm/packages/ruvbot/src/cli/commands/memory.ts:161 \u00B7 npm/packages/ruvbot/src/cli/commands/plugins.ts:249 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/channels.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f68504430849f7be970c72bf8c22477b9911f6de0ffd2f5206c09c6d160168"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/plugins.ts:77 \u00B7 npm/packages/ruvbot/src/cli/commands/plugins.ts:321 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/plugins.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe25299a62287ca0db06d8ad73e68f449f61116cb7d7cdce20ceda04c6889b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): npm/packages/ruvbot/src/core/entities/types.ts:44 \u00B7 npm/packages/ruvbot/src/core/entities/types.ts:85 \u00B7 npm/packages/ruvbot/src/core/entities/types.ts:252 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/entities/types.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d367aac30ab319803497d6c9ced9ea63a9ba615ffd5e230841e26dbdd31fe76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/exporters.ts:636 \u00B7 npm/packages/ruvector-extensions/src/exporters.ts:818 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17a8e686b0d94aa4dd3ee5471286025b3cac1b25b1d9ad6391cedfa758bfe4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/persistence.ts:1023 \u00B7 npm/packages/rvforge/src/estimate.ts:110 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10d88eef3de1d1c382a3911bc248c8a34c09d0dc890efa9ee9ccb4c4e002e3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:299 \u00B7 npm/packages/ruvector/bin/cli.js:358 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1548d40bfa49a11e3258acaf59a99042696c953f588f98659421eb80058387"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:1482 \u00B7 npm/packages/ruvector/bin/cli.js:1489 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021bdfd6f7f1d2867c11d8f7f0f81adee2d8ee021bfcaf0747fe59d2c9081c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:3616 \u00B7 npm/packages/ruvector/bin/mcp-server.js:442 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3616}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0dca7ca41267119f602e44c098c20c1dc10271270060be98a7432f6c7e7774"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): npm/packages/ruvector/bin/cli.js:6547 \u00B7 npm/packages/ruvector/bin/cli.js:6593 \u00B7 npm/packages/ruvector/bin/cli.js:6676 \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":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6547}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d24859743eff5dd873472993fa9a86010b42d7d0bdac3584ac53f04f53aca84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:8606 \u00B7 npm/packages/ruvector/bin/cli.js:8618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":8606}}}],"partialFingerprints":{"codehealthFindingId/v1":"c247668fa8370abca59bf3ccea040d78264d22b56fd7434390469c71e9b9706a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:9750 \u00B7 npm/packages/ruvector/bin/cli.js:10078 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9750}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac25bfcbc49d0b11425076757f310fecc2754de0a804344bb1eaae305ab5c11c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10705 \u00B7 npm/packages/ruvector/bin/cli.js:10715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10705}}}],"partialFingerprints":{"codehealthFindingId/v1":"d989d2d8c264d441376efffd833131484f82846a7282eb96ca153ef8f4c89a90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10721 \u00B7 npm/packages/ruvector/bin/cli.js:10761 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10721}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b42b7568359c9ed54eb908c63aee1e07d5d9a1fcf5d07940bd48d3182d7648"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): npm/packages/ruvector/bin/mcp-server.js:3261 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3297 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3361 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3373 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3261}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8c316eca939a14845adc6b2b14ac8e368b5e464256199fe498de39f54ac6a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:3274 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3286 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3274}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d0e964b8166970ce636ea0b0cad59cdc27f2da068ba22d05d863ae22610828"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:3701 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3779 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3701}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6bd8507580828c4a66f17d93587d8188257ea58d891fab3f3c6cda39408868"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:4636 \u00B7 npm/packages/ruvector/bin/mcp-server.js:4652 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":4636}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5844efb251048ae3639e4a1445eea502234869f12b7e4816e4e38c5d286498"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/src/analysis/complexity.ts:89 \u00B7 npm/packages/ruvector/src/analysis/patterns.ts:193 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a81b7ce7bc4bcbc78681b8a1ce6dbc62810631b6c21fe21867463f11d63eee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/src/core/adaptive-embedder.ts:982 \u00B7 npm/packages/ruvector/src/core/intelligence-engine.ts:519 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/adaptive-embedder.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"4763c17a6e4f752ac745393214431077049ae3e478a74de505bf794c045503f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/src/core/ast-parser.ts:246 \u00B7 npm/packages/ruvector/src/core/ast-parser.ts:509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2291913c9fc7bd65de52fdbb412f12d7cbdfbdf7fc998deb52274c23d642c8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): npm/packages/ruvector/src/core/diff-embeddings.ts:356 \u00B7 npm/packages/ruvllm/src/engine.ts:586 \u00B7 npm/packages/spiking-neural/src/index.js:316 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/diff-embeddings.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ea626df2d62789173bec072ec8707f39052d8deb8032c2f9404c0a9f3d04af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/src/core/graph-algorithms.ts:228 \u00B7 npm/packages/ruvector/src/core/graph-algorithms.ts:246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-algorithms.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8226a2ff0380452686b0fd3fae0e2ea989295b786daebf5b38d361a111639761"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/src/core/intelligence-engine.ts:394 \u00B7 npm/packages/ruvector/src/core/intelligence-engine.ts:430 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"494d8e5b15ed4524cc15b981c27675b556205f81747632a57e09e33d73438a84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): npm/packages/ruvector/src/core/neural-embeddings.ts:555 \u00B7 npm/packages/ruvector/src/core/neural-embeddings.ts:969 \u00B7 npm/packages/ruvector/src/core/neural-embeddings.ts:1205 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d5c783a24da8a7a7d5a6f363006d5d483adc8c2dfe8cfc47c0f1590c20ebe3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-embeddings.ts:1057 \u00B7 npm/packages/ruvector/src/core/neural-embeddings.ts:1139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c4c187b925f74db77efe1ddb675863b3852881c866facf856184dfe080aee4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-embeddings.ts:445 \u00B7 npm/packages/ruvector/src/core/neural-perf.ts:821 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd5c1fcd06641c99ae0a694f85546256c291b3dd3c4ea96264db6d518f572b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): npm/packages/ruvector/src/core/parallel-intelligence.ts:156 \u00B7 npm/packages/ruvector/src/core/parallel-intelligence.ts:176 \u00B7 npm/packages/ruvector/src/core/parallel-intelligence.ts:232 \u00B7 npm/packages/ruvector/src/core/parallel-intelligence.ts:256 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-intelligence.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0922df91876f9b8526a03cb38688c1af7fea924c1f43ba8afc6d9ddbe79408"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/model-decompiler.js:289 \u00B7 npm/packages/ruvllm/scripts/ensemble-model-compare.js:137 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce448a686fa1dd0fdefaecb4c1fc63835965e69deb2ef8465c442d089129f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/ensemble-model-compare.js:226 \u00B7 npm/packages/ruvllm/scripts/ensemble-model-compare.js:239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20bfabadf54185202587e24d38e6b888afd09f4a7c334cd73958c5025cdc66b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/optimized-model-compare.js:220 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:242 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/optimized-model-compare.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aa5f57e215bd12054f213b5a7b0ae0e6d0db756cc521ca65346be6fd76ce0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/training/claude-code-synth.js:491 \u00B7 npm/packages/ruvllm/scripts/training/routing-dataset.js:623 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-code-synth.js"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f1075fa23f7eb6bd4b5b9ffb2ad37642aeaddd1956aa5476269cd850367794"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/training/contrastive-finetune.js:90 \u00B7 npm/packages/ruvllm/src/contrastive.ts:170 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"715d4c9727aedb16727d38474a458a8c1770cd4942621f03cfd2655094c507b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): npm/packages/ruvllm/src/simd.ts:126 \u00B7 npm/packages/ruvllm/src/simd.ts:138 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/simd.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19ec91dae74d6fa5721f81f7c43ddc53ec22a63cf26bc0575ca5f40e0d4b3be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): npm/packages/weight-space/src/store.ts:82 \u00B7 npm/packages/weight-space/src/store.ts:198 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/store.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f0de1cd036d036f04ab3438b140ef01663a7ab8065bf35bdf56f2acfd76175"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/lib/module-splitter.mjs:226 \u00B7 scripts/lib/module-splitter.mjs:236 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/module-splitter.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c1e9c2de8e37fd6dc99e2ce14634a11a0ae35a45620b5051e7fda772a10486"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/ruvocal/src/lib/components/RuFloUniverse.svelte:118 \u00B7 ui/ruvocal/src/lib/components/RuFloUniverse.svelte:128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/RuFloUniverse.svelte"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb36e9abdfc3e3c3f5ac139db60543898c40bd2181c190a71d9725e8ed8f0c81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/ruvocal/src/lib/components/chat/ChatWindow.svelte:153 \u00B7 ui/ruvocal/src/lib/components/chat/FileDropzone.svelte:35 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatWindow.svelte"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"15667d295479ae4a6f61da20f89f0b9f2b71e937e0760be609a0d07f0d5499d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/ruvocal/src/lib/wasm/idb.ts:84 \u00B7 ui/ruvocal/src/lib/wasm/idb.ts:93 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acfdb21f85e9707f03492c9f39650bf78e439996bb895e826821a5ce08a69c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/ruvocal/src/lib/wasm/index.ts:765 \u00B7 ui/ruvocal/src/lib/wasm/index.ts:797 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/index.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99c02cb5d765a77c9da4c51e3d3ab07abc74218c6d65b746acbfa503c572659"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): ui/ruvocal/src/lib/workers/autopilotWorker.ts:176 \u00B7 ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts:34 \u00B7 ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts:81 \u00B7 ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts:119 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/workers/autopilotWorker.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e23ed4e0a20d2f9db26e191bd51d99857a44837693470e5757705f43f05712c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): ui/ruvocal/src/routes/api/v2/models/[namespace]/\u002Bserver.ts:1 \u00B7 ui/ruvocal/src/routes/api/v2/models/[namespace]/[model]/\u002Bserver.ts:1 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/[namespace]/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"128d31b396c57f05b21989e98bcd3063e0f9910f696caffbc0bc5d33e66784aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): ui/ruvocal/src/routes/api/v2/user/settings/\u002Bserver.ts:20 \u00B7 ui/ruvocal/src/routes/settings/(nav)/\u002Bserver.ts:16 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/settings/\u002Bserver.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d781926e71622421e6b18e57912d79cb30bb48679f08aafd78855039146a4bd3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/agentic-integration/agent-coordinator.ts:290 \u00B7 npm/packages/agentic-integration/agent-coordinator.ts:319 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"487abf5eae1e0d10dc2312503ef51fc59c11c378f13af80aac57bdec4e328e8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/agentic-synth/bin/cli.js:235 \u00B7 npm/packages/agentic-synth/bin/cli.js:401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/bin/cli.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa3f2fca280bd19f435f0dd29af9322e51edf1675beadfcff5f269ed40a577"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): npm/packages/agentic-synth/src/types.ts:104 \u00B7 npm/packages/graph-data-generator/src/schemas/index.ts:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/types.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9cd9dfa2fa083dba557a650862c0124b5aaaf274420269e4ed4f77f97e197b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/agentic-synth/training/dspy-real-integration.ts:875 \u00B7 npm/packages/agentic-synth/training/dspy-real-integration.ts:914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a34184d89232f686f7a89eea692a0c00679299b8e0baab20ee6d260f476e597"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/agentic-synth/training/openrouter-learning-session.ts:216 \u00B7 npm/packages/agentic-synth/training/openrouter-learning-session.ts:391 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"198cb146425954a80b9d7b3fe2b25095342207ba4c5ffde94b5a9bfa9ee39173"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/agentic-synth/training/openrouter-training-fixed.ts:188 \u00B7 npm/packages/agentic-synth/training/openrouter-training-fixed.ts:276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-training-fixed.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"59013b6a0072dc007abe4959ad6ee15482c16efe79128c8209c9f49332efa7ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:732 \u00B7 npm/packages/ruvector/bin/cli.js:5266 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ac02700b1ef841860e5abe0d1a555c97e713ad907e49c9091145d30bf05f7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): npm/packages/core/test-retrieval.js:13 \u00B7 npm/packages/ruvector/src/core/neural-q.ts:130 \u00B7 npm/packages/ruvector/src/core/quantum-wrapper.ts:340 \u00B7 npm/packages/weight-space/src/model.ts:199 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/core/test-retrieval.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"177a5b16029c2b88405a0fa8a591a7eba41a3ec57c3554dae7244d2440b1a3aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/e-means/integrations/quantization.mjs:73 \u00B7 npm/packages/e-means/integrations/quantization.mjs:88 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/quantization.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2ea0c4df01fb83f9809504619d28501987858bc3aeac34c845d6ffe26ead62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/graph-data-generator/src/openrouter-client.ts:147 \u00B7 npm/packages/ruvbot/src/integration/providers/GoogleAIProvider.ts:295 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/openrouter-client.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8edbb0e500675c79c2936da8d3031bcb286e9eeda2ffe8336fddca0f289173b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/kge/src/errors.ts:30 \u00B7 npm/packages/typesafe/src/errors.ts:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/errors.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a116a861f6cbe73526301186aa34cfc8a4b29ca9d0c6a138b006a6bc3d0a1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): npm/packages/ospipe/src/index.ts:506 \u00B7 npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts:374 \u00B7 npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts:557 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/index.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1211a05485bc14c98740b88e08bc260edf0479a69580c331b61f3abb9e2e3415"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 12 locations): npm/packages/postgres-cli/src/commands/hyperbolic.ts:177 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:213 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:249 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:354 \u00B7 \u002B8 more site(s) not listed \u2014 the 12 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/hyperbolic.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb81261d157952f88d8357561f9472287c51d7785d65379b551336add442cb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/hyperbolic.ts:283 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:318 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/hyperbolic.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6060624c61b8add6171343142e2e84a70c01f5a32507077cb53be0f90057ff7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): npm/packages/postgres-cli/src/commands/routing.ts:70 \u00B7 npm/packages/postgres-cli/src/commands/sparse.ts:131 \u00B7 npm/packages/postgres-cli/src/commands/sparse.ts:158 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/routing.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2858ffada094c578fd11cce355462a3827ed8e824d6ece2709d86208cdbedc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): npm/packages/replication/src/sync-manager.ts:176 \u00B7 npm/packages/replication/src/sync-manager.ts:188 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/sync-manager.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"386b5c106084f2967f29e8ce139ced8f06a1388a0f4e33fae31e616b5e7e3c4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/router/test.js:28 \u00B7 npm/packages/router/test.js:82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/router/test.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c5513e68bc9540082f09fad7b81dc60173eaed00fd3c47652c7b28df05f9bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): npm/packages/rudag/bin/cli.js:195 \u00B7 npm/packages/rudag/bin/cli.js:233 \u00B7 npm/packages/rudag/bin/cli.js:261 \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":"npm/packages/rudag/bin/cli.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f09b64a10f4a1898f416aae5cfc7eac6f0501c6ad683705bfcdbae26a5028eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): npm/packages/rudag/src/storage.ts:270 \u00B7 npm/packages/rudag/src/storage.ts:286 \u00B7 npm/packages/rudag/src/storage.ts:303 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/storage.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fe6b815c45c1cb59e73edd849db111d4473835f47ece5133c19ab3ed89e16f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvbot/src/cli/commands/agent.ts:217 \u00B7 npm/packages/ruvbot/src/cli/commands/agent.ts:282 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/agent.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1a9765cb48f300fbf7a7aeb996d248aefb7b0689b97ff9275f712f0587307b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 14 locations): npm/packages/ruvbot/src/cli/commands/channels.ts:252 \u00B7 npm/packages/ruvbot/src/cli/commands/channels.ts:296 \u00B7 npm/packages/ruvbot/src/cli/commands/deploy.ts:381 \u00B7 npm/packages/ruvector/bin/cli.js:1854 \u00B7 \u002B10 more site(s) not listed \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/channels.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e90bfaaa28ca24bef4ac42f9a70f565319fc3bb295da57ec444fb91cf80632"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector-extensions/src/embeddings.ts:597 \u00B7 npm/packages/ruvector-extensions/src/embeddings.ts:741 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"42311207352d1b824bd5583df0b2f71dd3ce73e35375a23e3de1aec597c6f922"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): npm/packages/ruvector/bin/cli.js:764 \u00B7 npm/packages/ruvector/bin/cli.js:1928 \u00B7 npm/packages/ruvector/bin/cli.js:2956 \u00B7 npm/packages/ruvector/bin/cli.js:3061 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dddadc1b4dfef338c44a9b0973c5d909a37d5212fad2f23001302a8b4522a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:1116 \u00B7 npm/packages/ruvector/bin/cli.js:1333 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f29d52738b586184e916eabfde11f48514e7f21b014d6813ec8c5cf03ad2cb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): npm/packages/ruvector/bin/cli.js:1882 \u00B7 npm/packages/ruvector/bin/cli.js:1915 \u00B7 npm/packages/ruvector/bin/cli.js:2092 \u00B7 npm/packages/ruvector/bin/cli.js:3112 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd292fb5a2a7208690fe4944a3806f56ba95a3017a85ffb86c4d85aeaad7077f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7 locations): npm/packages/ruvector/bin/cli.js:1922 \u00B7 npm/packages/ruvector/bin/cli.js:1941 \u00B7 npm/packages/ruvector/bin/cli.js:2734 \u00B7 npm/packages/ruvector/bin/cli.js:3077 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2a3998b5865d325a53cc6afdfbb090b57cc190c49798bb457ee470609d30c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): npm/packages/ruvector/bin/cli.js:1975 \u00B7 npm/packages/ruvector/bin/cli.js:10388 \u00B7 npm/packages/ruvector/bin/cli.js:10428 \u00B7 npm/packages/ruvector/bin/cli.js:10465 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cb1de2ed47ecfb2e41a64cd86a573177d2735d9183661633e2fc63edcf821b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): npm/packages/ruvector/bin/cli.js:2121 \u00B7 npm/packages/ruvector/bin/cli.js:10430 \u00B7 npm/packages/ruvector/bin/cli.js:10467 \u00B7 npm/packages/ruvector/bin/cli.js:10522 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"076011867d53573f45302a94e1228a2e8977eb8a7890a14e6593984979fc485b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:2691 \u00B7 npm/packages/ruvector/bin/cli.js:2710 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"565bb183ba9313e1e1503ad2056f221cf3a29bc571aa64cc23aa279bed8b39a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:4101 \u00B7 npm/packages/ruvector/bin/cli.js:4142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4101}}}],"partialFingerprints":{"codehealthFindingId/v1":"561aff02ade7b359a730df01fbe1f77e558662eaad4069d3d966efd8036f8f99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:6431 \u00B7 npm/packages/ruvector/bin/cli.js:6770 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1597676d404c92e00ede2a1ff635c001d26a469184ca0ac41d231db4dec9e2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:9570 \u00B7 npm/packages/ruvector/bin/cli.js:9697 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9570}}}],"partialFingerprints":{"codehealthFindingId/v1":"700c2be5534508099478c9df176237b2a2f0d9b89f7080345869ac0c0edac5cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): npm/packages/ruvector/bin/cli.js:9610 \u00B7 npm/packages/ruvector/bin/cli.js:9635 \u00B7 npm/packages/ruvector/bin/cli.js:9816 \u00B7 npm/packages/ruvector/bin/cli.js:10071 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed6c6c4532ac0a18c383cfddf1434594c6aa2983d2c32a303f61286b2f61f81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): npm/packages/ruvector/bin/cli.js:9817 \u00B7 npm/packages/ruvector/bin/cli.js:9855 \u00B7 npm/packages/ruvector/bin/cli.js:10112 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9817}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f39a555890f8094f666913062bc74bb12d34cf154fa5d077258416c3139e33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10215 \u00B7 npm/packages/ruvector/bin/cli.js:10356 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3def64d24bff738bddedc4fc2ec6601613cb029b3757912ad2c0d35d0a9a32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:3565 \u00B7 npm/packages/ruvector/bin/mcp-server.js:3599 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d991a8ac9c65770ab0238c921017818f406c57b0536615199bfc096b5a16d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): npm/packages/ruvector/src/core/adaptive-embedder.ts:331 \u00B7 npm/packages/ruvector/src/core/adaptive-embedder.ts:542 \u00B7 npm/packages/ruvector/src/core/onnx-optimized.ts:444 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/adaptive-embedder.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"009a3f7681dcf6d36cf9ab615b2c3d0dc5a6ecb0795b0b270dfa19f0818f9217"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/src/core/intelligence-engine.ts:921 \u00B7 npm/packages/ruvector/src/core/intelligence-engine.ts:956 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"4565cc9232a3ffa35579cac9e9d45ef0329067ac2ea0b34c41061361d5457392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/api-prober.js:137 \u00B7 npm/packages/ruvector/src/decompiler/api-prober.js:175 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c87dd325906404b443a4cbdec8cbb30c167a5a5a7cbcde577629983943c935"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvllm/bin/cli.js:221 \u00B7 npm/packages/ruvllm/bin/cli.js:229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f808de57955e05a6fd3df7a6a3f8393429be81a5a4c60b8172c6b92e5c78f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvllm/bin/cli.js:330 \u00B7 npm/packages/ruvllm/bin/cli.js: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":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"17abcc1ed7640d4cac0129f284e88522b5cb372b998b03fa462aeb03dac28f99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/optimized-model-compare.js:286 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/optimized-model-compare.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f38a1358e3e2fa4e5a4c789aef182c2678e387f49525d9dc40b1ff4da29c02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): npm/packages/ruvllm/src/engine.ts:99 \u00B7 npm/packages/typesafe/src/client.ts:57 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/engine.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59d8f6766a582e05e3266b008a695b7678f54cd43a7ad5b0b19c2d9362ba1ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/ruvllm/src/federated.ts:270 \u00B7 npm/packages/ruvllm/src/federated.ts:587 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/federated.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac8e67be1d9a6ab0056f052b859cf177f447e16dad67fa19fd27cd01133adfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): npm/packages/ruvllm/src/lora.ts:335 \u00B7 npm/packages/ruvllm/src/sona.ts:584 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4f4a0e2795c2069ece324130ceb505648c4def49c33bec9d888d8285a0ab6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/rvf-mcp-server/src/server.ts:202 \u00B7 npm/packages/rvf-mcp-server/src/server.ts:229 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/server.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbd422d9d964007b14d963be7c5121a82aae6e184480013abe9a86d68582b62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/rvforge/src/cli.ts:230 \u00B7 npm/packages/rvforge/src/cli.ts:299 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/cli.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f533d6cad36af6287ff778300df9dbd1dec761a18fba02150909745fc4b23e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): npm/packages/rvlite/bin/cli.js:341 \u00B7 npm/packages/rvlite/bin/cli.js:347 \u00B7 npm/packages/rvlite/bin/cli.js:353 \u00B7 npm/packages/rvlite/bin/cli.js:360 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"628f4ac8c1d058ee1fa6e6f58edab5e10fda33abd1cc5593e8b75fbcce3e3de1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/rvlite/bin/cli.js:355 \u00B7 npm/packages/rvlite/bin/cli.js:362 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6686b6e86ddb2c64d845767d89977847e0a2c3754ea0b9dd5e824fb352c01e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/rvlite/bin/cli.js:772 \u00B7 npm/packages/rvlite/bin/cli.js:780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcc7b231de4dc88f7a18eb6afdf9d53a9a3988727f857dd714c829d82e35a2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): npm/packages/weight-space/eval/adr-corpus.mjs:13 \u00B7 npm/packages/weight-space/eval/reshape.mjs:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/eval/adr-corpus.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaff607e8cce79afff82af81ecfc052b8f5aa7017c02ec1d2eed5523333d99d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): npm/packages/weight-space/src/reshape.ts:32 \u00B7 npm/packages/weight-space/src/store.ts:124 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/reshape.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"307977c00ee71568ad77fbbca3f510c225d2abea9fa779bc4ce2e8fd735ba206"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/training/generate-data-v2.mjs:495 \u00B7 scripts/training/generate-deobfuscation-data.mjs:181 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/generate-data-v2.mjs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb1a01aaedb195b5a82b0043ce37142af3d3b40b6d07f0aeee9551cc3c82ba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/postgres.ts:94 \u00B7 ui/ruvocal/src/lib/server/database/postgres.ts:105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"53237c6338990f5b120dc1b8207243e90235bb3f05f50361398cd7881f3ff326"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/rvf.ts:116 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f6431762a0e82b2d8b964ec6d9b8fc44f6a3a480739209381ed405c54a4556"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): ui/ruvocal/src/lib/server/database/rvf.ts:385 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:392 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:404 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"8862e7c90e658a0d6b5e7bb6f55deee31ccb280099e130e75df1be6055042207"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): ui/ruvocal/src/lib/server/database/rvf.ts:392 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:404 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:415 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"519283c0e57a1fe023094a8a45043492a54f927cf5bd3e1447405417764f9a53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:829 \u00B7 ui/ruvocal/src/lib/wasm/index.ts:913 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6976cbc52faa9efe3e88a8bfc2906924e0c226ef6425182e17f074f64961b94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): crates/ruvector-wasm/src/indexeddb.js:108 \u00B7 crates/ruvector-wasm/src/indexeddb.js:176 \u00B7 crates/ruvector-wasm/src/indexeddb.js:200 \u00B7 crates/ruvector-wasm/src/indexeddb.js:291 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/indexeddb.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d0ea12770d6048b6fe09bdfef740a8a0fb2d0abb0905883f0d3ba30443cbb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): crates/ruvector-wasm/src/indexeddb.js:260 \u00B7 npm/packages/rudag/src/storage.ts:258 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/indexeddb.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"37822217a5906c60a6c60b7becd68aa63ad271dd3637adc28586aae560661532"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/agentic-integration/integration-tests.ts:460 \u00B7 npm/packages/agentic-integration/integration-tests.ts:466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/integration-tests.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dc20758b3a9a6699c654aa51a7ec0a33a786d00d18cb9c88840f691b6a88c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): npm/packages/agentic-synth/test-live-api.js:57 \u00B7 npm/packages/agentic-synth/training/example-usage.ts:86 \u00B7 npm/packages/ruvector/bin/cli.js:5849 \u00B7 npm/packages/ruvector/bin/cli.js:6618 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/test-live-api.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"06df9959e0c309be3640e6c3f1fe0cacc2de7c39ebe58e9c1cc078bf3a26b1db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/burst-scaling/capacity-manager.ts:518 \u00B7 npm/packages/burst-scaling/index.ts:303 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/capacity-manager.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f43f5f3d90ada151dd79bf4c0b3770900fd55cb7eed882e9e33b3591a8caf00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/burst-scaling/index.ts:264 \u00B7 npm/packages/burst-scaling/reactive-scaler.ts:460 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/index.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f177824b26568d094a829939ca0f052bd8ea0e7cc3adfc662d038905dcf68fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): npm/packages/cli/src/cli.ts:170 \u00B7 npm/packages/ruvector/bin/cli.js:3788 \u00B7 npm/packages/ruvector/bin/mcp-server.js:732 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba151d29a068e059a3ba249aa2a6e0d4640e184d729390ca535ff1d7747d5e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): npm/packages/cli/src/cli.ts:221 \u00B7 npm/packages/cli/src/storage.ts:219 \u00B7 npm/packages/cli/src/storage.ts:253 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c728d4f08f351b707b8afcc7d788a81832f0a18a9120a2e45b62d13b29bdc8dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/cli/src/cli.ts:794 \u00B7 npm/packages/ruvector/bin/cli.js:5296 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcb8361cf9505e1a1235d5c42e5b615355da3d33833912730a4e026f45aa923"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/cli/src/storage.ts:237 \u00B7 npm/packages/cli/src/storage.ts:575 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/storage.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"de866190aa8d5a1c28182f173f1979e5313302ec4b2f094f2977c276f220b0e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 24 locations): npm/packages/postgres-cli/src/commands/attention.ts:32 \u00B7 npm/packages/postgres-cli/src/commands/gnn.ts:89 \u00B7 npm/packages/postgres-cli/src/commands/graph.ts:90 \u00B7 npm/packages/postgres-cli/src/commands/graph.ts:123 \u00B7 \u002B20 more site(s) not listed \u2014 the 24 copies are spread across 9 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/attention.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2d0a87216b644600b52dcdb3e47edb8f24f9992304f7730d769a28386f0ee3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15 locations): npm/packages/postgres-cli/src/commands/gnn.ts:89 \u00B7 npm/packages/postgres-cli/src/commands/graph.ts:90 \u00B7 npm/packages/postgres-cli/src/commands/graph.ts:123 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:94 \u00B7 \u002B11 more site(s) not listed \u2014 the 15 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/gnn.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41543fb45223ffca6efca1958f2b1e7608f162d5d8181c61994e4ed01d1c93e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): npm/packages/postgres-cli/src/commands/graph.ts:92 \u00B7 npm/packages/postgres-cli/src/commands/hyperbolic.ts:168 \u00B7 npm/packages/postgres-cli/src/commands/learning.ts:40 \u00B7 npm/packages/postgres-cli/src/commands/vector.ts:71 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/graph.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bce5324b74d19f9baedae32ae26765593cd38784d4bf92608eb9b06eb2b06f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/install.ts:714 \u00B7 npm/packages/rvlite/bin/cli.js:672 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"74088ea0cf462c3a7ff2d24ebef0e071cfa43c0e07d9e532020229c2f61cc9c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/postgres-cli/src/commands/routing.ts:61 \u00B7 npm/packages/postgres-cli/src/commands/sparse.ts:87 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/routing.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1318e1319d44a24c111a973edffc46235227cde48eee9c05193e741b1a1532af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:922 \u00B7 npm/packages/ruvector/bin/cli.js:950 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"8358281d565e329acd9a830a9f482a604519bad51503e4775b227332f7e1136d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:1849 \u00B7 npm/packages/ruvector/bin/cli.js:1874 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c938dd2f63caad21a97126be1e04c0f725bece62c0686daedddf0e841bdbb6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): npm/packages/ruvector/bin/cli.js:2354 \u00B7 npm/packages/ruvector/bin/cli.js:2400 \u00B7 npm/packages/ruvector/bin/cli.js:3112 \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":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b9a2494aee6acd62be223b6577ced7c85a78a3d574208840f9cefd0e7c962b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): npm/packages/ruvector/bin/cli.js:5236 \u00B7 npm/packages/ruvector/bin/cli.js:5255 \u00B7 npm/packages/ruvector/bin/cli.js:5275 \u00B7 npm/packages/ruvector/bin/cli.js:5288 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":5236}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca47d0480e9b01483ee7d6e23fade617a5f8ae1cc05e97fea94b8ec26b1e4fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:9699 \u00B7 npm/packages/ruvector/bin/cli.js:10142 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9699}}}],"partialFingerprints":{"codehealthFindingId/v1":"834e8966574f065df36ab8c15af27be2d75a516ff51bfbe32a471aa56daf54a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10505 \u00B7 npm/packages/ruvector/bin/cli.js:10875 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c13ec64b91a2ab0369679eea83c19902f121b42b962c492235cf719f46adab9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): npm/packages/ruvector/bin/cli.js:10541 \u00B7 npm/packages/ruvector/bin/cli.js:10581 \u00B7 npm/packages/ruvector/bin/cli.js:10748 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10541}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84309a24479c216babe0ca1f3d07c699570e570efe40d16dd489a88755e8bed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10642 \u00B7 npm/packages/ruvector/bin/cli.js:10761 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10642}}}],"partialFingerprints":{"codehealthFindingId/v1":"561ae1e55a62ff98a464c65b5485238c7a9351fbeee40ad755d2182d8dea2173"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/bin/cli.js:10815 \u00B7 npm/packages/ruvector/src/core/recall-index.ts:62 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ef3a07b9e38fcce944364f8afd86b061ec6b0682f493f02fbcbf16a30584a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): npm/packages/ruvector/bin/mcp-server.js:2908 \u00B7 npm/packages/ruvector/bin/weights.js:344 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"967b23eb0443d9b02d10c297ff07b77d9dfb2ee160e2dd66aa8e4e7eb9a97ecd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/bin/weights-edit.js:185 \u00B7 npm/packages/ruvector/bin/weights.js:208 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/weights-edit.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89471efd56e3622d396b17d5cb9d1de3640a768b1f24c24b732725dab291394"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/src/analysis/complexity.ts:49 \u00B7 npm/packages/ruvector/src/analysis/complexity.ts:54 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4279d1e1bf27fd598853e9f5a6f5ba2f43cde715adce65d155bdcd376e53460d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/src/core/adaptive-embedder.ts:1000 \u00B7 npm/packages/ruvllm/src/simd.ts:163 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/adaptive-embedder.ts"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed00dd10a8a9b14abfa6f2109b0de1ac71fed620f566062f1fafa43896e95530"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/src/core/ast-parser.ts:527 \u00B7 npm/packages/ruvector/src/core/ast-parser.ts:537 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef7959b4f77f6992b4021eb2949de9dfb3b5faaeb4a13d47af850a3608231a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): npm/packages/ruvector/src/core/mincut-wasm-wrapper.ts:109 \u00B7 npm/packages/ruvector/src/core/mincut-wasm-wrapper.ts:174 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/mincut-wasm-wrapper.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d7980d87ac4030927d57f75158ebcc8dfc2600d218e95135e1d7f79747188d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/src/core/neural-perf.ts:490 \u00B7 npm/packages/ruvllm/src/sona.ts:404 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-perf.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"9976a53a6ba037e129093e6682e49a0fd1a54c710283d25db161d40af1636c2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvector/src/decompiler/api-prober.js:156 \u00B7 npm/packages/ruvector/src/decompiler/api-prober.js:176 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f554b539a4623b03e586664995e6ee6f88a7816c474067f8f09fe8ed4b45843"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/ensemble-model-compare.js:182 \u00B7 npm/packages/ruvllm/scripts/optimized-model-compare.js:260 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f0c6e3d72dfa068cd8fe69a241422589c1a84ae1e63520912609b2a6083257"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/ruvllm/scripts/real-model-compare.js:235 \u00B7 npm/packages/ruvllm/scripts/real-model-compare.js:241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/real-model-compare.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb8d75c52aaa02af6db399d876bffe676795640bc644fbbe0409b96155a5998"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/rvlite/bin/cli.js:564 \u00B7 npm/packages/rvlite/bin/cli.js:933 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7956c45a9c062c536f3b7349d2d5d1fc61de468855f7ee76f6f2d7a9a7b52e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/rvlite/bin/cli.js:1635 \u00B7 npm/packages/rvlite/bin/cli.js:1645 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f66937155b002936b1f39bfc38117a85dc66c8cae5595bfaa9011bfb8e35a3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): npm/packages/typesafe/src/cli/eval.ts:39 \u00B7 npm/packages/typesafe/src/cli/eval.ts:54 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/cli/eval.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"df15df07612ed3cb2fa25ea82616e3d99015ecbdac79993511e54cc6930e2cf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/training/extract-sourcemap-pairs.mjs:172 \u00B7 scripts/training/extract-sourcemap-pairs.mjs:197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/extract-sourcemap-pairs.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd15b07250f33e28367bf4a45af90b6d17edab2efdff51076a82b744ed4c058"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): ui/ruvocal/src/lib/migrations/routines/04-update-message-updates.ts:129 \u00B7 ui/ruvocal/src/lib/migrations/routines/05-update-message-files.ts:12 \u00B7 ui/ruvocal/src/lib/migrations/routines/06-trim-message-updates.ts:34 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/04-update-message-updates.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"35017a261d604ec8d74c872011948f73644433a37cd5a32503702e3c27ca3cb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/postgres.ts:119 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:260 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eeec90d8fc765f5ed7ab3b124db10a06bcc51096daa59357c98207953e32615"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/database/rvf.ts:432 \u00B7 ui/ruvocal/src/lib/server/database/rvf.ts:444 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9ac8188a23ab0c8f991d015fc8dca640f772ecda296584276411c7e2ce5af6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/models.ts:12 \u00B7 ui/ruvocal/src/routes/login/callback/\u002Bserver.ts:9 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad2c512dd1e1c6adb78497983971e0e492398184b066310f31c3151053fe544"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): ui/ruvocal/src/lib/server/models.ts:12 \u00B7 ui/ruvocal/src/lib/server/usageLimits.ts:5 \u00B7 ui/ruvocal/src/routes/login/callback/\u002Bserver.ts:9 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe4e8e64941308477f6fcb0ab3a836864ebe23c5f5a8244ee713aba68ef0fe1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:749 \u00B7 ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts:763 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"723989d6c1cf9198bbe99b8ec6767876d1d951e0b8ab2005718179567a06b5be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/ruvocal/src/routes/models/\u002Bpage.svelte:23 \u00B7 ui/ruvocal/src/routes/settings/(nav)/\u002Blayout.svelte:96 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/models/\u002Bpage.svelte"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d544a5ecfadc6bb3d29c09fbd3e60aa308499e74cbf18258ec72afab2c06fb72"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: crates/ruvector-attention-wasm/js/index.ts:6 reaches into another package with a relative path (../pkg/ruvector_attention_wasm) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/js/index.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4141c2da46cec068d193721815fa9d62a24786a8a92563bf248138ad7977c0bb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: crates/ruvector-sota-bench/harness/test/metrics.test.ts:3 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/metrics.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/harness/test/metrics.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fe098b68ac1f4a304813306b0b5c87cd77dc52f1856f014ad39c4385360d58"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: crates/ruvector-wasm/scripts/benchmark-hnsw.mjs:5 imports crates/ruvector-wasm/tests/fixtures.mjs, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/scripts/benchmark-hnsw.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ef2d4abd66a9a7cc327bbf24a0d182861589dfb589c670dbf7543708d1789c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js:60 imports dspy.ts/dist/src/index, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1f21e9dad7d59fe7cd264baf76923777bda7ea44690e9c2c33b42ebd554148"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts:27 imports dspy.ts/dist/src/index, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c318079a0c4c74be457a4c94eb0c5682a965e8093132b40f93c7795dcd41e6f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/agentic-synth/training/dspy-real-integration.js:21 reaches into another package with a relative path (../node_modules/dspy.ts/dist/src/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4160f6ff1718922786d2b829f23cc3ff172cb36e400607bd0295de5a1ae4691c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/agentic-synth/training/dspy-real-integration.ts:19 reaches into another package with a relative path (../node_modules/dspy.ts/dist/src/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd54add8c9430d651c484bfda8ba39083df678092cfde4a44feefc41570a8a2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: npm/packages/agentic-synth/training/test-benchmark-import.cjs:11 imports dspy.ts/dist/src/index, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/test-benchmark-import.cjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5dba44783564397ce0ccb93df7701cb526ead44f2147e5c3ed0bbb66ff043e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/mincut-wasm/routing/worker.mjs:11 reaches into another package with a relative path (../node/ruvector_mincut_wasm.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/worker.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fb9beb72408622b8490bbc94d62a7b76341dbbfab4353b9bdb17c2ecaee514"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/mincut-wasm/routing/worker.mjs:15 reaches into another package with a relative path (../web/ruvector_mincut_wasm.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/worker.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"48422cc115136a4a038e6e464265d14ea29a8a068d2abcbedc01b0836655b842"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/rudag/src/dag.js:98 reaches into another package with a relative path (../pkg/ruvector_dag_wasm.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47ff2629005fd2f3444b8855fb6cde28753e06a832e1ad6ef7512a2fef20130"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/rudag/src/dag.js:109 reaches into another package with a relative path (../pkg-node/ruvector_dag_wasm.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"daef9f3fe9293ead5f81617c98d24ccacee2dbf0d76fb981ea556f810ec2498c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/rudag/src/dag.ts:137 reaches into another package with a relative path (../pkg/ruvector_dag_wasm.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5323da1e25b74763c1d31e6a2fc9437d58fe95f7d0638ea9acdf06879843586a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/rudag/src/dag.ts:147 reaches into another package with a relative path (../pkg-node/ruvector_dag_wasm.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bd24ee1cd22cd2e963ea73619a344d07a61cca4a66ec94d6ddb10b17e0e97e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: npm/packages/ruvector/src/decompiler/index.js:40 reaches into another package with a relative path (../../wasm/ruvector_decompiler_wasm) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"378554e87b456cbf87be2be3cd56756b0b52e76bb1f63cfad22ab9bf7f4e9783"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:2 imports katex/dist/contrib/mhchem.mjs, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b87abfeb9a9ac67311e592ebc9c4d3e73fe57391afce6ac4a8dbb1758ed16bf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:11 imports highlight.js/lib/core, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1594cc313e1285416c935498bf843c0c2dbcea4002c0b1c1b76f4be1d44e643d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:13 imports highlight.js/lib/languages/javascript, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1344a4edd07f18e5ad2a99fdd6e7b080bc808ed2b3837bb6f756b71a39d25c3c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:14 imports highlight.js/lib/languages/typescript, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e149f4f2e95f24d3b8546a735b1a70423f8ddea59210b1d61357cbc0fa3ae0b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:15 imports highlight.js/lib/languages/json, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e5242f06ca9e92f74053bfd98338d9f6a62d872945585897ed93d7db6983ff"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:16 imports highlight.js/lib/languages/bash, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e5b6650e3a59cd5025970b66519eb16f477fa0bfeaddce6997988883b9a338"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:17 imports highlight.js/lib/languages/shell, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc4ba8f65bd2b629439c9182e05f99dde5812d283c6086aa8bdc9f438385d21"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:18 imports highlight.js/lib/languages/python, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e9a167d667876eb58533738cf586cfad343df7d64d6fde43f957b31548834b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:19 imports highlight.js/lib/languages/go, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"677c8b236e33abd8d0f80c2e3c9db8e24d184c50c1887ce89672a31af336a8ce"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:20 imports highlight.js/lib/languages/rust, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"341d4824a034aed7f19f94d05077b54aea0c511bff6859822c5aca9fbb569bd2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:21 imports highlight.js/lib/languages/java, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"748fe56b5c7303d7873e3d4b46ff3c84edad6e86e77cb65db087a943175dcb92"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:22 imports highlight.js/lib/languages/csharp, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"920a8285cab7072d902bd17620cc51c4f7a5578b977c722428262d44893fe385"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:23 imports highlight.js/lib/languages/cpp, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdf403e765e575d0b0a74fb5c5d45dde8911f6ad9b06971c92ce43f92409279"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:24 imports highlight.js/lib/languages/c, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d68074cd1029b956aa3d06f59c6f8aa4f2cd4366fb9b8121a0062e7cc51aefa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:25 imports highlight.js/lib/languages/xml, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99dd0203501906ca0b8cfa9cac9b28751fba66bff17e6c9ef229f03f47c1c7d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:26 imports highlight.js/lib/languages/css, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"695d8de5f3641a0c043b2de6088ce4131b6b1e429540d6b23e1de3fd223e544b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:27 imports highlight.js/lib/languages/scss, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d1c764fc60b25971ba995614eb61242c1e5f257d6ed1adfc18a93d33e54ef2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:28 imports highlight.js/lib/languages/markdown, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4673f6dd2eb372d52e0295e3b0b969633ca898e01822bceda934f6b78ee685"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:29 imports highlight.js/lib/languages/yaml, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fbb548c57f170ecaf39de813b70addecf7852766c9b2ada69f705ab20244e1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:30 imports highlight.js/lib/languages/sql, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ced6c8307538e1643819e88ce1f957b44296c5283a5021b74d4e5c84ccc2b8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: ui/ruvocal/src/lib/utils/marked.ts:31 imports highlight.js/lib/languages/plaintext, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cceb39b7581ee7d9a12894256f91f9695d11434a93b8cd3a8e7864488227ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 571, cognitive 782): (anonymous) has cyclomatic complexity 571 and cognitive complexity 782; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c87144f4cffdb41e23c311bfa7a49f79c253c7b5ca385bd9cf69fc22c5f5b4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMcpFlow (cyclomatic 182, cognitive 315): runMcpFlow has cyclomatic complexity 182 and cognitive complexity 315; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38cc609792e093110aeb531486577f8056065e9f11f9af3b692cc83506977bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateTags (cyclomatic 163, cognitive 129): generateTags has cyclomatic complexity 163 and cognitive complexity 129; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/wet-filter-inject.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8176d8d646509e7e46cef51c4460a0c844f8ab497c289079f87ce8931a0ddf09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeWasmTool (cyclomatic 97, cognitive 134): executeWasmTool has cyclomatic complexity 97 and cognitive complexity 134; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dba0e6294fdb40618f73d8167896af6ede9c633cae466d046b0b03f5a16d5ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 84, cognitive 137): (anonymous) has cyclomatic complexity 84 and cognitive complexity 137; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":7378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1206c240516e7c87d08abb21404dbd6127318046bf3f98dbcc976c6dad58a8bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 78, cognitive 98): (anonymous) has cyclomatic complexity 78 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/wasmTools.test.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c10a2c7d9400f8b9360107883230da1744049a9ec94381eda2642d5594f69a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeMessage (cyclomatic 67, cognitive 110): writeMessage has cyclomatic complexity 67 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"503aaa50f1000c3b0e801517745c18d6eb8074e988b39f5ba9260e6d4828133f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 67, cognitive 84): (anonymous) has cyclomatic complexity 67 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4573}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb3f7eb785d0a53e3bfbe8cacc060c49036efb5a3a4ddf22d724a1799b3be30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle_message (cyclomatic 61, cognitive 91): handle_message has cyclomatic complexity 61 and cognitive complexity 91; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/index.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d04d805aadc0f7588da2559a8de1869698818cb3ef8f0e6799c15d6931f2342"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generate (cyclomatic 59, cognitive 104): generate has cyclomatic complexity 59 and cognitive complexity 104; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/generate.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ed9daf6e7342d8c3d4c5db2f679a71dee3dbadaf864e78c691dcf20753fa73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesFilter (cyclomatic 55, cognitive 111): matchesFilter has cyclomatic complexity 55 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d8c0afa48798e74d531bef5085ff7f11d71cf0674bfaf478d7806c78016bc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripComments (cyclomatic 54, cognitive 89): stripComments has cyclomatic complexity 54 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/frozen-weights-check.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cf900ad553237760199842701a6025889cd1f05d32fb0ed55c0d9e7ddb0c05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 49, cognitive 55): main has cyclomatic complexity 49 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"656d0797206ef38aab0277ca85ded67891b13572ccfb0ac81be034ce1cba3d0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 49, cognitive 52): (anonymous) has cyclomatic complexity 49 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/hooks/handle.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5634647a30e7c099d576c1e38fc23ceefec8b4a041a9350d0e7388a8023293d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 48, cognitive 66): update has cyclomatic complexity 48 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1571985e0905554d10208827eabf038306943f24efb55ebeae9c25c379dc72ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 40, cognitive 49): POST has cyclomatic complexity 40 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"996ab9fc9b531368996bf35371a7776e068d89c4db345b09b016b9fef067c11d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 39, cognitive 60): main has cyclomatic complexity 39 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/bin/cli.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ed009f4b02d0f48155292d71d4c740fb1184445061df77a7654d282c8cc0de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validated (cyclomatic 39, cognitive 29): validated has cyclomatic complexity 39 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/ivf.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dca0d55ea2c6cec6182b148ff261e1f62a5f8f7477d8472651bd97ce799029a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 59): (anonymous) has cyclomatic complexity 38 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10923}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9309e25ffcdff60357012268906b33275b6e722c7799609734cd684a10db37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openAIChatToTextGenerationStream (cyclomatic 37, cognitive 52): openAIChatToTextGenerationStream has cyclomatic complexity 37 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/openAIChatToTextGenerationStream.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c536c20c9f1e589bf68c5eef330913e6923b37954134dce7d77d8813191aa074"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitMegaStatement (cyclomatic 37, cognitive 49): splitMegaStatement has cyclomatic complexity 37 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"57075be82a009594678b34af947c09685b1394d20fc69cd39e80c3b205de0561"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 37, cognitive 40): POST has cyclomatic complexity 37 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d1b160f9c6fa3296708f37bc4dbcc94f9fb73cf0d5da902b5beb836eb2039c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 43): (anonymous) has cyclomatic complexity 35 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":7961}}}],"partialFingerprints":{"codehealthFindingId/v1":"375d16b637e13220e547121ade1cd7568c8d398aa24e68c379daf16ab2c16857"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 65): (anonymous) has cyclomatic complexity 34 and cognitive complexity 65; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatMessage.svelte"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d722cbc2ee702f33fba4a92e98271986caa719c0f1148a2ad103022e1e091d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 34, cognitive 29): main has cyclomatic complexity 34 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/pi-brain/src/cli.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc974fe35ff0b1fdabed2b5a2a9e3c13d03fa3f7cecf06b43da931a69adefa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 52): (anonymous) has cyclomatic complexity 33 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/bin/cli.js"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84e32a06d8ddadfc95e29cf83260c73a378d6a877197282a0233e60baca3219"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateSemanticContext (cyclomatic 33, cognitive 32): generateSemanticContext has cyclomatic complexity 33 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/generate-data-v2.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8873104b89627174463bd26337b8bc5bae6ad1d9b21c7ab1ab4efca25361deae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 48): (anonymous) has cyclomatic complexity 31 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3100}}}],"partialFingerprints":{"codehealthFindingId/v1":"565c97b85dbbf17845c505648b202ae13ee16c4c142d02b980ca332a445930a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 48): (anonymous) has cyclomatic complexity 31 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f3b14ec61061dab2d2f8eea6c675ef31c630f60fc9277852fd694feced8d41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 39): (anonymous) has cyclomatic complexity 31 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db0541136bf968aea3d24edcf5dafc1ac69f97e706dbf0121a6b8a125b4e937"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autoFillMissingParams (cyclomatic 30, cognitive 29): autoFillMissingParams has cyclomatic complexity 30 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a810ffbb68dfde27b0d752f4240ee6d97ee57787e55d6974a33c08a3681f7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleChat (cyclomatic 29, cognitive 38): handleChat has cyclomatic complexity 29 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/server.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebf8718990dbfa7ea92bc99c996f49fa941ee6302f2220339292f7f79427d40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSnapshot (cyclomatic 29, cognitive 28): loadSnapshot has cyclomatic complexity 29 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/backend.ts"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7552e0b2338263c30144cc44a3d084b8c91f9edb9cb505c27a5a58c9f522e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripComments (cyclomatic 28, cognitive 57): stripComments has cyclomatic complexity 28 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sona-drift/stub-tripwire.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f399182b434e54dc1a7921f6476b7712d68a41b0e55f8afdb8a8b796c1b8029f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function minCut (cyclomatic 28, cognitive 52): minCut has cyclomatic complexity 28 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-algorithms.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7186198dbee2b5ba28ba056699fb1f5e6223d0798617aad13a042769265ecc38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTopLevelStatements (cyclomatic 28, cognitive 48): parseTopLevelStatements has cyclomatic complexity 28 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7164081f087de73dea3017819f8dd145360741c60c41b1b907b17988b6669c05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTopLevelStatements (cyclomatic 28, cognitive 48): parseTopLevelStatements has cyclomatic complexity 28 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/module-splitter.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c4244de231339ef4bd098ede4a6707267f76889c2418ed9ff02d6124452bf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routerEndpoint (cyclomatic 28, cognitive 47): routerEndpoint has cyclomatic complexity 28 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/endpoint.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"128079dfa1e008b0d421d5e3555ad86fd82000e6bb9bcf4dcf37968cd0d0e5df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterToWhere (cyclomatic 28, cognitive 42): filterToWhere has cyclomatic complexity 28 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cb16954d257ded0cafcfb5519b467242a65ed5998b4916be1a92f600850dcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMarkdownIntoBlocks (cyclomatic 27, cognitive 50): parseMarkdownIntoBlocks has cyclomatic complexity 27 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseBlocks.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"634ec25012a6284d361162a8a8b6c9213f17b7f4c18c9df8d91242831d669ba4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIstanbulCoverage (cyclomatic 27, cognitive 37): parseIstanbulCoverage has cyclomatic complexity 27 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/coverage-router.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"838c3e19c385a3b056428e236fb4ff43aa1a179e72b078d2a56e7ea449d99c34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 27, cognitive 32): start has cyclomatic complexity 27 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd6c8611a609b0afb59ef7a8097078e439e9beb989571da90ee2b9d12b4efa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function louvainCommunities (cyclomatic 26, cognitive 43): louvainCommunities has cyclomatic complexity 26 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-algorithms.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a7b96c37e15cf074a1b37bf7d06475f3d3f402ddf88bba59024b1198b141ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainWithinBudget (cyclomatic 26, cognitive 39): trainWithinBudget has cyclomatic complexity 26 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/fann.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4a3819c71dc3662f6aa07b94453de2028e956a7aa352fdd45011709edfe52f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleEvent (cyclomatic 26, cognitive 34): handleEvent has cyclomatic complexity 26 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/workers/autopilotWorker.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"848cb58f1f7f6c2eccf9144c6717c259ce14c9eb7a11959b1c8360d2c1c3f58d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 26, cognitive 31): main has cyclomatic complexity 26 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-evolution.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd921d3c3d9d5079f17fb5ce81eaffc4279042ed6948f93b089088da1bdc69e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installNativeFull (cyclomatic 26, cognitive 28): installNativeFull has cyclomatic complexity 26 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"022af441c97661ff04906eabcf7ac2c5b05bdc4b5ff0bb6832f1c323b25ed64d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyCommand (cyclomatic 26, cognitive 25): classifyCommand has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4335}}}],"partialFingerprints":{"codehealthFindingId/v1":"535e0e592dadf0e996a0de0a86613eb735185cd450c887b42fea9899b9441891"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 31): (anonymous) has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10796}}}],"partialFingerprints":{"codehealthFindingId/v1":"68156cc1ef4d813df063091150f11c1fdf583e6acfe155d73590a6e7e7351823"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readValue (cyclomatic 25, cognitive 26): readValue has cyclomatic complexity 25 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1043f20ceb14d50c62825116b23dc283da01d24ee17166fa593099974de0e4f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBase64Image (cyclomatic 25, cognitive 13): isBase64Image has cyclomatic complexity 25 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/scipix/src/client.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8073d5256fed19725bbf3f5e09b093b238bdbdfffcb03b319adac99c0359495"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stream (cyclomatic 24, cognitive 47): stream has cyclomatic complexity 24 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f619b7aa08f74adc4060fce20296e128b48fe44dceb3e917daa92aa31d9f2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePatch (cyclomatic 24, cognitive 37): validatePatch has cyclomatic complexity 24 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/weights-edit.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01fcf6f923361b8ac0d647e14cd125c5f7f78718e3ca44336e9d0631510e548"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyUpdate (cyclomatic 24, cognitive 37): applyUpdate has cyclomatic complexity 24 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff19b71002c573ecfa0b548ed567da78f6fdd516d8ade929b92ace961149b91a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 36): (anonymous) has cyclomatic complexity 24 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"9001f4c15b394fcf63d933cb772066b06221a662a314b92c725beac0b2fb371f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 31): (anonymous) has cyclomatic complexity 24 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9875}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff611841bbd4fb73fcc6b022c58228d5d754943d7a716802b77bc96c21dc969"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 24, cognitive 26): constructor has cyclomatic complexity 24 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ca0bf8e9ae912a7312b0bdb64a3df225c422dbeac2b93d14fb390f5493240f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferPurpose (cyclomatic 24, cognitive 24): inferPurpose has cyclomatic complexity 24 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"50224fb3b689443af3102ae3798cc7944da2cfaf5c2a04a7b15c2af320e71af3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateAddress (cyclomatic 24, cognitive 16): isPrivateAddress has cyclomatic complexity 24 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c41e1baec7790d31c2530f0d40088c065514f26b95c30fb02fd94460bc253f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 23, cognitive 34): main has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/scripts/fetch-models.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cea823bc7739a5bfeb5dfdd0c2fafc1c86c1f3c70abf654d8cc56b082d5c49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rvfMigrate (cyclomatic 23, cognitive 31): rvfMigrate has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/cli-rvf.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6298373e40240d0d64d572431b9164135808b37bd1ea40b7f07a53b45937953"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function webSearchExecutor (cyclomatic 23, cognitive 30): webSearchExecutor has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/WebSearchSkill.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e632ce1729fe97ce7140919ac8c3e521cc4fecdc604402654180852b00f79060"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rvfRebuild (cyclomatic 23, cognitive 26): rvfRebuild has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/cli-rvf.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5b5cdbbbce007c348312b3b2e2ad5e86761abb351df32fa7e0440ac05495a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 23): (anonymous) has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/quantum-wrapper.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a815aa7271dd8f349e3c8eee9c6e275746a9f21636aff4019c005310dac0eb80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferParamType (cyclomatic 23, cognitive 19): inferParamType has cyclomatic complexity 23 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2c574c98021f34756046ca5651397ee7e71d19d24087f59869575b071da748"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spectralClustering (cyclomatic 22, cognitive 45): spectralClustering has cyclomatic complexity 22 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-algorithms.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"820f2dcd505ba184cc74f0840aaf69e2df9168a7a09da746bec0ef942efd6f9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codeExplainExecutor (cyclomatic 22, cognitive 34): codeExplainExecutor has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/CodeSkill.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"44804cdcddec1f2d3cfc2d58790c3815d8f219a5ad0f3bf253b0098ca6a2974e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 34): (anonymous) has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9510c081b7008cb6df771cd1e702e1541894fc401c35b1be86ccb85277d3db4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 28): (anonymous) has cyclomatic complexity 22 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fd553e1969d48dbd3d5b162d5adda6db036ffe74c679e42de40b4750155b84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 22, cognitive 23): search has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/recall-index.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"91399b76849f312b7f0009b662b8fe7ae85c183e2d29511563015bfb67cee0b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateVersionReadme (cyclomatic 22, cognitive 10): generateVersionReadme has cyclomatic complexity 22 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rebuild-all-versions.mjs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4892454b49efa46f460a8f1c84cc22a3c37ec4f79c927356dd49de97957e30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kMeans (cyclomatic 21, cognitive 49): kMeans has cyclomatic complexity 21 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-algorithms.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"770ed15b0eb6a8905059df47e98886bcc3113c79ce3985a4093bdf23e7dd749a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 33): (anonymous) has cyclomatic complexity 21 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"d542ddfccd65457916ccfa50456128288b2c2ca1f6253104add8bc1fac530365"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 32): (anonymous) has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10603}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd707489d4a3a3d56aaa7c9292587ddd0c478b8aac45a912a92a388e7bb3860d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 32): (anonymous) has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"69435764042ececb4e426a601dcd65da6b80dd284b781e41ba1ad08e4140b43b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 30): (anonymous) has cyclomatic complexity 21 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c737bdc53c4dd55e2f1a354867cd203867f6c1f5ee858f6f6055b7b0d5f87bf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateToSet (cyclomatic 21, cognitive 29): updateToSet has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0848d409c847401e77f5bddc8634eb529550c1516f97d757e188f9cc8f967db1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 21, cognitive 25): visit has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e77c7dd812a2b92d3388c3fdde6fe5b34cf2e20b9d374503770ae359a5459b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 21, cognitive 24): fetch has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/cloudflare.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fefb8924a71a883aa78e529f021200c0188600cec6876947d5efcfe1c1fe86d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fit (cyclomatic 21, cognitive 20): fit has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/runtime.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d6c5064eae063076c80b12d700a958e05879f075554efe60ce2cf4cc7d73a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 21, cognitive 13): main has cyclomatic complexity 21 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/main.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eea44bbd906f31b73833fff7a2343c869afc766fe31105d30e8585510e9b4bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitModules (cyclomatic 20, cognitive 37): splitModules has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a925584935c296284bdfafaf04d19ac05b33d1736e589a35ff99bbffaf094e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processSourceMap (cyclomatic 20, cognitive 36): processSourceMap has cyclomatic complexity 20 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/extract-sourcemap-pairs.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ccca227cc49c72398d8c2ec6def35583cf0c5f8e68a7d2072c15790eccfd76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decompileSource (cyclomatic 20, cognitive 34): decompileSource has cyclomatic complexity 20 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"539aae669960a9cc4b0bf6b566b84b51444a25b4d4a50a97885449d1b1672873"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function factVerify (cyclomatic 20, cognitive 29): factVerify has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gemini-agents.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ae4496b303a98c38b206ca60ba115d94816c3414f2806b3d1504a0454e0ec7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 29): (anonymous) has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/fileRefs.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"922eb110771ee7e33a46d3bbb5117d1edab37f805426c2bee3adb19d270b73c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installDocker (cyclomatic 20, cognitive 23): installDocker has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d82b16da5c133ca323a49e52965f774991e4aed7449a528d32fb3cc2713dc80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateRelations (cyclomatic 20, cognitive 20): generateRelations has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gemini-agents.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f297041e2d836df4a0b0539e2c9089a09f2447d437b6dc59fe7da4e9a4e74b56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 19): (anonymous) has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"4066cc342924e5b2950410f4d09b625c93472da94f25e525bfd35dd2755c0e6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 20, cognitive 13): main has cyclomatic complexity 20 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm-cli/bin/ruvllm.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dddff6d283a2f150a5bf67329a8c23c150caa585ef7a1fb3dfe053537e911fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findHardNegatives (cyclomatic 19, cognitive 36): findHardNegatives has cyclomatic complexity 19 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/generate-ecosystem-triplets.js"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"51eede6ed1a2f5c1926e1c0c1da634de17d74459da754916bb22a97d2387725f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 32): (anonymous) has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":7180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5430b672526950f581de5e8c063d971cf441b1c23f6c35d3c50b48c40073e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 30): (anonymous) has cyclomatic complexity 19 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0ea4220a918d66dd153ef20ad8e2893a8521f7912ee7b4e357e8db1766a398"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertLegacyData (cyclomatic 19, cognitive 29): convertLegacyData has cyclomatic complexity 19 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cfe7bc35c8d4bef1c4fbc865ba49a58af7c26b3229cca6f5f53777b897c5ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function download (cyclomatic 19, cognitive 27): download has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/models.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d37dc2834dc630de891bea2ab3e6b06a96aeeb761b76ec4499053dae927c9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 19, cognitive 27): parseArgs has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/cli.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee49ca063814ff17dae036ed84835101dab92ddc49151f6db8192710ee0daa72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function determineScalingAction (cyclomatic 19, cognitive 26): determineScalingAction has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/reactive-scaler.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9236cda66269dec61a0ffd51e6a3fb129921cf011d7cb8f0ecdd2b061fae8c0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sessionEnd (cyclomatic 19, cognitive 25): sessionEnd has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4407}}}],"partialFingerprints":{"codehealthFindingId/v1":"852d7bca9622d8cb909accfb2bdd81e6b1a9a254326312553153ce14c6afc7a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rawSseHealthCheck (cyclomatic 19, cognitive 24): rawSseHealthCheck has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c02b63fa9c86acf257ced306bb89281f85faad18d7ec97919cf4b1b12dacff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function route (cyclomatic 19, cognitive 23): route has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4aa8724ba32de5239ef92c2cbd2a0f02c9f40bc0b761157878cd4804779dab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasBraceBalance (cyclomatic 19, cognitive 23): hasBraceBalance has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afc76c646934f7bc22b42ba00c793a60e0b51d4e0e007c2081f34fb7a41f4cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasBraceBalance (cyclomatic 19, cognitive 23): hasBraceBalance has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/module-splitter.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b1de60a4333f29f5066a4694c4da6fce42df62564a54f4ee84fe1129c0e453"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function archSelectRoute (cyclomatic 19, cognitive 20): archSelectRoute has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/arch.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fc539e37fda69b5617c412067c54466a8969fc4c0cd8015868b6991a2c3374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 19, cognitive 20): POST has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/transcribe/\u002Bserver.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91b0b3875587d1267f570f9e8dbd9e9690d4fdde88496f5018d6d65dc8e1e63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 19): main has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/rvf-builder.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e96c8e73dfba4910373f62f88a64a11715758c92837c6e366d32db12e80f66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 18): (anonymous) has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":7310}}}],"partialFingerprints":{"codehealthFindingId/v1":"843c788854e005ad10b64249b43701573d1a3d0fbd1154ed618c8b703d21d6ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 19, cognitive 18): GET has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/settings/\u002Bserver.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa97fd6e89d5dbe82c6f2ea5b65dd838284cc886dd52b56f1fc50c9105ac26e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 19, cognitive 18): POST has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/\u002Bserver.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd637e6a399f0a86654a267740e45ad042e6af28ec6344ae3a962792ed6dc38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 19, cognitive 17): constructor has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/stock-market/index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac6f992c010a0fdfea859f33b81ea59e44d5dab6456a08ec697eb829361fd58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeProvenance (cyclomatic 19, cognitive 17): sanitizeProvenance has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/embedding-provenance.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abcf311dfb9b8bfd0c03e643c0027741d94934bc87f496f7fab9f9ae689408a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createRuField (cyclomatic 19, cognitive 14): createRuField has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/client.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8532ab6a67833a53f38023615e680194922aef8e08ecae7f53b9e5ef17ac8cf3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findUser (cyclomatic 18, cognitive 42): findUser has cyclomatic complexity 18 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/auth.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad466f490e38dbc68d030c788981208e60d55c3016102b3d0341872430644a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 41): (anonymous) has cyclomatic complexity 18 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":8457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0970aa0bd87dfdb969893363fd4eb8341c91c43396935a1741ee44d936eb0879"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function backward (cyclomatic 18, cognitive 37): backward has cyclomatic complexity 18 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/adaptive-embedder.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49c1b088bdc190d906f073948f930aa7aafcbc876512bc97f9fc3219c453acb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 18, cognitive 34): parseArgs has cyclomatic complexity 18 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/cli.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c00d722fc414e772daab6859b5dcc1af1c3a249c1c60e6968479b93b0a7d5ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractParams (cyclomatic 18, cognitive 32): extractParams has cyclomatic complexity 18 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/SkillExecutor.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e2bd508c90687b6f2a5194915a4b584df28f9c706f9eba5379177e69c2d4a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 28): (anonymous) has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/index.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aaea202aee844357b5cd26d8381d7f8ee4e2cf0eb3ea22f7721605402c0d2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 25): (anonymous) has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":5466}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e152320cc25d2afab8c3616da7b54fffaedab07e80149d090d971486a8efb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 23): (anonymous) has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10654}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a44ba6c2baf1675e47b3323dd76a93268539e8d8ee4d6041e9335d7c32eff07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeSkill (cyclomatic 18, cognitive 21): executeSkill has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/SkillExecutor.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac66be769a1c4172b2b82e5ade0f17f4e6a93e7acb9030650271387c6cf5140b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAdd (cyclomatic 18, cognitive 20): runAdd has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/extras.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7be4483297646a3149cd05fa7cbf95071a951a5f85b55c07f792bd37da4694"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStatementBoundaryAfterBrace (cyclomatic 18, cognitive 20): isStatementBoundaryAfterBrace has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f10aa3bdb20e8e48451cd7cef4d4954e889032c327318fc12eab55202d896d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStatementBoundaryAfterBrace (cyclomatic 18, cognitive 20): isStatementBoundaryAfterBrace has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/module-splitter.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6153a3dc4aeeb3e1d5ea6100a1297b672a1925d02e56346ed4832f93c5a50d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSystem (cyclomatic 18, cognitive 19): checkSystem has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad412e9ea8a6a5df5a41f9f7c53f816d7cddab731c1cce3fc01d48ed5984f579"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRvliteQuery (cyclomatic 18, cognitive 19): runRvliteQuery has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1edbc4ae97fa5d89120e52dfd373511c864be0022a2206eec51ebf4836d19e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pollOnce (cyclomatic 18, cognitive 19): pollOnce has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/BackgroundGenerationPoller.svelte"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87fd9dd0c2a171da7e8c8f9605719e1bb264f80b0592613393057b4a3e6efdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotOptions (cyclomatic 18, cognitive 16): snapshotOptions has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/quantization.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8940ec58265c4cb2bcc43647fdd181dc2f8de2eebf48c98519409ce20784d04f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleRequest (cyclomatic 17, cognitive 31): handleRequest has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/server.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"374abc5f061e2423c9c3bdb46d51bdcbdde957fd40fc18a154a97b265aa3b881"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateMessages (cyclomatic 17, cognitive 29): generateMessages has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/populate.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faee8f78f4ed0fdb46793c7849c0b979aa3b3e4b9379d1bafce9d576f879c21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authenticateRequest (cyclomatic 17, cognitive 29): authenticateRequest has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/auth.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"db41bda3ede0e757ce92376915b970eeb3aecb12743ef1990eb345bd079332aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 25): (anonymous) has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":11101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6b8487398e30219198fcf4e28c937a884f66e793f1e010e39c6981f21b8b07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 23): (anonymous) has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9008}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25ae54fbf9d5714661eaa5979276f858811bbd75d3553839b6862d1e244f030"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function route (cyclomatic 17, cognitive 22): route has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd89b7dd291eb28b30424ee14d04724d9e5f9714101389f1888de0a22245644"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyLora (cyclomatic 17, cognitive 22): applyLora has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/federated.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d09fe72d76fb1dbdd9620519869cfcba085dff1f3c6e03cbc3d0d72515a7de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function backward (cyclomatic 17, cognitive 22): backward has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"79afe660e22769760bad5bcf52163797cb820da74484521aba9b57426ddf91ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34d2207a2d0fa238f8bf73675d629549666f081f2ee576eb55c8a57d9c54a17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOptimize (cyclomatic 17, cognitive 18): runOptimize has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/cli/optimize.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"dede4006d8c184aee66c686ddb98aedcef649e99bfcd29b1bf9eb515468be893"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c630a914740fc01d8f8dff413e550acf98457e3f6ae51c71dc2729e122a412ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 17, cognitive 15): constructor has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2232412d133f494f49469474fb51b49cb83ba8f26b30eee5eae5b2b309aef8fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 17, cognitive 15): constructor has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/swarm/index.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf676e2c1cafe635ed3268f6837bcce5e2edc6dde743a9db3c6dda5a491e91ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 17, cognitive 13): handler has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/worker.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"882b16de0c551fa10f569d7d42afbc8a24a0daf93eb56bb4ce5562161ddc17ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 13): main has cyclomatic complexity 17 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/cli/main.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a79f21b91641442731f75f1681242691735799397c7444d182f01c007759255"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function focusTextarea (cyclomatic 17, cognitive 12): focusTextarea has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatInput.svelte"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6528b8c096a7e07ad722821cac174dad4c2622e5d578c44d551f44b83f59e230"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateTriplets (cyclomatic 16, cognitive 57): generateTriplets has cyclomatic complexity 16 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/generate-ecosystem-triplets.js"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44c3ee179379ca4f5c8e3e7d2003299e548d6ac1c849e81746b518a90c83609"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createStreamingCompletion (cyclomatic 16, cognitive 28): createStreamingCompletion has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/openrouter-client.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d047a683595a912ae2962c04bcbf9e73a079c783e170a9d5ec9d9db63c10f35b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkDeploymentStatus (cyclomatic 16, cognitive 27): checkDeploymentStatus has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/deploy.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee571f622620fb743d6b52dd3cb846ae7905dae107cacf375e4827aea43581af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 16, cognitive 25): search has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/memory/MemoryManager.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"744b90edf42679fe3ff2d8fec7737769bfc214d91b66902f0caeb50e40cf8c7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDiff (cyclomatic 16, cognitive 25): parseDiff has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/diff-embeddings.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd653ec69c225040aa5bd0cc9735095877350c4cde0262f30f45a2b72fee5b55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 16, cognitive 25): parseArgs has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/scripts/fetch-models.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50a1d82392cae20c72283c3c4f74f788a4ad66a9df5d069c0fe15f7f6752c73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 24): (anonymous) has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71675a75ccd0e023b5920ae0b5ef12731bf17c293bd55911f777d06fadb28c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCircuitText (cyclomatic 16, cognitive 24): parseCircuitText has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/quantum-wrapper.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa509dd32d2b4c7d6441f840becaf80f1176a624187b852be2cc6514b7caacfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function domain (cyclomatic 16, cognitive 22): domain has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/clustering-validation.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb75c49cb2d4b3045aa445a0b3da1db2cb2063ad57238cb2b36ec30455245bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5c3f0c7eaffcc43f743048da8c4ac2b0bdeec769e76031a111aa3d0c6bfc2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/plugins.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c525cad0ba80e4706fe61395178feca6646ccf9244f6d6fe731208061be7e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function complete (cyclomatic 16, cognitive 20): complete has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/GoogleAIProvider.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd61314f76f957e5bec14bd46a88e6be23ca4561f238ba4beca92a6f50bedf27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calculateRiskScore (cyclomatic 16, cognitive 20): calculateRiskScore has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/diff-embeddings.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b8464a373688eead66b994b0d545a65a9ed0eb8dd8f6000f95a4da99247e7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 16, cognitive 19): check has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6909}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4dfb68f923e437f08f5d2be1d9a112ee693f2728859793fe27915f87c530b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 15): constructor has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/domain/session.test.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"510b49428796f7628e9174975f9490cb3dc1e065fb5d38793f86f5cdf48f4251"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateConfig (cyclomatic 16, cognitive 15): validateConfig has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/config.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d65e218b6b7fbf021ce20ebd4b1a4e0f2091e6aeb352d7b339c52641a1b1d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectModel (cyclomatic 16, cognitive 15): selectModel has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/binding.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0799c3c276b1fd2f002d4451b6cde5366f150f7e0fc82fbd829baaacc2e94984"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function learnFromOutcomes (cyclomatic 16, cognitive 15): learnFromOutcomes has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/finetune.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc47877efff6cf3fef178fd213c2eee1681d54e287b5b0147fa208030e49091"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 14): constructor has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/security/index.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a671daf24e118f27fce45d8608a4fb3b182a2059690179d61e527514c042de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 14): constructor has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/self-learning/index.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86b91d1f99535036f4c1b8e3f8046097d41a3af24028a81e4e4b04ba44ea519"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heuristicName (cyclomatic 16, cognitive 14): heuristicName has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/name-predictor.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40d9def13cbe58dfb059e5ba7a9af84f1956dde9e785c2b0e4629c147f92a24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveStorePath (cyclomatic 16, cognitive 14): resolveStorePath has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/stores.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3917ffbd5f3ce5ca45849419d309e158d580ffc208c4eca669a43e8aa03a13f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyInclusion (cyclomatic 16, cognitive 14): verifyInclusion has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/merkle.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a50519401f060a04b055694b7fb10416c16f2a4a6b226c487b47601803155c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 16, cognitive 14): save has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/registry.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67d1f4b7bfec0af8eb41b850e36d5f2d8678c06e500ecaa12f950b0cc6c2cdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkedCodebook (cyclomatic 16, cognitive 13): checkedCodebook has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/cloudflare/validation.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feb5e7d2240753e6a46ca0ad364de085e460aeb5ef7bcf975f4e2a0e217f3f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOpenAiToolsForMcp (cyclomatic 15, cognitive 37): getOpenAiToolsForMcp has cyclomatic complexity 15 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/tools.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"864a5166193ba4e78405d33de68db1bbbf28db63d7298133f25df5e6045ece05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 15, cognitive 34): onmessage has cyclomatic complexity 15 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/workers/autopilotWorker.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b423c7396ea262e6f4b288084eda48780af2b1217f8f92624bb678065ca580ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stream (cyclomatic 15, cognitive 30): stream has cyclomatic complexity 15 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/GoogleAIProvider.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ed66c2d170cab12932be295180bd5057eddeb71f9c94cbf162731f1d4f86cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insert (cyclomatic 15, cognitive 29): insert has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/adapters/ruvector.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6157b2eae07cb6425fe0361c12c4c44e31e6b459461edc68340a75fae33568"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeRuvectorHooks (cyclomatic 15, cognitive 21): mergeRuvectorHooks has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":4540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa3b0a0be3cc284cd3e401f8ac2f0344b403597a5b08749787e4b01b60e1fd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isInsideStringOrComment (cyclomatic 15, cognitive 21): isInsideStringOrComment has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/reference-tracker.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7bb9e64c604abd6d788fbe297602ffa789571ca7757a6243090dc01c99e000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 15, cognitive 21): GET has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/fetch-url/\u002Bserver.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca65a47eb1fedecab5b674ddf3d6d46c3d4287807cf33753511a2edccf880ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateContrastivePairs (cyclomatic 15, cognitive 20): generateContrastivePairs has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-code-synth.js"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ed0afc9184965714da8de2fa6ee81cae0f6c956046e7bb99d45f58568d5b2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function researchDirector (cyclomatic 15, cognitive 20): researchDirector has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gemini-agents.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcd3969253ba47840481ac6cd09f3abd2ea6a39f61e8b07a8f13a2557dc250b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nearest (cyclomatic 15, cognitive 19): nearest has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/registry.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01b2631c44e547898fb7fc5f9486fe25b1c08d50c77951031a1f49b1f177563"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6283}}}],"partialFingerprints":{"codehealthFindingId/v1":"228552ace6d7f29c3fed3853c78059ddb305143a8bb12bdab696dca759e84009"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateJSDoc (cyclomatic 15, cognitive 16): generateJSDoc has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d4e0b69da781909bac474cc8a8f5c2ffbe93f5cd693f7dfd19c0f2959b973a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createRvfFromFiles (cyclomatic 15, cognitive 15): createRvfFromFiles has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rebuild-all-versions.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e73183d6667587cd63637de12580570286426b93fb23fd7eaafb93b5334bcee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 15, cognitive 15): GET has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/billing-orgs/\u002Bserver.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f5ecabf8976379ba827393fc4488d480aa3dbc25bba50798ba208f6ae92cea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromEnv (cyclomatic 15, cognitive 14): fromEnv has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/BotConfig.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a277b295eb27190763fae64587ee4814b224360218c794a43fa6814c4dc6e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectImageType (cyclomatic 15, cognitive 14): detectImageType has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/scipix/src/client.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c079efb29ce291f277dfc3fc6266559a679277f48df4718495926f85100e81f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCodebook (cyclomatic 15, cognitive 12): loadCodebook has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/cloudflare/storage.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"429c9cc20eabee0daaf30dae3f8627ea3f0cd225353876bd6d1f68155a869f6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"780bf4d349c632bdfbb1c81eaed3b0a3b31fff9ea67af0add79646331860e37a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 14, cognitive 28): create has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/backend.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a6bdb38ba260266fb066185fa894d00640a77347da643d02897f998a23700b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function smoothStreamUpdates (cyclomatic 14, cognitive 26): smoothStreamUpdates has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/messageUpdates.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2f16b969fa67cdda7152ec5a0496b9748391521c90c644f982ff60b225f93b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkAndRunMigrations (cyclomatic 14, cognitive 24): checkAndRunMigrations has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/migrations.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e67307b6859f00766d7bd534ef7af93693c70c93eccf451ba6e35f8cf95bdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRouterTarget (cyclomatic 14, cognitive 24): resolveRouterTarget has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/routerResolution.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8198a95d932e1c3bd38ef19023e0d045069bda7aae5d31ecc249646ee110783d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireIntelLock (cyclomatic 14, cognitive 23): acquireIntelLock has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3468}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f0cbfde792038a262f16889ee275603a34de2261ca02eb38a8c3cc7a2b0367"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseClass (cyclomatic 14, cognitive 23): parseClass has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee38221f9326d73fc26d6ae20d5e9a38be6ef1d1a77ba3014acd0dc9f124e80c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamAttention (cyclomatic 14, cognitive 21): streamAttention has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/index.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81042c4da5f0ba0f44a2b39afc4ceb4df6816a95ae330add57ef983da59f837"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 14, cognitive 20): open has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/registry.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeabcc64b7e84e64cfe7dd6ef595f7bc92cfa6d7b489adac00231aed34b76f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reembedAll (cyclomatic 14, cognitive 19): reembedAll has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"a748bf2ad0a9a15a32c2e9ebf8c7e2a24239d794a3e8ddb9b1caa58114f7c14b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseImport (cyclomatic 14, cognitive 19): parseImport has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"558c4b141215df9f4609ff80b823201b4f5217802272452854a56b95627f33b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function macroF1 (cyclomatic 14, cognitive 19): macroF1 has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/metrics.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"78173fa8381accdd24fc1b3712d7263afcf716cffe6d4b0cb086b9d32821d286"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractIdentifiers (cyclomatic 14, cognitive 19): extractIdentifiers has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/generate-data-v2.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fb90db8f9929a46dd676d443de554b710a08083eda1aee9489f7de2ebcf304"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateUser (cyclomatic 14, cognitive 19): updateUser has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/callback/updateUser.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c108797274d89763209cf0f7ae811a7b3e755753c558fa0df91be08cd83126"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function calculateQuality (cyclomatic 14, cognitive 18): calculateQuality has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9e97f3534d9e7a07b23d36c5ca66b84cbe1d24920152d8249cea6120cde3d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/security.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a538bc7ec62431c568247c0aa27b1d6c88b42934ed284bd999e54c8907fdf07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function conversationSummaryExecutor (cyclomatic 14, cognitive 18): conversationSummaryExecutor has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/SummarizeSkill.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3692d2e15a5a6bd2596a98248714289d7c4d43383848415d77531df292fc0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function predictName (cyclomatic 14, cognitive 18): predictName has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/name-predictor.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9bb461123c11950882f23d5491a2ee57d8df9144423b1689a1a2592a3cab1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collect (cyclomatic 14, cognitive 18): collect has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/adr-index.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd1608e23bc75f068cd5e315c52bfcbc872cb62639757be11ad54d01dc68cde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function crossDomainExplore (cyclomatic 14, cognitive 18): crossDomainExplore has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gemini-agents.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5c95d3f16085b88d785c169410b7ac0a15a02f214ebe86c0d400239173b8af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createMessagesPath (cyclomatic 14, cognitive 18): createMessagesPath has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"839f78e5b702016cd04aba9e73f5df45ec76a191e2a183334b06283e703613e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printHuman (cyclomatic 14, cognitive 17): printHuman has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/weights.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b16396db6ac855b8ec41b73854d2e0d2d6083f0bc0ac2bc20b898d22e8bcd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFunction (cyclomatic 14, cognitive 17): parseFunction has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b07fb51034b282500207797ee6971eb7863f33ab45a8e7489fe92d5f65ba6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateModelWithJson (cyclomatic 14, cognitive 17): validateModelWithJson has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/model.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"500d5fa31e7ad2e1607c428f3705acb35f97c337fdf6640ee6d8d4b007391521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertMessageUpdate (cyclomatic 14, cognitive 17): convertMessageUpdate has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/04-update-message-updates.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"943e9e386832c048d16e6dc7902fb9d454f3ca7dd06a92d69280f7c21533dfbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 14, cognitive 17): GET has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/callback/\u002Bserver.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4030ddab3a27c9898ad76823ad8d609b6e44de22b58503f4b0c87fb41e869bce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16890dabb4b803349b60b28071f74d82511dd0226c8363528b926b68f3e620a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6787}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ce98fb327381e6b08fcf793a6881934b3c188fca0e2886555ef2e821943c55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 15): (anonymous) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/bin/cli.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe7a6b7abde92743bd83f429b3c4869219735399321636829e2a9ee2215b6e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStats (cyclomatic 14, cognitive 15): getStats has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"737236c8b97e6964fe447a0301bc93bf233dd54527164018909d07c3e57697e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function literalToNative (cyclomatic 14, cognitive 15): literalToNative has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/metadata-fields.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2086738febd91eaff4764f6b95116bc4aa61159583836334c4465affefa4040b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":5255}}}],"partialFingerprints":{"codehealthFindingId/v1":"442526eceb8dcd4c3577a19dbfea083b195526311b40c879c00997cad13e7cf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9926f6c3540b8dd8e4402fb98a8bc59143547acde067d953669ab99032942762"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertEmbeddingSpaceIdentity (cyclomatic 14, cognitive 14): assertEmbeddingSpaceIdentity has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/embedding-provenance.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"230ceca7713b9071e0ee7d264d3406158162a50176947b9b3f1c7c6a3ac3e6ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runServe (cyclomatic 14, cognitive 13): runServe has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/serve.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e147bb6b2fe5ebb0fae499222baf8d570ef5976a4679502bb922ee99bc54c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 13): main has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gemini-agents.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a205a87dda4a4bb7a16893a4413e2df0a8c9303af8e7e9fecf85ad980d2e4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":7453}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad8fa0ed6a98d9f0805156e2b257dd4c03c96a8751ebccd4db81681d7547389"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 14, cognitive 11): evaluate has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/metaharness.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabfed748d39dd20ba2dd29a2efe1ded4ef8e4c3f7b75b44cff52419f395f1c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 14, cognitive 9): create has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/client.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5650aea5112d6a12ba717f6a6d35bca1236cda53aeab6808c6bc3c48a50f1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyStatement (cyclomatic 13, cognitive 38): classifyStatement has cyclomatic complexity 13 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"45efac7b3b50fb0f7559f5038c93dc712002741caad3eee6b782e4377d2a6041"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectSkills (cyclomatic 13, cognitive 31): detectSkills has cyclomatic complexity 13 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/SkillExecutor.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"106872e7915ac2c3c88bb14e578a9005fc9e575c4d0f92b5b02d6f3d6cba59bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update (cyclomatic 13, cognitive 31): update has cyclomatic complexity 13 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/spiking-neural/src/index.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"087b41564a073cb45fdadda3fcc19423e0d9c77fdb0374e35df58c2ee742890a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 26): (anonymous) has cyclomatic complexity 13 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10728}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c7444ab0009ccffad8b4fc86b4316d8e04891e7bec2acc5480cb565429056a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 13, cognitive 23): onmessage has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/workers/detailFetchWorker.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5578a9c957b5f8fe6d7b6515b6ec672b03609a4495f160bcd3f81de83d00fcc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildImportGraph (cyclomatic 13, cognitive 22): buildImportGraph has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6060}}}],"partialFingerprints":{"codehealthFindingId/v1":"8002496c5f7908eed807610b7cdb6fb666c0158950fdb48afaa4eb949a5d76c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainWithOptimization (cyclomatic 13, cognitive 21): trainWithOptimization has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6eebc707a5f9ac677c17fb6414d61f644483147f4c883514d9d601cba8785c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportToGEXF (cyclomatic 13, cognitive 21): exportToGEXF has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed647d3f35864fc0f837672746be7411b73ff27eb0d04135af21840273b0bebb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 20): (anonymous) has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":8889}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ba4a8845d9d12b7e76a80dedb1f8abb450d434aa075ca33aadb07509e656db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replayJournalFile (cyclomatic 13, cognitive 20): replayJournalFile has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/backend.ts"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4166891f443affe433e0fdef6dbcae00775844af0c7fbbdb93bf51d0abdb4a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processChange (cyclomatic 13, cognitive 19): processChange has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":7016}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6ce57e6002716ffad54620d2a8eea3835ae190f6f09b3bb144214922c84b8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 13, cognitive 19): walk has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/frozen-weights-check.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a50849fbfa497093809c7660cef3ca3d6f8518d3f5e38540c6fd0c65a99bf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushToDisk (cyclomatic 13, cognitive 19): flushToDisk has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db357d92cad631e0cef1009d7135a8ce0d08b31d600ff18269161c80c766412"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6711}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7ee0268b65307fffec9e3a4a9be3c8780f5078a9957cbd062ced83a248da32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTrainContrastive (cyclomatic 13, cognitive 18): runTrainContrastive has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"075dbc7402c00b4e380119fa71ec3db57f6d42572206a3c89789e45496d65eb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractUpstreamError (cyclomatic 13, cognitive 18): extractUpstreamError has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/endpoint.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f0b2320277a6585eda3985918228366885e39dcc15a25a37cdc984a062d5b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bbf0d3e273da8449b6e886ed0b690497651898ef13cd8416765f33cb577aeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stream (cyclomatic 13, cognitive 17): stream has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f6cbb245239bee96a2a532cfb1bb9b4c8e28aa6ee46ffaf81f21f7ea584aea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateGraph (cyclomatic 13, cognitive 17): validateGraph has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c828337bdb80f9045a9e6dad9f843d374a1a8d0ed77477eb31588394bc1e8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchWithCache (cyclomatic 13, cognitive 17): fetchWithCache has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/pkg/loader.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13e899833662f3338e2197dfb5c5247233a05b7cfead11086a40cec064bba95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchVectors (cyclomatic 13, cognitive 17): searchVectors has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"403c105c9e88fd21264ba5c8485aaa32734842bb4b83d65ca066cba995704e15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 17): main has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rebuild-all-versions.mjs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fbca7e32d461e3ae8ee5d3287cd43e303dab720b09216436d583993b64a974"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 16): constructor has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b949dce3d63edbb7677994fad415c3cad3a563af88ae19ccd844231dc4ceffbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBestAction (cyclomatic 13, cognitive 16): getBestAction has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/learning-engine.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a07b9f3a9e127462fe32a9c3fff029e5755916f2a7850a11980764d7d3aa153"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyLocator (cyclomatic 13, cognitive 16): verifyLocator has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/package-modes.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31127ce94d0a3ded2266597f704ca44abc08e9f267c5ac293d0d2add58558df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildReconstructionPrior (cyclomatic 13, cognitive 16): buildReconstructionPrior has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/src/fusion/priorBuilder.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbe3fb8b6e198830f4adf69ab13f32eec95685b4bce91cb23f5e227731315e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b79f596c689291fd94ff183fdb4d5b3bae83df860a5a619effa9a32357ec02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferGroupName (cyclomatic 13, cognitive 15): inferGroupName has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-tree.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2447b99d5b065adb984073ce1afd88a939300e32a9465668df7220de82a091"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 15): main has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/generate-ecosystem-triplets.js"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c03cdc69c93b68576062ded69576ceff176b400ee682ca0e90a6a3a1b221eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyCommand (cyclomatic 13, cognitive 14): classifyCommand has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e719daf8fa49d76f359bdc3080c692241a356ea755fa555c5403958b2482da22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c92b3dc3a0c7cbee12af281f9638d042caa9be03e1a611f32bf8299a7ef024f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PATCH (cyclomatic 13, cognitive 14): PATCH has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/conversations/[id]/\u002Bserver.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ea30b5bfdb8c9329e7ec7f80aed9deed4b3586c61eb6a89fe2ec2a6c8095e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":6376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cd03326c9fa4f44b0b9af346a6acc23af8d2e901ff39abb3cdd4abf5f9aefa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateVector (cyclomatic 13, cognitive 13): validateVector has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/record-validate.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a47eeb8f88c00e89b361b975d9f0bf4daf9981dcf52908aa5ff8ee876f81553"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 13, cognitive 12): (top-level) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/scripts/evolve-openrouter.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d02ca76465ffae4a65eb6a368c6faa39b9e5319873fb07497ad68aaa5ff2553"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyChange (cyclomatic 13, cognitive 12): classifyChange has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/diff-embeddings.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd10de4644767b6ee1fd29456a489583a5f371a8f42050499ccc20b58310378c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 13, cognitive 12): build has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/rabitq-wrapper.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c34f6f4fca65e68db16c245cdcaa0498f92faf167cd787b324cfdd97ce4e4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitCommaExpression (cyclomatic 13, cognitive 12): splitCommaExpression has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1319f6952e4d685d1468e47831dc2c683b04300a843b4da968266b37dde2153"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProject (cyclomatic 13, cognitive 12): validateProject has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/project.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab09dde916986e196fbbc4240adb4c07fa387f03c36f5224f8adfe0891ce9e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tuneClustering (cyclomatic 13, cognitive 11): tuneClustering has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/metaharness.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8ac09dc67d40f304b41591b189c73a7e0708232196ca70f1dad0e04e170f5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #call (cyclomatic 13, cognitive 11): #call has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/client.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93a2954f1431787eb1d311d28cd053a919834651f508133bb63b4c1a93883a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHarnessSurface (cyclomatic 13, cognitive 11): buildHarnessSurface has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":11229}}}],"partialFingerprints":{"codehealthFindingId/v1":"245e640a22c886101454331b2be7784f4e0071d6336f1494f53ca0813a01dfff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeModel (cyclomatic 13, cognitive 11): probeModel has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"79085a319eb76b96c5422c5938da2b19a2718c286e29fbd9eacfa5bdb4cfbabd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferReturnType (cyclomatic 13, cognitive 11): inferReturnType has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"52073e718f39ec2dcb64c647ab5d8cde951f6531933b55041767bb8115484e2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildModuleTree (cyclomatic 12, cognitive 26): buildModuleTree has cyclomatic complexity 12 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-tree.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6475921f59f9c8d5de7f3f3fa199b40344c2e251a4935187440790977771ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function train (cyclomatic 12, cognitive 25): train has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/training.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ea18014858f388fd9be2a510a2509ebad2196166c91a44ae92f2ed4b45b9c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractGroundTruthFixtures (cyclomatic 12, cognitive 24): extractGroundTruthFixtures has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/generate-deobfuscation-data.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d783f583fe8a08635066f53acda127abda839189a3b4bab610be549041fcb2bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSIMDBenchmark (cyclomatic 12, cognitive 22): runSIMDBenchmark has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/spiking-neural/bin/cli.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b725d7111662c820ddd1ee5e0c50030199a1d0f5401b69ae3569f2154387f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkLLMProviders (cyclomatic 12, cognitive 21): checkLLMProviders has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c637a9e25a587f977682b948124f2736e36a5ce5857df67540ee4a759da3d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeStreamRequest (cyclomatic 12, cognitive 21): makeStreamRequest has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4091d71e6ad226b80d9688c5115eb03af6ec3d90c04f27e2a078e04450fd9a5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fuseResults (cyclomatic 12, cognitive 20): fuseResults has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/search/HybridSearch.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1595f4199756309033ff6828cf317287917bd65b77ec4011aadea0abcf09cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateMemory (cyclomatic 12, cognitive 19): updateMemory has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3981}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d24122a68ad6efa8462d7065c5757dbc1d1628518c1f8d91a345bc0caf1537"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function embedBatchAsync (cyclomatic 12, cognitive 19): embedBatchAsync has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d700f293c84ab91e240765b2252cf543c0d43305b4f5d26cb3f7fec35fa353c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGraphFromEntries (cyclomatic 12, cognitive 18): buildGraphFromEntries has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0609c66f15fe3c61751fc59c54233f5d34a54d247fb488b73867bcc230257733"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportToGraphML (cyclomatic 12, cognitive 18): exportToGraphML has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"689da4be894b9c55bd18432c83be208afeb4f30d52baa73491177fde2ecf0fdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 18): (anonymous) has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":5902}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d626ff57e6f9965514986a66f6e06a60817508f8b7f4dfbadafc70c071b33e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 18): main has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/module-splitter.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1194fbae1011f825287926e660861c4e4bbc86738b7db9dc16ce80f0daa03a2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 18): (anonymous) has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f308cf6da64da5b3f4c019dac20a424c006f83322c66463181e5f8be833c0585"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 18): (anonymous) has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c02df9a22e477e4ce5be3f36d4ecad49fff950a87743cc090d638505489a05d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 12, cognitive 17): search has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/store.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b197adf17d29adbcb4a5029a4e0f6fde9bdfbd05c03fc0eb48f260eef6a23f95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractJsonArray (cyclomatic 12, cognitive 16): extractJsonArray has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7971bdaadad0dfd1fe2ea92998fefe7eaf8f58cec50e3779165d6d287d1a3f85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addIntentAsync (cyclomatic 12, cognitive 16): addIntentAsync has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/router/index.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f90d8515f7fef19a52f1978bfb35b76fe831643a46591d1182a8e5c9b97469e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateDiff (cyclomatic 12, cognitive 16): generateDiff has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12022e838dda8b904510052014e80103abba2465fbc48f039c69a3fc825a8a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeWithRegex (cyclomatic 12, cognitive 16): analyzeWithRegex has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce4babf99d92f2bde2e237993ea6c759378ade32968c10853368c58f2d67947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateToolCall (cyclomatic 12, cognitive 16): validateToolCall has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/optimizer/tool-schemas.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b4528ad5f8cd0799ec29542f768d7f91e549e6dfe0d735735007b7dcffac0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCheckpoint (cyclomatic 12, cognitive 16): loadCheckpoint has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/training.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"442fa19020ffbc012aa6649e03073908c6c4d80c79ac11f098a4bffad3aa4e8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 12, cognitive 16): walk has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/adr-index.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a7782db0459b65ed2b45135a2b720556c8c185f55e24a29ecbb96914b1a83d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":5338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6e50686fe0fccdffed05a02cf2d608d461d5c3246184444e2575b513ceadcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconstructCode (cyclomatic 12, cognitive 15): reconstructCode has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/reconstructor.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"493a68ed89fd1abed145f9976177711d35f442326e98bcb6e05404969b56ea9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addJSDocComments (cyclomatic 12, cognitive 15): addJSDocComments has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/reconstructor.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e377493cffb88acc29f0a82e1afea2c3657b9553344a0545a527830a6579e19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 12, cognitive 15): handle has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/serve.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d54dc0339382efec89b31afa718e700f41e660fc073f723c2d27d1347033a56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runEval (cyclomatic 12, cognitive 15): runEval has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/cli/eval.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ba713ae4c2a67b2e0326d2fd66f4a1e051403f7a9a6edfaff1ea9e20c95b1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shiftedDice (cyclomatic 12, cognitive 15): shiftedDice has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/src/calibration/sliceRegistration.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f05d11505f4101b01066bbc0a44216f70c67bdaf4428750aafc53d7a68a4b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/security.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4d8c7b38126da932b8c585389af5c1983fd72c895653733e18c35f4432c25e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkNative (cyclomatic 12, cognitive 14): checkNative has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/scripts/check-security.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43d2762e138a210c0286531fd957982ec3e85977d98b25577b48ce3c68919a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRvf (cyclomatic 12, cognitive 14): buildRvf has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/rebuild-all-versions.mjs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ce21059c22b01d20d215d88371ba63934c8e95c4928e68dbf37f6efb5b7561"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectJsFiles (cyclomatic 12, cognitive 14): collectJsFiles has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/generate-data-v2.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92597997dbf21ddac565290727bbd0d781520c723a251d7d7bbd2778f5e7e82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderOffer (cyclomatic 12, cognitive 13): renderOffer has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/main.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1431aec7857f38ba3be55c4ac193c82a9f7b746e6cc3cbcc37f1c1a359ff66c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyze (cyclomatic 12, cognitive 13): analyze has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/security/AIDefenceGuard.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ee05d10f29b396265cfb40c1ef346e4a81cd6149dd1b61115f6d3acb0f4bd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyWitnessChain (cyclomatic 12, cognitive 13): verifyWitnessChain has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/witness.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d00a4dc0691012dac1e2bbab0c44500da04e4cc9a239fa8aaff0e4b5ac5c7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProperty (cyclomatic 12, cognitive 12): validateProperty has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/domain/skill.test.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3689948f51ade76cae55f19956fcad1224866917f4d3b45ab0a6e91e87844016"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkFunctionalEquivalence (cyclomatic 12, cognitive 12): checkFunctionalEquivalence has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/validator.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fcc797eaf70ae67e019410c457cdc2f9a5f74da6af2af0999ef09970208545"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 12): main has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/real-model-compare.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1dfc31e993db9d492636731c8dce98cf13172770198801d71dd8bb5b5a6507"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runVerify (cyclomatic 12, cognitive 12): runVerify has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/verify.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f05230f3384e10d933dbb1f725c2bdb263a480c3209a23b6fe4af93c994b53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkOptions (cyclomatic 12, cognitive 11): checkOptions has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/clustering-validation.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2aadcad0b0050222c5c1f266156e057a49a0b7ffddde2f2f2eb42346d7e09f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOptimize (cyclomatic 12, cognitive 11): runOptimize has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/commands.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1731cb279f18d2103079503d553091acbf9f604d6e74de77ade5fd477f88b4a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10564}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7cf0aaa43ba84833f3ccbbb9dd3b99db65be6dd3e7d608c730f30d0e665cf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function num (cyclomatic 12, cognitive 11): num has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/weights-edit.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a786b3db5a4e0b21601e381f6c5c85fa05a7b12e34dbe28a2f2d9c904df57a34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function minCutFast (cyclomatic 12, cognitive 11): minCutFast has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/mincut-wasm-wrapper.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9757dd6dcd8d122b3bb495184475c6f6d5a57bea0e5d1cc790e36da38c286a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encode (cyclomatic 12, cognitive 11): encode has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa89903f560e46365df13a7672622e3af68bccfbe29755caca8e91cf9fb5b3e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd4ebf17e45e44871f6e3e0e068a727d4e9d2ffcaf905b9f4802cd36e949ee4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selfTest (cyclomatic 12, cognitive 11): selfTest has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/frozen-weights-check.mjs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2de0f375fc50abe40545cf6aa22bc8554752705b3cbce5b7387aafccbdb642"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function store (cyclomatic 12, cognitive 10): store has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/memory/MemoryManager.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b30e2fa27ce5dde03780fc524d67b781f94622b4efabab54af02d72f6613d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initializeBot (cyclomatic 12, cognitive 10): initializeBot has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/server.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1932f52eb58569ea80f88c2650df82dffd8ebe340221228715112b591d2ad90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10885}}}],"partialFingerprints":{"codehealthFindingId/v1":"3955c128097a4227beaa799aaca0d11c90e468642ab3c2c2891a3310d130b8a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createClusteringWorker (cyclomatic 12, cognitive 9): createClusteringWorker has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/integrations/cloudflare.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c7bd177eab97dbacb1b0b0cfc94fc1b49b8915ec1acdcbe3d24f8f354fa8ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/server.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a3996dab87b7d87269c5967d702ddfb54ff58125a88cde6a7f31a4aa3e5454"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 12, cognitive 9): parse has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/metadata-fields.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dc84f12642f0644a486bbcd292ff06cf958ca32cfb4628dd312d646997a2f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateInput (cyclomatic 11, cognitive 27): validateInput has cyclomatic complexity 11 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tests/unit/domain/skill.test.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5914a9b59a3c89006918c4ad2c5be0dac30a924b416442115eaab433733cee3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 25): (anonymous) has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/security.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec11d5670a3dfd632757d7f5fdbf75f992784598e89cc9560632310b1b1c103"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 24): (anonymous) has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":7087}}}],"partialFingerprints":{"codehealthFindingId/v1":"0181a7a6d965521c303e0c3145ead7265b504d1c2b558c5e35437a5ca6835372"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateStream (cyclomatic 11, cognitive 23): generateStream has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5891e4321602510f125c173f8f69b4f72834951bab12f295591057f72d7115f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forward (cyclomatic 11, cognitive 22): forward has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd172bdf5b80ae95df38bf455a3710eb2611aa1b5534ba6535a5a46e840b6fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replayJournal (cyclomatic 11, cognitive 22): replayJournal has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/idmap-journal.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0422745c587a4d4419d7063a60bf45b96a3d5775f8fcb22181412d8ec6b68d77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 11, cognitive 21): save has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3726}}}],"partialFingerprints":{"codehealthFindingId/v1":"38579cb0bfc8ef5c323c9764826fc4545389e4035955c8abd810dc85df8a8a84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getClient (cyclomatic 11, cognitive 21): getClient has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/clientPool.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b7f3408d9475331c2d0357367996216d7679b208a0c8bbc47e6f77de9248bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportToNeo4j (cyclomatic 11, cognitive 19): exportToNeo4j has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2b18d9b2d7ac7a887d9c9a620779e9828dc7d60c32a0e6aef4699d0071c619"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchWithRetry (cyclomatic 11, cognitive 18): fetchWithRetry has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/index.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccab83de2bf4adf95178cd8f63a231cfd8fd52946671671ea063bb069b2d77cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processMessage (cyclomatic 11, cognitive 18): processMessage has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/ChatEnhancer.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"95db69a4c183bcf6e006f79199e98cc85e8f78cd43abee692b2ac392672c248b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 11, cognitive 18): search has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/search/BM25Index.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cd1fb9e181c8829ca602ee054d001ed1e1e0eef4c92c03c2584bec658daa95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function demoPatternRecognition (cyclomatic 11, cognitive 18): demoPatternRecognition has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/spiking-neural/bin/cli.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea002900b7eaf6b75642b2f5de7edcaf6eaaf92ed71f7ef3c9e6969375d76ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 18): main has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-package-banners.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e24c06c6cbe11a70eb0230953635c689a1beb4d46b68c5a2bcd4dc8c7c48ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFromNodeModules (cyclomatic 11, cognitive 18): extractFromNodeModules has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/generate-data-v2.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e13e0698a908dab80d3e8b136b24d609a24fec2ec02d518e2e3f6e1d4e3a63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9624aebaa4ff56a4ce117fe647b63cc77897e0c37753e74c38b16af76c1a30fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":2753}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9e95a63430510f59f5b8d9a5999ad9d031d85b83fc6d8dce00190b4e8a4b4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandCommaExprs (cyclomatic 11, cognitive 16): expandCommaExprs has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4b7659033345ce26140f4173d3f3ab682a8cd973b4db5259c55c9f8146a154"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeAdapters (cyclomatic 11, cognitive 16): mergeAdapters has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6537ce10621a180a19e37bd1e76e1f00ecf29a09f976ebc0783945e4ee2f19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apiCall (cyclomatic 11, cognitive 16): apiCall has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/APIClient.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba29270831e7c68beba8290027a77fb310da813f11d160d65d082eeab22eaa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findArrayEnd (cyclomatic 11, cognitive 15): findArrayEnd has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f0bf839ab7567b0f19c0a8ac617d98c5afd723902297c76f4197f00955cac4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"70738626c340315a40b27169bb06938313219bd9bf36fdcc11361543d2791fe9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function patternTensors (cyclomatic 11, cognitive 15): patternTensors has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e2320ba2dadef16cceb4479934f3543fcbad9b03c65593e63bc4b3613831fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReconstruction (cyclomatic 11, cognitive 15): validateReconstruction has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/validator.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afa9cc413ad42f63fde56cfb6d54f21c24a2beaa98cf24af1b1bedfff845edb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runModelsDownload (cyclomatic 11, cognitive 15): runModelsDownload has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5e393c612663839cf714a622073593416ea4e131913bbb9aa77cb714348b44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":9630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a3c903bbba9b3a47b6b2ec4facf0056ecf09c5df6d5bffd856bbcca9404e35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 11, cognitive 14): validate has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/validate-ecosystem.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6929e3c3af00858fbe4cc32a9b9bcc0d43aac482691c98f48205cb39e944bee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encode (cyclomatic 11, cognitive 14): encode has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/hash.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"40261e0cc623eded75d250d4c60113e46ff941c32de2a4df7d8e2c43fec095fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 14): main has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/run-all-tests.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac3a1f8ce7883c519e2b055aff32a34950074ac26c313c7efa582fb51f0a8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFileRefResolver (cyclomatic 11, cognitive 14): buildFileRefResolver has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/fileRefs.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cd29b16e16f49e0a5dd944d38dd3c5a6021b2452d6a928d04c5a33f7220e9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 11, cognitive 13): install has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"783560fb1b390732a9086a90152d231307b73108b1d2d8ede8037e52a3d42a47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertLegacyData (cyclomatic 11, cognitive 13): convertLegacyData has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdd04268459f052db1253c70434b43dd42901e76560b0d8fb10736e60eb4110"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkMetadataNode (cyclomatic 11, cognitive 13): checkMetadataNode has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/record-validate.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6164a444f94e8fe0afb15e1933875fe828ef8961f0af48e721ec1838fdb298db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMcpTool (cyclomatic 11, cognitive 13): runMcpTool has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/weights.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb49b313971068c1492e4bf715d1573c399c9d817479a83fabe5caef01ca559f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runStats (cyclomatic 11, cognitive 13): runStats has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/cli.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccda47497f338944559e54bdd6b3ba94b1e2637a5e3f3520d3c377534b36d667"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeMappings (cyclomatic 11, cognitive 13): decodeMappings has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/extract-sourcemap-pairs.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d805c9444aa659d06d82fb3ca0073c0b4b56a78bd22c4984fa2aeae24c15f0fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringifyError (cyclomatic 11, cognitive 13): stringifyError has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/stringifyError.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51912dee082551dd68dec43ab542b9098ddc241d66fb0328d065fd92386b942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b764f2d39bf7adaee817f1002832e5298cbf3454ed25d78da9e2f9bb0b16e100"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":10843}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da6a6deb83369517bdaa77ef838071986bbdbbdfb7504548eac987d169f362e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function route (cyclomatic 11, cognitive 12): route has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46164d1a4eb00b2bc81b5464a37192a78b2cb0b4451a2642bda51c0cd6c1a51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generationConfig (cyclomatic 11, cognitive 12): generationConfig has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/bin/serve.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"88680a185cf2f342a795fee127a737b104a6a827571bdb04b096d735aaebcaa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkXml (cyclomatic 11, cognitive 12): checkXml has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gen-package-banners.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9185498dc478813f2e80b4836befef44a018280a364ec77da0e8d049f4291891"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/plugins.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af51ad1d5d6e25ed35ad4f3200426ea616cf0acccb443ccffd1531f943b8db0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queryAtTimestamp (cyclomatic 11, cognitive 11): queryAtTimestamp has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"c844c58119dbc1a9578829fccf57bc354c24a977e4e20f47f2e3907d8a80153c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listMemories (cyclomatic 11, cognitive 11): listMemories has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/memory-store.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"be19c2d7b62af8b07b22acf75b3e16f322976b5bc0f8cbddf4f68a4f12621e78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectQuantization (cyclomatic 11, cognitive 11): detectQuantization has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/model-decompiler.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e218f1f8704a2682b74ed5405a7280228e3135775e59add2973866d528d5aa8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runInit (cyclomatic 11, cognitive 11): runInit has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/config.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fac9482ac10d38e6595ef1869a1fdd16370cfc3a7c79499103f81962517b528"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/images.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"851508f7e3c1252015ca8718b032464c7246807643be648b2a09679e1f1d66c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializeMediaNode (cyclomatic 11, cognitive 11): serializeMediaNode has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7faeac95c4a60351feae5993f5dfb62a2cf6b144ae04c7a2c6663122d6e92ea3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0f9d5edd5a1c624e8e470f31743af28a1134fff3ea84fa17259ff0ceac341a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/serve.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"512a2cca58170a349e92bf299602120457bfb6aa6f9304d974da80d5a2b32eba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCriticalPath (cyclomatic 11, cognitive 10): isCriticalPath has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a707c7731ce93b864be0026ab7620969075069ba51e8e6268efb219c37aef7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertResponse (cyclomatic 11, cognitive 10): convertResponse has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"331f4894fc0d5cc75b199012192a8c75a383f69bcd84a0f959d8151a7d2576e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamSkill (cyclomatic 11, cognitive 10): streamSkill has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/SkillExecutor.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"131a04adcddb74d2632ee14397d5a31e11e3c9101b88c3d491af2205b105ae41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2e2de7f77d05b998fdc7d1f7ba6794d290a7d32f41cd78c4d9b64b35e6701b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/cli.js"},"region":{"startLine":5638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ac36d277c4f314241bb03f5aebcc90ca0f46ef4e518e227f228202ce052093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addBlankLines (cyclomatic 11, cognitive 10): addBlankLines has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/style-improver.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e782897b306cd63041186919a401166fb8dbeb0a85088b73ce608c8f6fe975"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 11, cognitive 10): parse has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/stores.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b42d2cf44df4016e57b11131393de5bea39e8769872bb0fbdd8eca094053d54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLayer (cyclomatic 11, cognitive 10): validateLayer has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/src/model.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fe076be6ccb3ed63f726991a2fd1172d15faae30e516a72d07adbd60ca3277"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/registry.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade017d33acc524d274d5ce3cbdc3f51d6b0477b9d364f30cf1ff800c87a4ac8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/\u002Bpage.svelte"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa7e9d772e074daada00bb82de5e41ee9883a29619173f236aa099e6ffa4866"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/models/[...model]/\u002Bpage.svelte"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ecd6a3187c2fc21c16166d9a73be703467b9886873ddedeb43e28d5a998b0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRequestAuthorized (cyclomatic 11, cognitive 9): isRequestAuthorized has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/httpGuard.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e10d329787c6d2c64689a6089b3768d6e7dd80f02b9eeee693c93fde577b48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memoryView (cyclomatic 11, cognitive 9): memoryView has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/memory-store.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d47a6b594edd752f2a5ae3dc0636f47eb26ccef27a9a3c23b22bc5246302c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromSafeTensors (cyclomatic 11, cognitive 9): fromSafeTensors has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/export.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"311587d820f26a454264bd2e3f5820572d2c1cd58440347711ff1674faf38b48"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/rvf/src/backend.ts: 1408 lines of code: npm/packages/rvf/src/backend.ts has 1408 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/src/backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"012cb184d154424e2dcd3c10abbefd2302762b722788587da3cfc8c1f64c4f8d"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/intelligence-engine.ts: 1335 lines of code: npm/packages/ruvector/src/core/intelligence-engine.ts has 1335 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cdd4bc61de095fce075cd453494887c08eb2f4a8008c05d1bee952de6939be"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts: 1259 lines of code: ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts has 1259 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df851642d14b69c1974de021fe96986a4510dd463b3ae31a915501c2c60aa98"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/neural-embeddings.ts: 1185 lines of code: npm/packages/ruvector/src/core/neural-embeddings.ts has 1185 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda0482186499725b168e276b55a5a966475e8fc761a5334c0cfb6d29b55796e"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts: 1140 lines of code: ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts has 1140 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad8658f7dbcfa9adc454c1739da27cc1826cbbfdc42ddb394633f021c5b56b3"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/wasm/index.ts: 1137 lines of code: ui/ruvocal/src/lib/wasm/index.ts has 1137 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3d018742adb22c3e4255358b0fda4d9ef18c974fc201e65b6d54ff560279b2"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/postgres-cli/src/client.ts: 1108 lines of code: npm/packages/postgres-cli/src/client.ts has 1108 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"797e0939f5349ca95804e328da9d1aa08225d390d5fc08592ea3a853d29295bf"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-synth/training/dspy-learning-session.ts: 1045 lines of code: npm/packages/agentic-synth/training/dspy-learning-session.ts has 1045 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-learning-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b13d5def4cd8aaf2244f11f31cf905a8146181d4065581b843fa379d97aee4"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/cli/src/cli.ts: 1042 lines of code: npm/packages/cli/src/cli.ts has 1042 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb8384c18c316421cb77a049734023c8265d2a12e1262ba4d4e2096223569df"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts: 1038 lines of code: npm/packages/agentic-synth-examples/src/dspy/training-session.ts has 1038 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2189a1bcd55eb9fa0f5f2d379d42367a3f7b53e4e83e01e6d829725daf720ba7"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-extensions/src/exporters.ts: 1035 lines of code: npm/packages/ruvector-extensions/src/exporters.ts has 1035 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcec4fa03d48ecc14418e071e8c5a362c59179256879e44559e5a67127ba392"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-extensions/src/embeddings.ts: 1021 lines of code: npm/packages/ruvector-extensions/src/embeddings.ts has 1021 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5128e3bbb23d1c079afcfa6f5817c5a6b6ec7d3d8cb60802da77e595d364126c"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/postgres-cli/src/cli.ts: 996 lines of code: npm/packages/postgres-cli/src/cli.ts has 996 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a968020dc41485e5854627ba51596fd92a485b28e045f3aa3565e78b8c15b0"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/server/database/rvf.ts: 964 lines of code: ui/ruvocal/src/lib/server/database/rvf.ts has 964 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbfaa6c61068de95bdb45c4d22841673bae7174df00dfbf81de5acfa08e63c4"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-extensions/src/temporal.ts: 944 lines of code: npm/packages/ruvector-extensions/src/temporal.ts has 944 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7876e2d61983f2cde1c5ca885f45e0e230a8e287490fbf83924491322dfde5"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/adaptive-embedder.ts: 937 lines of code: npm/packages/ruvector/src/core/adaptive-embedder.ts has 937 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/adaptive-embedder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03eef193d880f73dff821576b9dc3b8ebbdde44e7b9e94add20093c1cf016378"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-extensions/src/persistence.ts: 928 lines of code: npm/packages/ruvector-extensions/src/persistence.ts has 928 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8440eeafa8f6fa41423e90ca571ed291f2dfbb3393f5e817425cfa8f48879524"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/cognitum-gate-wasm/src/index.ts: 880 lines of code: npm/packages/cognitum-gate-wasm/src/index.ts has 880 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cognitum-gate-wasm/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8d1d272930dfae4188546a195ffb294bff163f7152c84127743f4eae8de52a"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/rvlite/src/index.ts: 864 lines of code: npm/packages/rvlite/src/index.ts has 864 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"069cdb9a4f8894a117f4068ceb2c3e870cbe2c59939e0ff13d9b93727c079fba"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/components/chat/ChatWindow.svelte: 858 lines of code: ui/ruvocal/src/lib/components/chat/ChatWindow.svelte has 858 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatWindow.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b54cb80a13e8bfbe269fb75b82b4141038c99ec36b48a57756118c20988d1e9"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/postgres-cli/src/commands/install.ts: 843 lines of code: npm/packages/postgres-cli/src/commands/install.ts has 843 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fa6134f6f50b14c1477637ef962cad6a7cf8214941b55d7fe8b029623b87f2"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/attention-fallbacks.ts: 836 lines of code: npm/packages/ruvector/src/core/attention-fallbacks.ts has 836 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/attention-fallbacks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"491c42c63cab2e1b3470a7cadef7070bd37fca0c964df3ad9df1495cd6514c9e"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-synth/training/dspy-real-integration.ts: 822 lines of code: npm/packages/agentic-synth/training/dspy-real-integration.ts has 822 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4071265191261065115cbd00c6fcc468748fe511f00e9d1b68384fc2faf36c5f"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/parallel-workers.ts: 798 lines of code: npm/packages/ruvector/src/core/parallel-workers.ts has 798 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-workers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ae96f089e59e39e51dec12a60ffb38dfcfa29aaafdc9b9b01f02b252c5f03d"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/security/AIDefenceGuard.ts: 751 lines of code: npm/packages/ruvbot/src/security/AIDefenceGuard.ts has 751 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/security/AIDefenceGuard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b5f8a45e12f59871c3796ecf6d3a740dbad6dc6455a138a46f876dc13d1b7a"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/learning-engine.ts: 751 lines of code: npm/packages/ruvector/src/core/learning-engine.ts has 751 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/learning-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5131470304b4b9b22067b2e253c857cc7374a4eaa9f041b8439fd76fbb1600"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/neural-perf.ts: 740 lines of code: npm/packages/ruvector/src/core/neural-perf.ts has 740 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-perf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e26c4d12a55ab87adc925204b35ecc50187de0539b69abcfb5b18d7756fe53"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvllm/src/types.ts: 724 lines of code: npm/packages/ruvllm/src/types.ts has 724 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2678c586f44500be9862140ac5ae44515027392e556c0ba2e6b1f9ac82be8dab"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/onnx-embedder.ts: 710 lines of code: npm/packages/ruvector/src/core/onnx-embedder.ts has 710 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx-embedder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed85b4eacd9a51170556bb138697a30c46852b71cb807214e8b6786f58da2a7b"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvllm/src/contrastive.ts: 708 lines of code: npm/packages/ruvllm/src/contrastive.ts has 708 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/contrastive.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e2ec10e25c5af1ea551918a0064d4e7492bd5d2ec3d9ec0a91aa6d6484269f"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/RuvBot.ts: 697 lines of code: npm/packages/ruvbot/src/RuvBot.ts has 697 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a7f4b13613473ecf71968bfa4a6bf49fdba92be32cf1a1c8d134a192f2cd92"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts: 681 lines of code: ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts has 681 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb85f567893450dd386d2338a945b780b13e571b4d3c24da242e595011a9eee"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-integration/integration-tests.ts: 680 lines of code: npm/packages/agentic-integration/integration-tests.ts has 680 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/integration-tests.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a35193562e1622124e07a72d1257ec50b3ca32b06096127528de298103da33"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvllm/src/training.ts: 673 lines of code: npm/packages/ruvllm/src/training.ts has 673 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/training.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b1e8c79fe7b5041c83266c1262526168f97d00c5b5e767b21558e872e8b84b"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/cli/src/storage.ts: 657 lines of code: npm/packages/cli/src/storage.ts has 657 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/storage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5bcd2a48d6519a1d2601afb38d9f904589b436ada3ce2a7289bb49d2b55b43"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-integration/coordination-protocol.ts: 655 lines of code: npm/packages/agentic-integration/coordination-protocol.ts has 655 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/coordination-protocol.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c774569f4db8928e6cc35de4b70a4bdbdeacf0867e855e8f171d765a216628c6"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/server.ts: 635 lines of code: npm/packages/ruvbot/src/server.ts has 635 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d87c2e3ce157e7af2f2f40bf87a8c56324287e16f2ed0251db19d34b6d40dc7"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/server/database/postgres.ts: 630 lines of code: ui/ruvocal/src/lib/server/database/postgres.ts has 630 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"524f92e7df39fbc193851477f1f9df270a4ccd0b84565558c7ee69b3b81b93f5"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/rudag/src/dag.ts: 609 lines of code: npm/packages/rudag/src/dag.ts has 609 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61626ff3f8fd6b659e806a6e22b9accdd96af6f6cf10911130394b00d5bbcfdc"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-wasm-unified/src/exotic.ts: 609 lines of code: npm/packages/ruvector-wasm-unified/src/exotic.ts has 609 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-wasm-unified/src/exotic.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"958cd5e55e55619428cb8e51be4eb240aefc48880d3b219149d4854849556cc0"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/plugins/PluginManager.ts: 598 lines of code: npm/packages/ruvbot/src/plugins/PluginManager.ts has 598 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c29d60ccb18e3c7196d0c1516437f1428d169ca0f0def119aae4556d49af6ed"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ospipe/src/index.ts: 593 lines of code: npm/packages/ospipe/src/index.ts has 593 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bd0026a58af708e50e8aa59e16d9cb3162c9429509a95a2901d29bb0c54a8d"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/ast-parser.ts: 588 lines of code: npm/packages/ruvector/src/core/ast-parser.ts has 588 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/ast-parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bb342ff8faa50826b4d9d6f0ce5f06a64f19f763f8fe1b312e0d1ded10d8b9"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvllm/src/sona.ts: 587 lines of code: npm/packages/ruvllm/src/sona.ts has 587 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/sona.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"405e8d87b313cb1a87fd4407c31203e3d867d0fc9b184c3b24547e85fc2fddbe"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvllm/src/engine.ts: 585 lines of code: npm/packages/ruvllm/src/engine.ts has 585 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"104b5c98b49eb586a00d07a9c37dc84ba55798e9260177781d3dbc28b8b3c325"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts: 549 lines of code: npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts has 549 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e6a813e4ea8db16e7ac64a317b60512070c8081d255d43e0b89c7a9f2db764"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/graph-algorithms.ts: 548 lines of code: npm/packages/ruvector/src/core/graph-algorithms.ts has 548 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/graph-algorithms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4f5a8dbb11a09289c748733208a2060bd71582fd3dc3c462c28de2ead20540"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts: 547 lines of code: ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts has 547 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d384bd4e3fe55bc33febf1a9ab68d7d1d149563832b0be75d68ef6e70d25a33f"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-synth/training/openrouter-learning-session.ts: 545 lines of code: npm/packages/agentic-synth/training/openrouter-learning-session.ts has 545 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaadc3c531fb2babed325c8770d1ccbe92a99f71919085a5022a393fa75c36f1"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte: 540 lines of code: ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte has 540 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7931c2a34a10572a2ebecaeba8ae495fd391f15cf099ebc423dcab51f72717"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvllm/src/federated.ts: 537 lines of code: npm/packages/ruvllm/src/federated.ts has 537 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/federated.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c7d05f5f098b436da33da68516a689040a4c8290624d9cfedddcdf267d8e0d"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvllm/src/lora.ts: 537 lines of code: npm/packages/ruvllm/src/lora.ts has 537 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a9a861858fc96bca932667f9fcf9447377f68a5a4e3287a6966f3162035e74"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/rvf-mcp-server/src/server.ts: 534 lines of code: npm/packages/rvf-mcp-server/src/server.ts has 534 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15da570fc2748baf63cae21c2aeef1124a579d13a6d1b6325bd190f12afc5ec1"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-integration/regional-agent.ts: 533 lines of code: npm/packages/agentic-integration/regional-agent.ts has 533 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4034822aa1dc06b4fe8a509d121ac3b103b7491490c23329c3d46ea82a8a58e"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-integration/agent-coordinator.ts: 531 lines of code: npm/packages/agentic-integration/agent-coordinator.ts has 531 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5584d3ea6754898f3f318ecc9b441028a05f970a352bac08628742bf94f488"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-wasm-unified/src/nervous.ts: 518 lines of code: npm/packages/ruvector-wasm-unified/src/nervous.ts has 518 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-wasm-unified/src/nervous.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5cfab3b05d52d779d8215449dcf59f3ec77854122f1c8ba94a7dd9828351c7"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-integration/swarm-manager.ts: 514 lines of code: npm/packages/agentic-integration/swarm-manager.ts has 514 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee43324943ff4758b19cb2f1749bf0aa873f34f6c91fac8045f5361a3211b24e"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/components/chat/ChatMessage.svelte: 512 lines of code: ui/ruvocal/src/lib/components/chat/ChatMessage.svelte has 512 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatMessage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2b1c5b88c289b7ef0b5fb2c718a126326263bfd97752481331cef71dbeca9e"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-wasm-unified/src/economy.ts: 505 lines of code: npm/packages/ruvector-wasm-unified/src/economy.ts has 505 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-wasm-unified/src/economy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8fdd72fc01a9b6615140d7442025c8cf83fef855685872afdd6f922069c90e"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/decompiler/index.js: 504 lines of code: npm/packages/ruvector/src/decompiler/index.js has 504 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58984f7428a5488c5a6a139c47aa6547f168f6bc74a297b6a58a71b83591cde8"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/rvforge/src/registry.ts: 493 lines of code: npm/packages/rvforge/src/registry.ts has 493 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e65354ac6c386a7ed94f33b372581d67a6604fe67735d75d45ecbc1554b2f0b"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/quantum-wrapper.ts: 490 lines of code: npm/packages/ruvector/src/core/quantum-wrapper.ts has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/quantum-wrapper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"740a561312e057b0787f74471998fcb7e9330bef3fb7c983c85b2efebee924b9"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/cloud-run/streaming-service.ts: 488 lines of code: npm/packages/cloud-run/streaming-service.ts has 488 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9e73161d6a5c04b6cef2a77a490c9d7db12da95429500c6ccafa957419b536"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-synth-examples/src/swarm/index.ts: 480 lines of code: npm/packages/agentic-synth-examples/src/swarm/index.ts has 480 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/swarm/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e336a0f7225e2c9e9acb8aa1402fe71bc1ae610b9bc70f2e4427e4fe504e9c"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-extensions/src/ui/app.js: 480 lines of code: npm/packages/ruvector-extensions/src/ui/app.js has 480 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7fc4326b6cc2d36041060ff686559e75d29338ec3448ceb682a345900583df"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/server/auth.ts: 480 lines of code: ui/ruvocal/src/lib/server/auth.ts has 480 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/auth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d5ce1f0e9acfd57768d39dfac1369ca464e0b3a691bc531f7850fb0abd07f6"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/utils/marked.ts: 480 lines of code: ui/ruvocal/src/lib/utils/marked.ts has 480 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d5384e37377eb1f7e4e92bddd2a8b15fa93434505016078bbf3a3436a8369c"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-synth-examples/src/cicd/index.ts: 478 lines of code: npm/packages/agentic-synth-examples/src/cicd/index.ts has 478 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c100d62852e2de26f13cc34470a0d1bfc15e9abb1901e46340ea7f3718758d03"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/workers/native-worker.ts: 478 lines of code: npm/packages/ruvector/src/workers/native-worker.ts has 478 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb270c9ad60019a68248bf472aca05a35521330042273a7fd7358bb7f75376d"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/index.ts: 460 lines of code: npm/packages/ruvector/src/index.ts has 460 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2e7de66560a4690a13804709ff095c4a877d61fd53e0686264b432a77eb48d"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/burst-scaling/capacity-manager.ts: 458 lines of code: npm/packages/burst-scaling/capacity-manager.ts has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/capacity-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f9c74510a48dfbb25db015aa3483d3460565d39fd91e72122eec8ae1bdcd03"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/cloud-run/streaming-service-optimized.ts: 456 lines of code: npm/packages/cloud-run/streaming-service-optimized.ts has 456 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7972bdfee304e2bb96ae359459f52aa768df79e2563aa6a00e499975453d125c"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/rvforge/src/cli.ts: 456 lines of code: npm/packages/rvforge/src/cli.ts has 456 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6f4048502ae52e96969e67456bfbb1a5bc750d282f57553cbe44fb34581ad4"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/server/models.ts: 453 lines of code: ui/ruvocal/src/lib/server/models.ts has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ed5b44a92b0ad76b1dbd4592885630f1a8747d2ffb273c8abaff3b0cb7d3f6"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/onnx-optimized.ts: 451 lines of code: npm/packages/ruvector/src/core/onnx-optimized.ts has 451 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx-optimized.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b44704095e1574ec86013febdc72ad4dcf94d70dff514a0836fdd8dbc577a17"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/stores/mcpServers.ts: 450 lines of code: ui/ruvocal/src/lib/stores/mcpServers.ts has 450 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"687bc5dcbe8a5ad14a377e86c53217ac1b12caeeb149a838eb5dddc0047c066f"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts: 449 lines of code: npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4e81b34a093ea344db507494475e2832588482f031ce87156b1fed41014e1d"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/agentic-synth-examples/src/security/index.ts: 448 lines of code: npm/packages/agentic-synth-examples/src/security/index.ts has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/security/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"758ef06223d886b2d705065ab61ddb61ba5b24032e07af9ebb2b359a0c0cd36c"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/lib/components/chat/ChatInput.svelte: 448 lines of code: ui/ruvocal/src/lib/components/chat/ChatInput.svelte has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8575f5dcbeaac75f09b35a6181455d43e72af1e4c402934ce383996362d9da"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/tensor-compress.ts: 446 lines of code: npm/packages/ruvector/src/core/tensor-compress.ts has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/tensor-compress.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6fb02513adf28944149b1300101562a5f61ed1e5f66ab008d53fecca440826"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/cloud-run/load-balancer.ts: 439 lines of code: npm/packages/cloud-run/load-balancer.ts has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/load-balancer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13aa59e559af72342cd074ce0ac62410af23dcd98de78fc797e3aabf997329"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/onnx/loader.js: 437 lines of code: npm/packages/ruvector/src/core/onnx/loader.js has 437 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/loader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"832da5ab51456ea3495ef3ff9dbd4ca499a7c6e12b73b20d07dc555abc039d38"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/src/routes/settings/(nav)/[...model]/\u002Bpage.svelte: 437 lines of code: ui/ruvocal/src/routes/settings/(nav)/[...model]/\u002Bpage.svelte has 437 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/[...model]/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a708f5e8fa3f5557ad696521c9864b8c19f8a9f908779f9328d514cf7c93f5eb"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/decompiler/module-splitter.js: 435 lines of code: npm/packages/ruvector/src/decompiler/module-splitter.js has 435 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e548271ce72bfaf3a9ce4ff781b19f024197106cb0ee32679d719cae2c0eaedd"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvllm/src/export.ts: 435 lines of code: npm/packages/ruvllm/src/export.ts has 435 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/export.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5cb2b1948741a96cb1dad7f9279e7c3dc3c94a35e40a85a2fed1a6c1466ace"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/cli/commands/deploy.ts: 433 lines of code: npm/packages/ruvbot/src/cli/commands/deploy.ts has 433 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/deploy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8769db82501d6f57514ba1cddb2a614015501d161566a597710e84de942107a"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/decompiler/reconstructor.js: 433 lines of code: npm/packages/ruvector/src/decompiler/reconstructor.js has 433 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/reconstructor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"005d3446c79b1bd4906d07cf81ef97644fa542623819f258899d4576abd3437c"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector/src/core/embedding-provenance.ts: 424 lines of code: npm/packages/ruvector/src/core/embedding-provenance.ts has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/embedding-provenance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a7da6e487332a5462697479ff77687854e2752767a400e064053e28eccaea1"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/cloud-run/vector-client.ts: 420 lines of code: npm/packages/cloud-run/vector-client.ts has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8330cd0f25c27b514b9701b6fee08881b5bd2a10fed2959f3b62ff8100a9ddd"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/cli/index.ts: 416 lines of code: npm/packages/ruvbot/src/cli/index.ts has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9157d0ec7cb98f0a604213064d1d59d7b78823a6b9446e1413d372ed15306f"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvector-extensions/src/ui-server.ts: 415 lines of code: npm/packages/ruvector-extensions/src/ui-server.ts has 415 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1206d96c448166f0d76c87b5a1d89749511ed28f4076b5cbf955f12e407bf71d"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/ruvbot/src/learning/memory/MemoryManager.ts: 409 lines of code: npm/packages/ruvbot/src/learning/memory/MemoryManager.ts has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/memory/MemoryManager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9786e83a1f8f15107968512a32cf121a65fc32b1345275230f993494fc0e058"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/ruvocal/mcp-bridge/test-harness.js: 405 lines of code: ui/ruvocal/mcp-bridge/test-harness.js has 405 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/mcp-bridge/test-harness.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f6983527df72080f6e2a4c339b09ff614621e43e1893fdfb87477f496ce0ec"}},{"ruleId":"R3","level":"warning","message":{"text":"npm/packages/burst-scaling/reactive-scaler.ts: 402 lines of code: npm/packages/burst-scaling/reactive-scaler.ts has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/reactive-scaler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"677109d390a4fdca5635f02e11a5c86a50597a1b19213f33e4045693021f0b9d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed39f72df25ffa934ed069d4ecf7b368ecb7dbbe71ec84890e3b796401173e63"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/generate-ecosystem-triplets.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9708d7cf2e09103a4cef7552ef5e237833acf287eae0767170e922ea9ee834f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48700dd682c991dca0af302763000838103b6fa106f5033ab7faaf6936c281dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-learning-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e18c8ae481762cd17962141a02594fe7d928413b3142711f1fb29c2f1be74ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/toolInvocation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0e38774d886376670cfb7c8374530935a364661369e4e709996937b164d073"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2486e3a3ecdc07722bcb032b8ed9b1b171c257ca938706735bc805e46715cf92"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"add3ece251dfc971d3d656eac5732c54a6fb3434406c8438c563f723bcba178b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"955c6ed372b11cbdf66f91a9bcd32aeb64f17f119ff7104f1b242dabd21c94ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c2e17e5abfee55d7276db7c0a24eddc1a60ddf4f64bf495861bdf51d505f6b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cognitum-gate-wasm/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c97fdb9b8af16e503b280d2621b03ea2814712bc72ab6957e9a17e39e937d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b431e35ae97224e624206ff5a8104017e61fe24cad9917a3d6d25c0d5b363e33"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"418de40bb7701cc7f0c6b65f85d46139a2ab68fe3890514c9c51158825f7dfdb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3b32b0ca91fda0d224c9a010f5c9e219dae7a7cd0d80035d6d6242d2829c05"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa92cfc08ba61563ff54305f354c3c9efef1eba259177e9f073b5e8926ae171"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/integration-tests.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d299c8dfbc0f317b2410065b80664ec2bd7a88693b9788b530d90770121fba"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/coordination-protocol.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf17191410cec034bfb14646d84ad38f23e364d4c93669bd380a0b6ccec00ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c9c9a8f867dbfe703344b23b58bff0ed9da8135dc900ee79ded7e2528059df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/storage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde37b0153cffb3050c51816715ba5eb8754ca3c97a383f12ec9fea81c36a8fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd3d7eb3ce2c5b6174c353c0f66daba670b1650c171d40e14e663999e5878e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"735b2d03a296943fee87b7fac5ee09ce14be05161efaaa0619a32a3a56f99652"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3c922eed6de72dcb5fe72e4441ea2fe81b4adfd6c8fa38dfba6f7c4afc2aa6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3b6ce353d9e2a7e6c181784496c8fe700fe6cc3d723b0d7248e1244d370afa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45928876be32f811f3db9340afefaecfc2dc2fec90d02dc1e44f072ada3e539"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0053a0c4031a70fe0baabc9dcac76ee9feb7f6779c84fb0a0b4f028418f8f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/routing-dataset.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a5d603fa134017c535e8d0f8b332bd92d8169f664acb375f5e9ac382f49181"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b2e474344b202c481c177187d6876952d9d0a723207effb4a4b0d6ce62c3d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f31d9cf30837742929bd3a74690d53c0c3baeda631df39c63dca7b5279aacfc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"407a37fc558405b5c32ef62f48f67fb7b88a670c057004179bc4f997ac5bd167"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c9fcf7528a600e33c08a9e81329d0d2ba36b4edda0965d798a5c7b8ae27820"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c280197b04942a2005a1622c17cf9733bf3f7b30f976b0e0cd91c717728278"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/swarm/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"461dc7c862c326b60b6f5b61e22514651c68eaa71247e54aba6f3b97e4afd969"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/auth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a46f135bf8f3cfc63ae67920add8aa58396c81e570eaa2b0e2824c2b0d6c45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2e857a726944656424a4315eea0fda67fbbc14427449a14039e5e9097a3fe7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e987373d48c8c5a8efdf65167927bcb9196a55d3e98b5e5780af1840b94cc38"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21a28b501224831637674e76a2ccd055db83ddda246092c6a17cbe8709a0eff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/capacity-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17adfa32dbdd5f885243d38ef78537bec63328c0282f09ac8fbf3c8def4632c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbf122994202f0cf7a442027c2d428a5acfb90a524503e6240d96ff97ba3ee5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b738175079ee0e7c6c3d9b31c1e71807da835eac59047b333d131b47042b1f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/load-balancer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa096b57ee3f5942fa12cbb8fa2a0023df5dfa16e2c2338d7c6fd4ceac93e27a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/scripts/build-rvf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"024c3edfa572e1ade3b8211e0c6ac7b097e363c48c2362dc5396e6b926e25ecf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-code-synth.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f2235a6f572dc966ed52faac7f8aaf1ef468bff8bbdbf5881b5cc7dfa46195"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/security/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c47f84936d659ccae6ecada11561d89e0082c62ce8449226d51597cddb267"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatWindow.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080fb79b13c50dd23bde14442d3bd47c1af8773eef0caafd23f965c2cc32f242"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3800ec5ffaac9d81ccbfd20dd6867ad11094ef64bf9deb4370e39344b1f08adf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a131e6745d36405f576744a8362b7a7db2fc221d050ee8a3b7446db2603865"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/mcp-bridge/test-harness.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a79f4431a8c41ebee16d535cc012f1051a07a36d88e13751f34d652f9912f13"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/reactive-scaler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ec1a185ea5a103e551f7bd8bd99c50f24f1061b923301790fd01f9bc04a4cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/wasmMcp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfe8b4a3e86af016b1b3398b45ef2fd2b5f4d0e8854b8b6faa4016dafcacbca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6282390cfde5582b7f48a91d499f769a663dad1a009a2e73af9613ae15b7640"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/routing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10686617f713ed222f60595f3f4b58451a4097d0fdb2377acffcf7a10c46e2f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b89481a9b30c1e907d1b6e9070d92b3f9f8e3283ed3b2858bca9a7bc3bb8632"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/stock-market/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c109f28bed8aadc1941bcb5300c757346dc2d8855acccc500172253f2b3e23"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/wasm/idb.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7649a55597604b81e4f6d25089293d494d01a9a04c4477a3970cf222ba57418"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2663498a849458d4839328574692eef2cb77270e09c4d4640a2e7939540f0ab6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/js/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"227bef81a226b3b59fde5b3e1cadbbbbcf7c8bdc31150fcb64de3ad16e4ecee9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/burst-predictor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ef372a7c02db1cd5ed17feb059263c1f09e4c70730fe18401c58da23e0aac4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/hyperbolic.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b906b73fcf0a5e86275e7789e996f39a8a8db596fc43b7f92f0450b7e1a01dc1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-training-fixed.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeca289e14a1c3815c6404bf88b4b9ada6d867f8107ac09913baa910887bccbc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/validate-ecosystem.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feca381ee03b80f75551939554fe35ea2bf4fbc2d0851885ccb6e464d4257a9d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/scripts/run-rvf.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ce64ff4dd6d6b0f4b7ed80c2355fa8548bbb05773aa50ce6271f2722d647c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/hybrid-model-compare.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c0f8e6c01d63baa1fb3e2a9db9c7a95543f51cbb0965038125d641999587b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/bin/cli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a939b9ab0ec4bdc10e35880fa6c3c195ed22d7a57d87f2f7bafae97f79188654"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/cli-runner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeedf9243028254613a25bd49aef37194e2911e2287167d8f4fb7c360710a6b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/optimized-model-compare.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"282a76e5b0b432aa1f467dea22363553fae0f906d9207402a9af9b6ac6cf5fc3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/cypher-generator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68d9980db75118b7909e16f9b574cf30211fc648c3a57c40819f9b99c1f2abf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/cli-rvf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a422f69f37c4c5cde9c2034a44635d311e298ae64644e5e9fa2e135723aa6c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"734986ef5fe236bf8d9cb8e221097935f280f3b0e78989d5a63002dd169af485"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/indexeddb.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6bbb1ef177ab2acc3240a4fe911cde9605f5416d46abaaa0316f7a2a14b1e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/self-learning/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"185b705bee1248cce2b42837250378c30e29d909ed7a7bfc1e3779903ddc3264"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/dock.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b86482238209a28026ec3551f97baff3b47945ae6e00a9d7409c237982c231"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/actions/snapScrollToBottom.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00604dbe260463be5ab60d291a5dd8b850f2214b78a5aa9b05ece8acd2bfa03c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4604d08e35bd35541caab787e59c61bfba37680e0a1c71f19a3a934d8d2638"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/embedding-enrichment.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74849599849bbc7d09094cd6779b1d2ab04e1e5559ac0dd891c7e8084edb56c1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/\u002Blayout.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133dee75f9dba503e535e6692acc72d7d9a289f73b79783a0395a9be4c05a0dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/library.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a62b0be057356482cf41efe8d118b82c72cf5caa03da53194ec923cba74f27"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/sparse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c18e60e5fa33322234952edc51bfe460495a51407d099a71f94ca9e97d4830"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/endpoint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"049ef86f9f80e2d2b7b8da8d78710e25d9b7951c0f3f2b7c71af62cf6a44dbe4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/jobs/refresh-conversation-stats.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ab78e7112e71b95419b42d20a561d4fb1b6a21e7cd2f0c38f903375c620a8e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/temporal-events.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7766052640c735f136b5f1e26efb01d504d8efa4972fc19d31bc931952b68c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/improved-model-compare.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdfea5d1d3d3f6d1b84f8bb306a35cc5af9f09c85b48cad1dda56d3baf3818e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/populate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6e21728a459b64012211329cd4c9c2c65ef6a8e8a267c5e7976dd05b78a967"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/embeddings/WasmEmbedder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0779de13ae80c182aaada5198bdef1d041559f63e1c506487acb62c1d746e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b954f6602fede9e224fb0cb7aa1c1c7c56342bcba886fbabd5a7c2647c7f05d1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/entity-relationships.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bb3ad850eac27bbb1880ff90cdcb126eed7e39f1854f615b2fa44f0f303fab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/real-model-compare.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28af4cbb1cba8bbd102dbdeed3620a14ed280aaa8cbee6ca9b55ad94e992b15f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatMessage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"929351b8ed4a67045a1f90af078ab5e6e9ddd24f42df88f6a248897e3af01da2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/vector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"409866113b942f42683fa17ebb8c810f4196bd32671e4392ec902b97105e8ddd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf9c1b7e61cfe87b639e41c10f1a1b52c5257d06220265a7c790bd590cfcf9d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e27aa3c35fe424cac215d93c6a145e90d237f3c4f1aaa5cd548a6c4f1eddb2d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/sync-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c826cf565f34474fe371a1c170b5ed559948dd4974d4a6823f6f1059d2c1a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/generate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"330576d6d8cae6252e849e3604384c2187c2a54238988c09bdf0344667d2dcdb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/metrics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0032e74227190ce6a045377aef0a296bb6471b3d740175f521e522680851e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/worker-pool.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dc938dd88f71aa97f49c3d51ecbcfbbd673dc961465a700d8c9a26011e9603"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/replica-set.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1094ea91f087e15141887f887c29c45457369de845481dd9f2fe2742bed0ae2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/hooks/handle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6a116a3f3e309a1ba83a55d78a05d96e9bef9da4d9723b655bb4601b8a5406"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/knowledge-graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e3c2d7907cca8bd37687d81961703c648cb90728f823914e1099bbf4c43f91"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/openrouter-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d47c4f11acc481fa028c1fb46029ec973df3fa5a3ab06b2392674a196dcade"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/quantization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df75fc32129d1572f03f639ca9a54c8d6677cb6b531b0ff9513dbfcdbe7387b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba309db6798330f2de3a273a028c2c3da48bd1d60f250701696d12cb2a47bbc8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatInput.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07851b8efd3018b775aa1e1201be322479587df8c4a8780b6645ef19d772cce6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/MobileNav.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbfd19dcd33f915a1822d3fdaa789c1e164f84e99448fe344e110d6ac12202c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/arch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c5297b1c1018da40b4c13dfdf304c56e16bd72fca3768fb5e11954f84bb5f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/social-network.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee539291b1f0df251ed24aaa0b7933b0c9b7413a58417b969fe3ee5cc2f6648"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/FoundationBackground.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93e6af8e2e8e6db3840d2157a3e81bb689d44cbeb68863b662b07c16bd3e7b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-hard-negatives.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5490eedf4a84378b201dea4fe4fd171097ac5489bfabfb95dcb77365296c9b22"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/workers/autopilotWorker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b73a9044bf7366509dfb17521566774a10767d8c0fc3e7f4c42dc9da51978a2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/entities/Session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88061b30288c1ed0b6d8afd4912cab036b82031fd8424605585fd4aac120a20"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/openAIChatToTextGenerationStream.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ee68dc873850b7c5ca33d9b4bc1da98bac9f8580b356688952a044972eafcc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/images.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55633f494abf9128b419c8711fab89d323eca9ee4e4c73e8fbb1274e571ccb0b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/constants/rvagentPresets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8f6ec718076cb7a0bab2046dfb6e66dedaf937e2727022c275b1bb17f8f71c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/wasm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab39bc19ab53b0dd82b9a1f3c1a18c89441cdb17f7f1fdf473238c2ffe52859b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a75f0092c8db7164a1dd9dfbe19fae98850170506d6d005b0f357b11a1c4ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c17e245ebc747bc36b1e53992b64d039a51aefaf33a66e3b6f92d18ba20152c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd9d1b938b31452e9d7a3a19b5a7ac60a4e841efbed321677c1ad6f93c708fa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e986d62bbf3fcad67c74e216128891ede30e1fa32f83e54c114ef84fa8426af2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"109a1be509a37d6e448d7f2aeddce1d134d8bc631c890229f5ddb465ac6183b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/export/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b6bca22f193a4b79493ed42146f41dd41541d89d73722ba182b6a7e40f7523"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/optimizer/tool-schemas.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d873d89cbacd3e5a530d359af6a6437c939168bfbf3d0ecf5df26374e5d6d736"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c009ae78104817b4862bb392867bc444338147f35fd8f364bd286fe0b1a38c1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4449c530de701a5b7b2840e28b1ff37218fc2a47dfe3b4478716607c562d42d6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f569c66979c22b592017c3127485ce0498d4c21149e671831389a6ee4d6cee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6678567a2bc90173b62b6e22aa6f7f2959dfd07488de15080890c5ed415294c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/learning.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"934a3c2d566052151266a56e39bf4af7d753dad4dc93408ca33aa005bd77a210"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/entities/Message.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8757a2d7aa6b5feb17c0f6b674b2ae1e55751acd20574f5111bc2a82f90e60a1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/settings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b928333f7f0ecd1a1253a7b490fa229d9d0550e7deee69119f44e505d3bfcb2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/static/chatui/welcome.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dfd7a4dab9e3c58dc9cd50ccaba183067528530182a1d71c619949ff543a0c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/test-example.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2354784f77a8773b6c7915ba37adbb14c6885254b81cf8b3456b9ee05c8a909"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/generate-welcome.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce050c2a043063b0ea85cb44242ffc886b2f56384fe55b2730139b2264b56992"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/bin/cli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73efc724c3cbdaa07d56fa3adb1cfeeb9ad3a58ca1064c0be3653b3cea8931f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/autopilotStore.svelte.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2703f80b31416cfd511dbed9bc3d9ba041e847bd16521dbf980378e3c1eb91"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/bundled-parallel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f475c1f073418b1c9b66db3973afaf470d15182227512838aa6b91b6bc1d95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/core/scripts/publish-platforms.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7129886a743678d94e90e77c0b601af9efe346ae460894125723a8a723228f3b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/gnn.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1311f110dd15d9c9d0306a3dc576992d77bf22b26ef6f882304262581036bea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/BackgroundGenerationPoller.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3813f062277d528feef013b2ef3659616fc177a2683189e2c606cdd268c1a175"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/VoiceRecorder.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f41d55ed8edb1540ffabe91f1cc0b368d707b1ef899534b7acaf45bd90480f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/RuFloUniverse.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0307b7b01395a8e24dadbe419872675dceb5b0dad0ce22057776f2602d4efe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvforge-reader/ui/witness.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94574d5e9a3b22b8e5ba01e0907ebeb25f6d376a92d7b0cea3e2b7eccdd3fe90"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/mcp-bridge/mcp-stdio-kernel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31ee23493ded4a8fa4739e8e767596baa0da7cc583877a03e6ab08651a5c645"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/admin/export/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0139393cd9540bdf9a1e2b80111b1b1b4c2d69403d82c737c3483fefcc37a1b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/bin/cli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6add2d6aeaec47678dde03d619736ef208dd4844c614c4e0a46c4613ae4ffeb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/fileRefs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd24dfb8dd64025b0b418e86033a3cbdd6d9bd317e5ee0699a8817f09e103cdc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/04-update-message-updates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d56c5040854680018999cea67ce56535eb9244c0d25b68ea3083c3d161dd1fa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/optimizer/context.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b6975d4276ae68ed1fdeceb256a3a5d883416cd980036de251fc20095301c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/vector-clock.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4964127bf0480561a1c274532ec346b683fb9176771aa33902debf20fc8c527b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/APIClient.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1923de53e0a75af5e2c5804afff0b65ab44d003deb41525e8a7d26f8ea341e42"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/mcpValidation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8bf1fab05c6f0358d3d629bbb076600f29f986c1826d4bc6e35c57306a9a72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/fetch-url/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c778a3c272451bcfd7e25086ed668d78678440fecd9353b23327d0b93eeb4c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/micro-hnsw-wasm/test_wasm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71f590bdfcbdf642a8faf2fa03962213800992222c74ab8571e6ca739c90187"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/eval/reshape.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdb878213afc57be82e741b28a23028d1a33a6da88f15bb7acbbe6636456e9e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm-cli/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2979bef5da81cfd42dfcceadcd00d6e324a5901f1c810305b276d84e85e22507"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e1e7cbb9e4d8c340d4cb23de3cb393a62fa7742bdba0fe11ee8363e6e5d489"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/NavMenu.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a14130e4d32935106899dfeaeb6500ea6e49299899a72be18bb5aebf4ec344"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c94496326cf71339dee9af6314041838cad0446cd21bb64231358892e1384d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/schemas/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c60a8ccc5955c96d0c2eba88b93f85cb766b2b6541eb07f461098b1b6d8d5e1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/types/MessageUpdate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8451dbbba434970ff1bd30a68b7b9fa8b3907641dd94b513ef1dd35fa6a05ad0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/commands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69efd38880cfb03e69e53820b6233e2d41397f073367cfe6c1cca5046041623"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/serve.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d21aed08b1d883a8bf538ca68e2b726e9f1d18738a8763caff1dcd66d4f895"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/log.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa9460f8f81a7e2646d5a22f503ef607a7c6fcbac4310c3e1c85282378be2e7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm-wasm/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a013ce70816e0d6b44ea6210548010434a90280f14e4b39dbc2ac05a3ef0137"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/wasm/GalleryPanel.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89740feba07dba8cad59dad7b8e340984e5bcecf7ed39200689c103c5a94cdaf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/httpClient.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a3433a6e4ff6b8c46216cdece146c13a2bdbb8479c666856d7af1750609eb4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/[...model]/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ec7b9983b73ee16bf67f7f50b07c81dcf5948cac797408fdc1bd12319387dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/AddServerForm.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"357b0d5439973b31d50c6234ec01bdcbb68a67d7734376c15bc762890d273b5f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/models/[...model]/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b095d787b3a939bb8adb2d6a30dacc4138e05cc64204cdf3aa8bbcec2bebd0e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/demo.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad86844d1eabcbd2ca45fcd1024f5d0d86e51f735910083ff3f5a5bfee332ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/switchTheme.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa964148ac202ba7f6a2c07cf285a88d15f4bacb10fe2c463eada65f852fa3b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/test-package.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2562bfdc7dde5eeb44dc256c182e53a727a70163cd4f3592f34edfcf06b442"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/eval/warmstart.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07df294ddf9062a353c3f1b1833b972e433ca67a18184a20e03c476fe445740"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8acf33d9889f0ea9b051be35bdad3c5caab5a77b9009e3f4d4e3894ddd698b6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/attention.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc94f9716f00b9001ab227941ac48ec31c2db8c04edfc29559900d9e6bc7637"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm-cli/bin/ruvllm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6f0127aae888eff0609d399078003bf5047f2d71ec7f680d091e5da5948a18"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/UrlFetchModal.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93214c1b48c4e58f457775b83c5bb87648f8bbbbdc9cbabc5b77fb17d34c1ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/test-live-api.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e36582cdb79fdc92b6016c13cc3e2ab2fc40d6fa28724b60519fd6956e431a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-node/scripts/publish-platforms.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b461beddea71eb924c9fd5188ca0e9dd18c8a89de131eb5a28026c544cd0fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install-args.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbd93dd38e65c315a1163feb959acae5daddace61f5757e7bcfe9cb11a4b802"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/loadAttachmentsFromUrls.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"642dafd5e05e4c13310172348c0ba96e4d8eccb37c265096471bb0285b3800d1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cd6b2c790f5c3acd19501bbb845c746ab2ee0d392b3d4c70ef16ab8d210cbf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ToolUpdate.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2b652cc4faa6ddb8f250c9c5926913631d5a4b6eb76652b8e7b0227f3844c4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm-cli/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5dc4326634b34b6fef9f2a4a90e24d60bb8eb8518bfc7e3a091b7b6d85de78"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/migrations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6114e1b07a0a0d4516bef05b1aaecb4bdb4450181d79c14d6182c167551f74be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/utils/logger.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3a3a43a0b17d7df8a0067ba07532eea7b18db7b8981ceb60da81557b6dd1c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/mcp/routerResolution.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab46ad7032f91575fdb2f81c1519ee5141f169c9d86032152cd4b11fa383858"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/example-usage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b391d069301313eb654214bf41676a9958eddb081bec151024bc2689e1e3515"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/transcribe/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"885b7c80de11b00fbaf9154734d68920d5c607b6a9dd26592296f4a4e6c466e4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/callback/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6d76f904d8e1a6323bd980cdfecd8a68215c53cf731ba3c369d18bec8d0884"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/\u002Blayout.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecb7747c11d38b0876c20e89452439de2092f3e3cef60fa6386b6f3e72c3272"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/application/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1850b15dcdd138b367148d26539ded04e3874e2a4b51bcb9bebe71d7e27ce9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/utils/toolPrompt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b17c88b8d57b24234edbe065f19e82ff1a8622ef6e4b807503573a6fafc44fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/workers/detailFetchWorker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efad4cfee2eb37570edd7edb28feb629244891f02c813f4e7394a2d66b0386a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a03bca2f483bda0c8ca27d89e87b33aaa503d5e227b6d236cb2e000a1088fc0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d643d47df89fd8b85fc41a2411513709a72209ec0d949984a582a12f18e3c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/entities/Agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"960dcfbbb7080730676c3d156eb943d49e4262f34a000c0b134dbbfae1d37614"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/eval/adr-corpus.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ef84283d9e61201c5af4e264a75cbf8cfee7ba01c6dd138b7ad0f493450ce7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/\u002Blayout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c8fefddeb1e11c2d40da008ec0950a7acaf24227c5aebb045a9e7d597d39c7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/utils/prepareFiles.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29eb5c724e5c41c42f226e063e54a4ea37d719796950eeab74c0163dcb242c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/args.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"365da745d2abe4e76a3513208d7ff854a41ee433c3dcc7727bf83752c3b9ef24"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/tools/evidenceRefresh.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8756e5c8586eb01f41416efbebfcbf1984a29909295be85448eb9e0dae0b52bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/binding.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb970dfd6ff9abcd2314e22a2e44b5d793e37525916afa27f0034872d952979c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/voice/AudioWaveform.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddb3d1cb075501a0a6dce1da9b7b3c322819ddaca35e96852aa21544ed2dfc7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/scripts/evolve-openrouter.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44a8ce0e4ca0d1d32be829880fbaf5611f887776d1c9f3ad06f81b369d437c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/ServerCard.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d53cd05974efcaadf17adff045212191e608deb80c0348e443a60add0912b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/conversation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecff4155d9f52b80744521983c3ba9f4cebfdce431f0ecbb65b639f665029edc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/clientPool.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04005ceba30d08148624a4a0b076875cf6246f71e18c9731f5d01af142caf587"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/title.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc886a81f8a42efed22fa86768aae6740124ed963a5da5c82fc01552e48f495"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/src/evidence/ruvnProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3210c1524b95df79e2bf0316cdf560fe4f4ff494a3232b3e658d980a2983ae4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/test-native.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55133953bab2eaee3ef4c2f85aff10949e9071338e5119098be5051176da5d16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/urlSafety.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"023cf93688e2dab392eaae979d06622743e165203a7fdb4d59ceac5d7ba5a83a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/types/Tool.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8906845d9ef7e9b891d8eae3c589a250b9ceb4bad58cf7b118dfa0435ceaf5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e541f98757801340abc5cf2f353430eed99a1dede100a592b9726fdb9e848de6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/PublicConfig.svelte.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1008434f2cbbf81226f950334566bfb234553ec80dad19da06dfe299af6d3bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/FileDropzone.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d289192e3d29812ae09cc67a8a4c6e124f4a65e3fc68de7a4166b8a10b0948f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f65a2cbf7e3761575c0a5703cc124c5b9a8638018b381fcc6569af479defd0d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/billing-orgs/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ee9025487befbc186014b2bf64a63d3a7c3fc8f6f57c22a6f701cfa8593169"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/test-dspy-integration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a403f46f089e71ece704b71cff55b53695a89bdfa99a5d96ab039fd4f26aba7c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/bin/cli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32ebfd8f3761b62ed6f5f3323b70b22bda9eb199c9cc06f40da4311c2de10fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/api/utils/resolveConversation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3fa89eeef50a17946a08428707a96d94f7a5dcfe4d07353f4556bbb10053b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/share/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c146be1bfe511cf5209d53b33f78c28b0a3991b5578e07ed9f2cd95b7218f3e5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/document.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"228c55ce404b1211315dccd3b33d40e7833c13bb77493a6e2900a73c04624133"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bin/cli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b047aba33dfb9af1c2da15f392d5146aca19f7df89c35c92ff8adc8dcfee07d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ScrollToPreviousBtn.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde599d841101c890e17eb085a67da9fb6ca1933ee3b710ff9ad487c0fc8bc51"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/message/[messageId]/prompt/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e3287df7a1f0b3a866c138f8ee3cc08ee14df6975e4d854fff2ee2e8502aba"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/scripts/fix-esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6085a68ef71a8d3c5a850953c6a6e439f0c951e88525087b5f663bb012024c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15b1ae14c3dcbdd4bc5bf52e562bc3c50a4d91c1e5700697cb73e337e104731"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ShareConversationModal.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72780267332d2ef22ec16a002cb265390a4baee97ab5807481aacbd2a86dccbf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/haptics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa9d64795b2ee4814475af8efb51b1dcfc97973cc68a02148048605c375adb5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/models/[...model]/thumbnail.png/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"035af4d488c5982e2e016e814e339ef614b16032425acf8a39a69e2608af7d97"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/UploadedFile.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8e1248bdbc380431826cf9488577e19dbf6d59fcbb66ca289e4f6de66dbb60"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/adminToken.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae3abdc5bbe23e5904a6101880c7dac19400c16a5871359b2a5beec7f750381"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/mcp/MCPServerManager.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a716affe53b41e892ea855fb4efebb3918b2c66ff620ca337b4622fb16a49d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/preprocessMessages.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483af9c95bf4450e78281f2495d9f8379b35c572639f499978b27d14b28dc45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/workers/markdownWorker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab7a732b160e54f90de6a0c222611d15f7a59eb7c7467df0c87b7efc58e7523"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/conversation/[id]/\u002Bpage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e169dca729616f40519f1a1ba0240248fadaa713b1bc0bfae437f88f1e6e76"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/exitHandler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"311ca0e890658af2fa9768b4b1cd57f0d2e49f0026d9c5498bb38b35217b6f80"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/Pagination.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2898af7b2d0236d757b45f16ee369c48b2712f86a74ec3904cea48c2dd6cae9c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/abortRegistry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"699531eb00e917b414cd4495d5dcc893519247dff5e6ee5e4bc1b8613c890584"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"177e1a2a48a355596960117c27bd5356d6e977a761c79cc8f53b4994c71fbab5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/__typetests__/narrowing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be643307563e886c7c930b2ec528fb15925565b78b4522898600dc773c01bc74"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/05-update-message-files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de399f5fc2c23e4f29e2b8e27b8ab3380a2c39a82e77bd36d9731354e03b298"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/06-trim-message-updates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3afd8bde99498b53338af09a798036efcba9ab60878b2937daf8deb3e55fd0a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/toolsRoute.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef5c3a6c9d4bbaab21c34f1967e6a6b15f7ce41ea3dda3b213e8b523a26af74"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/mime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e47c6a7d89bfb8a85a0cbf10217ed5d0a9628c3acbf329a5b0e0e7b6352c127"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/requestContext.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1f58ea0d1fe5945716e49494fc416e0c64020802cf6ef807798942fedca12c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"facccb188fecfc83563068fbe6a525bcfba64c9f8388c1c46f7062c66b567477"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/NavConversationItem.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90692818be23f1d12b76919b83a20079f2a21a29a14d085be04c988107a8f5b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/scripts/postinstall.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0891972d4101393366e46c4c8680f94ad651df05724dcaf259b1c140127bf2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/hooks/init.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1548c924be99dfbb4d5eabb0b089639e8fa79bd74845033f9070edc10c5e0da5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/01-update-search-assistants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4556cf03929eda37d936d1385950511d7961dd4f79c4260882ee59fa63c3e91f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fb2cbe8b4906d8a95f4effed4afb5fb651aa93a96cf3c8b0ca81bb3e4ab48e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/help.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa803d729c1a959176a6f63695d3081462df52931716aed86e29740416205ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integrations/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0697baf4248e081efb4083945ba458f5cf836721c4ad39b257492dc1a0980dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/updateLocalEnv.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a73f90438aba0b9c889f4331b579c2aa83822df13dcc71a635aa0adcc1f412b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/02-update-assistants-models.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20a449f3067848ead977e2ce38286d622bb2b9806c05d5d58900055b5417011"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/conversations/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f09421a0f224243db89a94f251b46001f54054a65cfe4b87316de734cff795"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/InfiniteScroll.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8e263ab7e08382e3d92f6a355397d9baa9505c4be24c11db372deae7733f94"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/test-binding.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fc1684d3822caaa6742e29a0478945dbe8ee8a754aefed6f08daa5c0c0087c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/generateFromDefaultEndpoint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c8f3a997da895f9940d08ef418e3634d7943387edd6ef29a293f83ae724a69"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/__typetests__/narrowing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77ee58a763753b63a54923c61f15f8441037bf1a770a6156e1c28e9abef3224"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/servers/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccdfa3225efccbe32ef331feb260232ba32c69ae7ff9f015d55993488ca971b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/abortedGenerations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"694492f6b0249d36a29dd0c0a15dccdd3b01b58852d69a4d272b9a9fee368686"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/endpoints.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cc122a1756a2c59521d12fdebd8816ca159e37ba834c0ba6e6723e5fa8f060"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/EditConversationModal.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bff31285665b21a56b1e299699bd3c1ffa1fa0a45ce983007178c0f040a0081"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/logger.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca7c169f5f3aae5b4afd6b0caaaa5635ed87abcb12b9225d480ba2707d0682a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/conversation/[id]/message/[messageId]/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"991af80bbd7060b8d7b5504635394c4a327405905a2ea4d5032f122108aca893"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/getHref.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefb012e359be4cb47990c8ad3e27b3b21cdb2370a82b73e8e3747026a6318fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/scripts/check-wasm-imports.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f197bc59dd44ca17e87eb2f117b3289bfff9987b0daf8a66e6fafdd03e37b3af"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/conversation/[id]/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4444904b0b7d969be8b56558e670f4e5249a6a39214f861de2965e3dd7b23253"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/models/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a9dd00bffee3abf6066f8f1c58c78d7ead498961a5e469000e6a1b534178fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/updates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c75b5106f32c77351f4c9a11aee37e511a41c76903d0d395a5b7829261e5c32"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/scripts/check-wasm-imports.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd5eb2575400ce245055e7fda732b57a13638a36580842634d08aeb17006994"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ModelSwitch.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7631d9a9db308aac3dfd17719346bda07acb14cf2ecef9aeffe926415aec8305"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/TaskGroup.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce14305e5545e9f5f3d4226d225b6d288d6c177e18fdf391c12ea81b9ef9211"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/mergeAsyncGenerators.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d1461e925a1d81764dc9b0ccd8abcd51041fd246c3951650d0cca422e80ad6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede94492e109543b49e82b0587cc73c2a515ed5c989629d5fb5764b1ee37a6f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ScrollToBottomBtn.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc047b7436ba7da5a2d55878f1832654c635fd4953e4131c7bea6ddff77d66a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/hooks/error.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0870cdc3582b148c59c34f63c666c81ee7c121fd5bf6cdc7c113ac45adeb6405"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/formatUserCount.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"090e784868491ecc292cd22a40c8227036015f34d339a410377774a6d2e4080f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4feed19ec0e73516d4d5650a744e6c3d14f5cd0dd295ef57f7dde661737ed5ec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ImageLightbox.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8622ae0bae5bc6a3139bb046ba188e928a68c1019a0e95355708b920b4f6da5f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/OpenReasoningResults.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b279670699c84c125d173bb58fb50013fae6c29863085d13085485f49c782353"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/MessageAvatar.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7364a2dfc490b41d51f56dabad65b9ec01143fdec39ff5900e63374c6d2bbf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/files/downloadFile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3e2d2bef0661a81290f9acfbc32425f04e684e935b75c3fc8d1c0822b790aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/r/[id]/\u002Bpage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6017c418285fa51df23e985f2509a7e8380e1e95c10362cf4e89c29cf5c5a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/buildPrompt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97899488cd4dabe37416613ebba15675a379aa81fddf5aefec33c31ad4b6e323"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/players/AudioPlayer.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70b1f76f323430d41a0173708911080b8a1f6d956149ef07c21c5d7c1fbad10"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/chunk.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ab590c19c92153be761645436a994ba19294298e4dec3cdaa1c04966f67f08"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/searchTokens.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"485df9529643f926b898589ae10fbd6e6497d7a2b5ac0f8fee1c236dfbd568f7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/refresh/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b8c2f8ce40cff453995e83c786233d7890868cb757f3999a9b03f426a41c5d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/hooks.server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86187a6dd935a023385228a72c742ea2cd10991b35e1200ed86a04b813726a6f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/08-update-featured-to-review.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9912db6fad5c6af956192cfc84429a2fe2babb750e52d5e04c63de3ce8d1cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/openAICompletionToTextGenerationStream.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8900044cb153bce7c368d4a5e1852f5ab82bacb29aecc25693cdb17dac3c24"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/hf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da79e45c591a41c55488abbdb095a27af1dc592af6545a3ab557362157c628a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/backgroundGenerations.svelte.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"321b245874cf17cd55c54180483a38b0eaae9204cd7046f3a98384e80122e8a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc769bf761efd88e17ed97fe8e1f546da40c4544823b4978cd787518ee36fea6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"505ad4edcf29dae99576354b3d51a47951253a0911e6d9208f8af60f303900da"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/api/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11ddf677f69e31bb59560a95383a7c366c6ea2fd6c54005eb740aca91487c27"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/DeleteConversationModal.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02d686d90c79061370c4a25796ea0e35cc563cb3e04e20d3846e78791d005ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/usageLimits.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27b2a4f399d227c11941378f741577f6f3a8524bb0f523e865acb66eca6ef89"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/10-update-reports-assistantid.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4e8143d77074ea9de17100758ebf8cc71e092ffd2d5425aa1cc79a5e1235f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/files/uploadFile.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c822948890c20a297617c7ec772eb78a7758228c90dd1515b62d9c7b016065"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/multimodal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f3a0787e515b169b56308eeb06274039715b81ce0b2c08705651ff68a60493"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/[namespace]/[model]/subscribe/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"644f0fc2451bb5140a4f25b37bfd73b2c0a7b0712361f738303b6b507bc24c87"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/[namespace]/subscribe/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba9c6045f2bff88212ffc82fa70487b8f98d71c71a833b5cb3f6cb44c5cb6c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/createShareLink.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b5916d369a7cf479f9eb0d900473cde0b6b5accea94ee87fa6c72ec1248436"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/api/utils/resolveModel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaeb05c09d07b52f958054b72db2ae4c117a6317badc22bb38ca3d0e6b39e1a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/models/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf15783016ae0495a26dffd061eaab6d56a94c14781fddd4d8943894e942169"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/burst-scaling/claude-flow-runner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefc302b22a85e73c7f4ad86a67e0b4ea7fda7caf3bce72cb27292c571d66dd7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/scripts/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8752b5d60bf27a2ed4b85197300a5a5d396d019e7aed4f83911cbb93326c9f6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/sendSlack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a1187b27e58fbe0431ffad026274599c1334d9c325b061beccb417ff33cbc3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/reasoning.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31286542667a1bc6815c7003a373483ee0c00d70040fdacf3d3f8f7660fed3a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/fetchJSON.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a4eeb5485e01b60a5f9c0861ceec89429804890a395d84bd0fe044c309ea4f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/conversations/import-share/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94b167dee462bf2f7da5bcf9a357a7c5ccfc10cd96941cd61e2cd9372f456ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/\u002Blayout.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d7498fafe6a33ba7d21d6a16a0b030d30c507881702bfa78c02282b2e4450f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/Alternatives.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18f528ee9345c38a788aae63226860f00a4e977f6533129135b37ba53b2e90f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/api/utils/requireAuth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc90e567c0712bd0dc606f60f3a07c429ca7dc045a45a62fa0c0a76e04d47ec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/hooks/fetch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c8af623703d93b4cd3643a47215230974faaa1a93451cd1427118263d519c7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/serveCmd.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62237c1162127bca6eace8760e0d04ca6c5abbe9f029a7fc033ae56d29f6df08"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/Switch.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59465317962f74dfbd5e816130cfbcb55886be36e570c0b18167fe1bd0ac1b14"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08add84b2af8f788e9f43352a988d5890151fab6e98004618ae762be8284c986"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/utils/routing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e77bbcb922de0a05fcf72c7bd512de556ce598ca7dc3f31d6138e96a48bd507"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/favicon.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae3ca7a2100d1521e765b2fb4196e7995dd8d232c9f516013f728301a205b04"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/__debug/openai/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2ea22b3827a42e56a265b81f4d1e9627c996f5c24b0e611fc36be0bf9681f3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/BlockWrapper.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69910f004e5fe937c7006782dcd8886115cf9c6e8b49f9b540aa307b9185c80b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/user/validate-token/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13dc1adbe8f6554511bdeaa804f9c0b8b824422d65974dd01504e275adc6157"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/bin/cli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3936ce83ec340037f975d465516e2abeeb0b48d17f012e6ee2916a11102bcc7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/chat/ChatIntroduction.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fddb59ed5b3379b860663f6a3d9e4e5d7010c86996282c092492095ddd837b2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/types/Semaphore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c826e60e8389a7bcf7772730c2c219a507aafc0eef4e3a17312b3967113cde80"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/src/fusion/contextWindow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2f3bbeccd77a3fc8b825024903058b03d446c9d0df1a0ff4156eb09c123022"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/actions/clickOutside.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe6fff9082fa8c38d84a712a91722099ccb8427b7b2acca3597cd02ea971b16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/logout/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4faaf9feb7b76ba65a6b4640dd4a652f5673e433d88de397759945d7bd2485"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/metrics/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6598f44a7ff096b23d52b57b06aa1432a3d8437fddc89ff5ef3b7ca1746f1be6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/auth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2764d063f95bf6e2ec6421692a900a36b6e1d684dc7606c3e2bcd695db7de3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/debounce.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f502169c983c0a9af054e0db63863b25fea79849cef0d0c2a0dbe3165598d7e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/hf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4b91ba1abe0b0e462e8027d62ae5015a0f765e0bfa9744988fd1488335a097"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/examples/metaharness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4940295e1d1b5dc486e531ea36b2e4b9533cf82b2469abd78fbe295d4de793"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/HoverTooltip.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c0e12852ba99aa330335ded0d51a0d835c57d8c288618f2878c28284daba5d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ModelCardMetadata.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2864e1273832d6706523b5300153296528c92f19e09b32c87fe9f9f99010786d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/isVirtualKeyboard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"099631be7bfdbe0bcabea0f66043b8d47f917313386f3f162babd983988fe6d9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/admin/stats/compute/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2558e30334484056b9c18aa76fd6d2ee57dd2cdd4a6010f51cb1a202ad1423"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/platforms/win32-x64-msvc/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fc573be3a460ff52082e34b56eff36cc28cfc722c737c6f76181f49e5d6b45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/api/utils/superjsonResponse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce36cc7ae17176fef3edc0f930d11235f7ba3023eef427d006204c3f68663233"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/user/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adf1b452c2dcbbfbf5624a95f4192faec8e883a1c0471a01c8e2f97efe4235d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/platforms/darwin-arm64/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"347bc23c36913e83d9c4e156d64cb3029d6b09446c77a60ec73d6ecb758ad23c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/platforms/darwin-x64/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5085cf1e3faa3e0ac82f4dd58186ea603474ed1e9e9102dab8a1c4da995abaef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/platforms/linux-arm64-gnu/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a28e2bd2e1ff2a99e2923ef97ce966ad1f172a3852cf7e8d89a232f2857661"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/platforms/linux-x64-gnu/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db50e3dd75b7706f466eede24480104a1402e8a5c2eac0dd2844360536aec7d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/file2base64.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0565c0bbf3be052d801675b18bbf10e3a278834998719a288762aeea0e337b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/models.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cc8be026354e254ccad219811d63421f08e55f4f3faa771d1974e0c12f907d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/randomUuid.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d593d1b5b902d0881f78479d10634b6d0162858d4080bf437e5f1d6f739958a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/models/[...model]/\u002Bpage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad1801064c05a1c3d4e94ae683b68aad292a86dcbfb2873bb875e49a2cacdc4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/[...model]/\u002Bpage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07132d36b5e13be76b37273b3ed1857cefc44bed05fb11f7ddd562135f642ac3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/findRepoRoot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe860d1fd49516611aff381569c8dca1e213979e3fbd9f64bc689e3d4489b485"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/shareModal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5815b55d6aa20e00a68a3ea337f86f04fdf0ff9788d6b8e466bed08f64c4d44a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/cookiesAreEnabled.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eebd64b3693a03ca11e54ca5b551120a24f7d8da298c7d63d4b92e67ada3ae7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/urlParams.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d2d1dcdf40da2693469159f30861a487c151aeca8303501ab5773ec5182531"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/SystemPromptModal.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8845c2999b923d1b206c5830204fd000f85e7097e381c937cc0ba37806928c13"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/WelcomeModal.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a21e062f2de132ec830f23b1bce4b14552bca92d48930a293a9c401217bef7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/hashConv.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2debc82cf8b0187ce644591a07fb338cbd6496280a96e0af35f5d78bcef0c1a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/stringifyError.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c4bac53b8d18001402a615449dfda5fe8f6bb5708ee14dd4d7e1ed5d5086c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/scripts/check-artifact.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c525e603478addf82f7d2906c782d9d304ad85bd7da9f967bfb8f06a27a2c73"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/PaginationArrow.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a07cd8e4cc4ba5a0976d9d5ef182280e51f0861d2b3b3bdfe83dd1356a04cbc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/SubscribeModal.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"830778f2b63dc8b3283b6597ac9abc6074e4d38f6907b59d2292489b684f5c0a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/constants/mime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2468ba1dc6e31ac3c597ebe90ffb22839e95596a6d433ffa60426737edf5118"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/apiToken.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8110a19c45e772e4a6f5e9b587f7a122c9cd26c32e065aa66d41b0bb837cc172"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/StopGeneratingBtn.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c2ae39a649ad039ddd47550a685b9daa967a9eaf727736c4e085c692154fa4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/Toast.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0443d52525556302fa57712b711eb7ba4e9c6994ea3debc78db6736b93a2f27b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/Logo.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3a2836459b27173be48b38f852b10c5a939c3661004c947872e5d56c598430"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseStringToList.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"185d7b83f970b7dc7102484819d9e15032b06ad988256186854a39ae11a4b152"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/models/[...model]/thumbnail.png/ModelThumbnail.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a878c514b57f08dc8d966b9d2dffad6d1dcbdd0ea6fc284617a3ff18e44528"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/RetryBtn.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b0b361f04aa7732626c79cfae447d8fb52021e277f3bb9213ed4b60674c1aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconPro.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf235b440fb3c2561dcee1506e908fb4fc541a7481764d96307a286cb5beaefc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f326cbd6a039f6ec8326a4471789b86dca58cf8ba13abb535cfb773d9c6c4fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/pendingMessage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf0a01ba98d2349fd067fb81860c3cd261927d7b9436529ae26c1bfbd29fb4a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/timeout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf3e9be06d8781449e44870abe39ab0eb8d5def26a09069f1c80b77b31aea16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/scripts/check-package.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de308747b016744aef0c19028557c1ba0764612bb33bb09e1e9c9aef5fed757c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/AnnouncementBanner.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b34fc8f5d6b8051155639a2d53f11eed3c9ba7efde4606ba8f2bc86fdbfdf0c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/ExpandNavigation.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf52f5dae0834fb9dc25268dbb7ca9c97cbb2d3974a7c3a98fa26a58309c49d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/isUrl.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7a1b9e9d5b66a43721f1962681b6077e858849a153fac22beb363f304b1203"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/[namespace]/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a70427076ed8ec129a5524559084bffec61740da1f8933830611d3035cc9bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/[namespace]/[model]/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2989fc69c4b47dfee70c7a3aae4f50e6fa84886ad6bebc9561d9db7ed764e7ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/src/agents/architect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8ca805bc1c859aa7e71ee5f2c18ae4f25572f7bd5983248bcbc4a8a44d7d45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/src/agents/implementer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d52a20e685aa69cb1c7cd5e5cb32757582f418ab734f232b822e295e8179c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/src/agents/reviewer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"134dcd596103144fc7dd62ed92397f3291060ea556f527e2b394db5b0f01e2ee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/src/agents/test-writer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33be6101f57b44b5174083fd4afcfcf8226dc8c90e5db7d88e07eb28c880a666"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/getReturnFromGenerator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc49425943570b0b2a9adcaf854cc5b80518c9e7a6bccaf3e5f5f834ba42425a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/isDesktop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9692f7a52d80b043dede6474bb20b04da3c97506ae88ab64b16a21d57910d7fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/sha256.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fe6694fbeaaa143f14f3a833932b8560aa2828b6135fee606b7662a6d64efa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/models/old/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"771165177c10af4442e8548e002a6119d34e8a81d7876e3daffbf190fcd8b73a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconBurger.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee80705c16baf053ce08b5a2a06b509cb4cbbdda21de6a9b8fd5c654739e517c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconChevron.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"985e4eb78238a19807411b1da6e63d90883e018ff7d86b20dd91f7efbc1d0b85"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconDazzled.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28cae061741891a20c636ee3c7bcc09a87c468c6b7ab57b4ed3def421ae0bc2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconLoading.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36cbf82219602fc0ce479fcec301216074b81e3c5bc473d771a987877d15811"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconMCP.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d533dc346950336319f4ccc8b70ffd57048e7d22ee8a1a8c75698f65a660bc0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconMoon.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6f4f22880774bbbfc74761a0d9e053936c9455b5c885a1a457b082499402de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconNew.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2354f3a9e801fbe7ba7a3bed6c272ff2fcb7d6a2072de4898359f9c97cd35b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconOmni.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d642b2ec54062959f8875742d7aeda8b951d01963342cabe8abca407e7a2d05f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconPaperclip.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133a25ea3fa187dd1f2e7989d2bf085dc3cdcd4068af40b563606188f4d057af"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconShare.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2992cc79ba6eb10e73375a50c6f5faf341712107b998427499769135e22cdcbd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconSun.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a3d7e3df1e16cfa0cdb6bf7208b200578174ff6b9cc4e654fddfe2991311bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/LogoHuggingFaceBorderless.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c8cd3c81c5ebc94a29bb1b2901c91603125b585877f2121059a14247fecf0d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/types/Review.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21503e7c8a588f8ddbc6923dc20c2c27d999140334685efb1f61d281710c821"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/deepestChild.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4b9ed98f2030e1b3626720e3be21a48b4d8dcea2404339b4877edcfbb7e552"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconCheap.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24fe52edc01a3f29a6348d269d16f4d5016f0df5444d781e4ffb0067b9e3947"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/components/icons/IconFast.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdd868c7921eaf8fea8d8df71b6438f12cc98804b0449c2ce5d3f2f0b22b8c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/types/UrlDependency.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05f95504114e5a05db6fe4590edb6d428d4c5af3bcd14f7ae1f5beed3a5910e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/login/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c15a33498a69e78b3ce14da97a98496c9f450068bf6cb59b20ed2b6661d355"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/isPro.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81c789bb513c86026b9cc3417363a2ad4056f1c5e95f79c4783122d070e31cf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/isAborted.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5071a75b2f218505c9eefdc82d318afd1ff4005e22dcb8ea365ddda57dc47e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/loading.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86498262e7a386a2808e28ddb10f89de0e5eec560fe658cef3d2e800349787a5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/pendingChatInput.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c43e7ce2fcba8559edd71a2fdd15e9bd4f733b5cdc026ceae3a80ed7a9d467e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/sum.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b969f3ff964cfa1e3eddcae6fc0d5005439777e53cff898b55486bba0cc5a69c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/healthcheck/\u002Bserver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1bb2cc68586087c4939e8275335af6e6c47f34e483cc9c4b3b7811a5419143"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/privacy/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"944f009686981ad1f26077215bf3ea8f7726e8c57d782af6693406df6523d37a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/scripts/write-cjs-package.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ed4c0352a85429f9cd6845ccbc87e015951f149463c12efe28cee64b434780"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/\u002Berror.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb6bd8001c3164a9ed15215b98b447674b86b451c839b434122684569fb6c6d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/constants/pagination.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce32a061b6049b380efe9979ae1c4c5d57268df23677c747774d57876647443"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/constants/publicSepToken.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e1e0d19119b4294431103c00ced861f50f912c1c1c5bff10bf62f6b7d91c63"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/\u002Blayout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2510eace05060738767b2b24a0b48692b06b0263004b24e32731cd900c9a703"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/settings/(nav)/\u002Bpage.svelte"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b578c00c749b2f37b97ba7a35c3744314e07d1056c28609ac40e2be72ceac840"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1252 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0918f71dd6097ce619d6a42638aa34843bc0678a56bc97abb8ff057907ad7cd0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1242 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-learning-session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1a1ae1e893ed4607e8be3e2938b45a17ad293e32878594a53d4d6847a4683a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1237 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5a8495157ea68deb6b27e9a66428832661f9dfd043d2f5ee61ed9a4556e630"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1213 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f07eca100b8a53098e0a81d1524c640d2209c5b9ab6a07065ff0b93e2a62f42"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1163 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1436012bcf05481ea52929cad7249272bdab48ba6f0bbdc38fb4c6548bb987"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1060 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb1eb93c87ad9b7b0292205cc10a1869177528c551db5d589523d0b794b2f1e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1059 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"017f1b67930200aa49643cf49bc61a32911e573e55afa619881bf171e935878c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~971 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69b48cf59ffbadc92275ba2cdb7d1736774729d0319ce877c41dc5962b81437"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~936 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78edc10da5237f9e33f2818be22d68544000cdeab867913aa8e7124924d7573"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~825 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/integration-tests.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7b184d81c41e3116f781579dc3cf5e00bcebebe7a08b1213bbbc564cabb288"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~749 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/storage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e56312203868ad2b2c15424f672f8e3032e48a4acc4230f2626f8a8792fb5d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~696 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff551cef3ffff7b10270aaa9e74e4c09c5411072fd9361501d959f3c643e643"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~568 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff015ed53812f96b94179969ab4803ab51bec0360748e024c0965fc76c1ea71"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~552 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de4c96ac7a5d769cae50067e739b887486858e929d5737229c660da36d8102b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~508 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), but 4 in-repo import(s) from 4 other file(s) do name it (npm/packages/cloud-run/streaming-service-optimized.js, npm/packages/cloud-run/streaming-service-optimized.ts, npm/packages/cloud-run/streaming-service.js and 1 more) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/load-balancer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de99790cfc0b3f306bed3e332e586b708c3f84e033e769127a3e7adb71b9551"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~485 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), but 4 in-repo import(s) from 4 other file(s) do name it (npm/packages/cloud-run/streaming-service-optimized.js, npm/packages/cloud-run/streaming-service-optimized.ts, npm/packages/cloud-run/streaming-service.js and 1 more) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef8595d756c03e8d2d71e7410de683ca386f9513020273e16af883e525007cd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~477 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c631a2143ae9ae17190034bfdbe3905c3c853af9c3cfd719fa50f5f43b9661"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~452 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/routing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30ec5795494630d656e43c7a028c52a0bcdf845181e5f82f2bcc57d20eb4551"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~447 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"334a1cefe4c526a5856d4c1964ec933543f860da78dc003e3c7faa9b14cfdd72"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~400 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/hyperbolic.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f670740eeab492a9dc3e0758b936dccf8a62e1bf05eb5e9107eba950758fb7e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~392 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-training-fixed.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"677515996121bd2a233a8d9342e36bec59fa81a689dd9571d3ad0de4ffbabc8b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~362 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/cli-rvf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da36d662bd3fea14d09667aae68b205f4bbf1ed5c572cedf6bc29cdeb9cdafc3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~348 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/pkg/loader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96500c51e6d1ef91bfd7d74c11dd3d68de587b83b67bdd390ed4c227ba31c12d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~319 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/sparse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804374279dc261e51ba45cc216f6317d882402cc49b9ddff777f3b375e6c7e76"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~311 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (npm/packages/ruvector/src/workers/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/benchmark.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a2bd38daae513439e70638e612c67c6b01a34d2a8c16f152e6c21c9fe37b5f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~271 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/vector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cacbe623b0aad795073fde29b712b82f79d69cdcc0d400a42ae66d406434f05"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~269 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedd72ccb009742fb83480ea548feec47a3ea36d70c1cdc315a5f08f2ef2a742"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~264 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/benchmark.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34da11fb14cff66dda745ec1b96958b86a5cf6a2e64be81352436cd2efc22726"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~260 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/sync-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2961281df710041e692788faee8c67c2da3bb714ef7f25ae8f8ed5f763fd8bc6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~254 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/replica-set.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4591f75416e31533d11fa02ecfe51cc13cd61a22e74b8ec111b45ba295badf80"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~242 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/quantization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ec1af3e64db3f43eab433bf198e44e7377e934ff61e9d60941fec6b13b29b1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~205 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ospipe/src/wasm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8208f6323c24386bfdcc430625aeafd3f6d5e5bc1927079fff14f0bb7842399d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~205 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e53e81aafdcc13d80e5849a7c6d8726e1903d20eaa65483122ba6986ff0b63c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~199 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cabf265d21827afaf3b9fa51595fccf65ccb17cd9355975964ce10a1e67fb0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~190 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (npm/packages/ruvector/src/optimizer/context.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/optimizer/tool-schemas.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"996d7dfd0c5b1f7ad556c4cb1ec6bae6ff9fcd5b8ebec838e85fb478bb763246"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~189 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b207d227d56c968d8d4762c490b43edcc1b2d6d482a6371e4742ece682bdf0f9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~185 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8635800f3eb50b30c40c59dd30bbf0f3cb597c9620cfe585f8616dd794e7f5e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~184 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/learning.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacb61a3bdd49b3ad08dd08d18a032625cbbc26996de2fda7e0d3e99646baaa2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~167 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/gnn.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54001101dd54c7c1d54e10f5001cc82a7f1320cadd8ba8b05c78e5664cb8772e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~152 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/run-benchmarks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be23350bbefa1cade7f5483053127171ddf603f57afd3901c93c1246a234de2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~149 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/optimizer/context.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d865a2b296a85d86808224d1104bd379650104548eb58e45404bc76fde6816"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~148 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/replication/src/vector-clock.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1abf1bddcfef91b3e0c9e3bb3b0a8c6bc889061c357050eb5df8bc8cf841376"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~145 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm-cli/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"633af19459b82717c72d24eae740fe9c7599bb7e7f04fbd2d322e55a2804a1cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~135 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/log.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3847682e9190ea2b2eaf6539d1112d1aacecdfe84be695a6f9edb4710dcc1636"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~134 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm-wasm/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd95d0c8e09f9c933fd0d3537238ace0a9e88d5a6f4fbc305a56b569c673103"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~121 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/attention.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c7bf216449988fd429511ffdd4653b607e590ee7c4c080085e20a771c81b79"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~116 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (npm/packages/postgres-cli/src/commands/install.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install-args.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af82890fd1cf840bd7f4c22afabd67f8810f99de605de9b7e6671d7228b7a546"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~107 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/example-usage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"912ae001ba4e42ca884019ab01433be26d78ce9247810260cd647f2ba049942e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~78 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/src/evidence/ruvnProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"993a02b1d4c64b5537f3d3a69bd93174a6d731fdea69a24e8917f4186300aae6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~77 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/test-native.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b0226979a16c039252023cbe9c75f8cfeb4183a2cb6aef44c72879323bbf1d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~75 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/types/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c1205bb79acc9dede48ba44290870af7cc6a2ed11cde8c2ca49ce4bd9765ff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~73 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be018680293ab64a511dc703aeaad800bf00e674aafa614006d0a4294a0fa98f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~72 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/test-dspy-integration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"571027bd8053159c33c4426dd7068fe3e16a9002e457e4e40625ee5887de058a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~56 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/__typetests__/narrowing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e1593381aa299008cf26b0d862ff43f05fbc09c73ab9e6bffc2ef381440aea"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~46 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/test-binding.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"315df807ccd7d7d66344631582d8132e7794c62a822f80199015e5b30eed9ac6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/__typetests__/narrowing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e6725184eb102b7f1b2a1a05d4f24ab6a78dac4bf4769b87d5f05fd33bb5e0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/node/src/gnn.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7152c17ad5cd22f1419d666f3dded20c0d74779d20bd84c78f2796048c95e17f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/src/fusion/contextWindow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d2f5cee7f98a9b9d1253758c9c155e002a32ce7bf42619a0ac8f6c78a03694"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/examples/metaharness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f6154a41dea592d72aa83c1fc71f44e6ae4b25bf78fa386dcf986b510713b1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebc3b3419e2c2c0ba51b005acbeda20f494fb4eb0fa1c3c34b800245c01d413"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/src/agents/architect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fff1ab1821323879917e9a383359bcbb811177fc5efda0951badfdedd4315f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/src/agents/implementer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bcdf5a34d3f066ddf9a3759da2414a62f60823c400746cf12cf647b13b16ff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/src/agents/reviewer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23106d160db831d401813f101dc28d5efa5836e27d2e8ce43658f0978df981a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/src/agents/test-writer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"494ba8e4baca2cf7d296deb409405673e634b1415157aa1ae1793bac6fb1d00a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/all/clustering/cloudflare.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f88b1678f67a54e16fc1876020e5d7ec4900afc1eb957209ef3adc85a7deb4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/all/clustering/ivf.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9895234fe28d3697896ee2be090432c6d024089d6a6e1ef3d645d0c09f07749"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/all/clustering/metaharness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb05b2caa1e8a77b57ad5d3c33d1738dfb349c81e178aeffab3e576df99cc15"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/all/clustering/quantization.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a607e9d63e49428f81ea6ebf9f30f88b2ab17c5b9dec41b5508eb56f848b7ce8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/core/clustering/cloudflare.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43efe9380cc779341ebec8d16ee75dba65b217b53882107aad6cd81f9492a247"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/core/clustering/ivf.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22db99f8cd1e0400a523690b01cbc4cd93a205598c6ff6efcf0f093480de4b2b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/core/clustering/metaharness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9980921efc8d76c6010b44017f1f5961bb12e15f424f74ae4a067c2bb07b4798"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/core/clustering/quantization.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"109d04e8727ffcfb6124dea3633f6bf748c7c027697f113c1adb3c65d26dd232"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/clustering/cloudflare.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2282a6f075852de5baee14f761a96d9128fb47879bb5b3b80421174c9119cbd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/clustering/ivf.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c1086ef5521c13595d43c08b5b40ddb2c46d70caee2d9aacd2b265aad893b7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/clustering/metaharness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b251db3fb04f1c3aee5795b54a7be5e71cf86c84f18a4b2ab054db8eb90f29"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (494 application, 321 tooling, 352 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/clustering/quantization.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"498ac4048e0a603b165962ea2a645a95d63379655f64e01899578523502aa1c9"}},{"ruleId":"R7","level":"warning","message":{"text":"Stale committed build artefact \u2014 its source no longer exists: npm/packages/rvf/dist/backend.js.map sits in \u0027npm/packages/rvf/dist\u0027, which npm/packages/rvf/tsconfig.json declares as this project\u0027s outDir, so it is committed compiler output; the map itself records that it was generated from \u0027npm/packages/home/ruvultra/.cache/weaver-lanes/tmp.A3uYeI4naI/wt754/npm/packages/rvf/src/backend.ts\u0027, and no such file exists in the repository \u2014 its emitted file \u0027npm/packages/rvf/dist/backend.js\u0027 is still committed beside it and is stale for the same reason. 6 other map(s) in the same directory resolve to sources that do exist, which is what makes the absence provable rather than a path-resolution gap. Delete the orphaned artefact(s), or stop committing the output directory and let the build produce it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf/dist/backend.js.map"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62991cd29d04c168f328a94f24e25ee569b07e91383254df2a39e4f457ff0e79"}},{"ruleId":"R7","level":"warning","message":{"text":"Benchmark script nothing runs (~115 LoC): This script imports the product (\u0027../tests/load-addon.mjs\u0027), so it is an authored benchmark, not measurement input \u2014 but nothing invokes it: no package.json script, no CI workflow or build recipe, no Dockerfile, no other file under crates/rvf/rvf-node/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type \u0060node crates/rvf/rvf-node/bench/async-bench.mjs\u0060, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/bench/async-bench.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc99273e155344d9e75fb6850ec01c0eafe2374fa6a730acaaecc85d7e04e74"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createCICDDataGenerator\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee2fd0b251cab656072c587b5f78a47efbbb5dad2b578b7e5cf0dc6574e053a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createSecurityTestingGenerator\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/security/index.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c86c4afcbea07774b0b6c58621d52fb8fcc05a163ab742d71d3606dce8be7e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createSelfLearningGenerator\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/self-learning/index.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c4be48d21f6f54f8090e689c32e14beb0d1ce804d685b7809b4c23b3d8a07c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createStockMarketSimulator\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/stock-market/index.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d4d1d1073cb6734aa3e9695b121649e897e276d83ac1ae6b6c9765407e5f1b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createSwarmCoordinator\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/swarm/index.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ddec35be726d040f67142ec728ecd6829732a99c75c182ceb8e7cd0337a9c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TrainingReport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/types/index.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf94b136171f39cb6c15e8b5d8958a06eacd72a581ba9b1e3b5db6a6f78ef5d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createRuvectorAdapter\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/adapters/ruvector.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a067f4643d6faae321b9b5046a3fde971093d6192577168394f212aa58d06c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/adapters/ruvector.js"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"89503a86335afa21a14e30aecd475c8149a07ead0f111e15ba5c10ba48df9a26"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATASETS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bench/datasets/index.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f424814d5dfd686ff6a054943e110f3743611b25b38a26708ba401e8fcf5df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_CACHE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bench/datasets/lib.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6c57fd90d650797b5ca609eb8bfb838d329edbf6703723372bd1e299709ba3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027optimize\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bench/lib/arms.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b5ccd8b3dcd7a32687dfe9f93bf012d62482d3a9ea210783635ce29c8c588d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SEED\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bench/lib/fixture.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"40521a3a50e02f2a2e2f1bfb23f7e3f672c89566e4ff8f1b944e26cde968bfee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027N_ENTITIES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bench/lib/fixture.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dff961e411dd41bd9ea2e49257720237d18e76c455de04eb29bf57ec618fc0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GATES_PATH\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bench/lib/gates.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1022f99c27d0c0d5eb13699a02c5dd423e525d129c141c3ac70d62e16ff2f16f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027meanRecallAtK\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/bench/lib/metrics.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f724ca7b508a85e1846de09955716729d6683f3786a7a283089491a84cf0d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_resetBindingCache\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/binding.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65123ff0b17a951c27cbf2bc48848ee2913fc2f4f504db6f1032d8f8a1fd5dd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027main\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/main.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3a8abb3e39bcccb793c855478f202de32c76542ef9c6a7c85f7379a7005d8d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/ChannelRegistry.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea53d0041ca18d3660c4b6c1cfcb57fabed47b010bbb60ad2c0a5c3177877f8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/BaseAdapter.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"75594c4f159fd2ee82800b862a223e274e22bd56c31a9e666bf20653254e595e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/DiscordAdapter.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c9ba7d9b66116fa78a8ce7ec2e81cf2d170998ae7aea879f99c9285e0e3285"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/SlackAdapter.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3dc793c8323c57cb9640050636e52ce1851243e4f00f2bd6fe19577295a142"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/channels/adapters/TelegramAdapter.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d51eca34f1f2caa1ffc09e62d99b61b6fd08190fbfa05a292dc25a923aa2198"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/agent.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"325629471ad89b4f4e57ca6752df22f8aaca01b98bf05703de93f2bf4245dc7e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/channels.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbdf6a426529a21eee8233c285179027acbc38b8282fc4094788e4f7a9744fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/deploy.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f27771fa9fc1570d82b9475f09af8847f4089eb01e957d745a63ae39687fe3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7378be1d5a60eb148b8d00d570c208d22691c0b9caa8170880dfbd1dd0f855db"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/memory.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0127ef91e244778a6d72fdd0d56f9c66863f1ab3a236afe48de4f9aef2d446"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/security.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2599be1249d6d6e775225f76df11082198fd92e0ac4a7f1b8faab43b368c060"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/ChatEnhancer.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f1f643dd6356cb5d53d9fdc5970d7a976fe03cdea2242af8ec1836eadaf602"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SkillParameter\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/entities/types.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed12faf1e208ee9d83b6136ed4d68cdf9f926fef262ad66d073229e1637c3693"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TaskStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/entities/types.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f775c228d1274c50223b79c9a839b77413c53a10ced86027e19b2a7c32b0ca17"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SessionError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f335aeba6b102344ba7e8f974cc0de6398aba14a2c8ea1196bcfc1bee480d5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MemoryError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"745cb51118dbcef1919ee0e349ea0ac3ab07de1d22672fad3daa82602729a884"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SkillError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8884ae9d2f2e270e4aa4285f2f35484af557874007dfc8edb373491f7865ab8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027LLMError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"335e3b50db7ed26ae86d7ccb01af5c8d01dfe61861eef8d795c57a656be96ebd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027IntegrationError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f456478515bb5503912a08a694d92d533e50baa0632b851faf610cb31789791"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ValidationError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a87f13185cbd2b2beef820c76ff6102a367f45a9fbedd1988505ff43e3b6a23"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RateLimitError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f61ce1773dc34f0dfbb02fbe41276a7623457c655bdf0bbbe9fa736ef47f2c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConnectionError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b12aacf65ccf08690dc7c8ed579b98425a9bd2745ff82d5c1073cff57180f6e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027AgentError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6847c53a5c8d3284a5195d0f2a6245a8482433d012e015e845159e1ab16e79cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ErrorCode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/errors.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a7d46f5b3700761ad32becdc8478c8cc5f4eb2c52d66e15d0d2d513f63c98f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ok\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/types.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb30fd4e4663e6a5954d36fba2a418efe624048ffb54dfcba2113b664599a55c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027err\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/types.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb0017a9fafa09874486328334cdb2c57d5d0e3a8972b5ca4bb67d22a2e4a71"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"86240680e5a272b661827494bebc118627a6849938f834d6eb34f9c4bb19b323"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfff5ee2fc1cef3cdfc8a0197b55b0da468f1b831569c5866d81611edfe1c167"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/search/BM25Index.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3def21b54cb0697ca5d44e11b2979906a85c96e7c4a70c8a43e16c613c17808"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/search/HybridSearch.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"312fd40ca0c891ee905967466b22df58c7648ead4e448fc178780e121a2ddb95"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/plugins/PluginManager.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"073a2f76fa835c52604e5f0adcf61e00f0e46955c7717ae57baa2ee2e7382d2e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/security/AIDefenceGuard.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa1db7a5dcbbccdd6f533306b081fccf30b1322268a6b1f0cb194a5177166f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createSkillExecutor\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in npm/packages/ruvbot/src/skills/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in npm/packages/ruvbot/src/skills/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/SkillExecutor.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff775fc2630e1b7dd3253b0481d84f02b441ebc21ca01605f989859d41f113b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/SkillExecutor.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d25293a94e225a3c1798b03d45d3604d11d2e9e0e394721ec126f081ca66af"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/CodeSkill.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8827d1b87ec2437c347c63a7fa8d523c244962aba49a3da1efb19dc2a42387d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/MemorySkill.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2993e0fc91a4adecc9e3cf71641aa80428ceb0c21c84d8e1d0cd1540767c2343"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/SummarizeSkill.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4805ffda28a33675ecff5952e4cfb7d048b46c68e4665157e44c959c7a11926"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/WebSearchSkill.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"533dcd73fff9b1c304de8d2f8455fbb12d6d4bafebdc1ca4aa305d416947ca49"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getSkillsByCategory\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in npm/packages/ruvbot/src/skills/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in npm/packages/ruvbot/src/skills/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/index.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ede38c8e526c8547e1ccea6343cf0bcb0fc0a195103f959fdbe095f9550076e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/skills/builtin/index.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"deecdb1d142aaf7ac55c8de10d4bc51009cad69496c179b3676bbc4db9dd5c8a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/swarm/ByzantineConsensus.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8e976236534c534516b527f43029a3a31ba58892dfc0664c7daa61a1b1bf60"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c31412205c5c0a76e8a6ee23e17c0cff77947c928deb40863cbccc104a4520e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027circuitFromString\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/quantum-wrapper.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b181dca86676b19bcf9c232f10f27bfa292e6165d8e821ffbdada9f9d3c1d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027simulate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/quantum-wrapper.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafbb75238f7c81fa6b7148e28dc54770ae1867df930a7f5925886f2a454dc3e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027info\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/quantum-wrapper.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6add9771927226a1043fe4bbf0af45395479ee7e3c6a281088db4c31efda9f3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027bench\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/quantum-wrapper.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"286dd2888870197d867a66b0921d754452522894349e927032496500b45c276e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027grover\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/quantum-wrapper.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a50d7f6ab5ed2da527cab71f12ead4b8cbfa2772bacec39deda0a15422562a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createLearningWorker\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in npm/packages/ruvector/src/workers/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in npm/packages/ruvector/src/workers/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28238bc86a219913049d171f08b31ac6847acf633f59403a9d6d88ef5aad2ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027manifestFileHash\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/build.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6879fdde7ab0711d0b0eb81f16e40faf37fb5beccb7318231dbc796849b659c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DATASETS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/bench/datasets/index.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0376040d36a9028abb52f9433938ca1ac3227136d694cb6c1701f4b4ca09fd4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_CACHE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/bench/datasets/lib.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e45c2745ea4a6f2fb1e949fcac20e85588986e4f197a16f5b982b4b17345394"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GATES_PATH\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/bench/lib/gates.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9580b7d00b777124a641a2241f5e56a3232863ef9b4e6f83d3c1dfbb804a5c9e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_resetBindingCache\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/binding.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ff6ac5875a5d7a63bb8f89187adc851f700163ef45453c6853230c81f16760"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027main\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/cli/main.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd573a9f43331058d2fd73a95a71b8df8b331662d709153d272889684746b9ce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027AdditiveKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/src/types.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f551ab5321f4d1c0160ec9c57be87c2c7abe4ff08fc2f61cc91be885aa54cad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RealSliceEvaluation\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/src/calibration/realSliceTypes.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"363400d57833e3d724f9f17e5c8ec362c0b36a9fc19e42c948131b20b103c4f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027REVIEW_REQUIRED_MODALITIES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/src/ingest/types.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8c4aec1d8af9d8251ca9a6c47893ebc3d93971b663c7e9bf3df519a2aae55e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/09-delete-empty-conversations.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"57649b383c3debdf5e4f9f2f59944ffbfcc105664d09b7e12b56b09b7c56e4c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isMultiTenant\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/rvf.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6419b68a7dcbf357dfe8bac09bf0b7ba780b7b3263dfece9154280027f9f102b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isURLStringLocal\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/isURLLocal.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d0b76e82b28ecdb5b3e32c1964ff198bc837fb949620e39578163d3bd0f778"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isHostLocalhost\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/isURLLocal.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cc16caa7e7b988017c7d054fb002374148865e7efce3f41604a5431a970364"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_SETTINGS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/types/Settings.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50ed0c217b9abcf93502ed08f4b2c48026a93772eb69be992d47c6c4eab7624"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027processBlocks\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafaabacacabd8b1c423bbaf0668329b56e0522c0e9dcd3cb7d26ff6f3ca0b78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027processBlocksSync\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/marked.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb412db0f9244bc21d78edd9f6e6e805667ab859388652c97c88d546f7c4c335"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fetchMessageUpdates\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/messageUpdates.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e2d49039836ecd2ed0b62312a37ce6bd98890788135e971a8feba29b276a1b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isMessageToolCallUpdate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/messageUpdates.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e656c1015cbb30f54d60596c8ef18f28e8c142a1a80f9e45adaaf6a2f3818102"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isMessageToolResultUpdate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/messageUpdates.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffe3ce4fbd566de5bccdf0e8b926c26aa035ed721c07a83a5534275f8d1b817"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isMessageToolErrorUpdate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/messageUpdates.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4ecbccf7b7b181f80257f73711a525bdf4090a3a92086553f1338d1ec7f26a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isMessageToolProgressUpdate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/messageUpdates.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c084296ca7bd29d64266b046d895964b2d0c814c5ac5b9aee9942a9af324fd7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027generateQueryTokens\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/searchTokens.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"988c5d626220eaae2ee5a535402ea5aa84297edd568cb1af9fb552455f44f91a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027retrieveFromMemory\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d840d92f7f1d44f03cb2b382ac9877bc15bff08dd616317da82ed1c0392eee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027KERNEL_FLAG_HAS_VSOCK\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/scripts/build-rvf.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"139dd20a9eb02801b7d8c9b891ea61aac0348fcd1d8b6020710ba2ace43628e7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027WASM_MAGIC\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/scripts/run-rvf.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e397d63d17c966c0b40ad66f17987789d922829189ceec498f6eeaa835ebd38"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027dequeueTask\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/swarm/SwarmCoordinator.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5dee71b2336f55573279f0e2c721dc51fb3a0503515270e95e5ebb6faa1da2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sanitizeShellArg\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/bin/mcp-server.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cba4cad458abdc98ff537dc0f09d794198303c80d780b9353dbda0f08b3249"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027scratchBuffer\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/adaptive-embedder.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b501f6d55756578e0cde61abd904d85e4f873cf9d821a4a1363ae29af952b13d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027sessionStart\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce33c234b65ea91798d2e07683392c03d159c77d228d8b251b1810665bfc07e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027learningEnabled\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/intelligence-engine.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"80288a2eb7bb51a8d78cb781596646702ecb5fe36d530ae225c94814ff9483f1"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027reflexLatency\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/neural-embeddings.ts"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a1e0c2a1157b791d9cbe34ea212df77170e1b6eec51ab9d61c246eab3cfeaf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ID_CHAR\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/reference-tracker.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d8ccab69557fe90205569d655629e855ce760974471d5dcd1bad5d919fd039"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AGENT_PRIORITY\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/hybrid-model-compare.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"735ccaab68b15b892c57b5080946023f9e18ce78fc937bee46cb98cccddc7d56"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SIMILARITY_TESTS\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/improved-model-compare.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9e8a1d92aaa66ef6a8b5661d046d006703f37661ea09d6289320ad5d8966a5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027infoNCELoss\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bb291240678eb501b037775a174030855fdb31a134dd7cade0c8942a714816"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027computeGradient\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/contrastive-finetune.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba3e527ab2336386f4ef03f78af621263f8922ecee62d4bfdf383d8c933111b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PROMPT_TEMPLATES\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/generate-ecosystem-triplets.js"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bedcbf1b42e6f18e899639f43dcdc9f7dbb0acbdfaa50e3f6735239da2267fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027_penaltyBuffer\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/sona.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5361e77331151ff7917b945cee1f3f29d96cf983e683cc1293a10eff871e23d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mobiusAdd\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80fe5e38ab625941ad007b01b8eb70577ba9ba6319ab25a7a7aac3a55a17e69"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027projectToHyperboloid\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/bin/cli.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bb10df62998b70919ae061c399b07615690c046a9c70703dade6f72898e3a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027idbDelete\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvlite/src/index.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"f833f65bc7ca8783cee37ddb0c95b989df432385f5f1e2247b354b991d3d4cd3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027warn\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/spiking-neural/bin/cli.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b1e5085c12044791a78298e8b80b16a216da86db6e68d61b6690141d607fd5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027info\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/spiking-neural/bin/cli.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39f6dc7d3e82b7682527afbe60ba5225c0e22a74a060b30dbaa3150d7cd7d0a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027IntegrityCheck\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/agentic-jujutsu/validation-tests.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4761d3cd7eeafe2100e38eb3a38bc95b869ece2c6e04c4db818c040ad1d1a359"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RollbackState\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/agentic-jujutsu/validation-tests.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"63321e13df464fd8afb7363b222d5e941b3dd6da73c91cbf0b5e244a780f408e"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027_projection\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c2a8625573b916f1809deb2d514cde8ed19622c7a6e79dfe7031caee912106"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_countSingleDollarSigns\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/parseIncompleteMarkdown.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1528eab12b291a25456e3a4855d665464eff29af24b824d6724f589ebedce2e"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@modelcontextprotocol/sdk\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/security-dependency-consumer.cjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88af69183c7337d6b48e8c8e98480362488c0d6f0534cc775c501983e4dcfaa"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@opentelemetry/api\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/load-balancer.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"923562c3423d1a855b806993811e31c17fe46ab61d3be32c55a7698ad871b105"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027axios\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/security-dependency-consumer.cjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcb7bfa552fca85e6833cd7a3c92d11138a083173c78a9ba75555da6df65380"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027compression\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/security-dependency-consumer.cjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d778d9d6ffcf2b708e0dfa05789a98a6f075ecf300026c3755db8b2e8c93c4a"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027fast-copy\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/security-dependency-consumer.cjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f70d90eee718fc67921c13da6361e3d208e22d786f4e5400472c1d8f07c9d5"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ioredis\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.js"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1c28994371b51bbae512aad54cba41a3b1565e9e4f6f70ecd3426a24ce9fad"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ip-address\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/security-dependency-consumer.cjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ce5a8a048238d9cf1fc80d1517cee2a68c9951b87e9ed2d433f3d522eec8e2"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027lru-cache\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bab27debaa5039ce7c161bd22ef3ac07ad0371b9703975f6d881e70fcd7ba79"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027prom-client\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/load-balancer.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"27129fe3fd0262f95318fe584cc1c27629810a39c8a635b7971b4318f6328f9d"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027proxy-addr\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/security-dependency-consumer.cjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2407e444e128d68e888a66b42152fc72c0ca8ab963951c4ae779f168634a01e4"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027qs\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/security-dependency-consumer.cjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd3bdaf30573bfa006fd171ca949fb22e15d937bbca932a962bda5742cc767"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ws\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e3f71d043f83d8245a3fdab89b3f66381c758ff0e9e636f0327c51ebaab373"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027zod\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/tests/security-dependency-consumer.cjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e11fef4eb0ae91f11ec71cafc47a1362b4f5718d779c91b726a7daad452b71"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027js-yaml\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/config/config.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d97f1ec07311c7d1916ec7bbc877d43dc3586f13a51c98255cf095948d272b"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027commander\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/bin/cli.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"af75ad1c471c89cd57855fba24937f1f5ee59b49d1a66e54905e9198469c681f"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027tsup\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/tsup.config.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd33989291607689d0f9dc64f2008bbfeb6ff6b669d89045f143d679c48adbd"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027glob\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b1af37ea1195996ce549328a7f0ed14476d4ba9edda34dcad1926833142107"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@google/generative-ai\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-code-synth.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d80ccd7ed17fa3191fb72d4e4c24e82d54e82fa19389a7a65a2b0ebc966f4a2"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027dotenv\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-hard-negatives.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf882c4cfc50c81efc4d656f5b172cf726513ebbd1bc20944951aadee8320e5a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@claude-flow/memory\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a0c27334183a239d48ef1ff29c7c25919e5f7a4af636809ea2a7aac742ee64a3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@noble/hashes\u0027: Declared in npm/packages/cognitum-gate-wasm/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a79240433c5829088b4561f98914aae5cb450a6f9642cf11fb56c6d0f0fd75e5"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027inquirer\u0027: Declared in npm/packages/postgres-cli/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1259c9c9d8af63ff9ca03768c08a6a48ec76aeeedc9d8333c369cfabf905512c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027idb\u0027: Declared in npm/packages/rudag/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e61fea0c23713a28ebc66ceee6fd4910ddfa328e3c59d386498efcb7f8f408d1"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@anthropic-ai/sdk\u0027: Declared in npm/packages/ruvbot/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"df515d5b9615de2d0ffef8d052d291011416feb95cc66856507607cdb803291b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027pino-pretty\u0027: Declared in npm/packages/ruvbot/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ccde6f8a48c94c71d3d7a3984c3b2032221c3ab97504c21dcbd11f96a0336f25"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027chalk\u0027: Declared in npm/packages/ruvllm/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d78e618031b8627815d45d2215ecbd036b09a5758186e6243fd489515b9de54e"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027ora\u0027: Declared in npm/packages/ruvllm/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8347511dd9b8277303ec1b48943bd21a74f7ea6dd13605baa57312326c41c4de"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027node-addon-api\u0027: Declared in npm/packages/spiking-neural/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"db1bfed33a0ed32f7d23a3f112410c2e8a4e0100467d334a0177c839f2a11c6b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify-json/bi\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7c5ced5546d6d308d1c7467b4ff43b90f6733cefae0992d9aa42a1ac33cf5137"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify-json/carbon\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d33fb659d2926550ce5c36a2b06bc123c74c498ee783318688929e83c27e3dd1"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify-json/eos-icons\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b4b1493ce20a1d460864736b78bdf11ac706890ed6648e73c81a61f287125fcd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iconify-json/lucide\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f1c5e6c653cdbe56fb13cfb119c746e145c2c6b16c1960fe17190ad90b6fe418"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027ajv\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea1ad52eed69bdff274867e7a15510667a223768b9e336a417477518d507084b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027devalue\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"27ba3e9a2d14b8a558337b8a68b6eb02af6899e9dafae710111bd29cb09a6cc2"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027dompurify\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f55bc94cb766a5fc10a000b999379d9f40c51168c62c11f695e679c62c3775c7"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027hono\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9cab6d8e5763f12a3a5b66bedc195ee691bde3b0e01b28444b0c28fe991aa52"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027mongodb-memory-server\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7be98a5eb27d395693fcf6cf98a217a9e068f0325806e8bf2b01ae8c2272de67"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027pino-pretty\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"38a9c0b4cbcb3ce6771bdd855c8582498153ec0b481c0111e38a51d3211afbe9"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027qs\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 while npm/tests/security-dependency-consumer.cjs DOES import it and no package.json above that file declares it, so the import resolves through the copy this declaration installs. The declaration is misplaced rather than dead: removing it breaks that import. Move it to the package.json that owns the importing file (or, if the two packages are meant to share it, hoist it to the workspace root) rather than deleting it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b2526cb416081c588df63e8f3ef9dbc022fb950b8a06838217f2969059ea3fc4"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tslib\u0027: Declared in ui/ruvocal/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d8a3d0faa47fd18b071ac2ea263bb7395790d201b593acc4743b98814298e27d"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027ruv-fann\u0027 in production deps: Only test files import it (first: npm/packages/weight-space/test/model-edit.test.mjs:10) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/weight-space/package.json"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84839e94ae8857e611507a3e37f5ee555468e56591d8b9e9f9a3d183a61b798"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): npm/packages/ruvector/src/core/agentdb-fast.ts \u2192 npm/packages/ruvector/src/index.ts \u2192 npm/packages/ruvector/src/core/index.ts \u2192 npm/packages/ruvector/src/core/agentdb-fast.ts (one verified cycle inside a mutually-dependent group of 4 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/agentdb-fast.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebab14b4ff0955a722ae557c2cbc4365f53081e0b05eb7139298762c6cae0d5"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/semantic_cache.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e43ae9306e6a8d0704c55651ff4379ca643dabadc020c40acaa91f3add14f4"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/semantic_cache.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dab6ad9a1c8306332cb2bc3e36150ada0d57d659fd003e40c32d87ad7d7de38"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/working_memory.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"2541e74b818dbea98db991d09fe072fea0316918cb6faee46bf3c750100d4b5f"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/context/working_memory.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9799eaaac517a976b110d2113137797727dc7d58026d290921552ee018d5adbc"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://d3js.org/d3.v7.min.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/index.html"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8580cc4352954eca1a4e1ec477d865385b7362cfc3c1233ce032d62d803ef80b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: .claude/intelligence/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/intelligence/package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c31f83ecffc6921fc9c89fd4e17e1e8212542db01bfa83b7ef8ce37223388a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: benchmarks/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/package.json"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee74a17f7eea348b6e620732dda264b324dc50b447f834cd0ef2fe5705b33c1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/ruvector-attention-node/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/package.json"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c867d5400bd9730148ff5de58ef81ddc242843f2064384750c3efe734ace810"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/ruvector-attention-wasm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-wasm/package.json"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c615b0500da02d5262b876b8d23717c8f3276b2f759ec4fc21b399a855dd7ee"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/ruvector-gnn-node/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-gnn-node/package.json"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bb0d5efb4bbe23dbe3d4c47d9a590690dd8357800b2b864292367d0c2fc720"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/ruvector-graph-transformer-node/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/package.json"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8761152f249968ca92d3887803b0d1a9dc1e915cea3dd40a49757dc3c4d1a8a6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/ruvector-router-ffi/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-router-ffi/package.json"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d5a6e5eb8ccca4d63875a6274ae0a6be7e6c7ad859cd0bb7254d12bda41315"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/ruvector-solver-node/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver-node/package.json"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfe145e23a6af082f4b4b4dc41d93ed20ef8f8faa4ef07b891e966b4a80a77d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/ruvector-tiny-dancer-node/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-node/package.json"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb7d842ab26a7d8890f497fd8f518eeb82fa515dbf0af510212752baf7cfa46"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/rvf/rvf-node/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-node/package.json"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e481e5651e1e21db218c33c9baaf52810221f72382a74a74b278a4f1996e7d7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/rvlite/examples/dashboard/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvlite/examples/dashboard/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"166e719e5335dc7d9a1655b35bd1ae86300823621241ad8644f7c671faf15ed5"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/decompiler-dashboard/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/decompiler-dashboard/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8deba96b764d0a7ab6fc869d5d0e6f9442e310ce3e80d1f24e8bfde64656b1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/delta-behavior/wasm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/delta-behavior/wasm/package.json"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6681c34ff06a1fc0ded7123a29aa864e113fea8244dc9f968f5faae7e94a83"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/dragnes/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/dragnes/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bccb659a21ae25fcc280355ac53d76dcca9bef4cce9b011f5ab7f2e6abcfde"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/edge-net/dashboard/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/dashboard/package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb0045012fa216a96ec513c53f64301fc406ca78653790095019c7d751508e8"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/edge-net/relay/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/relay/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3d9a6448b862c68a1e976c1937c7db26345244d95308c044bf39991c66bbea"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/edge-net/sim/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/sim/package.json"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb24ef205770b26013e2be4706aa43a7a9a22948553067bcecd1fe0600bc0461"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/edge-net/tests/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge-net/tests/package.json"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2d1911d55f00f4ff497f5c1e4a324bc104aec02815951284ebe136fd32291d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/edge/pkg/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/edge/pkg/package.json"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92678efd6554a21d18f860e140f04ad3cbaaf2c2cb35aea559e92333a8e1a3e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/meta-cognition-spiking-neural-network/demos/exploration/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/meta-cognition-spiking-neural-network/demos/exploration/package.json"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e0ef46bbc8dd7865628f80942e00a16e89e10d00b3744fdc86609e390b8834"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/meta-cognition-spiking-neural-network/demos/snn/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/meta-cognition-spiking-neural-network/demos/snn/package.json"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fddef8c3cd438c3cee5b29e1361726a691177f1bc3c93983bf952200f1c836"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/meta-cognition-spiking-neural-network/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/meta-cognition-spiking-neural-network/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"15096c74d5dc9491ef0a0f66d08ae01da1df2624e089f2f56e93d196d7fe407f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/mragent/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/mragent/package.json"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb73d260b21862a4009fc31cc358bb987262b98ef071cf8b4a9bc17ccf03fe38"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/neural-trader/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/neural-trader/package.json"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2baa9596c6b112bb52f56b7b97d5a9c80b3a896243728b5948e2e8125ae9584"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/npm-vector-graph/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/npm-vector-graph/package.json"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"067f4975215c5de3b883d98f7175bda6f521237e8fcd7de6a3f988c2858976ab"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/ruvLLM/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/ruvLLM/package.json"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f13ff1ffb3301ffb10779bbf0a5250c1888a720d981d7db1a749a224ba64c3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/rvf/dashboard/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rvf/dashboard/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8632562587b607a350d0e7a451da1d1229a0cb7b9e8f5f2457244b1c0e4d41"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/scipix/web/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/scipix/web/package.json"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63221fa0d1c85eccf5b667ff67691d62b3158051505be3be7c06b26d39755b6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/sonic-ct/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/sonic-ct/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d924d63b8c1e841aadabc9e4d8ec383d0f9ee8ba2ee2c54bc8b919e27849497"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/wasm-react/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/wasm-react/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba13059cab0155e77d388160cbff9c5aa4f57685994c4a1d4b901c9b65af699d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: harnesses/timesfm-harness/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harnesses/timesfm-harness/package.json"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3943694e2f95801512306f295efeba0825cb26346e9fdac214c00cae6ee8baf7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: npm/core/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/package.json"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c6bcea78d9fed27161f5c565bc195dfda7e5a5a8c33e915735990ea53c449d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: npm/wasm/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/wasm/package.json"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"16333be14fb0b87e29caaab83f51a67b295c71f25c547c346da609b2f0111c44"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd699919aa591b262d8f4a07a70eed2e90d52ddb856cc6e42aa98540126b06b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/agentic-jujutsu/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/agentic-jujutsu/package.json"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75455d200b2c555265a8c13e196eb3399d17621bf352afdce9de8608e9d482a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/docker-integration/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/docker-integration/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3d9a6a70db485a5930b538867a379b3b43123aae73875cd48533589fd5b6f9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: ui/ruvocal/mcp-bridge/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/mcp-bridge/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f132f313c89d51c6fef4e41f9e9894b55c8a5eb96d4f6147128015782de7349d"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: ui/ruvocal/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/package.json"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"925eaca5aabac1b5fb8cc93024904880bafc7229459e5035f57dc725a7987a0d"}},{"ruleId":"X1","level":"warning","message":{"text":"\u0060async\u0060 callback passed to \u0060forEach\u0060: \u0060forEach\u0060 ignores what its callback returns, so the Promise each \u0060async\u0060 call returns is dropped: nothing can await it, the code after this loop runs before any of the awaited work has finished (a function that \u0060await\u0060s around this loop still returns early), and a rejection is never handled \u2014 in Node.js an unhandled rejection terminates the process by default, and in a browser it is lost. Iterate with \u0060for (const item of items) { await \u2026 }\u0060 when the work must run in order, or \u0060await Promise.all(items.map(async (item) =\u003E { \u2026 }))\u0060 when it may run concurrently, so the enclosing function finishes only when the work does and its failures reach the caller. Where firing and forgetting is genuinely intended, make the callback\u0027s whole body a \u0060try { \u2026 } catch (e) { \u2026 }\u0060 that handles the failure, so it cannot escape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/export/\u002Bserver.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"50378f7e7025bc4077b69f8a93fc1ac07f0cc18c6d68ffc6c735ba32ed988a38"}},{"ruleId":"X1","level":"warning","message":{"text":"\u0060async\u0060 callback passed to \u0060forEach\u0060: \u0060forEach\u0060 ignores what its callback returns, so the Promise each \u0060async\u0060 call returns is dropped: nothing can await it, the code after this loop runs before any of the awaited work has finished (a function that \u0060await\u0060s around this loop still returns early), and a rejection is never handled \u2014 in Node.js an unhandled rejection terminates the process by default, and in a browser it is lost. Iterate with \u0060for (const item of items) { await \u2026 }\u0060 when the work must run in order, or \u0060await Promise.all(items.map(async (item) =\u003E { \u2026 }))\u0060 when it may run concurrently, so the enclosing function finishes only when the work does and its failures reach the caller. Where firing and forgetting is genuinely intended, make the callback\u0027s whole body a \u0060try { \u2026 } catch (e) { \u2026 }\u0060 that handles the failure, so it cannot escape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/scripts/populate.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"481cd160c7f92b7df4ee0b4f3ad6575400a9a5a605cfa3b4d11199bf2bd5bcbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!_.getKeySchema().getMergedTraits().sensitive||!!_.getValueSchema().getMergedTraits().sensitive\u0060 appears character-identically in 7 files \u2014 docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/___SensitiveInformation___.js, docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/getKeySchema.js, docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/getMergedTraits.js, docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/isMapSchema.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/___SensitiveInformation___.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df295e244378c12a674374c9fadd28b5f088e1f8e91e15e58914e2629ff8540"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(\u0027cost\u0027 in candidate) || typeof candidate.cost !== \u0027number\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/rudag/src/dag.js, npm/packages/rudag/src/dag.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe211fe861a607fe1db189f01c27e33715f67987f23b4f1bc1fb50d78148ee4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(\u0027path\u0027 in candidate) || !Array.isArray(candidate.path)\u0060 appears character-identically in 2 files \u2014 npm/packages/rudag/src/dag.js, npm/packages/rudag/src/dag.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9116d3ec6bb8a96d2f34ae09b9778fa9563fca001a714864f526d4098569f35d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(message.id === messageId) \u0026\u0026 message.ancestors \u0026\u0026 !message.ancestors.includes(messageId)\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/routes/api/conversation/[id]/message/[messageId]/\u002Bserver.ts, ui/ruvocal/src/routes/api/v2/conversations/[id]/message/[messageId]/\u002Bserver.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/conversation/[id]/message/[messageId]/\u002Bserver.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c36175800d7688fad95e39e5341dd651a0c4920f21deba31a8aaedf6b78160e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(queries) || queries.length === 0\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/streaming-service.js, npm/packages/cloud-run/streaming-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e96eb3317e86f80c6f546dd13925d8f239cb0b70aa3d362b76ac953c8fa584"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(v) || typeof v[1] !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/rvf-mcp-server/src/stores.ts, npm/packages/rvf/src/idmap-journal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/stores.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c0aba7cfd967bede28fab43cec1871c417f4ea5f50422a293f746830476692"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(value) || Math.abs(value) \u003E 3.4028234663852886e38\u0060 appears character-identically in 2 files \u2014 npm/packages/e-means/integrations/cloudflare/storage.mjs, npm/packages/e-means/integrations/cloudflare/validation.mjs. 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":"npm/packages/e-means/integrations/cloudflare/storage.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7d0db665375263e41b4c8c52fc080702c79465d3e0a4d953a07d4b4f3952a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(mechanism) || mechanism \u003C 0 || mechanism \u003E 2\u0060 appears character-identically in 2 files \u2014 npm/packages/rudag/src/dag.js, npm/packages/rudag/src/dag.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2ad8bf7a62c51f089f9d7f7fda1a71c973861050f1f3089a2faef9113ba2dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(operator) || operator \u003C 0 || operator \u003E 255\u0060 appears character-identically in 2 files \u2014 npm/packages/rudag/src/dag.js, npm/packages/rudag/src/dag.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4a846e95fc72572dd1250555e3af4748c8902828aeb5ff167efeeae9027cbf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(value) || value \u003C min || value \u003E max\u0060 appears character-identically in 2 files \u2014 npm/packages/e-means/integrations/cloudflare/validation.mjs, npm/packages/e-means/integrations/clustering-validation.mjs. 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":"npm/packages/e-means/integrations/cloudflare/validation.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7f8a6171b109fb3d5b50b96d302ddf5b3c80c47c94bc83aa323e1959ca9f7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!conn.inUse \u0026\u0026 now - conn.lastUsed \u003E this.config.idleTimeout \u0026\u0026 this.connections.length \u003E this.config.minConnections\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/vector-client.js, npm/packages/cloud-run/vector-client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd619280436ce291961f3e0d349ba858b7bbffeaf9eaec5e8c8fc2a49409d49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry || typeof entry === \u0027object\u0027 \u0026\u0026 \u0027dtype\u0027 in entry === false\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/export.js, npm/packages/ruvllm/src/export.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/export.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"989d0b3cd60f78d5d8cebd91166f49e85e118a16f0ec202c7b1b7e1ddd1efd22"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!graph.edges || !Array.isArray(graph.edges)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/exporters.js, npm/packages/ruvector-extensions/src/exporters.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.js"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"83022d5f57e50b43e649615123cd1a265093c6895b6b2a2e7b9c68e4dd40cd65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!graph.nodes || !Array.isArray(graph.nodes)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/exporters.js, npm/packages/ruvector-extensions/src/exporters.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.js"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e63e1d94e6b45cf024eb122df034d84759f07ab28c088aadfe9596127ca1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isRetryableError(lastError) || attempt === this.retryConfig.maxRetries\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/client.js, npm/packages/postgres-cli/src/client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5534c41c76bd0d96946d5ed1e1f5ba491a1a1153db89701a86c1b57b6fa4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!networkPartitioned \u0026\u0026 message.to === \u0027node-2\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/integration-tests.js, npm/packages/agentic-integration/integration-tests.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/integration-tests.js"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b681bab91b2d869244779efb9e8869304a99050353c98b2fb493e479ab71b8f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!options.force \u0026\u0026 this.isDownloaded(model.id)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/models.js, npm/packages/ruvllm/src/models.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/models.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd6e0193202c2d0a4f0786f391b06764160779583f33bf2b0a24c1745a40a5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!proposal || proposal.status !== \u0027pending\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/coordination-protocol.js, npm/packages/agentic-integration/coordination-protocol.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/coordination-protocol.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83e4ae9ebeb911c00557213cf49fff801613b71ccbe037dc707d04d61a36db4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!request.vector || request.vector.length !== this.config.vectorDimensions\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/regional-agent.js, npm/packages/agentic-integration/regional-agent.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93e04eafbc8a85fd06c1daa85d5fcf2feeaf45a5637cf3fe55433ce477e97aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!resolvedTarget.startsWith(resolvedBase \u002B \u0027/\u0027) \u0026\u0026 resolvedTarget !== resolvedBase\u0060 appears character-identically in 2 files \u2014 npm/packages/rudag/src/node.js, npm/packages/rudag/src/node.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/node.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc69256604d6fbd7834d3e8ce12f0d06e168257ad731dff21a78577f23d2be91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!sys.pgrx || sys.pgrxVersion !== PGRX_VERSION\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/commands/install.js, npm/packages/postgres-cli/src/commands/install.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.js"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"be63a61bd83dea50e99105e9d90eeb4427524e1fb449ab24381601a322dfe91c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!task.region || a.region === task.region\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/agent-coordinator.js, npm/packages/agentic-integration/agent-coordinator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03dfc51a22dcee0e9dbc96959bd55867caef6fa7c2961a522b0e045d61e2e2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this.initialized || !this.config.enabled\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/core/parallel-intelligence.ts, npm/packages/ruvector/src/core/parallel-workers.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-intelligence.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada901fb2b8ee5430b23d16cd7f0dbc48f004cf578325c07a9639bf4d9ed48bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this.vectorDb || context.embeddings.length === 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/workers/native-worker.js, npm/packages/ruvector/src/workers/native-worker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.js"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"784ca1e249d47f43cf95f14ccdd36394a97c746ca8b1744dccdf67735726b8b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 npm/packages/rvforge/src/config.ts, npm/packages/rvforge/src/project.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/config.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1b3a4e00e5e42a7716454ed790e2cc05dab55ac4120d64f8ea4d641771ca02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(!allowEmpty \u0026\u0026 data.length === 0) || data.length % dimensions !== 0\u0060 appears character-identically in 2 files \u2014 npm/packages/e-means/integrations/quantization.mjs, npm/packages/e-means/runtime.mjs. 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":"npm/packages/e-means/integrations/quantization.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab0c8e944ddc4a8714a49309f701fc3fc9f195011ae3a74d339c4153b2be2ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(this.state.votedFor === null || this.state.votedFor === request.candidateId) \u0026\u0026 this.state.log.isUpToDate(request.lastLogTerm, request.last\u2026\u0060 appears character-identically in 2 files \u2014 npm/packages/raft/src/node.js, npm/packages/raft/src/node.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/node.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1825116aa7aed6d8a894eb0215e566d014a4750f4428368f6659c5e5d5e56057"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(jsonSchema.required) \u0026\u0026 jsonSchema.required.includes(key) || false\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d13b77d5a25b76f240b404162a9c2eaf0a5678669083939bd973fe86bd24f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(outputData) \u0026\u0026 Array.isArray(expectedData)\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/benchmark.ts, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/benchmark.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04eeaec24d186bf14577d06c07edebf1fe4a913227f0d71ada64c98671c5407"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Math.sqrt(normA) * Math.sqrt(normB) || 1\u0060 appears character-identically in 8 files \u2014 npm/packages/ruvllm/scripts/ensemble-model-compare.js, npm/packages/ruvllm/scripts/hybrid-model-compare.js, npm/packages/ruvllm/scripts/improved-model-compare.js, npm/packages/ruvllm/scripts/optimized-model-compare.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/ensemble-model-compare.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66cc304cb1c51f73e42afc06da314797e32c66eb5176faed7ecb3b074f193d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.MAX_SAFE_INTEGER||9007199254740991\u0060 appears character-identically in 2 files \u2014 docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/COERCEFULL.js, docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/exports.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/COERCEFULL.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"388e76e6931744afa42823a0ec7e3e871fb76ff71dd3159ee61920583bccf35d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Object.getPrototypeOf(obj) !== Object.prototype \u0026\u0026 Object.getPrototypeOf(obj) !== null\u0060 appears character-identically in 2 files \u2014 npm/packages/rudag/src/dag.js, npm/packages/rudag/src/dag.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8081b899b0b601769ea665f0938d0808c2aa47f330aa472adc08baa0fa18953d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060WASM_FORBIDDEN.test(imp.module) || WASM_FORBIDDEN.test(imp.name)\u0060 appears character-identically in 2 files \u2014 npm/packages/kge/scripts/check-security.mjs, npm/packages/typesafe/scripts/check-security.mjs. 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":"npm/packages/kge/scripts/check-security.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"828f6779872f887e706b2a31ef6c99cb4652dd14995fb7d412d6fced3f2cf00a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.agent_type === failed.agent_type \u0026\u0026 a.status === \u0027active\u0027 \u0026\u0026 a.id !== failedAgentId\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd953dfada8df9a564924878e227bc672362f0188ddd523099a8cc1b0ffc5cfa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060added.length === 0 \u0026\u0026 removed.length === 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/persistence.js, npm/packages/ruvector-extensions/src/persistence.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0883137c39c1b909680bbf482864baba80dde58ee9946327bcda87b161868f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agentConfig \u0026\u0026 agentConfig.region !== sourceRegion\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/swarm-manager.js, npm/packages/agentic-integration/swarm-manager.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf055448899dba6f9fae3ab65f939724e12a06047866da5db955a0e9f8949b91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060avgLoad \u003C this.config.scaleDownThreshold \u0026\u0026 regionMetrics.agentCount \u003E this.config.minAgentsPerRegion \u0026\u0026 this.canScaleDown(region)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/swarm-manager.js, npm/packages/agentic-integration/swarm-manager.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"396de191b2591ba2951032c7c4dc0e59f9d669813f7bad105612d6eccc57618b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060avgLoad \u003E this.config.scaleUpThreshold \u0026\u0026 regionMetrics.agentCount \u003C this.config.maxAgentsPerRegion \u0026\u0026 this.canScaleUp(region)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/swarm-manager.js, npm/packages/agentic-integration/swarm-manager.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/swarm-manager.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1275e959fb2ffe60ef81be0171209c1431cadec31fe6fd05f5c7a3eae40ab635"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060backend.config.maxConcurrency \u0026\u0026 backend.activeRequests \u003E= backend.config.maxConcurrency\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/load-balancer.js, npm/packages/cloud-run/load-balancer.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/load-balancer.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"989a11e752fa1b659625e1c1ce4573ce1b080b35e57f0b79ba73dc279de304a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060braces \u003C 0 || parens \u003C 0 || brackets \u003C 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/decompiler/module-splitter.js, scripts/lib/module-splitter.mjs. 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":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e751c7c9bef5a697d578cf9978299ed0ba2049205928899f9e6cee0f5b38ef43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060braces === 0 \u0026\u0026 parens === 0 \u0026\u0026 brackets === 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/decompiler/module-splitter.js, scripts/lib/module-splitter.mjs. 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":"npm/packages/ruvector/src/decompiler/module-splitter.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"888b4aa02f6a6c4159ddab5fea4165883406fd61859d515dc7456e4b6c284a3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060builtInMatches \u0026\u0026 builtInMatches.length \u003E 1\u0060 appears character-identically in 8 files \u2014 crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js, crates/ruvector-attention-wasm/pkg/ruvector_attention_wasm.js, crates/ruvector-exotic-wasm/pkg/ruvector_exotic_wasm.js, crates/ruvector-graph-transformer-wasm/pkg/ruvector_graph_transformer_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0203d08d218b60d52d3f8fbd4c0488bed873144616091fdc0e8c1d50c71704"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c === \u0027 \u0027 || c === \u0027\\t\u0027 || c === \u0027\\r\u0027 || c === \u0027\\n\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/decompiler/statement-parser.js, scripts/lib/module-splitter.mjs. 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":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6524ed9055a32eca0a8804218fd0767fdee26275f2c406f62733d3494ed5cd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c === \u0027/\u0027 \u0026\u0026 j \u002B 1 \u003C len \u0026\u0026 source[j \u002B 1] === \u0027*\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/decompiler/statement-parser.js, scripts/lib/module-splitter.mjs. 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":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2593e090d9afe9dc62b4fa31ab80df17ae5cd3624739bb0a3fe9b0eb823ba76c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c === \u0027/\u0027 \u0026\u0026 j \u002B 1 \u003C len \u0026\u0026 source[j \u002B 1] === \u0027/\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/decompiler/statement-parser.js, scripts/lib/module-splitter.mjs. 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":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"da26e44e73f70c7eff1a50674304cf209b67fa1121c63dcf053933818dc335ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cached \u0026\u0026 now - cached.timestamp \u003C this.config.cacheTtl\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/services/embedding-service.js, npm/packages/ruvector/src/services/embedding-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/services/embedding-service.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0bde4b9ca72b76c6d1a78b018c2741d651acfcff16d4d70c84a89356e6e4c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined \u0026\u0026 \u2026\u0060 appears character-identically in 20 files \u2014 crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js, crates/ruvector-attention-wasm/pkg/ruvector_attention_wasm.js, crates/ruvector-economy-wasm/pkg/ruvector_economy_wasm.js, crates/ruvector-exotic-wasm/pkg/ruvector_exotic_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2c6d98cc7511cdeac6b6ecbdf70bfa7a2b98f03e09c361985fa4fc23f8a99c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cachedFloat32ArrayMemory0 === null || cachedFloat32ArrayMemory0.byteLength === 0\u0060 appears character-identically in 12 files \u2014 crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js, crates/ruvector-attention-wasm/pkg/ruvector_attention_wasm.js, crates/ruvector-learning-wasm/pkg/ruvector_learning_wasm.js, crates/ruvector-nervous-system-wasm/pkg/ruvector_nervous_system_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a357446e262cc78c52756b8de75111f256e967d116855f4c3f397cb8b18553"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cachedFloat64ArrayMemory0 === null || cachedFloat64ArrayMemory0.byteLength === 0\u0060 appears character-identically in 3 files \u2014 npm/packages/emergent-time/pkg/emergent_time_wasm.js, npm/packages/mincut-wasm/node/ruvector_mincut_wasm.js, npm/packages/mincut-wasm/web/ruvector_mincut_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/emergent-time/pkg/emergent_time_wasm.js"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"f066599201219898f1cec130ecd1bb00554c24522c7380babf5823ee4ed55a9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cachedUint32ArrayMemory0 === null || cachedUint32ArrayMemory0.byteLength === 0\u0060 appears character-identically in 6 files \u2014 crates/ruvector-nervous-system-wasm/pkg/ruvector_nervous_system_wasm.js, npm/packages/e-means/wasm/ruvector_e_means.js, npm/packages/mincut-wasm/node/ruvector_mincut_wasm.js, npm/packages/mincut-wasm/web/ruvector_mincut_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/pkg/ruvector_nervous_system_wasm.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafdd811d154bfd8d3c71f296d8608ea14ba726dd00bd4fe4fd437467a96cc35"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0\u0060 appears character-identically in 20 files \u2014 crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js, crates/ruvector-attention-wasm/pkg/ruvector_attention_wasm.js, crates/ruvector-economy-wasm/pkg/ruvector_economy_wasm.js, crates/ruvector-exotic-wasm/pkg/ruvector_exotic_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e4e615b319c4e7808d784f13402af5308b9bada7ec3df96052cfb9ddf1590b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060capabilityExpanding \u0026\u0026 !capabilityGate!.allowed\u0060 appears character-identically in 3 files \u2014 crates/ruvector-sota-bench/harness/src/environmentDesigner.ts, crates/ruvector-sota-bench/harness/src/shaperLoop.ts, crates/ruvector-sota-bench/harness/src/skillForge.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/harness/src/environmentDesigner.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e553da4ccf7c79cb11df3a490348d5fe09d13e88d978db2ce3340b7424d5cde3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060choices?.[0]?.finish_reason === \u0022stop\u0022 || choices?.[0]?.finish_reason === \u0022length\u0022\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/endpoints/openai/openAIChatToTextGenerationStream.ts, ui/ruvocal/src/lib/server/endpoints/openai/openAICompletionToTextGenerationStream.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/openAIChatToTextGenerationStream.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae369f4715607aed26ee0f1443f919b972a4d61363eecc3b2e56809b08aa5282"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060circuitBreaker \u0026\u0026 !circuitBreaker.canExecute()\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/agent-coordinator.js, npm/packages/agentic-integration/agent-coordinator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cccfa2984689d16fc0aca2f79b99f0e0dea6d156cfec46301ddfbc3207ff653"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cmd.includes(\u0027cargo\u0027) || cmd.includes(\u0027rustc\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6f69b15ad44437f2867219666af0f11172c81131125458fca06be1acb41d6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cmd.includes(\u0027npm\u0027) || cmd.includes(\u0027node\u0027) || cmd.includes(\u0027yarn\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dbd63e97213eba0a918f3229f8ea6cdef8a2cda0bff9ff800e3f932f7c94b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cmd.includes(\u0027push\u0027) || cmd.includes(\u0027force\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9045b218c76da03f676a5a6807a3fe62569faa2e49cad51d725338100223c29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cmd.includes(\u0027rm\u0027) || cmd.includes(\u0027delete\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f959728320f24720422ca0dc4d6e80ecc84d984b206b0ea9def56fdebda188f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060code !== undefined \u0026\u0026 retryableCodes.includes(code)\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/client.js, npm/packages/postgres-cli/src/client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c6b2fef58be100f19429b5b63fb48c8ea4e0990053eac921264f96d1791dcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060col \u003C weights.loraA[row].length \u0026\u0026 col \u003C otherWeights.loraA[row].length\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/lora.js, npm/packages/ruvllm/src/lora.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.js"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c648b9d878afd7297f507db0429d4adb38d28b20722ceda0e47a21281bee55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060col \u003C weights.loraB[row].length \u0026\u0026 col \u003C otherWeights.loraB[row].length\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/lora.js, npm/packages/ruvllm/src/lora.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.js"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e1e61dd88e1caa5c2848628086b1bd38f8c0396ddc4ac4980c1e0c0ac1a3e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.LLM_ROUTER_ENABLE_MULTIMODAL || \u0022\u0022\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/models.ts, ui/ruvocal/src/lib/server/router/endpoint.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"600eeff9dfd7168756d66595941b9ce71ddfa50d407b11eed1060970b22780d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.OPENAI_API_KEY || config.HF_TOKEN\u0060 appears character-identically in 3 files \u2014 ui/ruvocal/src/lib/server/apiToken.ts, ui/ruvocal/src/lib/server/hooks/init.ts, ui/ruvocal/src/lib/server/models.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/apiToken.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ec438e7c0f67f8a4d4195ba7ac96bb99cf1f43cb8c3d8f8dbd3f5b3eb3a596"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.OPENAI_API_KEY || config.HF_TOKEN || \u0022sk-\u0022\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts, ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ada04e01795d09a5926ca98fcb357ad4c51bcf6ca01385a75711083df3ad795"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.apiKey || process.env.GEMINI_API_KEY\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/base.js, npm/packages/agentic-synth/src/generators/base.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"299ed54ac73e07679253452c50c394bef9bfabeb0ad6dc212b9b7eba58d17441"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.apiKey || process.env.GEMINI_API_KEY || \u0027\u0027\u0060 appears character-identically in 5 files \u2014 npm/packages/agentic-synth-examples/src/cicd/index.ts, npm/packages/agentic-synth-examples/src/security/index.ts, npm/packages/agentic-synth-examples/src/self-learning/index.ts, npm/packages/agentic-synth-examples/src/stock-market/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/cicd/index.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae07ae2a93a7fc03d9a70e47b63c20cef0d591976571807dd0cefb476b9fdc57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.apiKey || process.env.OPENROUTER_API_KEY\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/base.ts, npm/packages/graph-data-generator/src/openrouter-client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42d5d696d89da99f84ec976afc2867ea67c235a20e1fb7b837cdf793ea1859f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.fallbackChain \u0026\u0026 config.fallbackChain.length \u003E 0\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/base.js, npm/packages/agentic-synth/src/generators/base.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a720b885a63c476fcb787c9e8598cb78871f2afa49e204f6f64fe19c763423"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.isHuggingChat \u0026\u0026 locals?.billingOrganization\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/router/arch.ts, ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/arch.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cce1f7c9b92bc937603176ac83ce29e0cd38da84fc807650e8f4cbda4724958"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.model || \u0027Xenova/all-MiniLM-L6-v2\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/embeddings.js, npm/packages/ruvector-extensions/src/embeddings.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2874738474c46c38e1fc89f68ab9d05f9c368c2cff6c49a121fb62c4b15e55b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.model || \u0027text-embedding-3-small\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/embeddings.js, npm/packages/ruvector-extensions/src/embeddings.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"690e27b9daaa10069881cd31342f2afcfceb76d031f700073152e4068265b096"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.provider === \u0027gemini\u0027 \u0026\u0026 geminiKey\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/base.js, npm/packages/agentic-synth/src/generators/base.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b62b7d586de03a407a4e3c7c21b10dfd0a5158b6d954bbf811bb51ef6e1afc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.provider === \u0027openai\u0027 || config.provider === \u0027openrouter\u0027\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/benchmark.ts, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/benchmark.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ca5825796b4a5769100ea795c5d9c132ee36571c24ef1255d07c560634f867"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config?.exclude || [\u0027**/node_modules/**\u0027, \u0027**/dist/**\u0027, \u0027**/.git/**\u0027]\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/workers/native-worker.js, npm/packages/ruvector/src/workers/native-worker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab66e13e964368b5be69014e08d31b85605e314dccaaaf9df1bc22561916bbfc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config?.patterns || [\u0027**/*.ts\u0027, \u0027**/*.js\u0027, \u0027**/*.tsx\u0027, \u0027**/*.jsx\u0027]\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/workers/native-worker.js, npm/packages/ruvector/src/workers/native-worker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fb1a65b6641e0cf96eb1dd55e641b42b3403b101f2179d9d580e75b574b146"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config?.query || context.embeddings[0]?.text\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/workers/native-worker.js, npm/packages/ruvector/src/workers/native-worker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeac8916f01a21f8e5beae80da3a417fb2f0ddc1a478dc14be672a246f4e72d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config?.types || [\u0027function\u0027, \u0027class\u0027, \u0027import\u0027, \u0027export\u0027, \u0027todo\u0027]\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/workers/native-worker.js, npm/packages/ruvector/src/workers/native-worker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d113be0a8de59e0ff67b373997c4f2c267012727b77f229870da5fbf709741af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060connectionString || process.env.RUVECTOR_POSTGRES_URL || process.env.DATABASE_URL || \u0027postgresql://localhost:5432/ruvector\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/storage.js, npm/packages/cli/src/storage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/storage.js"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2ebac25d817b0916ca067ef2f3de52904502d768b9f1223b919b21c888f037"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060costWinner !== winner \u0026\u0026 costWinner !== qualityWinner\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/dspy-benchmarks.js, npm/packages/agentic-synth/training/dspy-benchmarks.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.js"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4200cb7418134f6a3c78467be7bd47da2794873d65d26da53442715b7370e7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentProposal.status === \u0027rejected\u0027 || currentProposal.status === \u0027expired\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/coordination-protocol.js, npm/packages/agentic-integration/coordination-protocol.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/coordination-protocol.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e70035a37e150c5d1fba16412b4ff9be1732d3227c022ccf620de465699cba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.choices?.[0]?.message?.content || \u0027\u0027\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth/src/generators/base.js, npm/packages/agentic-synth/src/generators/base.ts, npm/packages/ruvector/src/decompiler/api-prober.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4a3445e43009d7a657b8a150f0c5c22a48a38e78a31760b4486b4183259e93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.content || data.title || JSON.stringify(data).slice(0, 200)\u0060 appears character-identically in 2 files \u2014 .claude/intelligence/pretrain-v2.js, .claude/intelligence/pretrain.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/intelligence/pretrain-v2.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1b5a6b4c21baf426ba53f67e5ddefdc933dab2a612354a02a61be81773b0ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.finalStats \u0026\u0026 data.finalStats.report\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/cli-runner.js, npm/packages/agentic-synth/training/cli-runner.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/cli-runner.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"922b5f7c3791c60f2d632732085d30ddddbd84b43c312c5843eff1597ae3a033"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.success === true || data.exitCode === \u00270\u0027\u0060 appears character-identically in 2 files \u2014 .claude/intelligence/pretrain-v2.js, .claude/intelligence/pretrain.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/intelligence/pretrain-v2.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"371f8cb51bb02f698cffa3d1f5ecbd2279d17d351e37df44e3acaf285b26fac9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dbDimension \u0026\u0026 dbDimension !== providerDimension\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/embeddings.js, npm/packages/ruvector-extensions/src/embeddings.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.js"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf661a933e4c85b576d23257a46d655793eb009d2c9c6ab01f5bb2dd52191005"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060decision.alternatives \u0026\u0026 decision.alternatives.length \u003E 0\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/commands/routing.js, npm/packages/postgres-cli/src/commands/routing.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/routing.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d673f6a09ae115d67dc46c4845d690855342bd7dbc1b970763e3ce6770707fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dev || config.ALLOW_INSECURE_COOKIES === \u0022true\u0022\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/auth.ts, ui/ruvocal/src/routes/logout/\u002Bserver.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/auth.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1693b143b53939877e115aa8193b0d2aea16f295b8b333ff75bee90ee7eb48f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.index \u003E= startIndex \u0026\u0026 e.index \u003C= endIndex\u0060 appears character-identically in 2 files \u2014 npm/packages/raft/src/log.js, npm/packages/raft/src/log.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/log.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"688e081d98fcb6dad14a2e7473b6aca0880a1bdff4638e5239372df559930e49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.metadata \u0026\u0026 Object.keys(e.metadata).length \u003E 0\u0060 appears character-identically in 2 files \u2014 npm/packages/rvf-mcp-server/src/server.ts, npm/packages/rvf/src/backend.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-mcp-server/src/server.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4113c3d57f76e4e817efeac45844f3d405becbd61f692676025504ecbe4212"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.source === source \u0026\u0026 e.target === target\u0060 appears character-identically in 4 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts, npm/packages/cli/src/storage.js, npm/packages/cli/src/storage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1899cd1b0537f6ef51e584fe47d96b68c07edaa66121dfd316c84a34bd29c38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060endDate || new Date(Date.now() \u002B 24 * 60 * 60 * 1000)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/timeseries.js, npm/packages/agentic-synth/src/generators/timeseries.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/timeseries.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"786cda7070b1a51723f60d98064ab823c26c8ccb868aefc7734fe33a8811ef55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.metadata?.name || entry.metadata?.label || entry.id\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/exporters.js, npm/packages/ruvector-extensions/src/exporters.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/exporters.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f091e1aba67c8b2f73a657d09be04afbdc8a534722a5a81fed0d66dfa735f60f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err \u0026\u0026 typeof err === \u0022object\u0022 \u0026\u0026 \u0022status\u0022 in err\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/routes/api/transcribe/\u002Bserver.ts, ui/ruvocal/src/routes/api/v2/user/billing-orgs/\u002Bserver.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/transcribe/\u002Bserver.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b4fda74e3575ef4c0e97a96247620ac6e7e6eadd0e2d9209bf2a66928bbfb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof PayloadTooLargeError || error instanceof InvalidJsonError\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvbot/src/RuvBot.ts, npm/packages/ruvbot/src/server.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11bb3a37ef5aa57a072d2cdb1e1aa27805f1164839550b4d6c904771f8e41d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060eventType === undefined || timestamp === undefined\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/events.js, npm/packages/agentic-synth/src/generators/events.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/events.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcce44572cb07864bd98207cad1a815fe69da3c319e623ea5abc7a5e82890293"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expectedDim !== undefined \u0026\u0026 vector.length !== expectedDim\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/client.js, npm/packages/postgres-cli/src/client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4c7f75254dead500865166a2de31d05c80c3582bc76e748e4095a8538a0d39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expectedType !== \u0027array\u0027 \u0026\u0026 actualType !== expectedType\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"52029170c0e82edb92ed7e1379b644ee1e3daf1d099c6482a0fa5f8cbec327b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expectedType === \u0027array\u0027 \u0026\u0026 !Array.isArray(record[key])\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7568009432180da39b66bb800f801c6cc17753ffcccdf43877fcb05d27ee4eec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fieldSchema.properties \u0026\u0026 typeof record[key] === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13fba0632ee6a11e17c97968fdcf9918cdc1100a6c32105b773f1ece71dc919"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fieldSchema.required \u0026\u0026 !(key in record)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2dccc93becb4782c4934f7a0fadeafa0b568ff55f2f714cb5cfb821772f8829"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file.split(\u0027.\u0027).pop()?.toLowerCase() || \u0027\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/patterns.js, npm/packages/ruvector/src/analysis/patterns.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/patterns.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"742066aab45c58aa315190ead23ede60c6850990e25e7ae918ac274c7fdb8fed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileContent.match(/\\?[^:]/g)?.length || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc8783e510e0dd40bcce184d5d4687b79ab70b94f9cd811d7c1340cffa9d1b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileContent.match(/\\bcase\\b/g)?.length || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"287b238d2b7bf6a38ec82265ba8e272b1e3821550fb287e6a16fa0897dc7e02b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileContent.match(/\\bcatch\\b/g)?.length || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a5aa8ce16a812ac92c4c90c943dc86b5517ddf314d6df7c8a4984313b5fbd7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileContent.match(/\\belse\\b/g)?.length || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f4c7e7ffbaccc735803d122e159f71e58482d7ad42d65e08b2012beddcee9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileContent.match(/\\bfor\\b/g)?.length || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55d70476fec4b01a979dee9c1729cec565535fa290db91576c26ceca4c4ef6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileContent.match(/\\bif\\b/g)?.length || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"119a3fa6fe6e3f4ca84c5e735ed0801c4895ca33f4d7b451070e365a2bde9866"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileContent.match(/\\bswitch\\b/g)?.length || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c5c5008d032e9cfbdb74bc68700ca4c558008c5804f5520e01b8bfced1f1aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileContent.match(/\\bwhile\\b/g)?.length || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a09cc735f762a1cf25c8fb9ad7c8a50cff1d22e937d55786e80495ea6c16cc0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fs.existsSync(settingsPath) \u0026\u0026 !opts.force\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbff202858c5aefff02e8189727d11b7569a56461cd8d94d1c810fa7fed0817"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C argv.length \u0026\u0026 !argv[i \u002B 1].startsWith(\u0027-\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/kge/src/cli/args.ts, npm/packages/typesafe/src/cli/args.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/cli/args.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a642e2e622116d4ec1b6bb5c2d8bc6841013b50e08b5c895f8e4716588f670b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input instanceof ArrayBuffer || ArrayBuffer.isView(input)\u0060 appears character-identically in 2 files \u2014 npm/packages/rvf-solver/pkg/rvf_solver.js, npm/packages/rvf-wasm/pkg/rvf_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-solver/pkg/rvf_solver.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d5d1b8a375f18ce7651554340b6a3eba06c4b2a3cc572c18178e9f92a5f2ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060iterations[0]?.quality.overallScore || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/dspy-real-integration.js, npm/packages/agentic-synth/training/dspy-real-integration.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce53cc980f5bb74f0bdcb1861039cf1e05ea4349f87d86035f25aee9ce33391"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u002B 3 \u003C dim \u0026\u0026 baseIdx \u002B j \u002B 3 \u003C weightsLen\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/federated.js, npm/packages/ruvllm/src/federated.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/federated.js"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8c72f01716f538cddcd267e1c0d06c2a0170dab90fad67658d895c04cac28a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u003E= 0 \u0026\u0026 (source[j] === \u0027 \u0027 || source[j] === \u0027\\t\u0027 || source[j] === \u0027\\n\u0027 || source[j] === \u0027\\r\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/decompiler/statement-parser.js, scripts/lib/module-splitter.mjs. 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":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3bba89ba08ae18b146927a0fe87792cc3fab401cfab7c12b53a17dec8f7973"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060jsonSchema.properties \u0026\u0026 typeof jsonSchema.properties === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b93b4c429b39a3fb44d5f59f617f0d5b8e680a4bd133f69b064df2ecd817bcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lastError || new Error(\u0027Unknown error during retry\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/vector-client.js, npm/packages/cloud-run/vector-client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/vector-client.js"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"926f676150a233d716833252ced72f7d91ce24494299915c9c9632259c5736a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060latencies[this.modelConfig.model] || 1000\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/dspy-benchmarks.js, npm/packages/agentic-synth/training/dspy-benchmarks.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83d9d2e424d50fe25a9e2eda1d898792fc32e3233576aa070b27254d9127061"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.includes(\u0027:\u0027) || line.includes(\u0027must\u0027) || line.includes(\u0027should\u0027)\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/training-session.ts, npm/packages/agentic-synth/training/dspy-learning-session.js, npm/packages/agentic-synth/training/dspy-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"84229df389179084bfa59223d06c3ef458ac350e4411daecb76769cbee964529"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.children \u0026\u0026 message.children.includes(messageId)\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/routes/api/conversation/[id]/message/[messageId]/\u002Bserver.ts, ui/ruvocal/src/routes/api/v2/conversations/[id]/message/[messageId]/\u002Bserver.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/conversation/[id]/message/[messageId]/\u002Bserver.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"da39eb74daa14753f5e7b69a9998d3cdb720fc8fd0f47940732c70ef9aa82fe4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.includes(\u0027rate limit\u0027) || message.includes(\u0027timeout\u0027) || message.includes(\u0027503\u0027) || message.includes(\u0027429\u0027) || message.includes(\u0027con\u2026\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/embeddings.js, npm/packages/ruvector-extensions/src/embeddings.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8217b60dd71dabc8d2b27f917e6156674f321d0b20b56d63650650e208e630e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.match(/error\\[([A-Z]\\d\u002B)\\]/i) || message.match(/([A-Z]\\d{4})/)\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1814e9b57b86e1bc96c9b8598e34dcd6e21e25d679deafe0423c9447a960c6e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060messagesOpenAI.length \u003E 0 \u0026\u0026 messagesOpenAI[0]?.role === \u0022system\u0022\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts, ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/endpoints/openai/endpointOai.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c222341e0fb3066ea78cb67807570767351af9846f2029541075105826646fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060method === \u0027GET\u0027 \u0026\u0026 pathname === \u0027/healthz\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/kge/src/serve.ts, npm/packages/typesafe/src/serve.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/src/serve.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6279634c44104e4181401a3cc55893a649935cf064f91456e40aa88bb10a463"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metrics.ops_per_sec?.toFixed(0) || \u0027N/A\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/commands/benchmark.js, npm/packages/postgres-cli/src/commands/benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/benchmark.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd5578b7dd7f2d195823a73d42d5c77836138103f4e3859413fed5a4bd11791"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metrics?.healthy \u0026\u0026 (!task.region || agent.region === task.region)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/agent-coordinator.js, npm/packages/agentic-integration/agent-coordinator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d484746632cdc41735ec2123b4bae1a1c96eaf70cde4a51f984f36e992f1d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.patterns \u0026\u0026 model.patterns.length \u003E 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/export.js, npm/packages/ruvllm/src/export.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/export.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"17164f8f332ebc84f1e2c7e63b8dfe7bd497bfbba55566626b609cfc3b6656fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060modelName.includes(\u0027gpt\u0027) || modelName.includes(\u0027turbo\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/dspy-real-integration.js, npm/packages/agentic-synth/training/dspy-real-integration.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df700fe0088d05b5616770b9a10a5ad03f331cb81a9f4d328401280a9b1189e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name \u0026\u0026 !reserved.has(name) \u0026\u0026 name.length \u003E 1\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/patterns.js, npm/packages/ruvector/src/analysis/patterns.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/patterns.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"524109dc69351cbcdb30a05f81645cd062016e67f40e8bcea0df350fadb1f1ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nativeBinding.VectorDb \u0026\u0026 !nativeBinding.VectorDB\u0060 appears character-identically in 2 files \u2014 npm/core/src/index.cjs.js, npm/core/src/index.cjs.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/core/src/index.cjs.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"125064ead5c304034b70315b314d8dc1b56304f91beda2df876f3e5092430add"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj \u0026\u0026 typeof obj.id === \u0027string\u0027 \u0026\u0026 typeof obj.timestamp === \u0027number\u0027 \u0026\u0026 Array.isArray(obj.changes) \u0026\u0026 Array.isArray(obj.tags)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/temporal.js, npm/packages/ruvector-extensions/src/temporal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.js"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e1c04f83588ae10ff210441aa5d445d6013809c2e71098a72d7873b8d0818a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj \u0026\u0026 typeof obj.type === \u0027string\u0027 \u0026\u0026 typeof obj.path === \u0027string\u0027 \u0026\u0026 typeof obj.timestamp === \u0027number\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/temporal.js, npm/packages/ruvector-extensions/src/temporal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.js"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ee3bf4c96da4218756ca6c459e6e013b5bbb6a7dbf05f31185c338c02efd64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060objective.direction !== \u0022maximize\u0022 \u0026\u0026 objective.direction !== \u0022minimize\u0022\u0060 appears character-identically in 2 files \u2014 crates/ruvector-sota-bench/harness/src/optimizationManifest.ts, crates/ruvector-sota-bench/harness/src/pareto.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/harness/src/optimizationManifest.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3568f950be006e4c78f91e7da5e51560dc430a6c1ba36eba5cd9face30ab8e51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060onProgress \u0026\u0026 i % this.options.batchSize === 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/persistence.js, npm/packages/ruvector-extensions/src/persistence.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"924ad594e8a71e44959adf32fc884323615da3c2f8625b3c652cec8659b8f10b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options === null || typeof options !== \u0027object\u0027 || Array.isArray(options)\u0060 appears character-identically in 2 files \u2014 npm/packages/e-means/integrations/quantization.mjs, npm/packages/e-means/runtime.mjs. 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":"npm/packages/e-means/integrations/quantization.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2874a6316abc75bcf715bf4122a148868a2b9f72243cc9409383cfeac18dd68d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.finalization !== undefined \u0026\u0026 ![\u0027lastEpochMean\u0027, \u0027ema\u0027].includes(options.finalization)\u0060 appears character-identically in 2 files \u2014 npm/packages/e-means/integrations/cloudflare/validation.mjs, npm/packages/e-means/runtime.mjs. 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":"npm/packages/e-means/integrations/cloudflare/validation.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd97d6eb0e0fbd17f4a195c1289f2474bab3a479fd3a386477279b66082d98eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.format \u0026\u0026 ![\u0027json\u0027, \u0027csv\u0027, \u0027array\u0027].includes(options.format)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/base.js, npm/packages/agentic-synth/src/generators/base.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3462e694be28d844f9cfefdb92d21ab60a80a59f7b6ce54e81de08c07f66912b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.format || this.detectFormat(options.path)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/persistence.js, npm/packages/ruvector-extensions/src/persistence.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.js"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80dab2e84f6181c49426011612db8f13baedc351bdb99893b9b5884810f35cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.path || this.getDefaultSavePath(format, compress)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/persistence.js, npm/packages/ruvector-extensions/src/persistence.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9609fdbac6631d9af511df311d8ba92aae465fe3f8648d5eb553d7b9195350c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.pgVersion || sys.pgVersion || DEFAULT_PG_VERSION\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/commands/install.js, npm/packages/postgres-cli/src/commands/install.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be3e1a63016cc49fba0a05d6b3b151828d7d64210af7e1a77f0db8f49934fe9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.prompt || \u0060 Generate high-quality output that is: - Clear and well-structured - Accurate and relevant - Engaging and professional - \u2026\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/cli-runner.js, npm/packages/agentic-synth/training/cli-runner.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/cli-runner.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b023ee2db0ec72c11f8fb102ac09cd28cb95e0a7c986ad24dd0be06546a1ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.ttl || this.config.messageTimeout\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/coordination-protocol.js, npm/packages/agentic-integration/coordination-protocol.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/coordination-protocol.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0547120dac0305f3660914be2a402429fb911c31fead64e5cea62de2a5ce2b5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.type === \u0027attention\u0027 || options.type === \u0027all\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/commands/benchmark.js, npm/packages/postgres-cli/src/commands/benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/benchmark.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ce97805e07e59f7423cd163e1ac6c7ac60e7f6c51515787f82d1f409685ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.type === \u0027gnn\u0027 || options.type === \u0027all\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/commands/benchmark.js, npm/packages/postgres-cli/src/commands/benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/benchmark.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b62030ff71fd92f472a709f0584ab8672801c99bd7925d1066873b2132ee0b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.type === \u0027vector\u0027 || options.type === \u0027all\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/commands/benchmark.js, npm/packages/postgres-cli/src/commands/benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/benchmark.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d2b40a898bcc012805164c110ebdfffc0e8be3a00aacbdf7391c6646597721"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.verifyChecksum \u0026\u0026 state.checksum\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/persistence.js, npm/packages/ruvector-extensions/src/persistence.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"113f85d0aaed95d9dc074de2d86968c83b2db5aee0f8252f2beac52f05c8576a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060other.quality.overall \u003E= result.quality.overall \u0026\u0026 other.cost.costPerSample \u003C= result.cost.costPerSample \u0026\u0026 (other.quality.overall \u003E result.\u2026\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/dspy-benchmarks.js, npm/packages/agentic-synth/training/dspy-benchmarks.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.js"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"835fdfceb6d016946e088597465b119ce71b8b6683b4a2a62747b61681ae67bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.quality_score \u0026\u0026 expected.quality_score\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/benchmark.ts, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/benchmark.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"274a580185d607d740c6294c3392d08fa034c7e04f6b3a8cbdb0a2301784110b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outputData.length \u003E 0 \u0026\u0026 expectedData.length \u003E 0\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/benchmark.ts, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/benchmark.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"583f47e97175b45fd8b6e08c6fc1232f0e747d72559f4f99d699c94e5fab95b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p !== \u0022default\u0022 \u0026\u0026 !Object.prototype.hasOwnProperty.call(exports, p)\u0060 appears character-identically in 2 files \u2014 npm/packages/rudag/src/browser.js, npm/packages/rudag/src/node.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/browser.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63c71c01912dfdb796dc3586bd9dbcbc27efa7195d5cc9888e6250185f2777a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pattern.useCount \u003E= minUseCount \u0026\u0026 pattern.successRate \u003C minSuccessRate\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/sona.js, npm/packages/ruvllm/src/sona.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/sona.js"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"787d5227efaef49c2b70f66637839858c3881c3e767df83de6a74abeba7fa970"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pgVersion || sys.pgVersion || DEFAULT_PG_VERSION\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/commands/install.js, npm/packages/postgres-cli/src/commands/install.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/commands/install.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cf92f2164eb2db7b9a6b64f2a691b4fc6b5d63d988e05baf242377b4fca895"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060platformMap[process.platform] \u0026\u0026 platformMap[process.platform][process.arch]\u0060 appears character-identically in 2 files \u2014 npm/packages/kge/index.js, npm/packages/typesafe/index.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/kge/index.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24248e29aad0456d9d07c2ed70bc3e804b4843fbfd11a05be12b2dfedeb657b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previousMetrics \u0026\u0026 previousMetrics.healthy !== metrics.healthy\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/agent-coordinator.js, npm/packages/agentic-integration/agent-coordinator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/agent-coordinator.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc44fbc6ad9cb23e16aac315119632e018a1c358ed7e9956be5f6b750a87a0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.ANTHROPIC_BASE_URL||m7().BASE_API_URL\u0060 appears character-identically in 2 files \u2014 docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/BASE_API_URL.js, docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/HTTPS_PROXY.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/BASE_API_URL.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b08bedde18b937fad4953d98dc3fb79334a98e61b3bd763b944dab568ab7bd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.BRAIN_URL || \u0027https://pi.ruv.io\u0027\u0060 appears character-identically in 2 files \u2014 scripts/analyze-evolution.js, scripts/gemini-agents.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-evolution.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"da74aac003aad8b72663be94f4ef8389f8b2540eac86678f3da679a08ff31c38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CI || process.env.GITHUB_ACTIONS\u0060 appears character-identically in 2 files \u2014 .claude/helpers/hook-handler.cjs, .claude/helpers/statusline.cjs. 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":".claude/helpers/hook-handler.cjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d3593294ddab098586d2aa7e142d82ef2712690bb72c1f9c7f859677231f15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CLAUDE_PROJECT_DIR || process.cwd()\u0060 appears character-identically in 2 files \u2014 .claude/helpers/hook-handler.cjs, .claude/helpers/statusline.cjs. 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":".claude/helpers/hook-handler.cjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25b523354af8ac8717305920e3b57fe85a2f4a9106ce47a518b5bd4e69aa8b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.GOOGLE_AI_API_KEY || process.env.GEMINI_API_KEY\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvbot/src/RuvBot.ts, npm/packages/ruvbot/src/server.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/RuvBot.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"90017d946febc3a95d34776fed21f3b9a5046af837094eb709bc954e2563d7a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.GRACEFUL_SHUTDOWN_TIMEOUT || \u002710000\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/streaming-service.js, npm/packages/cloud-run/streaming-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6382a5627180fc4bd4737f1aeab42ad17b67700cd2cceb4e215aba2447d1cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.KEEP_ALIVE_TIMEOUT || \u002765000\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/streaming-service.js, npm/packages/cloud-run/streaming-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fca16b686155cdb0038dad87b3b3d7878dc354bb3219043895680377b4d6b62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.MAX_REQUESTS_PER_SOCKET || \u00271000\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/streaming-service.js, npm/packages/cloud-run/streaming-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4756889db940ba52c218f6a6072fbfb35ed9be1d81ba583d492ca5b816374407"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.RUFLO_DEBUG || process.env.DEBUG\u0060 appears character-identically in 2 files \u2014 .claude/helpers/auto-memory-hook.mjs, .claude/helpers/intelligence.cjs. 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":".claude/helpers/auto-memory-hook.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7981e825ab0e9e8006f3cbfa0f3c6ce4ccbed1b7379a344c08212e6471819d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.RUVBOT_PLUGINS_DIR || \u0027./plugins\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvbot/src/cli/commands/doctor.ts, npm/packages/ruvbot/src/cli/commands/plugins.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"137ec33a96ca48c56c15a0d70559499e1ecf88279c03f0de728b782f834858d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.RUVECTOR_HOST || \u0027localhost\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/streaming-service-optimized.js, npm/packages/cloud-run/streaming-service-optimized.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service-optimized.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f067351e035d0487360513eef0d7004ccfcdcdb959fa1b72aa48d5aa1697bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.RUVECTOR_HOST || \u0027localhost:50051\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/streaming-service.js, npm/packages/cloud-run/streaming-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/streaming-service.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b14bd9a8b182eebf7d1338ce8251bcfb932e8c52043eda7ce2fd1184b7004b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.RUVECTOR_POSTGRES_URL || process.env.DATABASE_URL\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/storage.js, npm/packages/cli/src/storage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/storage.js"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66237d2d5ece7b8fca7419a2b3683997c310d634ce5bea56a07c5ae642eac18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r instanceof Error \u0026\u0026 r.message.includes(\u0027Rate limit\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/integration-tests.js, npm/packages/agentic-integration/integration-tests.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/integration-tests.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0d978fc2008a8baf5306bf35946ef8ad4f9392fa770a6bbd7fa765506f9d9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.id !== nodeId \u0026\u0026 r.similarity \u003E= threshold\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/ui-server.js, npm/packages/ruvector-extensions/src/ui-server.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.js"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"94543cc1ab8a72e3d8b240eac8b668b91dbe73d150e9d35795a2b60cd015ab91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw.startsWith(\u0022\u0060\u0022) \u0026\u0026 raw.endsWith(\u0022\u0060\u0022)\u0060 appears character-identically in 3 files \u2014 ui/ruvocal/src/lib/server/models.ts, ui/ruvocal/src/lib/server/usageLimits.ts, ui/ruvocal/src/routes/login/callback/\u002Bserver.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fdcfe673c35b583c2375845fae9292bc0ad3051828ffe905896b04434ff42e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060real !== rootReal \u0026\u0026 !real.startsWith(rootReal \u002B sep)\u0060 appears character-identically in 2 files \u2014 scripts/adr-index.mjs, scripts/frozen-weights-check.mjs. 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":"scripts/adr-index.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f64b9f407199dbd460fb466eac1874aae304058953aced196109c69729217bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060region \u0026\u0026 backend.config.region !== region\u0060 appears character-identically in 2 files \u2014 npm/packages/cloud-run/load-balancer.js, npm/packages/cloud-run/load-balancer.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cloud-run/load-balancer.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b04267840588a8ee6cc4ae935863408619d7cf533375664b5188a082815c0e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.prevLogIndex \u003E 0 \u0026\u0026 !this.state.log.containsEntry(request.prevLogIndex, request.prevLogTerm)\u0060 appears character-identically in 2 files \u2014 npm/packages/raft/src/node.js, npm/packages/raft/src/node.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/raft/src/node.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f165f46646b9785d82ded7a86c5e58052b1a0b0c83906eb0c768e61b4befed65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.topK \u003C= 0 || request.topK \u003E 1000\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/regional-agent.js, npm/packages/agentic-integration/regional-agent.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"423683f2e9a89c971b9865577d7b73d7120126c2909c976d88b0c61730f30873"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.headers.get(\u0027content-length\u0027) || String(model.sizeBytes)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/models.js, npm/packages/ruvllm/src/models.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/models.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec44fdaeb1925a0e47660474f0cac1c904396a85d6aa8282b28de6fd8ffd3c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.cyclomaticComplexity \u003E thresholds.complexity || result.functions \u003E thresholds.functions || result.lines \u003E thresholds.lines || result.\u2026\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/analysis/complexity.js, npm/packages/ruvector/src/analysis/complexity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/analysis/complexity.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c5d6d3a226a5ed8dfac2b53a2561e7f7efece7f64437acc0c613dee03fe3ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060results[results.length - 1]?.prompt || \u0027\u0027\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/training-session.ts, npm/packages/agentic-synth/training/dspy-learning-session.js, npm/packages/agentic-synth/training/dspy-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7e6c0d399a55b6307b8622e1116b1a76756afc67fa25c7cde69cfa0dd50cd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060results[results.length - 1]?.prompt || basePrompt\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/training-session.ts, npm/packages/agentic-synth/training/dspy-learning-session.js, npm/packages/agentic-synth/training/dspy-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d324eeabc83c0393e92aeb486520506e31d5048b1fe87b1088795361d20132bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060round \u003C optimizationRounds \u0026\u0026 !converged\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/dspy-real-integration.js, npm/packages/agentic-synth/training/dspy-real-integration.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-real-integration.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5112fbbce75f1d503949afd76c6045db0f83a4c77daa286da04dde2d339816"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060route.provider === \u0027gemini\u0027 \u0026\u0026 this.gemini\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/base.js, npm/packages/agentic-synth/src/generators/base.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31c13de6f78dc8ae6989ce785291579081c85ef84a241fe13219153500cc5dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row \u003C weights.loraA.length \u0026\u0026 row \u003C otherWeights.loraA.length\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/lora.js, npm/packages/ruvllm/src/lora.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.js"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5408ce1e502972e72da6f173874989f197a641bf2a3d8a03a959b48fdc8e520a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row \u003C weights.loraB.length \u0026\u0026 row \u003C otherWeights.loraB.length\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/lora.js, npm/packages/ruvllm/src/lora.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"758e87054858d1f05b8986fd8daa0cb7ad10277d01e0fe2cf8531800bc7021b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.from_file === fromFile \u0026\u0026 s.to_file === toFile\u0060 appears character-identically in 4 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts, npm/packages/cli/src/storage.js, npm/packages/cli/src/storage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"773af1eaaf1a1ce727fb73aad64aa31ba2fc5e0d2bf40ed87bc0b3f3f8c38b71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060severity === \u0027error\u0027 || severity === \u0027warning\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/cli/src/cli.js, npm/packages/cli/src/cli.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cli/src/cli.js"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14c770b2e0ba4a75ba2072f6f6d0e104bd2c10a66746bde010c2ffaec888f3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature.constraints \u0026\u0026 signature.constraints.length \u003E 0\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/training-session.ts, npm/packages/agentic-synth/training/dspy-learning-session.js, npm/packages/agentic-synth/training/dspy-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"6100c581b179138fc24fb21149a15b40807c9b70e232639456347f62d12cc83b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature.examples \u0026\u0026 signature.examples.length \u003E 0\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/training-session.ts, npm/packages/agentic-synth/training/dspy-learning-session.js, npm/packages/agentic-synth/training/dspy-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea914c68db157a284ded078e3697a992ea22e41602b08d0f0a18f269767a5c0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature.objectives \u0026\u0026 signature.objectives.length \u003E 0\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/training-session.ts, npm/packages/agentic-synth/training/dspy-learning-session.js, npm/packages/agentic-synth/training/dspy-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf348d09bc489d8ac08f2a4d2b58a9a8d9943ccd089d3bb6168a97cba81fbc0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060similar.length \u003E 0 \u0026\u0026 similar[0].score \u003E 0.6\u0060 appears character-identically in 2 files \u2014 .claude/intelligence/cli.js, .claude/intelligence/index.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/intelligence/cli.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"56613f7a4e3095543841f3a9b66346db1b5e06a0501dc38234381560c93362f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060size \u003E= 1024 \u0026\u0026 unitIndex \u003C units.length - 1\u0060 appears character-identically in 3 files \u2014 npm/packages/ruvector-extensions/src/persistence.js, npm/packages/ruvector-extensions/src/persistence.ts, npm/packages/ruvllm-wasm/src/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/persistence.js"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e260ad12dc15d8d661018e9c1c7457ce577df89b06f6eabc64d4eaca9dcd36d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source[i] === \u0027$\u0027 \u0026\u0026 i \u002B 1 \u003C len \u0026\u0026 source[i \u002B 1] === \u0027{\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/decompiler/statement-parser.js, scripts/lib/module-splitter.mjs. 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":"npm/packages/ruvector/src/decompiler/statement-parser.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b6a0d99454cc7635c992a2841b4ba9c8b924dd6d0fe9ea420c1e43967bd50b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stats \u0026\u0026 stats.avgQualityScore \u003E bestScore\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/training-session.ts, npm/packages/agentic-synth/training/dspy-learning-session.js, npm/packages/agentic-synth/training/dspy-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c39ab1ab53cf1d1deb43341ec07e49d597e1ddc91ec1d7a0245a938cbadd6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.activeStreams \u003C this.config.maxConcurrentStreams \u0026\u0026 this.getMemoryUsage() \u003C 90 \u0026\u0026 this.getCpuUsage() \u003C 90\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-integration/regional-agent.js, npm/packages/agentic-integration/regional-agent.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-integration/regional-agent.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd208562db81913f7475be8f34aa95f1c15c2eed764f1f3ae53f79c49f9254d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.adapters.get(this.activeAdapterId) || null\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/lora.js, npm/packages/ruvllm/src/lora.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"db73494408a2998306a1108215cb0b541ae2588405147c44a2481379a8671767"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.cache \u0026\u0026 typeof caches !== \u0027undefined\u0027 \u0026\u0026 cacheKey\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/core/onnx/loader.js, npm/packages/ruvector/src/core/onnx/pkg/loader.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/loader.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c20a0d323379a59f2819e840210916f079b8090e9e8982f74a813995a0c208a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.cache.size \u003E= this.maxSize \u0026\u0026 !this.cache.has(key)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/cache/context-cache.js, npm/packages/agentic-synth/src/cache/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/cache/context-cache.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0785d98e8339bd480cdf4373debdc873ec8c736a9148894af0e7da3ce292199"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.client.getConfig().model || \u0027moonshot/kimi-k2-instruct\u0027\u0060 appears character-identically in 4 files \u2014 npm/packages/graph-data-generator/src/generators/entity-relationships.ts, npm/packages/graph-data-generator/src/generators/knowledge-graph.ts, npm/packages/graph-data-generator/src/generators/social-network.ts, npm/packages/graph-data-generator/src/generators/temporal-events.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/generators/entity-relationships.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"083bd27a69a5d16d870e7a46b536da1e230283f4665a27b7c7d4cb228c7a4d91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.config.capabilities?.vectorDb \u0026\u0026 VectorDb\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/workers/native-worker.js, npm/packages/ruvector/src/workers/native-worker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/workers/native-worker.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5757b02110ddd5039303850790ea0ae06394cbd11baf307d46dd96a66bbf6b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.config.costBudget \u0026\u0026 this.totalCost \u003E= this.config.costBudget\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/training-session.ts, npm/packages/agentic-synth/training/dspy-learning-session.js, npm/packages/agentic-synth/training/dspy-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/training-session.ts"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62e6d010921b6189d9399e6411755aef24eac58bb4c46b0a98a53edfe1efb52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.config.model || \u0027moonshot/kimi-k2-instruct\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/graph-data-generator/src/embedding-enrichment.ts, npm/packages/graph-data-generator/src/openrouter-client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-data-generator/src/embedding-enrichment.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1436ae979cbf250829d4c65e11fd4005ad16abef4057b9050027fd25e5e9a062"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.contributions.size % this.consolidationInterval === 0 \u0026\u0026 this.contributions.size \u003E 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/federated.js, npm/packages/ruvllm/src/federated.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/federated.js"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f9c9ebdc6b7f59ad395f22ef30cbf1386b951e11fb763c41b1d4f297a5fbcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.history[this.history.length - 1]?.loss || 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/contrastive.js, npm/packages/ruvllm/src/contrastive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/contrastive.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecdbf536a79b49fc9a04f91ca15e6fe703e18e0c957cc0f0c7a947a10096795"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.initialized || !this.config.enabled\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/core/parallel-intelligence.ts, npm/packages/ruvector/src/core/parallel-workers.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/parallel-intelligence.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f59a23e5f7f62b59d4686c20546f370acf17b1d96d1a9fec1def9fd86d5a64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.scheduler?.getLR() || this.config.learningRate\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/training.js, npm/packages/ruvllm/src/training.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/training.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf987fe1af4e1e9c8726c4a63950a70da364e98c9034d0184423d472ebd47cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.trainingState !== null \u0026\u0026 this.config.dropout \u003E 0\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/lora.js, npm/packages/ruvllm/src/lora.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/lora.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0887c21ab8e2b8d1c4bf233b1d3b27cebbcdf14e5642f7ce8399995ccaa7350"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.versions.get(current.parentId) || null\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/temporal.js, npm/packages/ruvector-extensions/src/temporal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.js"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ffb40696f85cb3da1ee6b560c18f639d23980bf4c5c4081b2287b3bfa05e1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.versions.get(options.versionId) || null\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/temporal.js, npm/packages/ruvector-extensions/src/temporal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.js"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"03be59480a3a59dcba4d488ce00e728cc6041d6fb8c695cb0d6199302daf09e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060timeRange?.start || new Date(Date.now() - 24 * 60 * 60 * 1000)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/events.js, npm/packages/agentic-synth/src/generators/events.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/events.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"561234bec25fc0eee246ac597ea042e224ed778c43d4d23e835c7e2e082ab3c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokenCount % 3 === 0 || i === words.length - 1\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/streaming.js, npm/packages/ruvllm/src/streaming.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/streaming.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bc8196979bd489f544070011bbe90e2e15ca24474abf7f508a080a21f9af10"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060traj.outcome === \u0027success\u0027 || traj.outcome === \u0027partial\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvllm/src/sona.js, npm/packages/ruvllm/src/sona.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/sona.js"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"469fd7518a486159823a411e522055c7e4f6dbacd34cd6131e1d2f1d4ff1c61b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trigger.type === \u0027keyword\u0027 \u0026\u0026 input.toLowerCase().includes(trigger.value.toLowerCase())\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvbot/src/core/skill/index.ts, npm/packages/ruvbot/src/skills/SkillExecutor.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/core/skill/index.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9e8f75e6e6f2bae3de1428ad76b5636020863b6edf264819f8b429c6ff134d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof WebAssembly !== \u0027undefined\u0027 \u0026\u0026 input instanceof WebAssembly.Module\u0060 appears character-identically in 2 files \u2014 npm/packages/rvf-solver/pkg/rvf_solver.js, npm/packages/rvf-wasm/pkg/rvf_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-solver/pkg/rvf_solver.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c06427ed5e3baca4ee1c0f380cf2c224e92a2513a4fe1d0aac1b7c14c16415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof event !== \u0027object\u0027 || event === null\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/events.js, npm/packages/agentic-synth/src/generators/events.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/events.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b017f53bd487a8db4bc21f8c4f6c58aec476b369bc276a052db18fe93608cf2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof file?.mime === \u0022string\u0022 \u0026\u0026 file.mime.startsWith(\u0022image/\u0022)\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/router/endpoint.ts, ui/ruvocal/src/lib/server/textGeneration/mcp/runMcpFlow.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/router/endpoint.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccb6e71912d62d4d2b958ef8f801250afa95eb92e55674557e7c6298932377b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof firstItem !== \u0027object\u0027 || firstItem === null\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/base.js, npm/packages/agentic-synth/src/generators/base.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c68fa3b864178974a8a2ecd4ca0f52596186ed60f8fcc9b212b404a46735134"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof id !== \u0027string\u0027 || id.length === 0 || id.length \u003E 256\u0060 appears character-identically in 6 files \u2014 npm/packages/rudag/src/dag.js, npm/packages/rudag/src/dag.ts, npm/packages/rudag/src/node.js, npm/packages/rudag/src/node.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5e85c7d55dc6411f8dbd7dd566e82a689c7ce6fdba9b4df5911565c4b22e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item !== \u0027object\u0027 || item === null\u0060 appears character-identically in 6 files \u2014 npm/packages/agentic-synth/src/generators/base.js, npm/packages/agentic-synth/src/generators/base.ts, npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d54fef724c200bdbcd7b3507baeb5c7a68440962c5a67569c5d1aceb00fd9e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item === \u0027number\u0027 \u0026\u0026 Number.isFinite(item)\u0060 appears character-identically in 2 files \u2014 npm/packages/rudag/src/dag.js, npm/packages/rudag/src/dag.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rudag/src/dag.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dbe1e6dc663a461fee40861d52bd0219af47fd209c99b312f809806d1b1c87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item.age === \u0027number\u0027 \u0026\u0026 item.age \u003E= 18 \u0026\u0026 item.age \u003C= 80\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/openrouter-learning-session.js, npm/packages/agentic-synth/training/openrouter-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b6a90f9ff3e67ad8a863d0a774acfd7449f530c8db9e7e7fb59c69af4bea9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item.email === \u0027string\u0027 \u0026\u0026 item.email.includes(\u0027@\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/openrouter-learning-session.js, npm/packages/agentic-synth/training/openrouter-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.js"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1eba2b7f14825d06b2a93fd62bf1696de511bc75407e175552ca99184cfdb7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item.name === \u0027string\u0027 \u0026\u0026 item.name.length \u003E 3\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/openrouter-learning-session.js, npm/packages/agentic-synth/training/openrouter-learning-session.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/openrouter-learning-session.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa07be87e0382be44ef6ed5271555ce50ed289bee58519882f0083ec11c97d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof module_or_path === \u0027string\u0027 || (typeof Request === \u0027function\u0027 \u0026\u0026 module_or_path instanceof Request) || (typeof URL === \u0027function\u0027 \u0026\u0026 \u2026\u0060 appears character-identically in 14 files \u2014 crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js, crates/ruvector-economy-wasm/pkg/ruvector_economy_wasm.js, crates/ruvector-exotic-wasm/pkg/ruvector_exotic_wasm.js, crates/ruvector-graph-transformer-wasm/pkg/ruvector_graph_transformer_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb311af55b82ae6b995c7c32b8880355712b10903f1d2c97077b3697b7a1bf1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof name == \u0027string\u0027 \u0026\u0026 name.length \u003E 0\u0060 appears character-identically in 8 files \u2014 crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js, crates/ruvector-attention-wasm/pkg/ruvector_attention_wasm.js, crates/ruvector-exotic-wasm/pkg/ruvector_exotic_wasm.js, crates/ruvector-graph-transformer-wasm/pkg/ruvector_graph_transformer_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"030875b96b13155526bdfac5212cd06e68dbad3668afddf08a8a96d219dd2124"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof process !== \u0027undefined\u0027 \u0026\u0026 !!process.versions?.node\u0060 appears character-identically in 2 files \u2014 npm/packages/mincut-wasm/routing/worker.mjs, npm/packages/ruvector-wasm-unified/src/quantum.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/routing/worker.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa679f22093739fe48f6eb4364628be18e5f2dd2845978ae82813e6f0ffbddc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof process !== \u0027undefined\u0027 \u0026\u0026 process.argv[1]?.includes(\u0027dspy-multi-model-benchmark\u0027)\u0060 appears character-identically in 3 files \u2014 npm/packages/agentic-synth-examples/src/dspy/benchmark.ts, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js, npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth-examples/src/dspy/benchmark.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8aac1204cf5bd85f067dd7d7496303a4c4d81b86f957440f2faa557382be220"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof process !== \u0027undefined\u0027 \u0026\u0026 process.versions?.node\u0060 appears character-identically in 5 files \u2014 npm/packages/cognitum-gate-wasm/src/index.ts, npm/packages/mincut-wasm/routing/client.mjs, npm/packages/ruvector/src/core/onnx/loader.js, npm/packages/ruvector/src/core/onnx/pkg/loader.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/cognitum-gate-wasm/src/index.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"412d28f438fb188632071551a9d058c080b3cd2581069bdc2047d039f36a32f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof process !== \u0027undefined\u0027 \u0026\u0026 typeof process.argv !== \u0027undefined\u0027 \u0026\u0026 process.argv[1] \u0026\u0026 process.argv[1].includes(\u0027dspy-benchmarks\u0027)\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/training/dspy-benchmarks.js, npm/packages/agentic-synth/training/dspy-benchmarks.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-benchmarks.js"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"5710635ac54aab2e03d9adb9e9e418767a8faa1df5a9cf28fd914c8f5c05574a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof process !== \u0027undefined\u0027 \u0026\u0026 typeof process.versions !== \u0027undefined\u0027 \u0026\u0026 typeof process.versions.node === \u0027string\u0027\u0060 appears character-identically in 4 files \u2014 npm/packages/rvf-solver/pkg/rvf_solver.js, npm/packages/rvf-wasm/pkg/rvf_wasm.js, npm/packages/rvf/src/backend.js, npm/packages/rvf/src/backend.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-solver/pkg/rvf_solver.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"397816e678868da051542619da705cfdf7b2df64893e359e21847ed5c8d2e114"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof schemaValue !== \u0027object\u0027 || schemaValue === null\u0060 appears character-identically in 2 files \u2014 npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"840663fd7b9a75b221fc315f48cd6ce1222024211fc81cea5f82e9fc99d80187"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof state[key] === \u0027object\u0027 \u0026\u0026 state[key] !== null\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/temporal.js, npm/packages/ruvector-extensions/src/temporal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e52f8f9d1ff49e9dd3d0b75327484e2430a950f626db0e1b49b93be956377a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof toValue === \u0027object\u0027 \u0026\u0026 toValue !== null \u0026\u0026 !Array.isArray(toValue)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/temporal.js, npm/packages/ruvector-extensions/src/temporal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/temporal.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38f7ae4573b3e5aa4cbc0ebe43c840941877a5c120e1fe2b58751e2ba69b989"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v !== \u0027number\u0027 || !Number.isFinite(v)\u0060 appears character-identically in 4 files \u2014 npm/packages/postgres-cli/src/client.js, npm/packages/postgres-cli/src/client.ts, npm/packages/weight-space/src/model.ts, npm/packages/weight-space/src/store.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6adee9a189872ba32c43fed54a9d02de675a905299a7f26c17c16e7dfc629c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof val === \u0022object\u0022 \u0026\u0026 val !== null \u0026\u0026 \u0022$each\u0022 in (val as Record\u003Cstring, unknown\u003E)\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/database/postgres.ts, ui/ruvocal/src/lib/server/database/rvf.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23aa977794cd68e0ec226e7a924637bd1e548993c721a62be459d42a333154b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022number\u0022 || !Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-sota-bench/harness/src/optimizationManifest.ts, crates/ruvector-sota-bench/harness/src/pareto.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sota-bench/harness/src/optimizationManifest.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d332a8cc6df3f7daa1c18fe02b606874b271e1eccb3b4cb1fadf31800fc5ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || value === null\u0060 appears character-identically in 4 files \u2014 npm/packages/agentic-synth/src/generators/structured.js, npm/packages/agentic-synth/src/generators/structured.ts, npm/packages/kge/src/errors.ts, npm/packages/typesafe/src/errors.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/structured.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac995e40cfdadee526f2c13003ac85e856f368033759667ce355bf4b5c32beff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || value.trim() === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 npm/packages/rvforge/src/manifest.ts, npm/packages/rvforge/src/project.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvforge/src/manifest.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"32295b4b637feef6dcea7caec9886f8d3221e7cfa73ec19ae22abe194be1e4e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof(val) === \u0027object\u0027 \u0026\u0026 val !== null\u0060 appears character-identically in 10 files \u2014 crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js, crates/ruvector-attention-wasm/pkg/ruvector_attention_wasm.js, crates/ruvector-exotic-wasm/pkg/ruvector_exotic_wasm.js, crates/ruvector-graph-transformer-wasm/pkg/ruvector_graph_transformer_wasm.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29c85ea65bc1ec0626a6da9af80a60123b2e80bdb01d926aedbbd3fb87c9a8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060u.protocol === \u0022https:\u0022 \u0026\u0026 allowedHosts.has(host) \u0026\u0026 u.pathname === \u0022/mcp\u0022 \u0026\u0026 u.search === \u0022?login\u0022\u0060 appears character-identically in 2 files \u2014 ui/ruvocal/src/lib/server/mcp/hf.ts, ui/ruvocal/src/lib/utils/hf.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/mcp/hf.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1402f0b0fa95a9e07b36d52c728c96e82f3d5b373897219fa54a7a258437a1f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v.hits \u003C lowestHits || (v.hits === lowestHits \u0026\u0026 v.timestamp \u003C oldestTime)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector/src/services/embedding-service.js, npm/packages/ruvector/src/services/embedding-service.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/services/embedding-service.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90f001592ac8599503af0d8992626353598b57416148d1e729e8640fd58786d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027 || value.schema !== schema\u0060 appears character-identically in 2 files \u2014 npm/packages/e-means/integrations/ivf.mjs, npm/packages/e-means/integrations/quantization.mjs. 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":"npm/packages/e-means/integrations/ivf.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9a6ed94666a964086d44e3f0fb49e2234f3e2d6664480f90f10cbf266eebb6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060values.length === 0 || values[0].length === 0\u0060 appears character-identically in 2 files \u2014 npm/packages/postgres-cli/src/client.js, npm/packages/postgres-cli/src/client.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/postgres-cli/src/client.js"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"75351ade159baacb7cf99c6dd1161db833ce63667467059cec8518ff877a37ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vector.metadata?.label || vector.id.substring(0, 8)\u0060 appears character-identically in 2 files \u2014 npm/packages/ruvector-extensions/src/ui-server.js, npm/packages/ruvector-extensions/src/ui-server.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui-server.js"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1b5dd80cba85ede985ec30a38a9436ba55101347dd1690c1e7c156ba3cac40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.ndim != ndim or not data.size or data.shape[-1] \u003E _MAX_DIM\u0060 appears character-identically in 4 files \u2014 python/portfolio/ruvector-attention/src/ruvector_attention/__init__.py, python/portfolio/ruvector-core/src/ruvector_core/__init__.py, python/portfolio/ruvector-gnn/src/ruvector_gnn/__init__.py, python/portfolio/ruvector-sona/src/ruvector_sona/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/portfolio/ruvector-attention/src/ruvector_attention/__init__.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dede4e0fc40f7e5a76cba901b3fa1ef1ecffa423736a71401915b280f3480d2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, int) or not 1 \u003C= value \u003C= upper\u0060 appears character-identically in 4 files \u2014 python/portfolio/ruvector-attention/src/ruvector_attention/__init__.py, python/portfolio/ruvector-core/src/ruvector_core/__init__.py, python/portfolio/ruvector-gnn/src/ruvector_gnn/__init__.py, python/portfolio/ruvector-sona/src/ruvector_sona/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/portfolio/ruvector-attention/src/ruvector_attention/__init__.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0d70f012be1bdbae6387511b3bf1082779713c7117cf8134b0b4bb3f75c668"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(p.get(\u0022context_strings\u0022, [])) \u003E= 2 and len(p[\u0022original\u0022]) \u003E= 3\u0060 appears character-identically in 2 files \u2014 scripts/training/build-optimal-dataset-v2.py, scripts/training/build-optimal-dataset.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/training/build-optimal-dataset-v2.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3ba64bbd1c447f1ba18cf1085ade26ee188354e86068c75c603c1478771a0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!c.is_alphanumeric() \u0026\u0026 c != \u0027_\u0027 \u0026\u0026 c != \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"58acb6e41f86f25a1ee6f97eb29712deef7e84945e98da5f55ab6665d377dcb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!c.is_alphanumeric() \u0026\u0026 c != \u0027_\u0027 \u0026\u0026 c != \u0027-\u0027 \u0026\u0026 c != \u0027.\u0027\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f996b10f9d5c6b0de5d94baecf50b4f6646a0aa69129c5a2f750e4e189c607c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!c.is_empty() \u0026\u0026 !c.contains(\u0027:\u0027) \u0026\u0026 c != \u0022.\u0022 \u0026\u0026 c != \u0022..\u0022\u0060 appears character-identically in 2 files \u2014 edge/gateway/src/m3_api.rs, edge/gateway/src/rest.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":"edge/gateway/src/m3_api.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1862a58c7caceb89149a09a60395df710b4c8638f78c63862743d128049aece"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!candidates.is_empty() \u0026\u0026 neighbours_vec.len() \u003C nb_neighbours_asked\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnsw.rs, scripts/patches/hnsw_rs/src/hnsw.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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1b3fc964d24ab86c95c31a6b9170a3ab243c22b6ef6e63a6454b5663f3ab1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!changed || sl2 == 0.0 || slx * slx \u003C= best * sl2\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/quantized/utils.rs, patches/candle-core-0.9.2/src/quantized/utils.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":"patches/candle-core-0.8.4/src/quantized/utils.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"449945167df8a769d7b4c37b2c299a86587a03db01785cc47c70b52a57265daa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!discarded_points.is_empty() \u0026\u0026 neighbours_vec.len() \u003C nb_neighbours_asked\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnsw.rs, scripts/patches/hnsw_rs/src/hnsw.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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf96721a1e589af4168c056627dd9a85f1b64aacd1e721684ef8935f2718f6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ids_l.is_contiguous() || !src_l.is_contiguous()\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/metal_backend/mod.rs, patches/candle-core-0.9.2/src/metal_backend/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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1702eb219506ebac8c8d4dfcca6f82b6289e1cfdf996f4f61aeea97a7f82d31"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parent.as_os_str().is_empty() \u0026\u0026 !parent.exists()\u0060 appears character-identically in 3 files \u2014 crates/ruvector-core/src/storage.rs, crates/ruvector-graph/src/storage.rs, crates/ruvector-router-core/src/storage.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/storage.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cecd48557df526ea89559e9cd0f27cefe83f012e87c477f6cf2557873e5815"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!s.starts_with(\u0027[\u0027) || !s.ends_with(\u0027]\u0027)\u0060 appears character-identically in 4 files \u2014 crates/ruvector-postgres/src/types/binaryvec.rs, crates/ruvector-postgres/src/types/halfvec.rs, crates/ruvector-postgres/src/types/scalarvec.rs, crates/ruvector-postgres/src/types/vector.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef71885ecc1df0af278b5fa70acbc00500bb507e440bb696fa17bc9825ff9ba4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.clock.contains_key(replica_id) \u0026\u0026 other_ts \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-delta-consensus/src/causal.rs, crates/ruvector-replication/src/conflict.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-consensus/src/causal.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"56316cf26c7801058155016a9f8a3dbcab9a1b450ed33bd3ab91d79a8442ae60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.dist_to_ref.is_nan() \u0026\u0026 !other.dist_to_ref.is_nan()\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnsw.rs, scripts/patches/hnsw_rs/src/hnsw.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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b6432e77dfdbd807b367b252eda50e215a36b19f7971512aee1c64aaf558a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.distance.is_nan() \u0026\u0026 !other.distance.is_nan()\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/flatten.rs, scripts/patches/hnsw_rs/src/flatten.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":"patches/hnsw_rs/src/flatten.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7417f366ca806f0cc62201ddcadee1fe57f69e05774fb4c9288dd7c6286ef08a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.example_actions.contains(action) \u0026\u0026 self.example_actions.len() \u003C 10\u0060 appears character-identically in 2 files \u2014 crates/ruvllm/src/reasoning_bank/distillation.rs, crates/ruvllm/src/reasoning_bank/pattern_store.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reasoning_bank/distillation.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c952529ed06fd5da4957138499e7c269f63f0f432f363537a8d7b07d248293d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.exclude_positive || i != positive_idx\u0060 appears character-identically in 2 files \u2014 crates/ruvector-attention-node/src/training.rs, crates/ruvector-attention/src/training/mining.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-node/src/training.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c39b1e04b1e69da35c1d9f4955dacc6b27015b91cc6769af19acd37857591ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.is_contiguous() || !src.is_contiguous()\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/tensor_cat.rs, patches/candle-core-0.9.2/src/tensor_cat.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":"patches/candle-core-0.8.4/src/tensor_cat.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c389c403621e4e81335f4d5078f748ab231a07e445d56d365b458999e50fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.match_char(\u0027?\u0027) \u0026\u0026 !self.match_char(\u0027$\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1c408bd3286f657818bdadf0a1fa327b72c3e06756d50109ea87400cb9cb44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.match_char(\u0027_\u0027) || !self.match_char(\u0027:\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782cc5bc2e71a55d73b842309ac7116495fcced8b80357372befc365d83bf86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!source_side[v] \u0026\u0026 cap[row \u002B v].raw() \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-mincut/src/canonical/source_anchored/mod.rs, crates/ruvector-mincut/src/canonical/tree_packing/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d869a6e9b5efa7c75971180df89bfc50a3e46ac26f970ff6cfc4641a3b1d6eb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!tensor_info.layout.is_contiguous() \u0026\u0026 !is_fortran_contiguous\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/pickle.rs, patches/candle-core-0.9.2/src/pickle.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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c91e77a7cc97e2870ceee3577a62c44a5005e15e0c33f95d82254580826138d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text_str.starts_with(\u0027[\u0027) || !text_str.ends_with(\u0027]\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/index/hnsw_am.rs, crates/ruvector-postgres/src/index/ivfflat_am.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"33369f788ebb857011c8761cdc4e09425f2ab53131a3f4ed247ff18b6386a318"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!v.is_finite() || v \u003C 0.0 || v.fract() != 0.0 || v \u003E max as f64\u0060 appears character-identically in 2 files \u2014 crates/ruvector-mincut-node/src/routing.rs, crates/ruvector-mincut-wasm/src/routing.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut-node/src/routing.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a666d0ef9a9d9beb7dcf2146e0c0b2ad2c5270e5d20da7e26be1d73bc85175bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(lhs_m1 == 1 || k == 1) \u0026\u0026 (lhs_m2 == k || m == 1)\u0060 appears character-identically in 4 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.8.4/src/cuda_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cuda_backend/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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c668d0a6c95873137cc5e6768bb7936aecebbb962f1167b506c04947c83239ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(lhs_m1 == m || k == 1) \u0026\u0026 (lhs_m2 == 1 || m == 1)\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cuda_backend/mod.rs, patches/candle-core-0.9.2/src/cuda_backend/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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ab1792a0fed5dc53a747afcf0615901787972112d621d909633d2b1b944f1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(norm - 1.0).abs() \u003C 1e-5 || norm \u003C 1e-10\u0060 appears character-identically in 2 files \u2014 crates/ruvector-cnn/src/embedding.rs, crates/ruvector-cnn/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/embedding.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ac6aa575b7646066fbb250678bd4981f63027635ee93f1bb3b6505aed647c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(rhs_m1 == 1 || n == 1) \u0026\u0026 (rhs_m2 == n || k == 1)\u0060 appears character-identically in 4 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.8.4/src/cuda_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cuda_backend/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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac5bd0c62437a12faa6f0013f9c11c16ab40858cd763ebfa86a1de26b0a8b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(rhs_m1 == k || n == 1) \u0026\u0026 (rhs_m2 == 1 || k == 1)\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cuda_backend/mod.rs, patches/candle-core-0.9.2/src/cuda_backend/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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e31a21d41e7e14c9e49277741314431a5499fd0a4f10c1caa5372709abeb20a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(self.layer as u8) \u003C= entry_point_level \u0026\u0026 points_by_layer[self.layer as usize].is_empty()\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnsw.rs, scripts/patches/hnsw_rs/src/hnsw.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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"d081c96e0ac9250e45298297ef93673e2840bcecced265278d6267a8513520f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(std::any::TypeId::of::\u003CT\u003E() != std::any::TypeId::of::\u003CNoData\u003E()) \u0026\u0026 (d_type_name != distname)\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnswio.rs, scripts/patches/hnsw_rs/src/hnswio.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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a990e37673172cb68c54f80888858ba63a13fb49a8131d3001775b42ea5f31"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(std::any::TypeId::of::\u003CT\u003E() != std::any::TypeId::of::\u003CNoData\u003E()) \u0026\u0026 (d_type_name_split[0] != distname_split[0])\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnswio.rs, scripts/patches/hnsw_rs/src/hnswio.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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b71407c4256ad009db6d596f8de51e59fa121b6dfec6c07376667737fdb7843"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.len() != b.len() || curvatures.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph-transformer-node/src/transformer.rs, crates/ruvector-graph-transformer-wasm/src/transformer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"363db795808f85b4699e787713c05603e11d80dd18307f2699e84db712d9162a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060advance \u003E 0 \u0026\u0026 i.checked_add(advance).is_some()\u0060 appears character-identically in 2 files \u2014 crates/rvf/rvf-cli/src/cmd/rebuild_refcounts.rs, crates/rvf/rvf-cli/src/cmd/verify_attestation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-cli/src/cmd/rebuild_refcounts.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0175fa50eccda0269eedb63b75aa21a98c040be357b7df9ece318d41463365"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arg1.track_op() || arg2.track_op() || arg3.track_op()\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/op.rs, patches/candle-core-0.9.2/src/op.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":"patches/candle-core-0.8.4/src/op.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d18e1933503c1a250f9aac91bf5623dceb4c087697bf031d65b1ae540bc3437"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060both_int \u0026\u0026 op != BinaryOperator::Divide \u0026\u0026 result.fract() == 0.0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph-node/src/cypher_exec.rs, crates/ruvector-py/src/graph/cypher_eval.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6309059a43844adbec5af9993f6eec4fe104c7c0779fee2951a63d356ed0afd8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060budget.max_partitions \u003E 0 \u0026\u0026 evaluated \u003E= budget.max_partitions\u0060 appears character-identically in 2 files \u2014 crates/ruvector-consciousness/src/geomip.rs, crates/ruvector-consciousness/src/phi.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-consciousness/src/geomip.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"291562925ecce326c4de0d7503709cf997223c3cfb44748343e1f582b20ad99b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == \u0027.\u0027 || c == \u0027;\u0027 || c == \u0027}\u0027 || c == \u0027{\u0027\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0703ecb0b41d4b5c1bc02f5a6828edbe7947cbd78465a3864c69fd2dc3f177ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_numeric() || c == \u0027.\u0027 || (c == \u0027-\u0027 \u0026\u0026 current.is_empty())\u0060 appears character-identically in 2 files \u2014 crates/ruvllm/src/quality/coherence.rs, crates/ruvllm/src/quality/scoring_engine.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/quality/coherence.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c3870a330c72b4407784ed49a453dd76a180d734ae485e6a6ce16904185ae8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_whitespace() || \u0022{}[](),;.\u0022.contains(c)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b60b9966a786f188f20722264c28049c2d5afe360e5f3fabfaadc698d80d2b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060check_empty \u0026\u0026 layout.shape().elem_count() == 0\u0060 appears character-identically in 4 files \u2014 patches/candle-core-0.8.4/src/cuda_backend/mod.rs, patches/candle-core-0.8.4/src/metal_backend/mod.rs, patches/candle-core-0.9.2/src/cuda_backend/mod.rs, patches/candle-core-0.9.2/src/metal_backend/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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a292c6245d2c90d367f443b9cf9fbea2a238a0533d17c7f96362554b8603370"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.epsilon \u003C= 0.0 || config.epsilon \u003E 1.0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-mincut/src/jtree/mod.rs, crates/ruvector-mincut/src/sparsify/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/jtree/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec90639264d0fe1794127908bf40fd39af2ace5433bfc767f54b813324737bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060desc.output_size == 0 || desc.output_size != desc.input_a_size\u0060 appears character-identically in 2 files \u2014 crates/ruvector-wasm/kernels/rope.rs, crates/ruvector-wasm/kernels/swiglu.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/kernels/rope.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e94c45621eebc18d252deb7992f71573fd0aab5c5c8d760daed51b0eccd0e46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060desc_lower.contains(\u0022research\u0022) || desc_lower.contains(\u0022analyze\u0022)\u0060 appears character-identically in 2 files \u2014 crates/ruvllm/src/claude_flow/hooks_integration.rs, crates/ruvllm/src/evaluation/real_harness.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/claude_flow/hooks_integration.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"1724a848a70fd1f638ba0aff1b6183583ae60b6838718489659174065543e60c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dimensions \u003E 0 \u0026\u0026 dimensions \u003C= 16384 \u0026\u0026 actual_data_size \u003E= expected_data_size\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/index/hnsw_am.rs, crates/ruvector-postgres/src/index/ivfflat_am.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dadbd42d7a3e0199fcd79168dc7dfee971587973713aab382df207cb49f21f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060direction == \u0022pull\u0022 || direction == \u0022both\u0022\u0060 appears character-identically in 2 files \u2014 crates/mcp-brain-server/src/routes.rs, crates/mcp-brain/src/tools.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc668594588d1d0f9d080c2725da5b2dfec125421a3a76028657913ec468b829"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060direction == \u0022push\u0022 || direction == \u0022both\u0022\u0060 appears character-identically in 2 files \u2014 crates/mcp-brain-server/src/routes.rs, crates/mcp-brain/src/tools.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":6254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cee62891b8675c338ecb712303141aa52f15fd087ae4eea8e1afe6e807b0e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype == DType::F16 || dtype == DType::BF16\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/device.rs, patches/candle-core-0.9.2/src/device.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":"patches/candle-core-0.8.4/src/device.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80a3ef43f292a56556c8cd3b0999b739105418c111470e65ae648a95fd45549"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e_dist_to_p \u003C f_dist_to_p || return_points.len() \u003C ef\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnsw.rs, scripts/patches/hnsw_rs/src/hnsw.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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"dada829f9fc24385719a83475f8f390fb8f9ba9035d83cdece0e0e4518fdbceb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060epsilon.is_finite() \u0026\u0026 epsilon \u003E 0.0 \u0026\u0026 epsilon \u003C= 1.0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-edge-analytics/src/service.rs, edge/gateway/src/mincut_core.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-analytics/src/service.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da6954d7dc61740b9dfce038c58f7a8e38a77f7b274d0fe9fd97925ab5d10b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060final_threshold \u003E 0.01 \u0026\u0026 final_threshold \u003C 0.5\u0060 appears character-identically in 2 files \u2014 crates/ruvector-nervous-system/src/integration/postgres.rs, crates/ruvector-nervous-system/src/integration/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system/src/integration/postgres.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f145f9108a26cee53f51a498db83a18446ee20461b2542d609e80226ce762"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gate_proj.len() != gate_up_size || up_proj.len() != gate_up_size || down_proj.len() != down_size\u0060 appears character-identically in 3 files \u2014 crates/ruvllm/src/backends/gemma2.rs, crates/ruvllm/src/backends/phi3.rs, crates/ruvllm/src/models/ruvltra.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/gemma2.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e9adb2092112e8ed267164f4d89d2c1a40030ec467daf05e7e79fba5dd5246"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grid.dims.is_empty() || grid.lrs.is_empty() || grid.losses.is_empty() || grid.n3_lambdas.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-kge-ffi/src/optimize.rs, crates/ruvector-kge-wasm/src/optimize.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/optimize.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaaf952f2a08cbc0e95c728265790ff8f80ec5422cc6fddd585fa965cb8cf6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060height_in == height_out \u0026\u0026 width_in == width_out\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.9.2/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/tensor.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":"patches/candle-core-0.9.2/src/cpu_backend/mod.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bd3a6ea613d7765b4b972df46ccf24a2f12e2e793741c02384e06c42bfda06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hnsw1.layer_indexed_points.entry_point.read().is_some() || hnsw1.layer_indexed_points.entry_point.read().is_some()\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnsw.rs, scripts/patches/hnsw_rs/src/hnsw.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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fd49138192752ca8638758153b2f89f56301006873b551ca32bf6076028a63"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C self.indices.len() \u0026\u0026 j \u003C other.indices.len()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-core/src/advanced_features/sparse_vector.rs, crates/ruvector-nervous-system/src/separate/sparsification.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/advanced_features/sparse_vector.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd6a32c341fc595864d698c07373240fc3485ebb727a64f64d6ce3b77379382"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ih \u003E= 0 \u0026\u0026 ih \u003C h as isize \u0026\u0026 iw \u003E= 0 \u0026\u0026 iw \u003C w as isize\u0060 appears character-identically in 9 files \u2014 crates/ruvector-cnn/src/backbone/mobilenet.rs, crates/ruvector-cnn/src/kernels/int8_avx2.rs, crates/ruvector-cnn/src/kernels/int8_neon.rs, crates/ruvector-cnn/src/kernels/int8_wasm.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/backbone/mobilenet.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf123cf6a8ec0296b6251ac4ebfee54245f0c970626c2a14ea9da86d16a7ff08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ih \u003E= 0 \u0026\u0026 ih \u003C in_h as isize \u0026\u0026 iw \u003E= 0 \u0026\u0026 iw \u003C in_w as isize\u0060 appears character-identically in 11 files \u2014 crates/ruvector-cnn/src/kernels/int8_avx2.rs, crates/ruvector-cnn/src/kernels/int8_neon.rs, crates/ruvector-cnn/src/kernels/int8_wasm.rs, crates/ruvector-cnn/src/layers/conv.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/kernels/int8_avx2.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adef7537ef1c51d0977e6fc6927e13c41fc5f9a63caec33d295628ab50cce52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index_pages \u003C 100 || index_tuples \u003C 10000\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/index/parallel.rs, crates/ruvector-postgres/src/index/parallel_ops.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/parallel.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bdc3f86a2a17e4c19ba0529607ac17081e6e09b8658c2ce6eb5f834037e6be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_x86_feature_detected!(\u0022avx2\u0022) \u0026\u0026 a.len() \u003E= 32\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/types/binaryvec.rs, crates/ruvector-postgres/src/types/scalarvec.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b9927458a421b143acf09c5f2496477e65101fd5352b3dbc25967077f0f220"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_x86_feature_detected!(\u0022avx2\u0022) \u0026\u0026 is_x86_feature_detected!(\u0022fma\u0022)\u0060 appears character-identically in 5 files \u2014 crates/ruvector-cnn/src/simd/mod.rs, crates/ruvector-core/src/simd_intrinsics.rs, crates/ruvector-postgres/src/distance/mod.rs, crates/ruvector-postgres/src/distance/simd.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cnn/src/simd/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fa3a0a1a31cbda3b39d5e425b3919094b9d7177b528ef428d6aaf90a5320f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060k_layout.is_contiguous() \u0026\u0026 params.dilation == 1 \u0026\u0026 params.padding == 0 \u0026\u0026 params.output_padding == 0\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/metal_backend/mod.rs, patches/candle-core-0.9.2/src/metal_backend/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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d36fc5b7c3869133946fda104d57b183d86c1f92b395d41f1c81cca7a7ac8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kernel_l.is_contiguous() \u0026\u0026 params.dilation == 1 \u0026\u0026 params.padding == 0 \u0026\u0026 params.output_padding == 0\u0060 appears character-identically in 4 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.8.4/src/cuda_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cuda_backend/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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":2250}}}],"partialFingerprints":{"codehealthFindingId/v1":"75936aff5f01a7aa7de1c2f62a4b1c3dadd441ae4a2883b15b7d3ea81788db3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keys.is_empty() || timestamps.len() != keys.len()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph-transformer-node/src/transformer.rs, crates/ruvector-graph-transformer-wasm/src/transformer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bc53e676d4799709d5732924ba6b8b066a3abcff1ccaabe9b55b9c20fed408"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.has_aggregation() || right.has_aggregation()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph/src/cypher/ast.rs, crates/rvlite/src/cypher/ast.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/ast.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60a5b92a28dfb8713964f8ac60d126b06fc1dfb3e835118e1d281760f126956"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.is_constant() \u0026\u0026 right.is_constant()\u0060 appears character-identically in 3 files \u2014 crates/ruvector-graph/src/cypher/ast.rs, crates/ruvector-graph/src/cypher/optimizer.rs, crates/rvlite/src/cypher/ast.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/ast.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c36fd90914c98c7676eea97c6a72a2a3a479effe9fcf3bdffcc2c079691c3cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060level[v] == -1 \u0026\u0026 cap[row \u002B v].raw() \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-mincut/src/canonical/source_anchored/mod.rs, crates/ruvector-mincut/src/canonical/tree_packing/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9001315cb8949671ee5f0359e3f52a5412bdf08085a9b9627be67a8b964e8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060level[v] == level[u] \u002B 1 \u0026\u0026 cap[u_row \u002B v].raw() \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-mincut/src/canonical/source_anchored/mod.rs, crates/ruvector-mincut/src/canonical/tree_packing/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/canonical/source_anchored/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"daef8844b6a185c86f3f3c5e9d87612b25e28402c304bca21c888a09079cd1c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_dims.len() \u003C 2 || rhs_dims.len() \u003C 2\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/shape.rs, patches/candle-core-0.9.2/src/shape.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":"patches/candle-core-0.8.4/src/shape.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"219167d1edcc1eb773bf55f1f8e1c01e16059e16136b6260b06404c20b6f69a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_l.is_contiguous() \u0026\u0026 rhs_l.is_contiguous()\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cuda_backend/mod.rs, patches/candle-core-0.9.2/src/cuda_backend/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":"patches/candle-core-0.8.4/src/cuda_backend/mod.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57b9818ccb8e4109c456440d0818b82d31dcb30e018401f0095113ce61b8ad1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.is_empty() || line.starts_with(\u0027#\u0027)\u0060 appears character-identically in 3 files \u2014 crates/emergent-time/src/witness.rs, crates/ruvector-postgres/src/graph/operators.rs, crates/ruvector-weaver/src/ledger.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/emergent-time/src/witness.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5045d1edb5b24481e109a5bf6fc5ccf24e4af93efe6d524ed4824a171cdddbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060log::log_enabled!(log::Level::Info) \u0026\u0026 nb_still_to_load == max_nbpoint_in_memory as i64\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnswio.rs, scripts/patches/hnsw_rs/src/hnswio.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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe1010bda5df95f7311422f17f89beb60c27de193c82564dc5939011d057df8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060m.len() != keys.len() || keys.len() != values.len()\u0060 appears character-identically in 7 files \u2014 crates/ruvector-attention/src/graph/dual_space.rs, crates/ruvector-attention/src/graph/edge_featured.rs, crates/ruvector-attention/src/graph/rope.rs, crates/ruvector-attention/src/moe/moe_attention.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/graph/dual_space.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7022ec396e9945981d2ac34412e51911d899471d3f0308486bd90d9f1d04dc17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(l, EvalValue::Int(_)) \u0026\u0026 matches!(r, EvalValue::Int(_))\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph-node/src/cypher_exec.rs, crates/ruvector-py/src/graph/cypher_eval.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-node/src/cypher_exec.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae84e18ad9749f6f522872a226db570542382f12cf0a69d80bc002e1b063c18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min_cut == u64::MAX || best_set.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-mincut/src/fragment/mod.rs, crates/ruvector-mincut/src/instance/bounded.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-mincut/src/fragment/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b7c5619ca7941137c1b571a99636603b67b3648babfcd09a89b40d3be95ad7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min_val != u64::MAX \u0026\u0026 min_val \u003E self.nonce_watermark\u0060 appears character-identically in 2 files \u2014 crates/rvm/crates/rvm-cap/src/verify.rs, crates/rvm/crates/rvm-proof/src/policy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvm/crates/rvm-cap/src/verify.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7d7a50abfdb46a341c3183fc2416cde853433e5fb0805a7bdec5ac777e16be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model_lower.contains(\u0022llama-2\u0022) || model_lower.contains(\u0022llama2\u0022)\u0060 appears character-identically in 2 files \u2014 crates/ruvllm-wasm/src/bindings.rs, crates/ruvllm/src/tokenizer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaece12dc54cc3b54638043d707a5463e82b87afea9cf5ec9519551ef7001b62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model_lower.contains(\u0022llama-3\u0022) || model_lower.contains(\u0022llama3\u0022)\u0060 appears character-identically in 2 files \u2014 crates/ruvllm-wasm/src/bindings.rs, crates/ruvllm/src/tokenizer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/bindings.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7936cec534f6c809aa85c6f7499da50435a139e5abd7b487fa0860ef9fb9946"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module_name == \u0022__torch__\u0022 \u0026\u0026 class_name == \u0022Module\u0022\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/pickle.rs, patches/candle-core-0.9.2/src/pickle.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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"907d61918891f8725a1b04738d5d11569fa0e9272d0fdbc1c8606fb5f2795f1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module_name == \u0022collections\u0022 \u0026\u0026 (class_name == \u0022OrderedDict\u0022 || class_name == \u0022defaultdict\u0022)\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/pickle.rs, patches/candle-core-0.9.2/src/pickle.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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"db778ddd83b5eb99207a03447f0811baaa3582fbebfc84bf118583913e185d46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module_name == \u0022torch._tensor\u0022 \u0026\u0026 class_name == \u0022_rebuild_from_type_v2\u0022\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/pickle.rs, patches/candle-core-0.9.2/src/pickle.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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb713dd693677fee32fad052c0b2c8cef038d17fba0df8a07d28f81a3cf36c38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module_name == \u0022torch._utils\u0022 \u0026\u0026 class_name == \u0022_rebuild_parameter\u0022\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/pickle.rs, patches/candle-core-0.9.2/src/pickle.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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bb2b325ac36b58fbbf4889fa62bc3a575ae343e7fb0829919cdd8965c971ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module_name == \u0022torch._utils\u0022 \u0026\u0026 class_name == \u0022_rebuild_tensor_v2\u0022\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/pickle.rs, patches/candle-core-0.9.2/src/pickle.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":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e999e664b2b96a989612c4e86ea24f1d6e7fb0f03c2ba26e952c935a462ee2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n == 0 || t \u003C 3 || attention_history.len() \u003C n * t\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph-transformer-node/src/transformer.rs, crates/ruvector-graph-transformer-wasm/src/transformer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e51ed809467c2ce0162b85d0a1380a5d49f9f47705e356cb01f977bc9c61b35"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nonzero_finite_max / nonzero_finite_min \u003E v1 || nonzero_finite_max \u003E v2 || nonzero_finite_min \u003C v3\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/display.rs, patches/candle-core-0.9.2/src/display.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":"patches/candle-core-0.8.4/src/display.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7806f1d4e499679bd1cbb9d790867bd1c6ee742f1962e2f8eba0fb5385e40c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060o.dims == 0 || !o.dims.is_multiple_of(2)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-kge-ffi/src/model.rs, crates/ruvector-kge-wasm/src/model.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"165644aca04637bfed135deb2c448e42f7ecfefff439e8a41f5005db5b0c579b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.num_entities() == ne \u0026\u0026 old.num_relations() == nr\u0060 appears character-identically in 2 files \u2014 crates/ruvector-kge-ffi/src/model.rs, crates/ruvector-kge-wasm/src/model.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/model.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9613548dca286d175a62dec935e9708afa964c9fba29c32bcad253e07df30802"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.get(\u0022client_secret\u0022).is_some() || p.get(\u0022client_assertion\u0022).is_some()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-edge-authz/src/revoke.rs, crates/ruvector-edge-authz/src/token.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-authz/src/revoke.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c396932faf0d545561da6f28c530dd01b03062ef6bef7c47419f36b3a2285123"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p_id.0 \u003C= self.get_max_level_observed() \u0026\u0026 p \u003C self.get_layer_nb_point(l)\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnsw.rs, scripts/patches/hnsw_rs/src/hnsw.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":"patches/hnsw_rs/src/hnsw.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76d806215dff13aba0fa7ab4199f111f21752c00ced5a3a4d5dc43f28182125"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060padding != 0 \u0026\u0026 (src_h \u003C padding || src_h \u003E= h \u002B padding)\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"468b6ecd8c664e3933e7c27e3594c47bb1121658e8dcb1ad960d3b0f1e55edd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060padding != 0 \u0026\u0026 (src_l \u003C padding || src_l \u003E= l \u002B padding)\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8d37f5a46bf17e804d19847be592c9f09547b94f40c612d659ff902aac417b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060padding != 0 \u0026\u0026 (src_w \u003C padding || src_w \u003E= w \u002B padding)\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74f48055e0b370336bae66cde1f695d48774464f49f84b44c2d0e007dfd99c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060params.temperature \u003C 0.5 || params.top_k == 1\u0060 appears character-identically in 2 files \u2014 crates/ruvllm/src/optimization/realtime.rs, crates/ruvllm/src/speculative.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/optimization/realtime.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb63ea0c6e2eaa5f749d6b7cedae02997ee9116079c14b60b2816cf0f7a780a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path_str.contains(\u0022..\u0022) \u0026\u0026 !path_ref.is_absolute()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph/src/storage.rs, crates/ruvector-router-core/src/storage.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/storage.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9118243c362579ade67b348dccc6c9f47d63207edaea07e4827b314b8059489e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060plateau_signal \u0026\u0026 self.eligibility_trace \u003E 0.01\u0060 appears character-identically in 2 files \u2014 crates/ruvector-nervous-system-wasm/src/btsp.rs, crates/ruvector-nervous-system/src/plasticity/btsp.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/src/btsp.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4b36c58cc1186e7f3f0f72101429b28003da974703bfc7074d7a3e3dbef2f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060residual_norm.is_nan() || residual_norm.is_infinite()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-solver/src/neumann.rs, crates/ruvector-solver/src/router.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/neumann.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad5aa7bf9d8254cc49f101185c0d4eed9b730c0bef664d9ea5d3452674b700e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.score \u003E= 0.0 \u0026\u0026 result.score \u003C= 1.0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph/src/hybrid/graph_neural.rs, crates/ruvector-graph/src/hybrid/semantic_search.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/hybrid/graph_neural.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ab8c9a27c403703cf01ddd50691f73d4ba44569c63834f2d37d0ee39071036"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rss_u \u003E 1e-10 \u0026\u0026 df_denom \u003E 0.0 \u0026\u0026 df_diff \u003E 0.0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph-transformer-node/src/transformer.rs, crates/ruvector-graph-transformer-wasm/src/transformer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-node/src/transformer.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3dc1900f4e9f228a2128a9d78302395c43e28482c69feb3208e3d75ccc3417"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.available \u0026\u0026 model_size_mb \u003C= self.max_model_size_mb\u0060 appears character-identically in 2 files \u2014 crates/ruvllm/src/autodetect.rs, crates/ruvllm/src/backends/coreml_backend.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/autodetect.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"416e473f4dad0500b73e93159fff7172e034c9a7bd0780c1bbdd6db84efd4ad6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.dimensions == other.dimensions \u0026\u0026 self.data == other.data\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/types/binaryvec.rs, crates/ruvector-postgres/src/types/vector.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/binaryvec.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a87fb50ad12e8e8847ec41bb3ee9546367eb384eeb99cc76cc7f05237416b19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.dropout \u003C 0.0 || self.dropout \u003E 1.0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-attention/src/config.rs, crates/ruvector-cnn/src/config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention/src/config.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ebd88048945eb34d0be80ed78b748ba25490d7ebaa11eb796601adaf485d4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.dropout \u003C 0.0 || self.dropout \u003E= 1.0\u0060 appears character-identically in 3 files \u2014 crates/prime-radiant/src/learned_rho/config.rs, crates/ruvector-attention/src/sheaf/attention.rs, crates/ruvllm/src/qat/lora_qat.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/learned_rho/config.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7eefd1704573090643cc755bf0235a68b144bdeaf8d8d958f96651c70611aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.is_at_end() || self.peek_char() == Some(\u0027}\u0027) || self.peek_keyword(\u0022OPTIONAL\u0022) || self.peek_keyword(\u0022UNION\u0022) || self.peek_keyword(\u0022MINUS\u2026\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e5a14a51c921f8610084fee0ffe8887fd81183bf1310922a09f339b7551190"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.match_char(\u0027\u002B\u0027) \u0026\u0026 self.peek_char() != Some(\u0027\u002B\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a85d74c86e57224b90ed44b83873820150bf9315d71503cdcf65f75caf324a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.match_char(\u0027-\u0027) \u0026\u0026 self.peek_char() != Some(\u0027-\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcb110be6c8234fadf35103f9d15d73077d7e81b83f7fda11119b7127639a56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.match_char(\u0027^\u0027) \u0026\u0026 self.match_char(\u0027^\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1df58b69ea13312100d3077a0c1e495802ad2432a6cafe497c6553c8a6e52b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.match_keyword(\u0022\u003C\u0022) \u0026\u0026 self.peek_char() != Some(\u0027=\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"84363be7661f31b1f61b0cd2497eb3318f5ae55e51545a52a45127ba6754764a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.match_keyword(\u0022\u003E\u0022) \u0026\u0026 self.peek_char() != Some(\u0027=\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"978722bfb8762c64ae237858944f9d3695bddb16fbcf808c76fe0c3000d8c7b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.match_keyword(\u0022INSERT\u0022) || self.match_keyword(\u0022DELETE\u0022) || self.match_keyword(\u0022LOAD\u0022) || self.match_keyword(\u0022CLEAR\u0022) || self.match_keyw\u2026\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb3cfc4942a69053531c2496a3d6b125bad297d91aace495be91243c298424b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.match_keyword(\u0022IRI\u0022) || self.match_keyword(\u0022URI\u0022)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7742cee0c5fca35ad047d10510c6a9b6063d278d189f7ecbbffda73efde5a4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.match_keyword(\u0022WHERE\u0022) || self.peek_char() == Some(\u0027{\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d535664c43deb17bb53dc9a85e141e830ad544c727ed1a4637d4e66e1bca39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.nonce == nonce \u0026\u0026 self.mutation_hash == *mutation_hash\u0060 appears character-identically in 2 files \u2014 crates/ruvix/crates/types/src/proof_cache.rs, crates/ruvix/crates/types/src/proof_cache_optimized.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/types/src/proof_cache.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f237b5b26d8593860298addcdb1054bd3f23ea28cea47b74ef8c41338185b74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.offset \u003C other.end() \u0026\u0026 other.offset \u003C self.end()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-wasm/src/kernel/memory.rs, crates/ruvllm-wasm/src/workers/shared.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-wasm/src/kernel/memory.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dd8c5c7f010450f945d95924d87f02e07970116640a9c0dd7bb3edd35c6931"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek().kind == TokenKind::OnCreate || self.peek().kind == TokenKind::OnMatch\u0060 appears character-identically in 2 files \u2014 crates/ruvector-graph/src/cypher/parser.rs, crates/rvlite/src/cypher/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/cypher/parser.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7a49b6da076d03fbeb25bfada41c7440e0499b8f772e4f6712e7db485a08c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027\u0022\u0027) || self.peek_char() == Some(\u0027\\\u0027\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64b0972388346116ad26e2c27522897bfccc52c0b6b19473602293a851fb7b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027\u002B\u0027) || self.peek_char() == Some(\u0027-\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b6ece991733f8f2f2701e0d579f28e41e8bafefd5b332b6e985d41e584049d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027-\u0027) || self.peek_char() == Some(\u0027\u002B\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0918f46b36c6d3af577786e59e3a912e2b0df5a135fc4cd3531d45c46d1b12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027.\u0027) || self.peek_char() == Some(\u0027}\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"030ccd8319c33768e6de0119804a1a996f52de94b8027c130a0a430b6e86de1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027?\u0027) || self.peek_char() == Some(\u0027$\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"44063a0fdaac166e2211d66d00511ad180b6c1f6cea47266578a6aede5dd7aaf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027?\u0027) || self.peek_char() == Some(\u0027$\u0027) || self.peek_keyword(\u0022ASC\u0022) || self.peek_keyword(\u0022DESC\u0022)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7abe1b32b0b77ddeb9bd64531ec5f5e249a527503fa9c057374c12eba1cfa6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027_\u0027) \u0026\u0026 self.peek_char_at(1) == Some(\u0027:\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"689874c2101135e975dbfe85f355086b359ddef421ff434deb58b82d0e57b6b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027e\u0027) || self.peek_char() == Some(\u0027E\u0027)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"318eb092e0efd31f27a590ec8089e6c5cbefa90e83c2f21c708efb99146af96d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(\u0027}\u0027) || self.is_at_end()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52d97511953816db807d0056627ac162286d4b49033ad3e9fa8ffc6ef0de6c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(quote) \u0026\u0026 self.peek_char_at(1) == Some(quote)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce91f3145e24e5fa7ed5434a18af893482e264b11a02bfaecb87cc09ef2647f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.peek_char() == Some(quote) \u0026\u0026 self.peek_char_at(1) == Some(quote) \u0026\u0026 self.peek_char_at(2) == Some(quote)\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/graph/sparql/parser.rs, crates/rvlite/src/sparql/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/parser.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2608fa20f06d11997aa8dd3afe01ebe5bb78045a3e4856dc9e180b396af6f38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.previous_witness.is_none() \u0026\u0026 self.sequence == 0\u0060 appears character-identically in 2 files \u2014 crates/prime-radiant/src/governance/witness.rs, crates/prime-radiant/src/ruvllm_integration/witness_log.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/governance/witness.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b00876e3022fd76504d74acdc40ef2ba8af872ce7ff90a899b399ba416a3f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.quant.is_none() \u0026\u0026 self.slab.len() == 0\u0060 appears character-identically in 2 files \u2014 crates/ruvector-edge-store/src/shard/persist.rs, crates/ruvector-edge-store/src/shard/write.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-store/src/shard/persist.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfa8a7b69bce15e211de0fef1f6385800c06c848fb0b6d942ff66a4a65207cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sl2 \u003E 0.0 \u0026\u0026 slx * slx * suml2 \u003E sumlx * sumlx * sl2\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/quantized/utils.rs, patches/candle-core-0.9.2/src/quantized/utils.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":"patches/candle-core-0.8.4/src/quantized/utils.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"394397d8d8c76b1474a01cb54de46ddd914ef12c5a5a7cdccf0a1e3149f0f750"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060split.valid.is_empty() || split.test.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/ruvector-kge-ffi/src/optimize.rs, crates/ruvector-kge-wasm/src/optimize.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/optimize.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fb206bbe80ed46d02aa4fa93f887fb70761621721d4d5f1c537daff2fb532b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src_h \u003C p.padding || src_h \u003E= p.i_h \u002B p.padding\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/conv2d.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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8ebfbcf29c31d50a5eaf4bcf7f4f67c8097145b97af8f6ce6de1efb3115a9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src_l \u003C p.padding || src_l \u003E= p.padding \u002B p.l_in\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b86a3b5bafe970b3d7f2d8a521420b059ca9a6cb5ce8d4c72fd92fc6545639"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src_l.is_contiguous() \u0026\u0026 self.dtype == dst.dtype()\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/metal_backend/mod.rs, patches/candle-core-0.9.2/src/metal_backend/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":"patches/candle-core-0.8.4/src/metal_backend/mod.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"1291629e498f02e56d67d86a7c99171008b2e59f402587adb9995e127742c93e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src_w \u003C p.padding || src_w \u003E= p.i_w \u002B p.padding\u0060 appears character-identically in 2 files \u2014 patches/candle-core-0.8.4/src/cpu_backend/mod.rs, patches/candle-core-0.9.2/src/cpu_backend/conv2d.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":"patches/candle-core-0.8.4/src/cpu_backend/mod.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ca04ff6f8753d4376f71a5c5ca0a663773aa3ba3155af420fac26dba5ba73f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060std::any::TypeId::of::\u003CT\u003E() != std::any::TypeId::of::\u003CNoData\u003E() \u0026\u0026 std::any::type_name::\u003CT\u003E() != descr.t_name\u0060 appears character-identically in 2 files \u2014 patches/hnsw_rs/src/hnswio.rs, scripts/patches/hnsw_rs/src/hnswio.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":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04e3f3bccbc5016dd91ada39ac9e80b006b1895bb13db19c1c5603b0483d9ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tables.num_entities() != ne || tables.num_relations() != nr || tables.dims() != champion.dims\u0060 appears character-identically in 2 files \u2014 crates/ruvector-kge-ffi/src/optimize.rs, crates/ruvector-kge-wasm/src/optimize.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kge-ffi/src/optimize.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76c847ec9440c80e2af9c506e745f9033b9688d5596dc60fa9be1e6cd15fdb1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typoid == pg_sys::Oid::from(25) || typoid == pg_sys::Oid::from(1043) || typoid == pg_sys::Oid::from(705) || typoid == pg_sys::InvalidOid\u0060 appears character-identically in 2 files \u2014 crates/ruvector-postgres/src/index/hnsw_am.rs, crates/ruvector-postgres/src/index/ivfflat_am.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/index/hnsw_am.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca23a654a0fe45f999a09497ff9f636f9831de7627dd2d3cc5a558a013225eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060urgent || matches!(storage.get_alarm().await, Ok(None))\u0060 appears character-identically in 2 files \u2014 edge/gateway/src/durable.rs, edge/gateway/src/durable_m4.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":"edge/gateway/src/durable.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bd608bc42a7b7b5ec4b65fda70e86d86d10928df37b4088b5272a4effcd811"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v.is_finite() \u0026\u0026 v.abs() \u003E f32::MAX as f64\u0060 appears character-identically in 2 files \u2014 crates/ruvector-solver/src/neumann.rs, crates/ruvector-solver/src/true_solver.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/neumann.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c279f23e0c965a3918de74e7a5e4e4b6c1c545163e4c01f415c3584508f712f5"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060serialized_len\u0060 is read from the bytes being parsed at line 203 (\u0060u64::from_ne_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 207 \u2014 and nowhere in its scope is \u0060serialized_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060serialized_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"122c07b00555929b5248daf606667a2a3c46801025414f327a56c8c2f87a9c3e"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060nbpoints\u0060 is read from the bytes being parsed at line 667 (\u0060usize::from_ne_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 669 \u2014 and nowhere in its scope is \u0060nbpoints\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060nbpoints\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b438ea2b97671fbf5a83a3acdd60d40250dac0b02a6c77ac52066b92c2354e2"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060serialized_len\u0060 is read from the bytes being parsed at line 1151 (\u0060u64::from_ne_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 1153 \u2014 and nowhere in its scope is \u0060serialized_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060serialized_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1d26fc1369803e666c5c1ddbf0fab40764f642d2a8fc8812f2c0c758e771d2"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060serialized_len\u0060 is read from the bytes being parsed at line 1203 (\u0060u64::from_ne_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 1208 \u2014 and nowhere in its scope is \u0060serialized_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060serialized_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e08bfcf36a03a581af65f1f13bba326454bedbdddd984577cf089ea19bbf96"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060nb_neighbours\u0060 is read from the bytes being parsed at line 1258 (\u0060usize::from_ne_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 1259 \u2014 and nowhere in its scope is \u0060nb_neighbours\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060nb_neighbours\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b018d7f27ef8b5c607f9eddfe561fd9d406680e79f438cf4326fc48e9fa8fd"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060serialized_len\u0060 is read from the bytes being parsed at line 203 (\u0060u64::from_ne_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 207 \u2014 and nowhere in its scope is \u0060serialized_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060serialized_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/datamap.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd806ca980da857ea16cf4a133830e160d59862733396c81d882459c7ac1782"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060nbpoints\u0060 is read from the bytes being parsed at line 667 (\u0060usize::from_ne_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 669 \u2014 and nowhere in its scope is \u0060nbpoints\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060nbpoints\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"41052ba8fb9afa6ebf7ad2079503d63302876de0675bdeb353471df73d73da22"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060serialized_len\u0060 is read from the bytes being parsed at line 1151 (\u0060u64::from_ne_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 1153 \u2014 and nowhere in its scope is \u0060serialized_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060serialized_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"551891cab520066c0e363ea3be152b16d6eaf9761febbda0fd03f1e682f953dc"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060serialized_len\u0060 is read from the bytes being parsed at line 1203 (\u0060u64::from_ne_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 1208 \u2014 and nowhere in its scope is \u0060serialized_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060serialized_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b64056c6c1196768b3234d1d625284ad235f17f3dd5b44995ae3b40c21586b9"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060nb_neighbours\u0060 is read from the bytes being parsed at line 1258 (\u0060usize::from_ne_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 1259 \u2014 and nowhere in its scope is \u0060nb_neighbours\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060nb_neighbours\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/hnsw_rs/src/hnswio.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d33e03d560f188d0d9e1a2d458ea7dac0b56e5938d000962addd0802991547"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 483 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 484 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/pickle.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b276015a1e90b45317d5625748059bbceedffae0f8cd5c4e707cd66672c841"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 110 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 111 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/ggml_file.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67778c57476f2fe608057d9dd3931221db95481edc92079997fa19a597287a1"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060n_dims\u0060 is read from the bytes being parsed at line 196 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 200 \u2014 and nowhere in its scope is \u0060n_dims\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060n_dims\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/ggml_file.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"03eb2f0a2c372b9b4cb0ea73008253d1a1605997d8d9b6382568f5c17cf1fc06"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060name_len\u0060 is read from the bytes being parsed at line 197 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 205 \u2014 and nowhere in its scope is \u0060name_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060name_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/ggml_file.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e47f8e7c34539210a4a57d20ddbd0bb555998955ac53bc0d6ce067eb46da85"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060n_dimensions\u0060 is read from the bytes being parsed at line 423 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 427 \u2014 and nowhere in its scope is \u0060n_dimensions\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060n_dimensions\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/gguf_file.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23964b849c7bbfa81297f89135508258090c0bb53bafdcfbeef94257e79966c"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 42 (\u0060read_i32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 51 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.9.2/src/quantized/imatrix_file.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d319b3d8e7df27817c9dde42e7bcb93b6d4266e0137b4f6e87ffe3b0a33e99"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 472 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 473 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/pickle.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3985d6e148255a1cbe36cf88a816b173a575cd8b2cddd3765045adc4a881496b"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 110 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 111 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9f91f5ace23a79e69327dae77b9246a41333d00cbcf9a4bd174f293ce04c1c"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060n_dims\u0060 is read from the bytes being parsed at line 195 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 199 \u2014 and nowhere in its scope is \u0060n_dims\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060n_dims\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"803cf13af5f6956b0ecde46f5e8a2cdb999a6a5164580be26b8517952dee3e52"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060name_len\u0060 is read from the bytes being parsed at line 196 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 204 \u2014 and nowhere in its scope is \u0060name_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060name_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/ggml_file.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c59fb4433184e0a5e2e74a31f77d82840918819dec2a7012a075426e307b63"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060n_dimensions\u0060 is read from the bytes being parsed at line 422 (\u0060read_u32\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 426 \u2014 and nowhere in its scope is \u0060n_dimensions\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060n_dimensions\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patches/candle-core-0.8.4/src/quantized/gguf_file.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b96329d92e45131115cb748cc0d3cd5f278c871a17422d6762ae6621cc6e1e4"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060restart_count\u0060 is read from the bytes being parsed at line 120 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 125 \u2014 and nowhere in its scope is \u0060restart_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060restart_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/index_seg_codec.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"60118e899fa5d3d83176c21c742251ac8de1abbb2841f197172acdff8624fe29"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060block_count\u0060 is read from the bytes being parsed at line 54 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 59 \u2014 and nowhere in its scope is \u0060block_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060block_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-wire/src/vec_seg_codec.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"237b2d570d817515e7c8510129537dbc93f76a5b9015b0e57892a927a15cc264"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060dim\u0060 is read from the bytes being parsed at line 207 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 217 \u2014 and nowhere in its scope is \u0060dim\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060dim\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/tcp.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c827c8842f3a69ab6452bdf42de79448407d4f99eb1f9ffa0ba35eaf0afa933"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060count\u0060 is read from the bytes being parsed at line 259 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 271 \u2014 and nowhere in its scope is \u0060count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-server/src/tcp.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cb4af53029545a745feef8a64e52147fe56320d79605f77ba306f36c26777b"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060count\u0060 is read from the bytes being parsed at line 93 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 101 \u2014 and nowhere in its scope is \u0060count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/cow_map.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca1c30b82b59a66195ba27d9ca64b8469a1740adcd4dce86c3dbe4ceec73c91"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060count\u0060 is read from the bytes being parsed at line 664 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 674 \u2014 and nowhere in its scope is \u0060count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0b7e8776074ddad91ac6176102034b52e8dccdd8a6dbdeb314543ac91ef467"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060vector_count\u0060 is read from the bytes being parsed at line 706 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 720 \u2014 and nowhere in its scope is \u0060vector_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060vector_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/read_path.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f8236fd0c6b3a3983e9bcb0e18225b2a623df6552f2d7e643c15e865fab74"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060count\u0060 is read from the bytes being parsed at line 194 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060.reserve\u0060 at line 205 \u2014 and nowhere in its scope is \u0060count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-runtime/src/vector_slab.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c01fb527379f3333c6e7fa556dfd2ea17a27e9d152ca565024dc354167a3883"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060restart_count\u0060 is read from the bytes being parsed at line 211 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 222 \u2014 and nowhere in its scope is \u0060restart_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060restart_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvf/rvf-index/src/codec.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"46618131071f29c278c82cc213cb08a891899cf71f7d3c2b8df7b08af769f658"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060vector_count\u0060 is read from the bytes being parsed at line 324 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 326 \u2014 and nowhere in its scope is \u0060vector_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060vector_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/checkpoint.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ade449cc7fcf3298a5b634c26ea6fc876622889a2cfd68274b7b7eab195c4be"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060graph_count\u0060 is read from the bytes being parsed at line 335 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 337 \u2014 and nowhere in its scope is \u0060graph_count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060graph_count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/checkpoint.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6008cbacb5b329332deba5d2d32ef83c82311ddd587d9c26c1d10b8fc8a3a85"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060count\u0060 is read from the bytes being parsed at line 501 (\u0060u64::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 508 \u2014 and nowhere in its scope is \u0060count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/crates/nucleus/src/witness_log.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4300e9eb9ad8b92d5e186ea2314f4a479760d78fddd871c6babfcabdc6fa51"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060n_dims\u0060 is read from the bytes being parsed at line 255 (\u0060read_u32\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 258 \u2014 and nowhere in its scope is \u0060n_dims\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060n_dims\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4453bb657f3066da2369afa7240885af1170c4151e70ebd5a214e583be0ae624"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 284 (\u0060read_u64\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 285 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae6798e24048d72850c9cf7857c547217ed2eecc175e7c266297aa23dc3e341"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060array_len\u0060 is read from the bytes being parsed at line 311 (\u0060read_u64\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 312 \u2014 and nowhere in its scope is \u0060array_len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060array_len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/model/gguf.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82798c11c1c075258c4c88d5d88d696437e74c8a6110dabb4dbd82728b7db53"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060nnz\u0060 is read from the bytes being parsed at line 298 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 309 \u2014 and nowhere in its scope is \u0060nnz\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060nnz\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/sparsevec.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7832fb72b8b8396fb6225b50351372d996952cdf7b1a21c53ffac95c5dbe3d8"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060dimensions\u0060 is read from the bytes being parsed at line 116 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 127 \u2014 and nowhere in its scope is \u0060dimensions\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060dimensions\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-delta-core/src/encoding.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5b4cb684c8181928cfa67565946a4098e2ef4e5af86a9433699166c9a96cc5"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060ndim\u0060 is read from the bytes being parsed at line 436 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 438 \u2014 and nowhere in its scope is \u0060ndim\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060ndim\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/transformer.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c81081c39c32aaeaa94b569c5420116defca70f27b3d3c0eb525301e16e3f5"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 19/76 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/static/wasm/rvagent_wasm.js"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4053f31cd1a6f827062aeccad2d1d2907084130bb2c14eddbad0a405fa6cfb5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: RequestHandler: \u0060RequestHandler\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/billing-orgs/\u002Bserver.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f4e8c7c2d967026d42179f51e424b9f526919e2cd7ca3c661e197280b9a78c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: createShareLink: \u0060createShareLink\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/createShareLink.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"782ac8f4af395a1b1ece311ce7bb883ee8844b9a71e9615d5151de26aa8d5a70"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadAttachmentsFromUrls: \u0060loadAttachmentsFromUrls\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/utils/loadAttachmentsFromUrls.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70ba023f55cf08ed22df7dfb2266db02646fe925e008cf0a250df5d052bb118"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: refreshMcpServers: \u0060refreshMcpServers\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8358c689055fde2209026839e196e21d5f57e7040f563fbc10a8de508591c5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: healthCheckServer: \u0060healthCheckServer\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/mcpServers.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a6c57be8a81d47f37adc1c089f6d1856b287c3ac1183df9129341eaf08d9fb"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: setSettings: \u0060setSettings\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/settings.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"58351b6997c849b1d98c7d180a2487ad7170261584c39dd95b34b49902dfeb6c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: initValue: \u0060initValue\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/stores/settings.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"976ac66015d125f97c5793e737eb129c25b8d80a3b5b5bb1780923a54bba6d7d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: authenticateRequest: \u0060authenticateRequest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/auth.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f206e0d034e497dbbfc3ff706190e4332dd7bf0d0e6bb32eef8481c532774eb"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: processModel: \u0060processModel\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6ab09f0b3fb142bf65753ef724704377c3047218f8757eddc0c011f90b48be"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: buildModels: \u0060buildModels\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/models.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f68fa2aa597ec353d9b55bc472a8961124d42f8cf6157040045df6351521d9"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: sendSlack: \u0060sendSlack\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/sendSlack.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb90a6537aef0b391819ef0582937fc510b9a2a22d9043400e35bd77d13fede"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: grade: \u0060grade\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/metabiohacker/tools/evidenceRefresh.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4493e9b1a5d3c6d328e43ad7142a12dd94dfa0477a204879db62586568e8916f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchTo: \u0060fetchTo\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/typesafe/scripts/fetch-models.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eae9b1ddce2b2bf167e9a09eecebdeb30166edf5f1c45e7c1fc78f36ef08b9b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: init: \u0060init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/rvf-wasm/pkg/rvf_wasm.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c12de76da39a4c563b3adbd1db1d1193cfc6c39f2290af792335c3f20d516d0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: download: \u0060download\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/models.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef8082f728bd8c622a69196114b30e873f524dc7ed1b78fc2e320e547d25ef"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: download: \u0060download\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/src/models.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8092d7c2d81575603aaf70eeaff8ff8e688497d93a8b13850a2abae5b2aa5f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: callClaude: \u0060callClaude\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvllm/scripts/training/claude-hard-negatives.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b02419d1e9c4f7cecf337717f75fb4dbf3c56af8aeda4963bf56eedd52dac1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: embedTexts: \u0060embedTexts\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fea85023c7ca3c9faedba557957d39bfc91cb1326b2051caa1ce2b75f6d1037"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: embedTexts: \u0060embedTexts\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/embeddings.js"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6428e9339f6eb1d2bf662306d9ff4a7ff425fca2988e6a5fae9263bf38db0e47"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadInitialData: \u0060loadInitialData\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/app.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e37dca0a55fd314160841b1d165e5dabb080dfed53d6d4aaaf831dda2d5ee58"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: findSimilarNodes: \u0060findSimilarNodes\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/app.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"88488188b060a7d7df9677f4f615632dca6fb25e1581a5093d8c8c49ccfe6d88"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: searchNodes: \u0060searchNodes\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-extensions/src/ui/app.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae4ecb1daa0a9b03a35bbe53d2f13eb4d1826ebba639c332fdf9adcc0984009"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector-cnn/ruvector_cnn_wasm.js"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19d3a0efe30386e57faa8c65d20fb162f6d1e62b32f2b41c6ddf12399b80048"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: sendAnthropic: \u0060sendAnthropic\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f08184f08ca815e97fb6d63160b6c19fd4029ee76f4b0fd47680dbc1bfc1cba"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: sendOpenAI: \u0060sendOpenAI\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3470fe7c2645310959605a7faa3bcd9c72f0f2b0df3136f5ade7cfd34f632433"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: sendGoogle: \u0060sendGoogle\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"088638527e265dcdd724e3ffc25bce9115153b37311d75b6a283b85101d15d76"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: testToolUse: \u0060testToolUse\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/api-prober.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"182f7c030846d8e667cd3b46a69fc98c6485f79c99c941d70e968f5be513e557"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: decompileUrl: \u0060decompileUrl\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/index.js"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d2316598f0cb17d6c5d16dcaab5bd62036e7e48a795c871fe826ac4551e888"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchPackageInfo: \u0060fetchPackageInfo\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/npm-fetch.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"01208c21c9ed5ed676cae549d17c4d0880e5be8c8caaf6829e7d8e51e68ef059"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchPackageFileList: \u0060fetchPackageFileList\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/npm-fetch.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09ec79dc2bd99605c8dd450cfce0b4ec56416069b306234642fd2118346102e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchFileContent: \u0060fetchFileContent\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/decompiler/npm-fetch.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f78ab61da2c4f386a48277b397492755b5846a4e42538f07bd81876a9b6226d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchWithProgress: \u0060fetchWithProgress\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/loader.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee57fd90ef2519da091620d141dc7a4620c1a6a75e5755802e59b31e7dd346bf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchWithProgress: \u0060fetchWithProgress\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvector/src/core/onnx/pkg/loader.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a71d92abc6025ab5b1e4cfbb3344959f58293fba5bc7c72e61acdc8d527858"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: makeStreamRequest: \u0060makeStreamRequest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/AnthropicProvider.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d007873041bbcbabdcc9f1b847fa711c6eb1ba649c899f62f843a67d4b8fcd55"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: stream: \u0060stream\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/GoogleAIProvider.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e9c3d676fc3c55caf1affb8d10bad8e004804ef9087b0afafd19e21e06044c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: isHealthy: \u0060isHealthy\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a115392907a18fed7058f560c7657c96a78d319f6c37216fa0a92dbefef10a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: listModels: \u0060listModels\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08b041f84ea2d146b4df6cfb109123fc907e5eb3b75e3ecbed07e332d616d47"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: makeStreamRequest: \u0060makeStreamRequest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/integration/providers/OpenRouterProvider.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4843395ef86a5b3154bb83e575218c832449cb2cdb2a515ba9726a29e54005cd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: checkLLMProviders: \u0060checkLLMProviders\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/cli/commands/doctor.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"525981bdfa29095f5daabf1896d559e0cce6ca989c8769fb60fbc47a522a78c7"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/mincut-wasm/web/ruvector_mincut_wasm.js"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a80e77d460f8c2046092feb6296ee8db2670cd745f7b7809d01bc4323bcef8"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/graph-wasm/ruvector_graph_wasm.js"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b52a65a90717bbf5ea59d64c88be9281bfd66333b59281155becb3c4c8f8f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/emergent-time/pkg/emergent_time_wasm.js"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7abe0617379de90a75707dd9144e21784da05ec2b5a595571c24a8db858d3c8"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/e-means/wasm/ruvector_e_means.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea3e190daa032b6fb5fce5f67c84d4488c4e18cbf1e8c2d927589fdaabd6ab0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: generate: \u0060generate\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51f5d7cd479ba91edef1b12dcfb48d99272c4a0c7f38bc9ad8f6827a2a28027"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: generate: \u0060generate\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-multi-model-benchmark.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d8b0304ae6430c546792c6dd4dba4208cbb9488e6bf6617c20ac528f584030"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: generate: \u0060generate\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"de27494abe8280eb923c894a6a90e99dd5c5fd3cab66c7cd55306c3856563b18"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: generate: \u0060generate\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/training/dspy-multi-model-benchmark.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"948dadbc0a133bc83ebd99bf97a83d50b00aa46acaf0f2f3e2a8032c61f00ae7"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: callOpenRouter: \u0060callOpenRouter\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/agentic-synth/src/generators/base.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"65618338660a9951389d995b3cb5555dd5360f169377834417c37a1ad61b885b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/explorer/ruvector_wasm.js"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"009942e85804af792c36b042cfbcb4904f43587caee12813a4aca4adf672dcb5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/cnn/ruvector_cnn_wasm.js"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cd7129fd566e808f6afc6bd322a9ff48f2604a78705255138d82a141612d7c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-nervous-system-wasm/pkg/ruvector_nervous_system_wasm.js"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f39294b96198239b172c4483ac880f02927adb0203ca9ff86fecae7d62cb0af"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-learning-wasm/pkg/ruvector_learning_wasm.js"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"252c37cce2a54d2d3cca8cc2d59b0686db4a471ce5c84db6f878f28a928e8df5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph-transformer-wasm/pkg/ruvector_graph_transformer_wasm.js"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b2ab0db86deeeab6e50ab7160a36043a7eeecfe3671aab2ce44d3736717d6f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-exotic-wasm/pkg/ruvector_exotic_wasm.js"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4304400fc7b749352a7aaeb08d49a121e49fce547b3afadfd578b57440c63b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-economy-wasm/pkg/ruvector_economy_wasm.js"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e282f3aaab2e64ef1781b6b0846b4ea837ee6861d7615f765129ffe0a3d0b3"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: __wbg_init: \u0060__wbg_init\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-unified-wasm/pkg/ruvector_attention_unified_wasm.js"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"852fa09ded10e44d4d85b7f06873963dcad19b8d7f2cb9423d0f199cf6cfb07c"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060results\u0060, and the statement it guards acts on the element it is on \u2014 \u0060r\u0060. The test deciding whether that statement runs does not: \u0060maxScore \u003E 0\u0060 reads \u0060results[0]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts \u2014 the fixed one at line 254, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/search/HybridSearch.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"746a5b9e9dbc496b7c15205fb980e02f26cf9f229ae6627e5f50f15c6c5f11f9"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060results\u0060, and the statement it guards acts on the element it is on \u2014 \u0060r\u0060. The test deciding whether that statement runs does not: \u0060maxScore \u003E 0\u0060 reads \u0060results[0]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts \u2014 the fixed one at line 254, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/packages/ruvbot/src/learning/search/HybridSearch.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e24a23a9f67a7b5e11f4de8ab27164d59d188c5aa5d8b8ce2f1717f92f4932b"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060patterns\u0060, and the statement it guards acts on the element it is on \u2014 \u0060patterns[j]\u0060. The test deciding whether that statement runs does not: \u0060let Some(target) = p.get_mut(\u0026 patterns[i].id)\u0060 reads \u0060patterns[i]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reasoning_bank/pattern_store.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19407cd83b7060878c4f5714d6aeb2e4744844691fbdcf1892ddfde98c179d4"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060patterns\u0060, and the statement it guards acts on the element it is on \u2014 \u0060patterns[j]\u0060. The test deciding whether that statement runs does not: \u0060let Some(mut entry_i) = self.patterns.get_mut(\u0026 patterns[i] .0)\u0060 reads \u0060patterns[i]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/learning/reasoning_bank.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc940b04d3836efde66cccf82294a95f10dceda866dc37d7f2f9b5c1ea7ac490"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 27 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.error({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.error(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/billing-orgs/\u002Bserver.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba828bdec19467a8c1c5c4e48d9bd3ad3d84b55f7bd932d8f229fb680524b59a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 51 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/v2/user/billing-orgs/\u002Bserver.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"43176095e6986fe1a48ee4d86b710741b1190495f9861735795af7e89e3381e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 256 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c51ce9a45b3767382497b14e4d781ade9fcdb87927ed445fe52645ff3dc298"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 263 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0845dc2005250665d4ee804743c9bede885052b7fdb4ce3b100c71311a2b663e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 331 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/routes/api/mcp/health/\u002Bserver.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"744e584d803a1ae1410d38652cd02cccc84297976e09c24c29799285d8e3bee8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 58 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/adminToken.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d52f1b31271cffaedeb8f296d44b9bab276fd511bc843ed0c8361ae6841219"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 237 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/metrics.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2799cf8ad75b385ea678544ca10238acf5165e7130aaba0e8c3acc8c8774d75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 21 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.error({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.error(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/sendSlack.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d055f9140ceb6785bf5f8934653c1d781a148807d2914d313834fea679870af2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 248 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/textGeneration/generate.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de40f374ec2717db182fc07aa80e69921107eb876e333018a14d24a104d0c2a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn\u0060 at line 164 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.warn({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.warn(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/server/database/postgres.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c73ed99efa0b7791af2e6995cb9fed478213db4cbb5756f0ed968181f36500"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 52 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.debug({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.debug(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/migrations.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6311981e9e34869a8bac26beb3f76e1b06e6aede6f16f346f6eb93646315395e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 59 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.debug({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.debug(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/migrations.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d696837e88abd12b1503aac4d735ab9b124ea09d35bf20b4f12e07f6ff187ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 66 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.debug({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.debug(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/migrations.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b2e40d85ebd9af3e213d1aef2d1734b0128440af18522ab9fa0a82250f6917"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 89 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.error({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.error(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/migrations.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b0a0d3607c1fdae8a88cadb1a4d3d8b653ec5c91a5d0101225b49a52b82528"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 73 is handed a template literal with \u0060${\u2026}\u0060 substitutions as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Pass the values beside a constant message instead: \u0060logger.info({ orderId, status }, \u0027order status updated\u0027)\u0060 for pino and bunyan, \u0060logger.info(\u0027order status updated\u0027, { orderId, status })\u0060 for winston. If these calls go through a NestJS \u0060Logger\u0060 routed into pino, nestjs-pino forwards an object first argument as fields in the same way."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/ruvocal/src/lib/migrations/routines/09-delete-empty-conversations.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf2ba212ac7d9685b8cc7bee7c4d1a696fe50cf50ce3d5f525f08ce0c577210"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 77 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hitl.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b4a61f3ae1e3f73c2688e0e754765a63aad0c58914be5cebe7ef83db41fa6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 813 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/hnsw.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc7161c77a9cea6fcd3f0d3a0757ce5cdb2bd9614857843d199ae29a5491948"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 153 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/memory.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffa3dad525b42b2ee0fc1b0fffebb0d093bd100992950117f2d59d2d5a099d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 167 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/memory.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe2189ad1784259b5d24c2862cdbb82e642bc2dc14e4e243ae7c62193beadb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/memory.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68c739d3c1272f53c2e7900f1af3b0980a459cbd86b6ed1dcfef062dd5e49f3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 73 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/patch_tool_calls.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e149b03412ef68f8ec0bfc7c8e701563033ac9cf2ac4570b204285c75de0968d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 200 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/skills.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"85457f500e9a185834a7d6b12e0f749ac1ae2fb1aa8cc9b1746a7c640bbcc886"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 219 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/skills.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c4df4263251316df1aa8723f2a50793dd55e1485afa55dba8f8405390dcdee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 250 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/skills.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"75226f618eb673ca48723388324918356bef1a5d575de8593b14b0e01bfa8314"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 345 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/sona.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38083accdd429bd161008ef83e1dcab2b984b71e071d2bbb0273f931240192"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 350 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/sona.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"36469d101f04bc24f8dfcb845cfda71a1e59a1666bbc8d6530112a1c808786c3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 410 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/sona.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2ad1273b44ced46f38e7460e39bfd1455aa3ad66c6d501121508c70a9e12c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 419 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/sona.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1e8c7f594c6fdf337cba1d30b6a2c53e715cbeeb5a788170155cb5e802e549"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 478 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/sona.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffade196d9ec9ac8a02e45982ab6aeb6d17c223c521795e99528c65de7cc193"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 482 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/sona.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44630a3f8ab6039376c148fe245b61f5b8df550ab1a1541cf80bbba4da2de05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 75 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/unicode_security_middleware.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"161b7f7b6e21628036b66aaedef761a95b4130d9b0be0102781a650b20964af3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 81 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-middleware/src/unicode_security_middleware.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f419066d59e31c29060206a0f12134f20464baf16cf915abecaa54087cc3cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60d15e665ee03e72fd74748982db50cba0c43c9c6a3fbdd176fccf4d69f3c51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 130 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d43a52c1f9db5e06f3e905f9bef94ac6084be6540218815a6b340bb494fdeae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 144 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5a373e2655b3d71b4f720423a0f18f13f876c7b780fa46d329734bed6af316"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 172 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afaa612befe7351518c76a4740b0602974caff3a57dab75939065deca628785"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 191 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5f24259fbc731309cb78e10c38204939381530902d7e904d15d74997ddfd6f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9f05cd89f2db85fd6224e7b5f5a55932c7d371b93a909262d667378d20efcd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 211 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"512040cff2e6f8551d68b8ed82c973b7d200328c436b1a2847ee729e2ce1fc52"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 257 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e015d7f9d1c57c6f3d24979135bc94e9cd9b036d91ea592e250f96236c93261"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 263 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebe53fbe51448890c85195ef12ed66bbb6c2bcdb41b33592dc71970f45149be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 271 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8197eb6b015fb65b32628f5102221e16dedd94224eb2d5d386b37ac82f9fe90f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 272 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bdf69cb649df70e928ffb8d716ad4ba21b70dab8d1ee882424b4ccb0d9e031"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 273 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55b7bbb55c4220ecd097f0a8b72f1e28551c9f714089cd89d49a72c4fe3269b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 343 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-mcp/src/main.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"07995f7b4f3ff08f80b2b04b49bbb9a21eae71638a76a51f9f4e181c81155506"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 374 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/app.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb97881d5777df8b808828b512d1bb54fe5d28357027909eb61ad1f675a75796"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 391 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-cli/src/app.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9001279063abd264cddfb128faa5aca81363cc74dea8fe0a556cab9ce77d47e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 144 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-acp/src/server.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa815bdc8e6ee81303b73f13191465d2390dfe1121c97de154efa63f682b56cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 221 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/models.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8424e3a73d06e4170c8625161ea56a2338256385edf36a047492fa6f9cd380"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 795 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/serve.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"672683681d1c5d18f5bb3a303320e22a8971cb64dfe67b824b4dc1e477f789b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 856 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-cli/src/commands/serve.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"753d318917575d8db3f6ee0caecd1792614dcbd97780a030e944f50b7f45e4b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 784 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/ruvector_integration.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7cf04367f6fbe2652fc6aceff3c64638ce6029762888326badc6f3b37fc8df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 731 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/witness_log.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee8ba0486402cfee7ff7bf09c8f5cbf9ae77ad36df0d3bbcbf389773f20d8e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 796 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/witness_log.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a246020f7bcc9bb13fe18742c0af4f55904cb5b8624f961c58d0fbdf6b882ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/real_harness.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b01bab81cc42bcb78c49b754e2baaa45f20bf94f1a0a5d381e10b011c1b50a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 518 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/real_harness.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e951afc3dd081caf0954913c4d24c99c739c4b1b1b78b5d79c85a226a8cd4657"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 636 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/real_harness.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f4f3839d27474f09d42a4d49d8e307a5c1593272d6d046e3dbf64f06874c2b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 276 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/swe_bench.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf7e0821fe1f067632ef8a6ada232cadaf69cc6478fbb2818beabc19c142712"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 354 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/evaluation/swe_bench.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca14a00704f36273cbcf920d7cff1eaf2f0ef39f216edbab8358f5ea7de80908"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 441 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"99483041473c8accc20c8f4328c2b38b421bd425791dc69afe4335d09daaa5b2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 482 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3b55055270abba94d259fc76dfb1eb38fad7ed957cae18fd753c82cf97fd21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 544 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7bb696975715ceb5a1ecde15085812700b21cbecc5727dc40583aa1d5a4396"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 600 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c5e1641a1c12763b64e66b6aec1f532160166e871dddc8c93d1a1fe26b34b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 609 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d35840d6398844cbf730914b2d003e6da63d8b0e27c5942a35b5355143286dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 636 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3f6dae66a2ce3310fe93ecd76a4c2c256943656dd8e225623e0d3f6fa49b98"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 710 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"520447ba1f656b20b8607c863d82b24faf6a2e2649152a62c394781fbadb0f64"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 897 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0901e308e02cff22f2974616f0f2ea90d5815e751950862a3afbb183be1218"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 997 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baff53ed2baf368a66886be75b0991421959ad0d292be0d5ed62074e940c320"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1507 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3984a575c270fdfe00818a391b66d5626e1eabfbb818b2d61132371371cc64c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1553 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a0c160826834601dd61f9ffc9ca2c61f9ab5b5472efe9e11303e0bf9d81546"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1641 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/candle_backend.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a2eb910da0daa458c024ff40ea7fe41cbfb535e7cca083baa6792c5092fe84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1211 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"135940b865abf81bca39e4a372ac1b23119ce42fbe7eeccd7f1024e4272162bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 388 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0addce39d361f29c6b2eae2c454ba3f4144b74a203ed8309d8b49f2070c1872"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 844 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b397d3c57d374e5f2fce31502ab4e9a38993302a0e24c6b9fdddbe6b2cd2c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1253 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd5d541b8fcedafacd918a4ea4cf8f68eadaff6c16222f6dcfec6af17091cba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1256 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5496ad4cd102b1d03015e9792ec487cca28648bac309b205b0d115f1c0c45bcd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/mistral_backend.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e4bc8048975d7c8b802c70b2adf2900fe2a0b1b7b96361887c8f971dd0b9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 581 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab858191b54f29b0278c46adf4ede757ca8e52d77f150fcef7210815ab1c229e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 918 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0b676af31dd089e7f68ef444bec55ceaa7c54a92fb0f6b286be866736a46b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 922 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"127798c5dc1c79f3a55ac78ffdb8518d888c46f00e0e48a38a5266e8e5468f21"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 926 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bf1da243b19bb27deb18ec2b2d19c3cf59924b082bf5d5c5f4599bbe99d50b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 930 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"616b5a7188df8735a35e119e87c3c2c742ce6285968ffa2bd2c41094ade415eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 934 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/consensus.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"292da4ba17bc628bbebe045125691b9ac955f7bd8f8d2949eb233cd54f0e9de5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 389 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/console.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3080b4f0fbc9dcc9bbd55c88b535cd429d365cafae217645c5c9b8341351fa7f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 404 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/console.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4d6b0d131125abeabe00baefb3b366aad3b2d5951164c406ef1920a1b947d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 518 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/network.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"694a8e07458f15bba3f42a24bb513b7c075ffd920fb79f093bfa2468535a7b6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 396 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/node.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"30561cf6c31e0da691ed6a8f1efd93f316e96767dd54cdaf97df23a46f49c199"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 479 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/node.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c51fd8c0dbc2a25215eb3d681446a11591e8605c35729a39662bca5e5bc358"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 502 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/node.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37b35e77d1f71fbbb184add1ea55c524ad7a38fb8a8233843fdf071aa443854"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 519 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvix/qemu-swarm/src/node.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53ce3dbeffa2ea84e777600fd73700338446a894a98b7edbd24e0960b63f8ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 138 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/api.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44e29bfe21cb81d57ebc02c5878dcec3d919b43bd84d9edb59db1633e6e197d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 321 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-tiny-dancer-core/src/api.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"34160ab431746c4031167b35516f81ed023bbf8e9fc10f5a398c386dc8cbd436"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 188 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/sparse/ffn.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b30f53d8e9dffcdf3497b02937adf86ab5aa9b6f282261b1bdf458a263c60f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 146 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/predictor/lowrank.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94efb23e23a66cc7909861bba03f0ead22354f94b2523379a86770f3b8e185e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 154 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/predictor/lowrank.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0b7bd76a932a484aea5a7c8aa48bc33ca30b95d11f9334d7cdfbf0b88383a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 224 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/predictor/lowrank.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07c5c4f70ae4c21ed7c6fc72bf713538da9e08234f11077a45df26e1fff57ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 250 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-sparse-inference/src/predictor/lowrank.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"749ab5957fcb627f27c08a84e326cd65d272affbb2537469fc62ed8b2bf2c011"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 452 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4377176bb207c5fbfa8397d27c2fdf520bb3fbc67c02e5bcb57bad42724fdb0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 467 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7daa6e7f08a8b3252d5ac1466c6233cf17838948237931f3c7cd0745b30715"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 486 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96bd1113b43e6d2071a7df997274198878cc4933ce93dd76bd9def1013fffdf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 509 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf1ea50938716c936112dec6ab3b210c6bd06df9a47a7e771424dee5e032d4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 516 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdb9b368e72b6ef31ea3a7bba2ac772854f654f0f3485534d887156f89c53eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 528 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad607b84732a2df6b038e5fc6a8a67a781693c4d83245f760e6cd85defcb04c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 553 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"60683f2bb2ae23c223054ff096ddd147e9aaeb0635d49b40af6b8111024c3fe8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 576 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/cg.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbec3c4abdefe43c6af6e7ac3ab7153d916e49cc8bbe3bd5b3346c0fd652594"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 376 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/router.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf6e3a84c34f6541b2a8314c8c68efe778d51237b02bbab31ae8eec5f6dfaae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 162 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-solver/src/validation.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"678907847f95223f5ed897cfd9f58bd8a88ab9b1de4416fa5c9d676e1292f939"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-server/src/lib.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2f6bcc9761ef897e86935b0adf4de53ace161f3c5cd1b54181d7f28df589fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 216 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/failover.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b3e97bb122340e8b94b10d488791c5b3eb982c4c083da6ad996e6d4ae0c980"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 300 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/failover.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4166f8829fcf0ffa3d99b83d78e42296779812234e0a332ed1c1899600838b5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 301 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/failover.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f0b3ef97799f7ed29db1e0ce3f0db8e277d9a5c581f3edbda236691fbef05d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 351 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/failover.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7630e59741858e43a07cf2a5ae8f2124a4fa44240d8dbf48a0c2b58e8c65bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 258 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/replica.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1681ee6fb2d6fa58a692b3d3f9bf530fdc3b01776920fd131065229583c1d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 277 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/replica.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f5dd686711bc448f3c53ff358e834fee5874119f7394c62484d2d6eefb40ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 196 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/sync.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1b446c2b3b07b57fa4dd90ccc6bb83b4535422f235e2cd4d1c29b6e0f05d57"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 258 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/sync.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d372ca856251387a38d382a2d10eaa76cd2a41d2d827b8fcad01cd2365168d77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 280 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-replication/src/sync.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e603055769d237ab41aa63ed14895f1bc9aba98ccd13d9256db12b613440f651"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 148 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b7d4fffb577a8ee2b3d6a52a42c74fdaef6c3b4b8bcfd7807dc4ae1993124a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 206 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0b58249c46b9af9cd5c401daa89875928a176d1b1ab40d8ccc1eb080d8b0f8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 214 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d732c4c64493d7fbcaa05f0f9ee6bb0d8abe19b00eafe132740329764c574eeb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 222 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"34984e7f5e79deeeaaf9173dd70d320316f267eb6a5d599f3a3305fce629362e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 274 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e834cc359eb757b68d64f71b17275d25f1fde50a2644dc95b024623293c04ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 319 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c128042c92c607550e09e798094cd1e164ea06533cb8ddbc518c55c3ad7e02cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 327 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a7acdfb63c91b25f3180100d3bc182efd208407d4748ed7402a4b35555a48b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 359 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0e6b7fdd92dd3a165ac2e6e932d2719cdc769cffeb3b9731cc9a085c92e4aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 362 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba33f3882c84076fed2ddde2fa9a0cedfa9f9ed8947758894f0e17d72345833"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 381 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9aeb15d1154e5d36ce37ef567dd4bb07f3aa04f7d13a058ea4e712bd4a2ed0f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 469 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e07a8b3bba8751d6b3b0393e0f0d23dba5fedada9a1a7f7fcd800a9498ee430"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 484 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceec71b395bd36c92066ef9bed5593aa7153da497a3d3445837d80fac1a1d17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 491 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3441a0604e3bb03c9f6c128b2d495610c4deaaad10bfc2721068e3be2a54bab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 516 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb07f41c330579a000fe3975433a51d2a8ed6b3b08f25ad2d0e715d6e4c1e5db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 549 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-raft/src/node.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d38bd9cf9d27fb9292f42ec21e1d74093baba0444e7d0bc54379f03a2255aaf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 131 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/ws_client.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"68705751731dfe7a6ffb0ea67cbda00d87d39daaf552f07f4dfb3319e6bfac3b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/ws_client.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a544a27ca30bfb3f4e308e98f37d76275b77dc0556f578bb1267e524c7202951"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 176 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/ws_client.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a66c6414ecadb47370097f1920fceccb44e689ab8e42b80ab56a73f332168d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 180 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/ws_client.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0d3458637019e3e390027166520fe055c448d07cb91f8f8851b0e996c244f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 184 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-kalshi/src/ws_client.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb87390c5b73821cb9c05a1f93068796abefe36b0f24e13c0fb924dc3c48b63b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 114 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruvllm-pi-worker.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e8c7b95b2d1da2b29ccef719913b4f9b44971e843a9328f5385b2ef3764054"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 204 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruvllm-pi-worker.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51dd23ec42c0c18832d244ca91ebc322ba9f5b5c076db2cbf244ce9637512cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 508 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/worker.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c31e6fa109ac4194e0adacf5f0efbd7c2740e6c719a935e7d90a0bf460b6fe1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 135 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83bdf87e67e9d9ea755209768c4c21d2124f8fc8240498f1e1025c305532770"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 141 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc4aa19fded2843c255bf9c558a54cb76a945c9a559cb861789a44d3087dd2a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 243 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf5ad8a89efcd8ffb86f74b2a03826e69a98f873fd1c6ed3bd2b73cd8c316d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 251 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"47feaf5545d85f674380ca2698dd3c84cc02cd9f982a1b747ed6c8ef737f90ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 351 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"19efa16ae37208688ba0a4558c23be9b56b35c02300f26eea458659acd85771b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 364 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"42292c5520ba7d05d221ad9c0bb75bc40725846a9735488ca14c9f86ffe62824"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 372 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"885b86114511ee9ee0b99fbe24981c8a49174b6baac52f8b5ba826861c93d550"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 385 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/coordinator.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41f1d8d08aff9baf54ce3d6650531bd9f5fe7e5003849b3e0a5a7619e440f94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 101 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"45065476eeaf9920e6b3ee837f70352496243d83dfd9677d1800408120b13f82"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf87fad0989a3abe0d639f1be3c5c0d0826d475be242beeb9c8e5eaedc7fca0b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 153 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c020bfc7281319e0b414a8944d24a58d3698a586188f0a8a10baeec0c29c47c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 167 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86185e8a7ffe9441126b1f83a5487a64596214ccab5108b39550395bb6bae80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 316 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab095dfe7e59f723b24097991390fe9d66ba55b77bab01b1e6670a71b079f7f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 360 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1e1c7b1b614ff5f1f2a491e32bb984fb6284c9920c0af6154ab582fd600c8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 363 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6111481ecf0e2c5c541100fadfd0c26ebf80bb11eb94418dd3e66d7e467e30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 376 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8c9c218829500e39d12266c220fa39b2ad4186c5891bb43be402d7bde1408e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 389 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e27026fa607be7225404bba79e5fbe530e529b4dce23763e54e50887c3a0527"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 414 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"75621e3a0aea99b1a8e9036b3e9e8e96645cc161bb31fa36ad53eb7c3f6cb870"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 456 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/federation.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6986dc9fd89fd8cae094264c607566977ac0833a55ec11beeaa5867a8728dd4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 238 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82c3ceb16c5e369bf4cf9d42d3bbc1d4de7fb3c139747aceac55eade1b7520b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 257 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c4a444fec77da400a0bac387f51f70b1ce7931ea0035f982852fa4cbee3b42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 268 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f61fd7436723c3956258d6d058271a766cf5e911079140c2f6c0171c23a9f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 275 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"924cf2741d631836029b201e962f4e650e8d6f240896d5931804e4d0f05b5aed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 375 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcb1f3c285acab73eeefec9da9e01756f62aa2595be6025048ba1b373e8e8fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 412 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef02883599f062c9be08e16ba75af17b2f289a2611168b1a72e248c8b7b26419"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 418 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"870a01666561e36d7718ad421695da320b1b9b777858782c97c70007ecc6c51e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 439 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6e4c767515d089a7128d5fa7a180cc5d786d99b79dad9ac440ab69632f95fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 490 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bfbbfd11833b60c75c527e84de6e7ae5a93ad3acc62d98ea6778cb0d42e6e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 510 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78cbb850f221a1804d69e22126e47461995cd8e818b98cbfe56d000d008f70e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 538 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/gossip.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e67aa85ae355006f0987915d3d8aed144f75832011da649d34d2a4b92680a96"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 98 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/replication.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae314de31ded87337eb873afa135cacf1caf0249d5dcf243e165d542a57f45a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 144 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/replication.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"555a22f6c21cde4ed589be3b48f6653021442c285b4601cf3bd8129e90bf8a22"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 175 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/replication.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b98635ac66ce916e44a2f83f91268c0bb34f847d99f911b0468df7860b4d39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 190 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/replication.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"513223d6c7e3b1c6f9b3ffa9ebaded37df957312f513d9bd3e3c238d6e086ce7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 201 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/replication.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d22a0deb639d34f57e6f8de1873a9ee15e21e14490822e178502bffdcca40b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 227 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/replication.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa6a1dee97c40cceca2cb50ba100067fa08793a01b2f7bfb5eb33dbeeb415ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 234 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/replication.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"048b225562f9715062cd00f852f8a05582a8f68247b6d9c4702e13afa5210fa5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 170 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"836ee764edaa88eeca1e9ced435dca3f3b2986e8011349cc7c12a8c14619f4e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 201 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5e2e91f1b22e5cacb3b4826c8cf124fb16704d26bde97c0f54288c228fe37a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 215 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45f7832d4cf6a2ca5f915eb3e198af8dec0be6d25e1af05bb170884a8277f32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 228 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb4d671966417ceb68598b524d293465643550ed774568ebaac09a14d217832"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 270 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa008b0ef33893b1e728a8da4d9de9d82769a91ce3f6db00663cae5686a65e00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 274 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f075a253391205fd83feacd7a225a2cf0b3fc46a9cb5d16de4082784ab033f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 295 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dcc08ed06d2b1ecdc08ba1dec00689a9d5abb6f72dcdf801b6e8b7ab8de8e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 299 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae23be4fec06492dc7d3b1eca52fbdd837207e02fa54d5911943419c9c6367d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 347 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36bbff452cba2b87e5d770096676ba96fd60c5750856b8492d49fa0d981e7dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 381 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/rpc.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b8ac2b5cee08858112a242fba886ea6f34b29179fd767c638e5e6252446b1f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 198 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/shard.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f8f8a3f74e81aa62562ec189b46b3b049841b9c4f6ac8821f96e09db719a1e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 276 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/shard.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab1cd894d321c008848f0355e0b99ac0664ac4ebd1d4a2c225bb57e87403d26"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 390 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-graph/src/distributed/shard.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"35669b75c92886d84ea1d37266e6d52f54a304d78bc83b68b480770d7a5f7609"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 58 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/qudag/crypto/security_notice.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8979f40578816a1fcad4b0ebe3f5c37b74f383a14a7e2b2e9c4cfe69920121df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 279 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"891e8a6b2888be144fab9f5263941db84ef247c07d56bccb0e3846e64e50ee59"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a362b8947b912e5380ed892c15b7ed239ddd0183ef6a3aa7c94a14b274acd887"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 312 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6970798a179d9bc7b61171a7b79d65fb78452e81990d7f80a66ed783d9842c3a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 351 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0df5eb1a2295c9d85c4f9bab4b46beb9536fbaa777e03a63172e4478a05cc3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 401 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2174d59b5c3eba3023aca024f032780368d30b36efd7f406e94035614d500158"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 470 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-core/src/vector_db.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a71231568604c0e5ae79c53604deb6caee5b4e25d4a28d3032ba360daf6566a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 141 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/consensus.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"743fc7db8d5c7b4dab99e3ad25e09bbf97db420e7509d61736e96d569c8eda15"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 169 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/consensus.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78b5960d3c7fbfbd462d42ed1cf9f35e0daeec8467e332c542c82514530c4f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 260 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/consensus.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e0b4fa50efc7c575d45c94e230f76c63567e8ec3f993690f2db5c78800e1bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 370 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/consensus.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2a7d24972ae8bd013b1e07b5e053ca3cc278ec0022456196f15ab2ec724172"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/discovery.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"76517bf045e5a780206c861e9969f8950fb50e6a5bcc790f00d77f975671cb44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/discovery.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc995408bb8dd3f6866c87885cf811c413911ebe1344159b75b6cc3bb764d41a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 165 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/discovery.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d56b24331f8c5445d37f115dcc9d7c1a5a3a8564712c1fb34c387756a196a05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 274 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/discovery.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"54916af1fa00e6eee48114f14fe25807bba2c5480b01f2319a6e6bd8daa8ab61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 237 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31b9e8ae0dbc60311460f65feb8fa801845e5ea3b5d1c0313dd9c4eef86dc0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 251 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e70c51f8631cc9686bf8a7ff0503111b1d004f74c92c4ba8724ee9f61cbb483"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 257 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/lib.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7050ad65d20af6ab0e48ca2d1ccc6a1fcc02eed84894c003c9a5878c9eab2f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 271 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5e576e5efba3889bb006f112f036260947457b6ae6721bbb6919e8f744028f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 374 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae92b8d9f0fddee3b183d45e09ae72437a997b9fc1216e4b71f41faafbfbec03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 391 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cluster/src/lib.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee29e37f94787ef6b63adb252e1bc1fa1325e2a30a3240f29c193d54981dddcb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 78 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/mcp_server.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e95421c3043a92dcd47b9c383003405973def5546d71d19bd2f77e326412b60"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 125 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/mcp/transport.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"628472640d2fcb20c759c59f62557feed0cf91f94404d96cec296fa52a5e7c69"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 61 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/compute.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"de02c11e14e7a45c993ee21fde44e1b5b7fd364e32e6a93790fe0cc137c7bbbd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 64 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/compute.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3537bba317f1dff3b0474ee53c6fc0dea9d6e666bc3db7d5fe8288db0896f1e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 84 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/compute.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"474994e1cb5bc40fcc23bacf77098f26e3614bb6da376e956698a51d7c46563a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 94 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/compute.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44470ef8b661b4250fadaf33b113dc045e6633b87c90cdab3e8851e3d4d15ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 124 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/compute.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ed924429ea2e6bb3dafc5da39c7b10f48ea710b1c2f2c80aac7766070a7da1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 146 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/compute.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3382d79f7b9a3a04c265b07b618211a1e72c3b3c21773afebc6cc5ec61377592"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 43 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/convert.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"98435634a7142ceb97011afdd1194f2951abca79826e8f42f23b40c6174334a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 92 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attention-cli/src/commands/serve.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d62099b92bd67ecf57187e901c00c82ec4de907755a2ec7af631df2c10ff5b3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 69 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/device.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"384d55b019de51b5227de35a57a49dfb233d346295c807e64437c719b51cc1cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 84 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/device.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def1caaed641d36856b127c65a889ac830a266d237a385051a0a2d785159134"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 109 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/device.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baca6572b11ee884fa673c020fea01fd5aebdbfc89ca4a239ea0e36a69b8abf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 132 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/device.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2658c331a952594ddce038e7c3e772c617ee9a0877760b563d3289035c5f0e3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 147 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/dispatch.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf19e4c1bc96108606c8dde5765d2104b8551069c0fcd64af3d23f07614d5140"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 206 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/dispatch.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0308e4e9eb50cef7aacb503c2b0337f49545d8111adb78dc4de8b0467965189"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 260 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/dispatch.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73fea89dc46594f71a54f87fa069c681b8ddcf210a0d1bf4e4dd918bfc13c8b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 272 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/dispatch.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5358e5b545290486f7be78165410289ec0f4e97eb48bbc5d0000d3a1b54c45e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 186 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"26164d1cfe1570ac420957bd3854c095e469a527cd0f81a0ef4256e3bf6ab762"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 236 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fd1c0cd1d6704864bb93ae33b6f07cead83c2835baba3a5dc265335f9b704e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 459 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd80b4eae19a75779815a6be4e54c67746e80ee91651cb264e167c3eeb83664a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 706 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/engine.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"07236002ad519ce07e53fc002a8276eb3d9f8d004d6e8740d961cefc63aa8d76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/pipeline.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b9c65a7129ebcb4cea8a61719dbb075ecce9e77806fb698830bc25ce73f044"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 333 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prime-radiant/src/gpu/pipeline.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8618e4b03bac536b9c0a444839791d6936c7a2b7ea5f009b10c412106824a64"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 24 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/main.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf7a01970cb06608d52ae509e3dca7dc2a191a794643195e64f923cf5ff5c83"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 110 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/server.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c3aab2b820e35c1c1aa5ad681f75709921bb93c2c313ac93758f6254fcc4f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 116 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/server.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a997ad7dba0acf115f59a9fc2ad6cf887409d14e1b7c5c1491df71dfdb709d1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 132 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/server.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb466dc0872dae75e916f932af0c49debcb86fec51c5a6faeb024fd9ac19fe9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 160 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-gate/src/server.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a649f231cb44760eb7ba492cf11371910e83eaefb76fc29a883b36679bf8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 55 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"933c95b8e07f3da3c331f53040112f0f25db953c352859f2a594523a7e5b5c00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 57 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd6feaacd9369ea5fe4a0d0021eeaaff3b139699fd3862ceabc14eddd8e1ba0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 118 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b37061651984ac167ac9f99a1472ceb49dd916fa2f5d68eaf7531fd6988c1a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 143 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"86280c6049242caca86d8925bf6d04cdf598ef214635447f3deb80c22a6b9200"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 189 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"372b94122dd9bfc302101b12762c3e07bba001b2a9dda5c1a8d233fbab155cc8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 198 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b558e006f6183f60496268abf1b4a8098a833b39f5df9cf4f768624f418c310"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 201 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1a966e5c094c4452625aaa18224126fc2105185d9ac334561840314e2986a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 245 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc445804c714e2bfe2e89251b58cdcf6068cbc7aa9d2571a9714e65c8f59a24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 248 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"17420465e9cf1da5ffb5a9539b0885e82a3f17e52875a3a3498188b7517436c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 269 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gcs.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"898cd17c0831e7ebcc6194595a4cb824e00518c1c789117e65d8335ac097e3db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 303 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"67233db4cd16d05c3da95201bab7cb0561ecaf3fde19b023dcb3d52b29e3e2df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 316 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f285c319b9c8bc8e9ce138e396767b9a6b99a2d51eedc718b4f24ccce597a37d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 339 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f866b25cc06dc00ba9dcca91d9a71f6a3d5f1418db2af63ddf1fab25ed979e03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 343 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7d68bdc1ae27cb83202c7e55e72270ef8772aae80260e1ea77806735c8cb0d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 399 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7f68a69505f240dbced5fa14d9056d543f7fc2aef125db82d2a4acd2fe228b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 749 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a36d71ee2c53a4b4cf42552272bca0a6196fceb1c7ba251b92cb72210ec5089"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 753 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/gist.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"413a6f7e6e4713155fae5681f9d5b31e29cfddcd7bc860a37cb5403bff88de02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 840 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b7ec345fa403b5bb86900805cdd0af122c1b276c0c80d621bca40e8a1537b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 889 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f150cfa4878e2daeee9cb8c8a420cb897e0968cb527ede43b998d1429066558b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 924 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafb6b9df944cac3d2a5880c4e8447596a588d1e6097dd6cb9802fc224a290fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 933 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dedeaa581729479f3197627fd4ab4f7f387625a6bbe65ada538525347232fa5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 962 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"170f0424fe2187149a0d465acf5d95dca6a85ddc4b76f43ac6569a5e2da54fa5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 20 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b603eca01bfb4a21b57f962abb9711dd815195d8a43bee40edeb81ef0c2f549"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 44 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d299f9a2f289269e78e1d7b13f8447cd997966de783e12541dd18170880e32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 52 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7880b54b4bfa4bf5efa42cf282d675a0451b580ecd5b536036c63beb26e402"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 68 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4bef795cc71363efe94aff13f2d8f4baeb36680747a81c667dc6ddf04ec530"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 157 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bdd152e0489d93638bfd8471451efa3239b7f037fc391ff91551f473d42c24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 200 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d60e0e4541f5e06ab4825d23724e9f12248a4c0905a2b2bf8edf6250d3e5254"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 204 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"845e6ddba2fa9ccf735fe39f9cf496431d04f2672ac50d8b3f218080f9ed88cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 235 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/main.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9033a5c1bc1fac14684959ca6d0ca26455d830e364f1dfca3f5da4b573a9e490"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 206 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe0b4f930154664a30309db0729ca9ac26284d5d4775d0b98192af55846dd78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 314 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"38871a38ffdd4ffb21b8ef49a6684a57c35bc4efdaccaad17f0d0041e24c02f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 322 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8538bb52de117f3013c5f1da06faa5133d3523c734169a6fe70444a1991da7e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 371 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3060b9195845f145f6bb028ac18757e399336dc4e02bab6e63a765ac99b534"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 400 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/notify.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8605d8a5d1dc6d608e4d53d117f015a7b21a0fe7bbe494fe01df8844cc221657"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2c6e26b347d575e2d2d7541498fa84dbecf3a1e8a2af80f2c6bd7d28038b9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1115 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a59b5f8ec27aa3c46f8f6b94165edbcab704431000d057dd69b3b99a075253"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbe9a28626042858ebb881cf78f6183394dd9f96bb7bdba71664ab50374670a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1153 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d77be8a670cbc515986944082c536af6bcf42ea3e343724f5ee7975b3c4c44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1201 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0fa4148101934aec2e7239222aa80f265536233668edfd49d916df6c249f3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1407 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pipeline.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6456cbe72905618bf2d3bdba0b7e4478afc15a862b5dbecce3b1aaafdc57c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 569 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pubmed.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d2cd9c95df3d4fb3e46873d584d952d27c3c36c79d4db11d5e89f4db6c47fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 576 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/pubmed.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"5539661a226d6ecbb3ea3fa3a865797f2b7b91638c08c6eaf8bced693fc5ff00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 180 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/rate_limit.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0f4c8f8698d617d38cc0daa3030582538ec1c864ff6749294e62e444b99a4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 60 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"49548f8e160c5379a3417648d135996a29ac2256e0466f0e9ff15689275dc015"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 79 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54a51be036ddd9fd1bbd717a70d1cfe455b78f63518120e7b3d7e91749d97ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 84 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5725f3e1792b605607bf899b0fe573c90959a6705115504729bad01ec934ad6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 115 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be05f61d865f39467d00fa6c8f01d6e9fe22a61abaf3b1ff7fc96c255610768"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"be14d01d1a3ff4fdb7361cc4328faf2ad579831d2f4268187f05a586b5313736"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 159 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0246cf767d227faea29fb411fb00b56816ce026d22d1bdf7eb039e31ff759601"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 168 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17a98835742150078e3d1533ab2bbb0f98a875bf32a8c02e5b1030ab54e5d34"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 193 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2144df34b2d7bb35d105da487490b69b99294e10e79994883dd8ebb933a7c49e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 264 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49f9190e37d9d9b0222b28a6648041aa94ef3aee1869ecf21fa88d8de6faace"}},{"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":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a676d7452ee292a54ebfc4d4fba0dbdb7535c55a9e6f9b3f1328051fda54d8b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 572 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee8d1c81a853835615e95aab6b610c05b080d25596225ae4b203e717295f6bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 577 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"23718c334d3d9bc471c9660046adf216fe94f3f1c04e0fe1bf973d1e55adf073"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 591 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0a0138420d03ba7fdf378d542bb52faf0a86bb628076bc2e7f1d95a5a04335"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 638 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6d21e632d37e5738557525bacb5cddd90b4ff618186b9c05730c7b1a48b83c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 760 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9adb1e5540955269e3f6e7af5622c1bfda07ac2df51f770bede2ad494d1a55"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 812 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37b378adfc4560fe5da7466e8585eaed9f54364225e2ba19f267b86b8d95380"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 827 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f191b280e074977bed071ecd980c9bdc179bdf72927341deedb4869454e70e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 928 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcbd4e937e6c1983f559cd89ec1a1f96a354ddff792e25cbac87cad38196d15"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1007 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b2115aeb5b2cbcac08d4d35b9590b14774f30f49a1e98d70e5e5009c1c783f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1017 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc9e29f904b4c6f3e1b58f8b855abc56aae0a13f639668f7b35c3a63dcca9b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1280 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e471b28ba8ea8e37ef4bee1bea610b6b0a3bf99cbfe94132999504516534a67b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1284 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcc15c6d953924ee5ac73e81283964ee73c0b662fb18efe1fee3c7af8db7dea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1289 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aacb4ef338c97dd2f6ff16bceb49bcf491cd3709ee02e196735fef01f6923a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1507 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5cb44e010e43adaae9ae1768a54eec0884070f1dba4a74e86a136d26d96331"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1523 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa9569d70b9bcd5d7840c4f83b866f429aaa892bb46f77629f9d978e347f7cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1602 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8a73344c55bf8f4a6c1a7b05e89dac6c45e78fbf454ca332cdfb607082ff3a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1810 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0063540022a85efd9d64fbe99388124c878a95d720799d5020b3f5a16e112c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2804 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"9114a34d7276075459d6d439d3ec5e66da0c2cd053e611bb70bb41c8a51ca130"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3116 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"821cb1da8bd3a87231c97f481e45d6051e4daf748a77653ace8a498b019949ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3173 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2cbc90ea4422f5a019800ba695e7a1e7b0d8c20f57a14754e5ff88bd281094"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3219 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":3219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3f2cbf6a9ea004df14463732f98919135693da55940c3b76ccf71fd0f820de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3487 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"459b01db46f1db1389e9c3a2b25c1ce91d4daf6ebd1850fbc6f877c25bb8d450"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3592 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":3592}}}],"partialFingerprints":{"codehealthFindingId/v1":"1615aa943fd55979abb1d759519ff75ec023b71fb6fe0e5caa0713aa9ad8b89a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3961 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":3961}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8ace9a59903c0a69532646f72599662a4a7758adb966b82a6eda67d3a0e1a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3973 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"69256270ef059f941e4eafa509be59ece1f98e16b6d0078f8676c2ce4f0fcd48"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4266 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf1fe940cc6d4b6a43819d6406ba7d630843f44288e449c5744f25b0388ae13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4476 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":4476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07265727116c6ffbe8e047c366e3009711fb72550e58687151a553561e4e83f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4722 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":4722}}}],"partialFingerprints":{"codehealthFindingId/v1":"36278cc18a62282833fdffa031bcefdc7e9824939e885fdf80b5f0a17ae04b4c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5457 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":5457}}}],"partialFingerprints":{"codehealthFindingId/v1":"19595c3626e68434d441bec6d5d42602a0db5d3677a076f5d8a7ee0eb96211ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 5477 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":5477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc882cf0b3b3087fd5ec4c005a3adcd89f2ea1d3f81bb353daec39b06cfa26a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 5504 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":5504}}}],"partialFingerprints":{"codehealthFindingId/v1":"112649a57338fd837651ea5fa3754d0ba0d234886296e771f580887d92479ad8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 5515 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":5515}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdc9672249e91f2b9163ff8edde9e6b8a29e1d651726f8628fecfed79dacd51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 7302 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7302}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f32523dbb050d813b95663467a7b236bd597e47a17481b33212e1fd147c2c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 7334 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d793dfea826e3b2ff1595c3ddb3d6968cf87e56f2142113317f4ea74a59bcc8b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 7452 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d649dee38bc471903af5922b4691bfbfb59107e7c07e98cd510eb2c0096d774"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 7462 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7462}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b0203908cc4fadf72d458ac4fae227a474ec36c99b232ae83cb682d5f784f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 7557 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7557}}}],"partialFingerprints":{"codehealthFindingId/v1":"534574e38949003080028989bae6db9c5730624e53c183e2d11cef7f00f8721a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 7594 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7972bfc8e4f6b6394c0b49f80e918be329cc5bff34a90b325cc8cda2b4d31ce0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 7790 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":7790}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0635da925d3a11a24933bb8cbbef45871dd84e1811afa88bf40a415acb6731"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 8081 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":8081}}}],"partialFingerprints":{"codehealthFindingId/v1":"4009e7af10a33b176407dc298737d1cff051a2c33110843c2f6488b5c322e009"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 8192 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":8192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2335b11365f00da70e04bab25edf4cf9875fe61e820c7c4062a9306e8b04d8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 8325 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":8325}}}],"partialFingerprints":{"codehealthFindingId/v1":"197fe733732078bbaf789cd5873e2eabd870a63b515def148cef78a598bf06d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 8336 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":8336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f695b983a183173bfed3be4384f3b7611acff2870757ec9c8fcfdcc8649a99d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 8369 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":8369}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c7e17edc175fcad0d9d3e9ef6c932724e172769376b8909f0b14374f688d0b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 8428 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":8428}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a29eafd9fa543938edeeb7404f0178e64411d0b92d4c2508537b0200e94139"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 8452 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/routes.rs"},"region":{"startLine":8452}}}],"partialFingerprints":{"codehealthFindingId/v1":"35392c528339f6c6aa5e88d7a70e0aaf8678934c9c2e97d17200c4504422c920"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 90 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea0d9c1142b93c543441c5a55c7fbf13b817456038129e021bacc20500b35b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 92 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6179546de39c2d0b18aab4c20d075fd837fda6cf1d0d7191c5dd2ecee95f8a78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 94 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d822c66dea5478c89b8b23d4c4111bc7e98391d6435956d538ecfb0e9fb6745"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 171 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e42765e3d9ba4ad393dabe7b0533a5a7afbaa25b563947909527a4379ba8ea"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 215 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b66e5870d55479895f3732805343a63ba50fbcc0b2f11310a33bf5ade2241a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 243 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a24be2b360dc0878b5cf6bc3b30ea9471533b3d4ae7cfe22a242d194ee6087"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ce057dde27fc7bf2e7fa898e60bd5e1ed20356a65c88c42b5b38058091e974"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 296 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83df33e05d3db3ea1d61d871295e3425be30aaced7f607b5ee01a0bad7d2da6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 305 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"604cd9e1dd379d47c15168dab3f702b4d2bef832b9da10f502e356ce363791f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 312 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c812153420e0fe58011b62d075729fe14d2baf481849c4d91a27a9edcba17008"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 316 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fe19f32fbd201a538b275ec2bf3b3b6c1923927cfc9e08aa8f10cd58f1665f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 322 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f42734d6d3181118f6b70673f58aae7db14239aba5086687828dd50a4b8b0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 345 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bcde05bf16ae8236d731198300b7102932499e2fb3b2aa9286d92ebf3b650e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 350 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"388e23946a4c4fda692030b6133e56767663acf442af1a6995a408a6ee534f27"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 390 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c0bea0395220caec58f0ab4fecb7e52821058548350d1ea05bf440431a6c1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 420 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ed2f0eef0cd3ef1e762aaecbe36ea3fa013c1cd3cdf39466e296735fb6789c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 433 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aecb8c807a9809cac72b089e2eee412bf2eaaffd987912cbb6141b9340eaaf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 446 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb9a64999f5532453436c633a5b08aea0fc671c987fd1101bdf9eb4f841fa07"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 460 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bc9fa6867a90328c9ba425eb7d9d67d0e31e65147a274c50224906ca1f0aa3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 469 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"589f0e5b9d3bedb5c326dd45b635b55220f911448d7e7cf474ccb68aab9330ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 485 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"52570ae9be9903f88b8337f94c92b18db1843678e4c22564787a0a6cb3d696ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 501 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5458710095e1cd1b4fed6d27193af842b1177744347dc05fe027d69557d713"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 535 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"72caed75bb82fd60f49e4e48fab28bc9a64f43c225569e2666c36d7b3b98bc4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 563 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55770fae2d1d82293e331c611383dd896d47167850f17709b53b7d23b0859d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 569 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93dd8d807631128b65e057af142d57d6dfa712071a78ca3f03fe69ef47fbb95"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 609 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab1800c112778fbbb4f3428e91daceb8d32a075066f4fbdd2e71b5f04e4e51e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 614 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"8853397ea81eaa4bf24570d4308addddff288ed087c1cb32e710f3369e0ebf79"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 633 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4cc78a684ec39d5e6dafaf3bb928afdde7c09baf3f66f86cbf00772aa03c8b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 657 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"7119c0e34b913d116df38de1e2d808b9760654d42d5ee87e0968ba2246c7f012"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 677 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9a83b90666c81f9a549a07040bc871da6339fb855d21a1c8cd24a69877fd11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 681 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed687fdd6d4c0fe995aabf03c7722acb605961982046e192345ceddfba151005"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 689 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/store.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a38afe6962b1219f97b85e34cc60aa18e2ed6532aa4ba7b3ffab394bbe2f6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 345 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b229e6c2ca613514a63792473d6d56754a801732d07a08d207dac319960bf507"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 437 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4398fde7f244b15b71834776daa9f435742ccbf94b7496f80419b2dbd5b0b0a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 506 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"010f87a272c1946f6125e6c3005405a47f22e65fbd498e09accb35bace530e28"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 566 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4f6e4c02e41acff802847e75981fb5b8d0b2a9188b7f2f912a1b60cc6f50b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 636 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1970e4f46898adb666fbea85c25bd4ff829ee2d0eb551b870c8913dd7713d8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 689 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb92f603059b218caa85175e9e7c900a0a93002f3f146ae544e3c4b329b185a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 771 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"5963aec409a578f34921ba987ca614fe92678f82715162772cbe5343f0488186"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 825 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/trainer.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef04cb1c22abb22eb89142178f4f7416d11a8495829e522ada82723c6257df37"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1246 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/types.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4215a7630408f61253532dc35eb9e6f245f721bdb9061fdc05ec63510a75474a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 124 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/graph/rebuild/task.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46358a8f8161f8da3c69579328f620a5ca3fa13d363bb854e0abf843f2106a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 116 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/embedder.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfd9cbe1bd5ad554b7ed1fe914d922b59ceec173b962cedcb5496775b04fa5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 47 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/ruvbrain_worker.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b621321ec000fb0aab50199bf536d21bc9408266b30ecd465c0daf411619d3c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 51 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/bin/ruvbrain_worker.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"187564ac5ce9ebffb2a3125d4896af69ff63c2b0fcc8f5a1c86ade24025a8c9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 19 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/main.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"77492c6e4c87d67436b3479efbc0314205289ef5d2678fa19998442416ed189b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 40 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cafe8e96b30d3c4289c5f9c23101ece5c6ef05e7f1a0b4802db3f3f3481e8f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 46 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0fe8f497037a2930de8e3968339bf4e708dde1d3daea3d77d5b76d9798de94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 61 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b87344ce39bd12eb329226b00b0c8c00c5d151f47ce12ec9a770c888ae1147"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 84 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/server.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df062f7aa5556d110b0c0183aa656618eb8f2f263e97fe36788e5a9f1fbe758"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 330 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f80e90ae4d72c744d4cb243c333deaa8472b64ac8ad3151f3afef10648fc085"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 643 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"72af3807fb870ed83ebdb8b405d5d7c3e6ddd56df5732daa8476e32102b91f95"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 664 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain/src/tools.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f53a39731f129b901211482838c46015c448473409afb89cda9d58bb103e24b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 71 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-rt/src/executor.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7669171f923e30a978dddb3e70ea291697237cea1d9df9a7ebda353239f7f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 36 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-core/src/middleware.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dc06db54ac0820e3d88c79edf003a2c33e01ec7cd98b2c221f099107204348"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 33 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-core/src/service.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1cf1350a43b1eaa337b8115060c4377f35cc0396386c973388039651f1a1fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 77 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-core/src/service.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f74123edd37650c39488ca24cc3c45a8c9ee9a734318fa907c960853dfa6766"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 20 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agentic-robotics-core/src/subscriber.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf96b1ae818e753ab0640324eca1331aaff128103fc7cb5689fb9d09acb2ba10"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: 56/57 of this repository\u0027s type-checking configuration(s) turn on strict null checking (\u0060\u0022strict\u0022: true\u0060, or \u0060\u0022strictNullChecks\u0022: true\u0060). A configuration that states neither is counted as OFF, because off is tsc\u0027s own default; a solution-style one whose \u0060\u0022files\u0022\u0060 is empty and whose \u0060\u0022references\u0022\u0060 point at other projects is in neither number, because it checks no source itself. Where it is off, \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060: passing a value that is null compiles silently and throws on the first property access."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~1.3 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 172 assertion(s) across the 130715 source line(s) of the 597 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: npm/packages/ruvector/src/core/graph-algorithms.ts (21), npm/packages/ruvector/src/core/intelligence-engine.ts (13), npm/packages/agentic-synth/training/dspy-real-integration.ts (10). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/versions/v2.1.x/tree/react_memo_cache_sentinel/react_memo_cache_sentinel/acquired.js"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd1931e6147bc38781de01d6fa116d6352fd516e5111e76a991a9469dd4f2f3"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/uncategorized/uncategorized.js"},"region":{"startLine":3945}}}],"partialFingerprints":{"codehealthFindingId/v1":"85075142bb2e4202a1f02aba8d7486d64be985f83c58a638f8ba54db75d7b306"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/uncategorized/uncategorized.js"},"region":{"startLine":4212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bebad992a6477d23296420e3f5d631f134a2b445442b708d9a569a513ba41ac"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/uncategorized/uncategorized.js"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4134675bf9e37e2b8de483e533ee1fb41362a2817a8f8d805f4511ed76e116"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/ui/commands.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edbd58e552c4bec75be5db215a4c5cd2bc0c0914979c12d4a242af713e88144"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/tools/tool-dispatch.js"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"50abc49fe6534953a7085d7d1f73d2e51fc6d887824da95cbda4cd6e347276b4"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/tools/tool-dispatch.js"},"region":{"startLine":7147}}}],"partialFingerprints":{"codehealthFindingId/v1":"027c319ad6390be2ebe6671c2eefdd3867f23b2b6ca858268b8d00328111bfb3"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/telemetry/telemetry.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3214dd80c61937a2188fb73d618fa940959d369bff29f5b393741cc0d2a7a0b6"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/telemetry/telemetry.js"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5db4412fd467cef7e0d0f2c1ff24b6c49b80ae69e666630c65c6c00cc721b43"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/permissions/permission-system.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d0c3f0055b24b2dd353e95756635fffcec9d525c24bac8c461106da0c60e89"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/permissions/permission-system.js"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c217d4467036e09f126d0202b560b3a5e946e723d3332b9ebef0e896770921bb"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/agent-loop.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0272dde9baaeb09e9ab46dcb2160c6eca804b0d81cb30f016b52ccfbdd8358"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/agent-loop.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5828d68b677fa86113e03725ad682f7e7ee8dddb299c06b7761f89f397507198"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/context-manager.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c19155319ac6c25b11a18475d2c3fd0ad761e01565216541a175bd7af0abe3"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/session.js"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56b38fe028060b898c4184a710dc491c9e5dafbcdeb8121f9da6d183cd5d473"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/session.js"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a198948d376d453debcf2e6b489c89cef8e1c451cc1fcea038330d0b510ea19b"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/session.js"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"244ad0e02cccbd87437ae89c3f84732577efb825f0cfe50f9d0df7aa40ee42b8"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/session.js"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca66297b58cee4f8cf556ccfca5c1b9e9d51bb662658190a40949ac17348143e"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/session.js"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7be7633a2efaedf8fb62a080f1eb388f23a5c3ab9fb7f9af3bf4ca28c28672"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/session.js"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d76a45e05a3e4db10ff463310fd87403d8b3dacaf48592bbd74b47b3e9ba2e"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/core/session.js"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"749cd65a68f27db0f220085da0535ae5f56a0eeefdd794b09233098965017f66"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/config/config.js"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"70690b5bb789f1492749c8b495c9718a090e66590c6767f9ad903ac5495328d8"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/claude-code-rvsource/extracted/source/config/config.js"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fa49bb4c764cd55fe1329df727879c755af2f70958b9d891afe3730b30951f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060store_mode\u0060 turns every \u0060Err\u0060 into \u0060\u0022rvf\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":"crates/mcp-brain-server/src/bin/local.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f13a1b6bd541e676373d0a990d983f7288417a00286907d66ac9b1c013e12b7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060strange_loop_score\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-brain-server/src/midstream.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"60811e1de9d58d99cd1ad3200e12954e48268a2fb5a189453f6cf60a0c13024d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sdpa_imbalance\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/neural-trader-strategies/src/attention_scalper.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e033dd3ca1124328e6cabc46e031c566004252eb18175268062ff0245149e13"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060default_config_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/photonlayer-wasm/src/lib.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"604063b356fbd37f3345832a6949f346fddd4b423a084d819356b0ca234ea729"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060witness_log\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-attn-mincut/src/witness.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b47eb2040edda3e53c8fc9f90519860e2a06b2b1a346177db2bca3590b1d3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_feat_csv\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-bet4-ivf-bench/src/data.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed75d73836ce6657e7133477ce9277dfaa062d73bc19c1e6870ac0267d13d7e1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060default_data_dir\u0060 turns every \u0060Err\u0060 into \u0060\u0022.\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-cli/src/config.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc95b21916521d21c4ae7f0967dba6703bea5308f865d552524ca130b70e5091"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060compute_critical_path_cost\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag/src/mincut/bottleneck.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"250742b7d5dbaa097a74cacddbe81516b3f8c0e55025ab2a686c56a4bd3ceec7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060to_json\u0060 turns every \u0060Err\u0060 into \u0060String::from(\u0022{}\u0022)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-dag-wasm/src/lib.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8362e7c9488324899dff19e8a9e8010ac5253431f3b1de67c2590e83e6e799c8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060builtin\u0060 turns every \u0060Err\u0060 into \u0060Self::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-decompiler/src/training.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aad6dcd68fc4d92278205c434affb49f9bbaa2ab33dd0bc2d4d959751045eb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060to_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-economy-wasm/src/reputation.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae0a5bd6c9c22be79fa80ff1ee702005d993f2676a5b3bb1953e37368221557"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060export_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-economy-wasm/src/stake.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9504e5aca8db4ccdb1c000b9538093601990812aff8aa26e4334cb75929e8763"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060to_json\u0060 turns every \u0060Err\u0060 into \u0060String::from(r#\u0022{\u0022error\u0022:\u0022server_error\u0022}\u0022#)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-authz/src/error.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5674e97c3841910f73f14a4ca7a39d97e752fbd4893e271ad7011bb0b0e5c3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060growth_bytes\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-index/src/hnsw/mod.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"30da0f085fd250da503a16c4fae224dfb048b66215dcd5dd52a3941a4e2c0e6c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060to_json\u0060 turns every \u0060Err\u0060 into \u0060String::from(r#\u0022{\u0022type\u0022:\u0022about:blank\u0022,\u0022status\u0022:500,\u0022code\u0022:\u0022server_error\u0022,\u0022title\u0022:\u0022server_error\u0022}\u0022#)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-edge-tenancy/src/problem.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdda949da5a91ec6e59e64646254205764cac0ff6b5932f444f954221ae8589"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_optional_env\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cunset\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-hailo-cluster/src/bin/ruvllm-pi-worker.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3efe6c8e70ad9ba484342e81d11678b474521ae00c8013facd9856a7fc68c81"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060rustc_version\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-matryoshka/src/bin/benchmark.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b632f264dad975c931299a8264965f9acc3ac72ef88e317684ba5f8ce15148"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/sparse/types.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8821175086b8fe2aa4ef52257db881b8672a70735926a6d104c3f30f4673a982"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/types/sparsevec.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"231aaa0f1063d1787562a12b3e504201d909058ab8aa58f27103f18129611b93"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060format_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-postgres/src/graph/sparql/results.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4775d6ededd667800dbac6cad02f9dd31b9767cd4dbb47b6fca52938ec670cf4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060describe\u0060 turns every \u0060Err\u0060 into \u0060\u0022an unknown object\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-py/src/rabitq.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbe0577b531361f71aae1c22421b244d4c535cdbbaa05227fd7da0e94ddcff7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_obstacles\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":"crates/ruvector-robotics/src/bridge/pipeline.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa89ec32b9bf5fcb72d0fd88c36aa4469a19495c0fe8b52fa47dd3b44dc17451"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060source_for\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvector-weaver/src/cli/seo.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"128e0b99020ed6573edbdaa9165685ef896edc01204e0361243d43b1a72578dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060report_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/models/rdt.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f0aeb870a3d0af372c10558f51f7b103fa6a661fab8f2fb3db023e7ddb7aaf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run_bench\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/quant_bench_wasm.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec251237446e946fcdf4325fb5f2243013a7465279a4726039b89250d73c676"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060compare_formats\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/quant_bench_wasm.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a068022e55e9bb6d8539d226e50114db9a3aa81776ef253f97896c1d6f2565d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run_detailed_bench\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/quant_bench_wasm.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72c13cf9eaeb2b4af10777cdb696f202c70a7268731fdae02445845764c2674"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060memory_efficiency\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/quant_bench_wasm.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"39083b130962304830d70f76dff53de940468f869c9f676382a92d54f7c402e0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060feature_summary\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm-wasm/src/workers/feature_detect.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d7969d0a5c6338c0522bf581873b01eba5b53e1715d2f6c4152afdec560356"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060canonicalize_value\u0060 turns every \u0060Err\u0060 into \u0060\u0022\\\u0022\\\u0022\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rvAgent/rvagent-a2a/src/identity.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b62e33208b4b57794e4888e1e8392b7397551a31a770637f25aa0a290271cda"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ls_info\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":"crates/rvAgent/rvagent-backends/src/composite.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"015bd9e930c87e1f20604be0a3275c7197c65936ad9019e50a12da90613cf481"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060glob_info\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":"crates/rvAgent/rvagent-backends/src/composite.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1f6df8c9d6c2a2855ac3a7adba1179a6c7741dda61e9aae4cc981aa8493139"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060glob_info_sync\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":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7873a7f47a8dbb0a3d045d22f4f169c01be271076704ba6ea1e2d492372cf0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ls_info_sync\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":"crates/rvAgent/rvagent-backends/src/filesystem.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e358b9c8fac2176e0307792e41cbad2fb56a45ca3ca720de1d902be64e186185"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060glob_info\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":"crates/rvAgent/rvagent-backends/src/state.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef815372bb1f618eae5fdae4eff8e18739f2eb133f4f16040c8c5de27e1bc1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_entries\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":"crates/rvAgent/rvagent-core/src/bootstrap.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f779c35fd024107de4a9c7ef7b8757bc1ca3e1c5cca35047ccdbd17b1700ad"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060search_shared\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":"crates/rvf/rvf-adapters/agentic-flow/src/swarm_store.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e391778594353a258cd2f18f86024a7b0abedc167d3fac8c038a985a52434e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060search\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":"crates/rvf/rvf-adapters/rvlite/src/collection.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bc1357d43d28cb8efd5c2ea49ee64b33b828a665efa79b52847fcf5d9a5113"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060rvf_store_open\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":"crates/rvf/rvf-wasm/src/lib.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"290356b9ca97fe40e38e8c842ddbe0b54803fc2f829d022e3352af08c59791c7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060destination\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"edge/auth-worker/src/endpoints/consent_view.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6bc8a43b75dfaf8f12c281f25e6ff9ca45c81d22bac7913a6de06922bd7f9b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060serve\u0060 turns every \u0060Err\u0060 into \u0060String::from(r#\u0022{\u0022Err\u0022:{\u0022code\u0022:\u0022server_error\u0022}}\u0022#)\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":"edge/gateway/src/graph_store.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e61375a9c32c9507de499e8bc5a8d7b34213bc27ea86ab7137c5fc69f78724"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060serve\u0060 turns every \u0060Err\u0060 into \u0060String::from(r#\u0022{\u0022Err\u0022:{\u0022code\u0022:\u0022server_error\u0022}}\u0022#)\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":"edge/gateway/src/ledger_core.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e96bcb0d5b1739065560586162a761464e7c552e46ff10637549fd41e3e3a4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060reply\u0060 turns every \u0060Err\u0060 into \u0060String::from(r#\u0022{\u0022Err\u0022:{\u0022code\u0022:\u0022server_error\u0022}}\u0022#)\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":"edge/gateway/src/m3_wire.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"514a1d6a3927864a219b349a18c5305f7fd123ac436bb05823514a4bfb343ea6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060encode\u0060 turns every \u0060Err\u0060 into \u0060String::from(r#\u0022{\u0022Err\u0022:{\u0022code\u0022:\u0022server_error\u0022}}\u0022#)\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":"edge/gateway/src/quant_shard.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f37d7d4517dbe866e7a36865acd647676bf8c951afda201428f5134f88a9d9f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060serve\u0060 turns every \u0060Err\u0060 into \u0060String::from(r#\u0022{\u0022Err\u0022:{\u0022code\u0022:\u0022server_error\u0022}}\u0022#)\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":"edge/gateway/src/shard_core.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7e9649dd71cbe1fb53ebe6cfb677013e3394515963defd68556cae069fac1b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022temperature\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022temperature\u0022)\u0060 also satisfies \u0060text.contains(\u0022temp\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":"examples/ruvLLM/esp32/examples/rag_smart_home.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d42666a7d5f4e4ff9b122b535715e54c9ab511bd853dff6a4361b94cf131d56"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060formatted.contains(\u0022Q4_K\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060formatted.contains(\u0022Q4_K\u0022)\u0060 also satisfies \u0060formatted.contains(\u00224\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/tests/gguf_tests.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0791a72dc732d8ac7db6a6d0f909b72dbaf825f463b4440710bd67b777a8ac"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060output.contains(\u0022async fn \u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060output.contains(\u0022async fn \u0022)\u0060 also satisfies \u0060output.contains(\u0022fn \u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/reflection/confidence.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3aa052d70a7677612e56dd5974bb24f6610b5f759f428cc38cbba0eaf6b2c41"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060t.name.contains(\u0022self_attn\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060t.name.contains(\u0022self_attn\u0022)\u0060 also satisfies \u0060t.name.contains(\u0022attn\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/bitnet/backend.rs"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9a04761ba077ecce40175d8414b1e369f812eb1015b19dbfc961f6df40c1e0"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022last_hidden\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022last_hidden\u0022)\u0060 also satisfies \u0060lower.contains(\u0022hidden\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ruvllm/src/backends/coreml_backend.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e102fe83075113545b88075de65f3281516db80a90dd511a54c4c7cb7b577696"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-1188","guid":"90b5d93c-2e8f-7d58-b831-915e7ee4a150","name":"CWE-1188","shortDescription":{"text":"CWE-1188"},"helpUri":"https://cwe.mitre.org/data/definitions/1188.html"},{"id":"CWE-1220","guid":"778dd409-4c3f-1951-90c2-50410b5c91ba","name":"CWE-1220","shortDescription":{"text":"CWE-1220"},"helpUri":"https://cwe.mitre.org/data/definitions/1220.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.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-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-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-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-310","guid":"97174724-2e33-8455-b7cd-5c3258d1cb8f","name":"CWE-310","shortDescription":{"text":"CWE-310"},"helpUri":"https://cwe.mitre.org/data/definitions/310.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-326","guid":"7ee78bef-7589-f65f-a9d7-619f3485e844","name":"Inadequate Encryption Strength","shortDescription":{"text":"Inadequate Encryption Strength"},"helpUri":"https://cwe.mitre.org/data/definitions/326.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-676","guid":"550e6fab-2881-3252-8a05-c688a6b19c14","name":"Use of Potentially Dangerous Function","shortDescription":{"text":"Use of Potentially Dangerous Function"},"helpUri":"https://cwe.mitre.org/data/definitions/676.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-778","guid":"58944737-c935-8a57-9195-e7b7e640597e","name":"Insufficient Logging","shortDescription":{"text":"Insufficient Logging"},"helpUri":"https://cwe.mitre.org/data/definitions/778.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-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-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-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"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"}]}],"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":843,"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."]}]}